TSTP Solution File: PUZ001+1 by E---2.6.X

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---2.6.X
% Problem  : PUZ001+1 : TPTP v7.5.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n024.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Tue Apr  5 04:51:47 EDT 2022

% Result   : Theorem 0.19s 0.50s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   49 (  16 unt;   0 def)
%            Number of atoms       :   90 (  25 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   76 (  35   ~;  29   |;   2   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :   41 (   0 sgn  25   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pel55_6,axiom,
    ! [X1] :
      ( hates(agatha,X1)
     => ~ hates(charles,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel55_6) ).

fof(pel55_4,axiom,
    ! [X1,X2] :
      ( killed(X1,X2)
     => hates(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel55_4) ).

fof(pel55_3,axiom,
    ! [X1] :
      ( lives(X1)
     => ( X1 = agatha
        | X1 = butler
        | X1 = charles ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel55_3) ).

fof(pel55_1,axiom,
    ? [X1] :
      ( lives(X1)
      & killed(X1,agatha) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel55_1) ).

fof(pel55_10,axiom,
    ! [X1] :
    ? [X2] : ~ hates(X1,X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel55_10) ).

fof(pel55_7,axiom,
    ! [X1] :
      ( X1 != butler
     => hates(agatha,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel55_7) ).

fof(pel55_5,axiom,
    ! [X1,X2] :
      ( killed(X1,X2)
     => ~ richer(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel55_5) ).

fof(pel55_8,axiom,
    ! [X1] :
      ( ~ richer(X1,agatha)
     => hates(butler,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel55_8) ).

fof(pel55_9,axiom,
    ! [X1] :
      ( hates(agatha,X1)
     => hates(butler,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel55_9) ).

fof(pel55_11,axiom,
    agatha != butler,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel55_11) ).

fof(pel55,conjecture,
    killed(agatha,agatha),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel55) ).

fof(c_0_11,plain,
    ! [X1] :
      ( hates(agatha,X1)
     => ~ hates(charles,X1) ),
    inference(fof_simplification,[status(thm)],[pel55_6]) ).

fof(c_0_12,plain,
    ! [X21] :
      ( ~ hates(agatha,X21)
      | ~ hates(charles,X21) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).

fof(c_0_13,plain,
    ! [X17,X18] :
      ( ~ killed(X17,X18)
      | hates(X17,X18) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel55_4])]) ).

fof(c_0_14,plain,
    ! [X16] :
      ( ~ lives(X16)
      | X16 = agatha
      | X16 = butler
      | X16 = charles ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel55_3])]) ).

fof(c_0_15,plain,
    ( lives(esk1_0)
    & killed(esk1_0,agatha) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[pel55_1])]) ).

fof(c_0_16,plain,
    ! [X1] :
    ? [X2] : ~ hates(X1,X2),
    inference(fof_simplification,[status(thm)],[pel55_10]) ).

cnf(c_0_17,plain,
    ( ~ hates(agatha,X1)
    | ~ hates(charles,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_18,plain,
    ( hates(X1,X2)
    | ~ killed(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_19,plain,
    ! [X22] :
      ( X22 = butler
      | hates(agatha,X22) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel55_7])]) ).

cnf(c_0_20,plain,
    ( X1 = agatha
    | X1 = butler
    | X1 = charles
    | ~ lives(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_21,plain,
    lives(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_22,plain,
    ! [X1,X2] :
      ( killed(X1,X2)
     => ~ richer(X1,X2) ),
    inference(fof_simplification,[status(thm)],[pel55_5]) ).

fof(c_0_23,plain,
    ! [X1] :
      ( ~ richer(X1,agatha)
     => hates(butler,X1) ),
    inference(fof_simplification,[status(thm)],[pel55_8]) ).

fof(c_0_24,plain,
    ! [X25] : ~ hates(X25,esk2_1(X25)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_16])]) ).

fof(c_0_25,plain,
    ! [X24] :
      ( ~ hates(agatha,X24)
      | hates(butler,X24) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel55_9])]) ).

cnf(c_0_26,plain,
    ( ~ hates(agatha,X1)
    | ~ killed(charles,X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_27,plain,
    ( X1 = butler
    | hates(agatha,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_28,plain,
    killed(esk1_0,agatha),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_29,plain,
    ( esk1_0 = charles
    | esk1_0 = butler
    | esk1_0 = agatha ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

fof(c_0_30,plain,
    ! [X19,X20] :
      ( ~ killed(X19,X20)
      | ~ richer(X19,X20) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])]) ).

fof(c_0_31,plain,
    ! [X23] :
      ( richer(X23,agatha)
      | hates(butler,X23) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])]) ).

