TSTP Solution File: PUZ001+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PUZ001+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n019.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 : Mon Jul 18 18:10:40 EDT 2022
% Result : Theorem 0.20s 1.40s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 18 unt; 0 def)
% Number of atoms : 83 ( 25 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 67 ( 30 ~; 28 |; 2 &)
% ( 0 <=>; 7 =>; 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 : 33 ( 0 sgn 20 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(pel55_4,axiom,
! [X1,X2] :
( killed(X1,X2)
=> hates(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel55_4) ).
fof(pel55_1,axiom,
? [X1] :
( lives(X1)
& killed(X1,agatha) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel55_1) ).
fof(pel55_3,axiom,
! [X1] :
( lives(X1)
=> ( X1 = agatha
| X1 = butler
| X1 = charles ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel55_3) ).
fof(pel55_10,axiom,
! [X1] :
? [X2] : ~ hates(X1,X2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel55_10) ).
fof(pel55_9,axiom,
! [X1] :
( hates(agatha,X1)
=> hates(butler,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel55_9) ).
fof(pel55_5,axiom,
! [X1,X2] :
( killed(X1,X2)
=> ~ richer(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel55_5) ).
fof(pel55_8,axiom,
! [X1] :
( ~ richer(X1,agatha)
=> hates(butler,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel55_8) ).
fof(pel55_6,axiom,
! [X1] :
( hates(agatha,X1)
=> ~ hates(charles,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel55_6) ).
fof(pel55_7,axiom,
! [X1] :
( X1 != butler
=> hates(agatha,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel55_7) ).
fof(pel55_11,axiom,
agatha != butler,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel55_11) ).
fof(pel55,conjecture,
killed(agatha,agatha),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel55) ).
fof(c_0_11,plain,
! [X3,X4] :
( ~ killed(X3,X4)
| hates(X3,X4) ),
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,
! [X2] :
( ~ lives(X2)
| X2 = agatha
| X2 = butler
| X2 = charles ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel55_3])]) ).
cnf(c_0_14,plain,
( hates(X1,X2)
| ~ killed(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
killed(esk1_0,agatha),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( X1 = charles
| X1 = butler
| X1 = agatha
| ~ lives(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
lives(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,plain,
! [X3] : ~ hates(X3,esk2_1(X3)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[pel55_10])])]) ).
fof(c_0_19,plain,
! [X2] :
( ~ hates(agatha,X2)
| hates(butler,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel55_9])]) ).
fof(c_0_20,plain,
! [X3,X4] :
( ~ killed(X3,X4)
| ~ richer(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[pel55_5])])]) ).
fof(c_0_21,plain,
! [X2] :
( richer(X2,agatha)
| hates(butler,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[pel55_8])])]) ).
fof(c_0_22,plain,
! [X2] :
( ~ hates(agatha,X2)
| ~ hates(charles,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[pel55_6])])]) ).
cnf(c_0_23,plain,
hates(esk1_0,agatha),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_24,plain,
( esk1_0 = agatha
| esk1_0 = butler
| esk1_0 = charles ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_25,plain,
~ hates(X1,esk2_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( hates(butler,X1)
| ~ hates(agatha,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_27,plain,
! [X2] :
( X2 = butler
| hates(agatha,X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel55_7])]) ).
cnf(c_0_28,plain,
( ~ richer(X1,X2)
| ~ killed(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
( hates(butler,X1)
| richer(X1,agatha) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
( ~ hates(charles,X1)
| ~ hates(agatha,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
( esk1_0 = butler
| esk1_0 = agatha
| hates(charles,agatha) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,plain,
~ hates(agatha,esk2_1(butler)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( hates(agatha,X1)
| X1 = butler ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
( hates(butler,X1)
| ~ killed(X1,agatha) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
( esk1_0 = agatha
| esk1_0 = butler
| ~ hates(agatha,agatha) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
agatha != butler,
inference(split_conjunct,[status(thm)],[pel55_11]) ).
cnf(c_0_37,plain,
esk2_1(butler) = butler,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
fof(c_0_38,negated_conjecture,
~ killed(agatha,agatha),
inference(assume_negation,[status(cth)],[pel55]) ).
cnf(c_0_39,plain,
hates(butler,esk1_0),
inference(spm,[status(thm)],[c_0_34,c_0_15]) ).
cnf(c_0_40,plain,
( esk1_0 = butler
| esk1_0 = agatha ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_33]),c_0_36]) ).
cnf(c_0_41,plain,
~ hates(butler,butler),
inference(spm,[status(thm)],[c_0_25,c_0_37]) ).
fof(c_0_42,negated_conjecture,
~ killed(agatha,agatha),
inference(fof_simplification,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
esk1_0 = agatha,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
~ killed(agatha,agatha),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_45,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_43]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : PUZ001+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat May 28 22:21:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.20/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.40 # Preprocessing time : 0.014 s
% 0.20/1.40
% 0.20/1.40 # Failure: Out of unprocessed clauses!
% 0.20/1.40 # OLD status GaveUp
% 0.20/1.40 # Parsed axioms : 14
% 0.20/1.40 # Removed by relevancy pruning/SinE : 5
% 0.20/1.40 # Initial clauses : 10
% 0.20/1.40 # Removed in clause preprocessing : 0
% 0.20/1.40 # Initial clauses in saturation : 10
% 0.20/1.40 # Processed clauses : 16
% 0.20/1.40 # ...of these trivial : 0
% 0.20/1.40 # ...subsumed : 0
% 0.20/1.40 # ...remaining for further processing : 16
% 0.20/1.40 # Other redundant clauses eliminated : 0
% 0.20/1.40 # Clauses deleted for lack of memory : 0
% 0.20/1.40 # Backward-subsumed : 0
% 0.20/1.40 # Backward-rewritten : 0
% 0.20/1.40 # Generated clauses : 6
% 0.20/1.40 # ...of the previous two non-trivial : 6
% 0.20/1.40 # Contextual simplify-reflections : 0
% 0.20/1.40 # Paramodulations : 6
% 0.20/1.40 # Factorizations : 0
% 0.20/1.40 # Equation resolutions : 0
% 0.20/1.40 # Current number of processed clauses : 16
% 0.20/1.40 # Positive orientable unit clauses : 7
% 0.20/1.40 # Positive unorientable unit clauses: 0
% 0.20/1.40 # Negative unit clauses : 5
% 0.20/1.40 # Non-unit-clauses : 4
% 0.20/1.40 # Current number of unprocessed clauses: 0
% 0.20/1.40 # ...number of literals in the above : 0
% 0.20/1.40 # Current number of archived formulas : 0
% 0.20/1.40 # Current number of archived clauses : 0
% 0.20/1.40 # Clause-clause subsumption calls (NU) : 1
% 0.20/1.40 # Rec. Clause-clause subsumption calls : 1
% 0.20/1.40 # Non-unit clause-clause subsumptions : 0
% 0.20/1.40 # Unit Clause-clause subsumption calls : 0
% 0.20/1.40 # Rewrite failures with RHS unbound : 0
% 0.20/1.40 # BW rewrite match attempts : 0
% 0.20/1.40 # BW rewrite match successes : 0
% 0.20/1.40 # Condensation attempts : 0
% 0.20/1.40 # Condensation successes : 0
% 0.20/1.40 # Termbank termtop insertions : 375
% 0.20/1.40
% 0.20/1.40 # -------------------------------------------------
% 0.20/1.40 # User time : 0.013 s
% 0.20/1.40 # System time : 0.002 s
% 0.20/1.40 # Total time : 0.015 s
% 0.20/1.40 # Maximum resident set size: 2768 pages
% 0.20/1.40 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.20/1.40 # Preprocessing time : 0.013 s
% 0.20/1.40
% 0.20/1.40 # Proof found!
% 0.20/1.40 # SZS status Theorem
% 0.20/1.40 # SZS output start CNFRefutation
% See solution above
% 0.20/1.40 # Proof object total steps : 46
% 0.20/1.40 # Proof object clause steps : 24
% 0.20/1.40 # Proof object formula steps : 22
% 0.20/1.40 # Proof object conjectures : 4
% 0.20/1.40 # Proof object clause conjectures : 1
% 0.20/1.40 # Proof object formula conjectures : 3
% 0.20/1.40 # Proof object initial clauses used : 12
% 0.20/1.40 # Proof object initial formulas used : 11
% 0.20/1.40 # Proof object generating inferences : 11
% 0.20/1.40 # Proof object simplifying inferences : 4
% 0.20/1.40 # Training examples: 0 positive, 0 negative
% 0.20/1.40 # Parsed axioms : 14
% 0.20/1.40 # Removed by relevancy pruning/SinE : 0
% 0.20/1.40 # Initial clauses : 15
% 0.20/1.40 # Removed in clause preprocessing : 0
% 0.20/1.40 # Initial clauses in saturation : 15
% 0.20/1.40 # Processed clauses : 42
% 0.20/1.40 # ...of these trivial : 0
% 0.20/1.40 # ...subsumed : 7
% 0.20/1.40 # ...remaining for further processing : 35
% 0.20/1.40 # Other redundant clauses eliminated : 0
% 0.20/1.40 # Clauses deleted for lack of memory : 0
% 0.20/1.40 # Backward-subsumed : 8
% 0.20/1.40 # Backward-rewritten : 6
% 0.20/1.40 # Generated clauses : 45
% 0.20/1.40 # ...of the previous two non-trivial : 42
% 0.20/1.40 # Contextual simplify-reflections : 0
% 0.20/1.40 # Paramodulations : 40
% 0.20/1.40 # Factorizations : 5
% 0.20/1.40 # Equation resolutions : 0
% 0.20/1.40 # Current number of processed clauses : 21
% 0.20/1.40 # Positive orientable unit clauses : 6
% 0.20/1.40 # Positive unorientable unit clauses: 0
% 0.20/1.40 # Negative unit clauses : 7
% 0.20/1.40 # Non-unit-clauses : 8
% 0.20/1.40 # Current number of unprocessed clauses: 2
% 0.20/1.40 # ...number of literals in the above : 2
% 0.20/1.40 # Current number of archived formulas : 0
% 0.20/1.40 # Current number of archived clauses : 14
% 0.20/1.40 # Clause-clause subsumption calls (NU) : 18
% 0.20/1.40 # Rec. Clause-clause subsumption calls : 17
% 0.20/1.40 # Non-unit clause-clause subsumptions : 6
% 0.20/1.40 # Unit Clause-clause subsumption calls : 10
% 0.20/1.40 # Rewrite failures with RHS unbound : 0
% 0.20/1.40 # BW rewrite match attempts : 2
% 0.20/1.40 # BW rewrite match successes : 2
% 0.20/1.40 # Condensation attempts : 0
% 0.20/1.40 # Condensation successes : 0
% 0.20/1.40 # Termbank termtop insertions : 832
% 0.20/1.40
% 0.20/1.40 # -------------------------------------------------
% 0.20/1.40 # User time : 0.015 s
% 0.20/1.40 # System time : 0.000 s
% 0.20/1.40 # Total time : 0.015 s
% 0.20/1.40 # Maximum resident set size: 2776 pages
% 0.20/23.41 eprover: CPU time limit exceeded, terminating
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.43 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.44 eprover: No such file or directory
% 0.20/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.45 eprover: No such file or directory
% 0.20/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.45 eprover: No such file or directory
% 0.20/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.46 eprover: No such file or directory
% 0.20/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.47 eprover: No such file or directory
% 0.20/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.47 eprover: No such file or directory
% 0.20/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.48 eprover: No such file or directory
% 0.20/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.20/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------