TSTP Solution File: PUZ001+1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : PUZ001+1 : TPTP v8.2.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n013.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  : 300s
% DateTime : Tue May 21 02:24:10 EDT 2024

% Result   : Theorem 0.20s 0.50s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   53 (  21 unt;   0 def)
%            Number of atoms       :   94 (  28 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   78 (  37   ~;  28   |;   2   &)
%                                         (   0 <=>;  11  =>;   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   :   40 (   0 sgn  26   !;   3   ?)

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

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

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

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

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

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

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

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

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

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

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

fof(c_0_11,plain,
    ! [X5,X6] :
      ( ~ killed(X5,X6)
      | hates(X5,X6) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel55_4])])]) ).

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

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

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

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

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

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

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

cnf(c_0_19,plain,
    killed(esk1_0,agatha),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

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

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

fof(c_0_22,plain,
    ! [X13] : ~ hates(X13,esk2_1(X13)),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_14])])]) ).

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

fof(c_0_24,plain,
    ! [X1] :
      ( X1 != butler
     => hates(agatha,X1) ),
    inference(fof_simplification,[status(thm)],[pel55_7]) ).

fof(c_0_25,plain,
    ! [X7,X8] :
      ( ~ killed(X7,X8)
      | ~ richer(X7,X8) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).

fof(c_0_26,plain,
    ! [X11] :
      ( richer(X11,agatha)
      | hates(butler,X11) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])]) ).

fof(c_0_27,plain,
    ! [X9] :
      ( ~ hates(agatha,X9)
      | ~ hates(charles,X9) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).

cnf(c_0_28,plain,
    hates(esk1_0,agatha),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

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,
    agatha != butler,
    inference(fof_simplification,[status(thm)],[pel55_11]) ).

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

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

fof(c_0_33,plain,
    ! [X10] :
      ( X10 = butler
      | hates(agatha,X10) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])]) ).

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

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

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

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

fof(c_0_38,plain,
    agatha != butler,
    inference(fof_nnf,[status(thm)],[c_0_30]) ).

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

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

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

cnf(c_0_42,plain,
    ( esk1_0 = butler
    | esk1_0 = agatha
    | ~ hates(agatha,agatha) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

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

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

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,
    hates(butler,esk1_0),
    inference(spm,[status(thm)],[c_0_41,c_0_19]) ).

cnf(c_0_47,plain,
    ( esk1_0 = agatha
    | esk1_0 = butler ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_40]),c_0_43]) ).

cnf(c_0_48,plain,
    ~ hates(butler,butler),
    inference(spm,[status(thm)],[c_0_31,c_0_44]) ).

fof(c_0_49,negated_conjecture,
    ~ killed(agatha,agatha),
    inference(fof_nnf,[status(thm)],[c_0_45]) ).

cnf(c_0_50,plain,
    esk1_0 = agatha,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]) ).

cnf(c_0_51,negated_conjecture,
    ~ killed(agatha,agatha),
    inference(split_conjunct,[status(thm)],[c_0_49]) ).

