TSTP Solution File: PUZ129+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PUZ129+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n032.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:53 EDT 2022
% Result : Theorem 0.12s 1.32s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 36 ( 7 unt; 0 def)
% Number of atoms : 248 ( 49 equ)
% Maximal formula atoms : 58 ( 6 avg)
% Number of connectives : 321 ( 109 ~; 91 |; 88 &)
% ( 1 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-1 aty)
% Number of variables : 94 ( 0 sgn 41 !; 29 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove,conjecture,
( ( ! [X1] :
( ( person(X1)
& property1(X1,honest,pos)
& property1(X1,industrious,pos) )
=> ? [X2] :
( property1(X2,healthy,pos)
& X1 = X2 ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( property1(X4,healthy,pos)
& X3 = X4 ) )
& ! [X5] :
( ( grocer(X5)
& property1(X5,industrious,pos) )
=> ? [X6] :
( property1(X6,honest,pos)
& X5 = X6 ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( property1(X8,industrious,pos)
& X7 = X8 ) )
& ! [X9] :
( ( cyclist(X9)
& property1(X9,unhealthy,pos) )
=> ? [X10] :
( property1(X10,dishonest,pos)
& X9 = X10 ) )
& ! [X11] :
( ( person(X11)
& property1(X11,healthy,pos) )
=> ~ ? [X12] :
( property1(X12,unhealthy,pos)
& X11 = X12 ) )
& ! [X13] :
( ( person(X13)
& property1(X13,honest,pos) )
=> ~ ? [X14] :
( property1(X14,dishonest,pos)
& X13 = X14 ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( person(X16)
& X15 = X16 ) )
& ! [X17] :
( cyclist(X17)
=> ? [X18] :
( person(X18)
& X17 = X18 ) ) )
=> ! [X19] :
( grocer(X19)
=> ~ ? [X20] :
( cyclist(X20)
& X19 = X20 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove) ).
fof(c_0_1,plain,
( epred1_0
<=> ( ! [X1] :
( ( person(X1)
& property1(X1,honest,pos)
& property1(X1,industrious,pos) )
=> ? [X2] :
( property1(X2,healthy,pos)
& X1 = X2 ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( property1(X4,healthy,pos)
& X3 = X4 ) )
& ! [X5] :
( ( grocer(X5)
& property1(X5,industrious,pos) )
=> ? [X6] :
( property1(X6,honest,pos)
& X5 = X6 ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( property1(X8,industrious,pos)
& X7 = X8 ) )
& ! [X9] :
( ( cyclist(X9)
& property1(X9,unhealthy,pos) )
=> ? [X10] :
( property1(X10,dishonest,pos)
& X9 = X10 ) )
& ! [X11] :
( ( person(X11)
& property1(X11,healthy,pos) )
=> ~ ? [X12] :
( property1(X12,unhealthy,pos)
& X11 = X12 ) )
& ! [X13] :
( ( person(X13)
& property1(X13,honest,pos) )
=> ~ ? [X14] :
( property1(X14,dishonest,pos)
& X13 = X14 ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( person(X16)
& X15 = X16 ) )
& ! [X17] :
( cyclist(X17)
=> ? [X18] :
( person(X18)
& X17 = X18 ) ) ) ),
introduced(definition) ).
fof(c_0_2,plain,
( epred1_0
=> ( ! [X1] :
( ( person(X1)
& property1(X1,honest,pos)
& property1(X1,industrious,pos) )
=> ? [X2] :
( property1(X2,healthy,pos)
& X1 = X2 ) )
& ! [X3] :
( grocer(X3)
=> ~ ? [X4] :
( property1(X4,healthy,pos)
& X3 = X4 ) )
& ! [X5] :
( ( grocer(X5)
& property1(X5,industrious,pos) )
=> ? [X6] :
( property1(X6,honest,pos)
& X5 = X6 ) )
& ! [X7] :
( cyclist(X7)
=> ? [X8] :
( property1(X8,industrious,pos)
& X7 = X8 ) )
& ! [X9] :
( ( cyclist(X9)
& property1(X9,unhealthy,pos) )
=> ? [X10] :
( property1(X10,dishonest,pos)
& X9 = X10 ) )
& ! [X11] :
( ( person(X11)
& property1(X11,healthy,pos) )
=> ~ ? [X12] :
( property1(X12,unhealthy,pos)
& X11 = X12 ) )
& ! [X13] :
( ( person(X13)
& property1(X13,honest,pos) )
=> ~ ? [X14] :
( property1(X14,dishonest,pos)
& X13 = X14 ) )
& ! [X15] :
( grocer(X15)
=> ? [X16] :
( person(X16)
& X15 = X16 ) )
& ! [X17] :
( cyclist(X17)
=> ? [X18] :
( person(X18)
& X17 = X18 ) ) ) ),
inference(split_equiv,[status(thm)],[c_0_1]) ).
fof(c_0_3,negated_conjecture,
~ ( epred1_0
=> ! [X19] :
( grocer(X19)
=> ~ ? [X20] :
( cyclist(X20)
& X19 = X20 ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prove]),c_0_1]) ).
fof(c_0_4,plain,
! [X19,X21,X22,X23,X25,X27,X29,X30,X31,X32,X33,X35] :
( ( property1(esk3_1(X19),healthy,pos)
| ~ person(X19)
| ~ property1(X19,honest,pos)
| ~ property1(X19,industrious,pos)
| ~ epred1_0 )
& ( X19 = esk3_1(X19)
| ~ person(X19)
| ~ property1(X19,honest,pos)
| ~ property1(X19,industrious,pos)
| ~ epred1_0 )
& ( ~ grocer(X21)
| ~ property1(X22,healthy,pos)
| X21 != X22
| ~ epred1_0 )
& ( property1(esk4_1(X23),honest,pos)
| ~ grocer(X23)
| ~ property1(X23,industrious,pos)
| ~ epred1_0 )
& ( X23 = esk4_1(X23)
| ~ grocer(X23)
| ~ property1(X23,industrious,pos)
| ~ epred1_0 )
& ( property1(esk5_1(X25),industrious,pos)
| ~ cyclist(X25)
| ~ epred1_0 )
& ( X25 = esk5_1(X25)
| ~ cyclist(X25)
| ~ epred1_0 )
& ( property1(esk6_1(X27),dishonest,pos)
| ~ cyclist(X27)
| ~ property1(X27,unhealthy,pos)
| ~ epred1_0 )
& ( X27 = esk6_1(X27)
| ~ cyclist(X27)
| ~ property1(X27,unhealthy,pos)
| ~ epred1_0 )
& ( ~ person(X29)
| ~ property1(X29,healthy,pos)
| ~ property1(X30,unhealthy,pos)
| X29 != X30
| ~ epred1_0 )
& ( ~ person(X31)
| ~ property1(X31,honest,pos)
| ~ property1(X32,dishonest,pos)
| X31 != X32
| ~ epred1_0 )
& ( person(esk7_1(X33))
| ~ grocer(X33)
| ~ epred1_0 )
& ( X33 = esk7_1(X33)
| ~ grocer(X33)
| ~ epred1_0 )
& ( person(esk8_1(X35))
| ~ cyclist(X35)
| ~ epred1_0 )
& ( X35 = esk8_1(X35)
| ~ cyclist(X35)
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( epred1_0
& grocer(esk1_0)
& cyclist(esk2_0)
& esk1_0 = esk2_0 ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
cnf(c_0_6,plain,
( property1(esk3_1(X1),healthy,pos)
| ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ property1(X1,honest,pos)
| ~ person(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
epred1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( X1 = esk3_1(X1)
| ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ property1(X1,honest,pos)
| ~ person(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( person(esk7_1(X1))
| ~ epred1_0
| ~ grocer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( X1 = esk7_1(X1)
| ~ epred1_0
| ~ grocer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
( property1(esk4_1(X1),honest,pos)
| ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ grocer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
( X1 = esk4_1(X1)
| ~ epred1_0
| ~ property1(X1,industrious,pos)
| ~ grocer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,plain,
( property1(esk5_1(X1),industrious,pos)
| ~ epred1_0
| ~ cyclist(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
( X1 = esk5_1(X1)
| ~ epred1_0
| ~ cyclist(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,plain,
( property1(esk3_1(X1),healthy,pos)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos)
| ~ person(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]) ).
cnf(c_0_16,plain,
( esk3_1(X1) = X1
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos)
| ~ person(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7])]) ).
cnf(c_0_17,plain,
( person(esk7_1(X1))
| ~ grocer(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_7])]) ).
cnf(c_0_18,plain,
( esk7_1(X1) = X1
| ~ grocer(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_7])]) ).
cnf(c_0_19,plain,
( property1(esk4_1(X1),honest,pos)
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_7])]) ).
cnf(c_0_20,plain,
( esk4_1(X1) = X1
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_7])]) ).
cnf(c_0_21,plain,
( ~ epred1_0
| X1 != X2
| ~ property1(X2,healthy,pos)
| ~ grocer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,plain,
( property1(esk5_1(X1),industrious,pos)
| ~ cyclist(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_7])]) ).
cnf(c_0_23,plain,
( esk5_1(X1) = X1
| ~ cyclist(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_7])]) ).
cnf(c_0_24,negated_conjecture,
cyclist(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,negated_conjecture,
esk1_0 = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_26,plain,
( property1(X1,healthy,pos)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos)
| ~ person(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_27,plain,
( person(X1)
| ~ grocer(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_28,plain,
( property1(X1,honest,pos)
| ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
( ~ grocer(X1)
| ~ property1(X1,healthy,pos) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_7])])]) ).
cnf(c_0_30,plain,
( property1(X1,industrious,pos)
| ~ cyclist(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,negated_conjecture,
cyclist(esk1_0),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( ~ grocer(X1)
| ~ property1(X1,industrious,pos) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]) ).
cnf(c_0_33,negated_conjecture,
grocer(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_34,negated_conjecture,
property1(esk1_0,industrious,pos),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : PUZ129+2 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.08 % Command : run_ET %s %d
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Sat May 28 21:10:40 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.12/1.32 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.12/1.32 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.12/1.32 # Preprocessing time : 0.008 s
% 0.12/1.32
% 0.12/1.32 # Proof found!
% 0.12/1.32 # SZS status Theorem
% 0.12/1.32 # SZS output start CNFRefutation
% See solution above
% 0.12/1.32 # Proof object total steps : 36
% 0.12/1.32 # Proof object clause steps : 30
% 0.12/1.32 # Proof object formula steps : 6
% 0.12/1.32 # Proof object conjectures : 10
% 0.12/1.32 # Proof object clause conjectures : 7
% 0.12/1.32 # Proof object formula conjectures : 3
% 0.12/1.32 # Proof object initial clauses used : 13
% 0.12/1.32 # Proof object initial formulas used : 1
% 0.12/1.32 # Proof object generating inferences : 7
% 0.12/1.32 # Proof object simplifying inferences : 24
% 0.12/1.32 # Training examples: 0 positive, 0 negative
% 0.12/1.32 # Parsed axioms : 1
% 0.12/1.32 # Removed by relevancy pruning/SinE : 0
% 0.12/1.32 # Initial clauses : 19
% 0.12/1.32 # Removed in clause preprocessing : 0
% 0.12/1.32 # Initial clauses in saturation : 19
% 0.12/1.32 # Processed clauses : 37
% 0.12/1.32 # ...of these trivial : 0
% 0.12/1.32 # ...subsumed : 2
% 0.12/1.32 # ...remaining for further processing : 35
% 0.12/1.32 # Other redundant clauses eliminated : 3
% 0.12/1.32 # Clauses deleted for lack of memory : 0
% 0.12/1.32 # Backward-subsumed : 3
% 0.12/1.32 # Backward-rewritten : 0
% 0.12/1.32 # Generated clauses : 28
% 0.12/1.32 # ...of the previous two non-trivial : 27
% 0.12/1.32 # Contextual simplify-reflections : 3
% 0.12/1.32 # Paramodulations : 25
% 0.12/1.32 # Factorizations : 0
% 0.12/1.32 # Equation resolutions : 3
% 0.12/1.32 # Current number of processed clauses : 29
% 0.12/1.32 # Positive orientable unit clauses : 6
% 0.12/1.32 # Positive unorientable unit clauses: 0
% 0.12/1.32 # Negative unit clauses : 1
% 0.12/1.32 # Non-unit-clauses : 22
% 0.12/1.32 # Current number of unprocessed clauses: 9
% 0.12/1.32 # ...number of literals in the above : 30
% 0.12/1.32 # Current number of archived formulas : 0
% 0.12/1.32 # Current number of archived clauses : 3
% 0.12/1.32 # Clause-clause subsumption calls (NU) : 90
% 0.12/1.32 # Rec. Clause-clause subsumption calls : 78
% 0.12/1.32 # Non-unit clause-clause subsumptions : 7
% 0.12/1.32 # Unit Clause-clause subsumption calls : 7
% 0.12/1.32 # Rewrite failures with RHS unbound : 0
% 0.12/1.32 # BW rewrite match attempts : 0
% 0.12/1.32 # BW rewrite match successes : 0
% 0.12/1.32 # Condensation attempts : 0
% 0.12/1.32 # Condensation successes : 0
% 0.12/1.32 # Termbank termtop insertions : 1908
% 0.12/1.32
% 0.12/1.32 # -------------------------------------------------
% 0.12/1.32 # User time : 0.008 s
% 0.12/1.32 # System time : 0.001 s
% 0.12/1.32 # Total time : 0.009 s
% 0.12/1.32 # Maximum resident set size: 3008 pages
%------------------------------------------------------------------------------