cnf(c_0_32,plain,
    ~ hates(X1,esk2_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

cnf(c_0_33,plain,
    ( hates(butler,X1)
    | ~ hates(agatha,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_34,plain,
    ( X1 = butler
    | ~ killed(charles,X1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_35,plain,
    ( esk1_0 = agatha
    | esk1_0 = butler
    | killed(charles,agatha) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_36,plain,
    agatha != butler,
    inference(split_conjunct,[status(thm)],[pel55_11]) ).

cnf(c_0_37,plain,
    ( ~ killed(X1,X2)
    | ~ richer(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_38,plain,
    ( richer(X1,agatha)
    | hates(butler,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_39,plain,
    ~ hates(agatha,esk2_1(butler)),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_40,plain,
    ( esk1_0 = butler
    | esk1_0 = agatha ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).

cnf(c_0_41,plain,
    ( hates(butler,X1)
    | ~ killed(X1,agatha) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,plain,
    esk2_1(butler) = butler,
    inference(spm,[status(thm)],[c_0_39,c_0_27]) ).

cnf(c_0_43,plain,
    ( esk1_0 = agatha
    | killed(butler,agatha) ),
    inference(spm,[status(thm)],[c_0_28,c_0_40]) ).

cnf(c_0_44,plain,
    ~ killed(butler,agatha),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_41]),c_0_42]) ).

fof(c_0_45,negated_conjecture,
    ~ killed(agatha,agatha),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[pel55])]) ).

cnf(c_0_46,plain,
    esk1_0 = agatha,
    inference(sr,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_47,negated_conjecture,
    ~ killed(agatha,agatha),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_48,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_46]),c_0_47]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : PUZ001+1 : TPTP v7.5.0. Released v2.0.0.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n024.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 600
% 0.13/0.34  % DateTime   : Mon Mar 28 05:53:45 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.47  Running first-order theorem proving
% 0.19/0.47  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers --proof-object --auto-schedule --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  # Version: 2.6dev006
% 0.19/0.50  # No SInE strategy applied
% 0.19/0.50  # AutoSched0 assigned 149 seconds (0.498328)
% 0.19/0.50  # AutoSched1 assigned 65 seconds (0.217391)
% 0.19/0.50  # AutoSched2 assigned 22 seconds (0.073579)
% 0.19/0.50  # AutoSched3 assigned 18 seconds (0.060201)
% 0.19/0.50  # AutoSched4 assigned 13 seconds (0.043478)
% 0.19/0.50  # AutoSched5 assigned 11 seconds (0.036789)
% 0.19/0.50  # AutoSched6 assigned 5 seconds (0.016722)
% 0.19/0.50  # AutoSched7 assigned 5 seconds (0.016722)
% 0.19/0.50  # AutoSched8 assigned 5 seconds (0.016722)
% 0.19/0.50  # AutoSched9 assigned 5 seconds (0.016722)
% 0.19/0.50  # Scheduled 10 strats onto 1 cores with 299 seconds (298)
% 0.19/0.50  # Starting AutoSched0 with 149s
% 0.19/0.50  # AutoSched0 with pid 2381 completed with status 0
% 0.19/0.50  # Result found by AutoSched0
% 0.19/0.50  # No SInE strategy applied
% 0.19/0.50  # AutoSched0 assigned 149 seconds (0.498328)
% 0.19/0.50  # AutoSched1 assigned 65 seconds (0.217391)
% 0.19/0.50  # AutoSched2 assigned 22 seconds (0.073579)
% 0.19/0.50  # AutoSched3 assigned 18 seconds (0.060201)
% 0.19/0.50  # AutoSched4 assigned 13 seconds (0.043478)
% 0.19/0.50  # AutoSched5 assigned 11 seconds (0.036789)
% 0.19/0.50  # AutoSched6 assigned 5 seconds (0.016722)
% 0.19/0.50  # AutoSched7 assigned 5 seconds (0.016722)
% 0.19/0.50  # AutoSched8 assigned 5 seconds (0.016722)
% 0.19/0.50  # AutoSched9 assigned 5 seconds (0.016722)
% 0.19/0.50  # Scheduled 10 strats onto 1 cores with 299 seconds (298)
% 0.19/0.50  # Starting AutoSched0 with 149s
% 0.19/0.50  # AutoSched0-Mode selected heuristic G_E___107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.19/0.50  # and selection function SelectMaxLComplexAvoidPosPred.
% 0.19/0.50  #
% 0.19/0.50  # Preprocessing time       : 0.029 s
% 0.19/0.50  # Presaturation interreduction done
% 0.19/0.50  
% 0.19/0.50  # Proof found!
% 0.19/0.50  # SZS status Theorem
% 0.19/0.50  # SZS output start CNFRefutation
% See solution above
% 0.19/0.50  # Proof object total steps             : 49
% 0.19/0.50  # Proof object clause steps            : 24
% 0.19/0.50  # Proof object formula steps           : 25
% 0.19/0.50  # Proof object conjectures             : 3
% 0.19/0.50  # Proof object clause conjectures      : 1
% 0.19/0.50  # Proof object formula conjectures     : 2
% 0.19/0.50  # Proof object initial clauses used    : 12
% 0.19/0.50  # Proof object initial formulas used   : 11
% 0.19/0.50  # Proof object generating inferences   : 10
% 0.19/0.50  # Proof object simplifying inferences  : 5
% 0.19/0.50  # Parsed axioms                        : 14
% 0.19/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.50  # Initial clauses                      : 15
% 0.19/0.50  # Removed in clause preprocessing      : 0
% 0.19/0.50  # Initial clauses in saturation        : 15
% 0.19/0.50  # Processed clauses                    : 53
% 0.19/0.50  # ...of these trivial                  : 0
% 0.19/0.50  # ...subsumed                          : 4
% 0.19/0.50  # ...remaining for further processing  : 49
% 0.19/0.50  # Other redundant clauses eliminated   : 0
% 0.19/0.50  # Clauses deleted for lack of memory   : 0
% 0.19/0.50  # Backward-subsumed                    : 4
% 0.19/0.50  # Backward-rewritten                   : 4
% 0.19/0.50  # Generated clauses                    : 29
% 0.19/0.50  # ...of the previous two non-redundant : 27
% 0.19/0.50  # ...aggressively subsumed             : 0
% 0.19/0.50  # Contextual simplify-reflections      : 0
% 0.19/0.50  # Paramodulations                      : 24
% 0.19/0.50  # Factorizations                       : 4
% 0.19/0.50  # NegExts                              : 0
% 0.19/0.50  # Equation resolutions                 : 0
% 0.19/0.50  # Propositional unsat checks           : 0
% 0.19/0.50  #    Propositional check models        : 0
% 0.19/0.50  #    Propositional check unsatisfiable : 0
% 0.19/0.50  #    Propositional clauses             : 0
% 0.19/0.50  #    Propositional clauses after purity: 0
% 0.19/0.50  #    Propositional unsat core size     : 0
% 0.19/0.50  #    Propositional preprocessing time  : 0.000
% 0.19/0.50  #    Propositional encoding time       : 0.000
% 0.19/0.50  #    Propositional solver time         : 0.000
% 0.19/0.50  #    Success case prop preproc time    : 0.000
% 0.19/0.50  #    Success case prop encoding time   : 0.000
% 0.19/0.50  #    Success case prop solver time     : 0.000
% 0.19/0.50  # Current number of processed clauses  : 25
% 0.19/0.50  #    Positive orientable unit clauses  : 6
% 0.19/0.50  #    Positive unorientable unit clauses: 0
% 0.19/0.50  #    Negative unit clauses             : 8
% 0.19/0.50  #    Non-unit-clauses                  : 11
% 0.19/0.50  # Current number of unprocessed clauses: 1
% 0.19/0.50  # ...number of literals in the above   : 1
% 0.19/0.50  # Current number of archived formulas  : 0
% 0.19/0.50  # Current number of archived clauses   : 24
% 0.19/0.50  # Clause-clause subsumption calls (NU) : 18
% 0.19/0.50  # Rec. Clause-clause subsumption calls : 18
% 0.19/0.50  # Non-unit clause-clause subsumptions  : 4
% 0.19/0.50  # Unit Clause-clause subsumption calls : 8
% 0.19/0.50  # Rewrite failures with RHS unbound    : 0
% 0.19/0.50  # BW rewrite match attempts            : 2
% 0.19/0.50  # BW rewrite match successes           : 2
% 0.19/0.50  # Condensation attempts                : 0
% 0.19/0.50  # Condensation successes               : 0
% 0.19/0.50  # Termbank termtop insertions          : 989
% 0.19/0.50  
% 0.19/0.50  # -------------------------------------------------
% 0.19/0.50  # User time                : 0.027 s
% 0.19/0.50  # System time              : 0.007 s
% 0.19/0.50  # Total time               : 0.034 s
% 0.19/0.50  # Maximum resident set size: 1580 pages
%------------------------------------------------------------------------------