cnf(c_0_52,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_50]),c_0_51]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : PUZ001+1 : TPTP v8.2.0. Released v2.0.0.
% 0.03/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n013.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat May 18 10:38:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.48  Running first-order theorem proving
% 0.20/0.48  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.50  # Version: 3.1.0
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50  # Starting sh5l with 300s (1) cores
% 0.20/0.50  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29910 completed with status 0
% 0.20/0.50  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # No SInE strategy applied
% 0.20/0.50  # Search class: FGHSF-FFSS11-SFFFFFNN
% 0.20/0.50  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.50  # Starting new_bool_3 with 136s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 136s (1) cores
% 0.20/0.50  # Starting sh5l with 136s (1) cores
% 0.20/0.50  # SAT001_MinMin_p005000_rr_RG with pid 29915 completed with status 0
% 0.20/0.50  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.50  # No SInE strategy applied
% 0.20/0.50  # Search class: FGHSF-FFSS11-SFFFFFNN
% 0.20/0.50  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.50  # Preprocessing time       : 0.001 s
% 0.20/0.50  # Presaturation interreduction done
% 0.20/0.50  
% 0.20/0.50  # Proof found!
% 0.20/0.50  # SZS status Theorem
% 0.20/0.50  # SZS output start CNFRefutation
% See solution above
% 0.20/0.50  # Parsed axioms                        : 14
% 0.20/0.50  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.50  # Initial clauses                      : 15
% 0.20/0.50  # Removed in clause preprocessing      : 0
% 0.20/0.50  # Initial clauses in saturation        : 15
% 0.20/0.50  # Processed clauses                    : 53
% 0.20/0.50  # ...of these trivial                  : 0
% 0.20/0.50  # ...subsumed                          : 2
% 0.20/0.50  # ...remaining for further processing  : 51
% 0.20/0.50  # Other redundant clauses eliminated   : 0
% 0.20/0.50  # Clauses deleted for lack of memory   : 0
% 0.20/0.50  # Backward-subsumed                    : 9
% 0.20/0.50  # Backward-rewritten                   : 6
% 0.20/0.50  # Generated clauses                    : 43
% 0.20/0.50  # ...of the previous two non-redundant : 40
% 0.20/0.50  # ...aggressively subsumed             : 0
% 0.20/0.50  # Contextual simplify-reflections      : 0
% 0.20/0.50  # Paramodulations                      : 38
% 0.20/0.50  # Factorizations                       : 5
% 0.20/0.50  # NegExts                              : 0
% 0.20/0.50  # Equation resolutions                 : 0
% 0.20/0.50  # Disequality decompositions           : 0
% 0.20/0.50  # Total rewrite steps                  : 13
% 0.20/0.50  # ...of those cached                   : 8
% 0.20/0.50  # Propositional unsat checks           : 0
% 0.20/0.50  #    Propositional check models        : 0
% 0.20/0.50  #    Propositional check unsatisfiable : 0
% 0.20/0.50  #    Propositional clauses             : 0
% 0.20/0.50  #    Propositional clauses after purity: 0
% 0.20/0.50  #    Propositional unsat core size     : 0
% 0.20/0.50  #    Propositional preprocessing time  : 0.000
% 0.20/0.50  #    Propositional encoding time       : 0.000
% 0.20/0.50  #    Propositional solver time         : 0.000
% 0.20/0.50  #    Success case prop preproc time    : 0.000
% 0.20/0.50  #    Success case prop encoding time   : 0.000
% 0.20/0.50  #    Success case prop solver time     : 0.000
% 0.20/0.50  # Current number of processed clauses  : 21
% 0.20/0.50  #    Positive orientable unit clauses  : 6
% 0.20/0.50  #    Positive unorientable unit clauses: 0
% 0.20/0.50  #    Negative unit clauses             : 7
% 0.20/0.50  #    Non-unit-clauses                  : 8
% 0.20/0.50  # Current number of unprocessed clauses: 7
% 0.20/0.50  # ...number of literals in the above   : 18
% 0.20/0.50  # Current number of archived formulas  : 0
% 0.20/0.50  # Current number of archived clauses   : 30
% 0.20/0.50  # Clause-clause subsumption calls (NU) : 23
% 0.20/0.50  # Rec. Clause-clause subsumption calls : 21
% 0.20/0.50  # Non-unit clause-clause subsumptions  : 7
% 0.20/0.50  # Unit Clause-clause subsumption calls : 13
% 0.20/0.50  # Rewrite failures with RHS unbound    : 0
% 0.20/0.50  # BW rewrite match attempts            : 2
% 0.20/0.50  # BW rewrite match successes           : 2
% 0.20/0.50  # Condensation attempts                : 0
% 0.20/0.50  # Condensation successes               : 0
% 0.20/0.50  # Termbank termtop insertions          : 900
% 0.20/0.50  # Search garbage collected termcells   : 81
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.005 s
% 0.20/0.50  # System time              : 0.002 s
% 0.20/0.50  # Total time               : 0.007 s
% 0.20/0.50  # Maximum resident set size: 1700 pages
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.015 s
% 0.20/0.50  # System time              : 0.008 s
% 0.20/0.50  # Total time               : 0.023 s
% 0.20/0.50  # Maximum resident set size: 1696 pages
% 0.20/0.50  % E---3.1 exiting
% 0.20/0.50  % E exiting
%------------------------------------------------------------------------------