TSTP Solution File: PUZ129+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:12:07 EDT 2023
% Result : Theorem 0.22s 0.52s
% Output : CNFRefutation 0.22s
% 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/sandbox2/tmp/tmp.29PUpYioRT/E---3.1_25425.p',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,
! [X23,X25,X26,X27,X29,X31,X33,X34,X35,X36,X37,X39] :
( ( property1(esk3_1(X23),healthy,pos)
| ~ person(X23)
| ~ property1(X23,honest,pos)
| ~ property1(X23,industrious,pos)
| ~ epred1_0 )
& ( X23 = esk3_1(X23)
| ~ person(X23)
| ~ property1(X23,honest,pos)
| ~ property1(X23,industrious,pos)
| ~ epred1_0 )
& ( ~ grocer(X25)
| ~ property1(X26,healthy,pos)
| X25 != X26
| ~ epred1_0 )
& ( property1(esk4_1(X27),honest,pos)
| ~ grocer(X27)
| ~ property1(X27,industrious,pos)
| ~ epred1_0 )
& ( X27 = esk4_1(X27)
| ~ grocer(X27)
| ~ property1(X27,industrious,pos)
| ~ epred1_0 )
& ( property1(esk5_1(X29),industrious,pos)
| ~ cyclist(X29)
| ~ epred1_0 )
& ( X29 = esk5_1(X29)
| ~ cyclist(X29)
| ~ epred1_0 )
& ( property1(esk6_1(X31),dishonest,pos)
| ~ cyclist(X31)
| ~ property1(X31,unhealthy,pos)
| ~ epred1_0 )
& ( X31 = esk6_1(X31)
| ~ cyclist(X31)
| ~ property1(X31,unhealthy,pos)
| ~ epred1_0 )
& ( ~ person(X33)
| ~ property1(X33,healthy,pos)
| ~ property1(X34,unhealthy,pos)
| X33 != X34
| ~ epred1_0 )
& ( ~ person(X35)
| ~ property1(X35,honest,pos)
| ~ property1(X36,dishonest,pos)
| X35 != X36
| ~ epred1_0 )
& ( person(esk7_1(X37))
| ~ grocer(X37)
| ~ epred1_0 )
& ( X37 = esk7_1(X37)
| ~ grocer(X37)
| ~ epred1_0 )
& ( person(esk8_1(X39))
| ~ cyclist(X39)
| ~ epred1_0 )
& ( X39 = esk8_1(X39)
| ~ cyclist(X39)
| ~ epred1_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( property1(esk3_1(X1),healthy,pos)
| ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos)
| ~ epred1_0 ),
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)
| ~ person(X1)
| ~ property1(X1,honest,pos)
| ~ property1(X1,industrious,pos)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,plain,
( person(esk7_1(X1))
| ~ grocer(X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( X1 = esk7_1(X1)
| ~ grocer(X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
( property1(esk4_1(X1),honest,pos)
| ~ grocer(X1)
| ~ property1(X1,industrious,pos)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
( X1 = esk4_1(X1)
| ~ grocer(X1)
| ~ property1(X1,industrious,pos)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,plain,
( property1(esk5_1(X1),industrious,pos)
| ~ cyclist(X1)
| ~ epred1_0 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
( X1 = esk5_1(X1)
| ~ cyclist(X1)
| ~ epred1_0 ),
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,
( ~ grocer(X1)
| ~ property1(X2,healthy,pos)
| X1 != X2
| ~ epred1_0 ),
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.07/0.13 % Problem : PUZ129+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 19:03:39 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.50 Running first-order theorem proving
% 0.22/0.50 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/tmp/tmp.29PUpYioRT/E---3.1_25425.p
% 0.22/0.52 # Version: 3.1pre001
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.52 # Starting sh5l with 300s (1) cores
% 0.22/0.52 # new_bool_3 with pid 25576 completed with status 0
% 0.22/0.52 # Result found by new_bool_3
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.52 # Search class: FHHSF-FFSS11-SFFFFFNN
% 0.22/0.52 # partial match(1): FGHSF-FFSS11-SFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.52 # SAT001_MinMin_p005000_rr_RG with pid 25580 completed with status 0
% 0.22/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.52 # Search class: FHHSF-FFSS11-SFFFFFNN
% 0.22/0.52 # partial match(1): FGHSF-FFSS11-SFFFFFNN
% 0.22/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.22/0.52 # Preprocessing time : 0.001 s
% 0.22/0.52 # Presaturation interreduction done
% 0.22/0.52
% 0.22/0.52 # Proof found!
% 0.22/0.52 # SZS status Theorem
% 0.22/0.52 # SZS output start CNFRefutation
% See solution above
% 0.22/0.52 # Parsed axioms : 1
% 0.22/0.52 # Removed by relevancy pruning/SinE : 0
% 0.22/0.52 # Initial clauses : 19
% 0.22/0.52 # Removed in clause preprocessing : 0
% 0.22/0.52 # Initial clauses in saturation : 19
% 0.22/0.52 # Processed clauses : 68
% 0.22/0.52 # ...of these trivial : 0
% 0.22/0.52 # ...subsumed : 7
% 0.22/0.52 # ...remaining for further processing : 61
% 0.22/0.52 # Other redundant clauses eliminated : 3
% 0.22/0.52 # Clauses deleted for lack of memory : 0
% 0.22/0.52 # Backward-subsumed : 3
% 0.22/0.52 # Backward-rewritten : 1
% 0.22/0.52 # Generated clauses : 33
% 0.22/0.52 # ...of the previous two non-redundant : 33
% 0.22/0.52 # ...aggressively subsumed : 0
% 0.22/0.52 # Contextual simplify-reflections : 2
% 0.22/0.52 # Paramodulations : 30
% 0.22/0.52 # Factorizations : 0
% 0.22/0.52 # NegExts : 0
% 0.22/0.52 # Equation resolutions : 3
% 0.22/0.52 # Total rewrite steps : 19
% 0.22/0.52 # Propositional unsat checks : 0
% 0.22/0.52 # Propositional check models : 0
% 0.22/0.52 # Propositional check unsatisfiable : 0
% 0.22/0.52 # Propositional clauses : 0
% 0.22/0.52 # Propositional clauses after purity: 0
% 0.22/0.52 # Propositional unsat core size : 0
% 0.22/0.52 # Propositional preprocessing time : 0.000
% 0.22/0.52 # Propositional encoding time : 0.000
% 0.22/0.52 # Propositional solver time : 0.000
% 0.22/0.52 # Success case prop preproc time : 0.000
% 0.22/0.52 # Success case prop encoding time : 0.000
% 0.22/0.52 # Success case prop solver time : 0.000
% 0.22/0.52 # Current number of processed clauses : 35
% 0.22/0.52 # Positive orientable unit clauses : 6
% 0.22/0.52 # Positive unorientable unit clauses: 0
% 0.22/0.52 # Negative unit clauses : 3
% 0.22/0.52 # Non-unit-clauses : 26
% 0.22/0.52 # Current number of unprocessed clauses: 3
% 0.22/0.52 # ...number of literals in the above : 12
% 0.22/0.52 # Current number of archived formulas : 0
% 0.22/0.52 # Current number of archived clauses : 23
% 0.22/0.52 # Clause-clause subsumption calls (NU) : 161
% 0.22/0.52 # Rec. Clause-clause subsumption calls : 118
% 0.22/0.52 # Non-unit clause-clause subsumptions : 11
% 0.22/0.52 # Unit Clause-clause subsumption calls : 27
% 0.22/0.52 # Rewrite failures with RHS unbound : 0
% 0.22/0.52 # BW rewrite match attempts : 1
% 0.22/0.52 # BW rewrite match successes : 1
% 0.22/0.52 # Condensation attempts : 0
% 0.22/0.52 # Condensation successes : 0
% 0.22/0.52 # Termbank termtop insertions : 2024
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.006 s
% 0.22/0.52 # System time : 0.002 s
% 0.22/0.52 # Total time : 0.008 s
% 0.22/0.52 # Maximum resident set size: 1884 pages
% 0.22/0.52
% 0.22/0.52 # -------------------------------------------------
% 0.22/0.52 # User time : 0.008 s
% 0.22/0.52 # System time : 0.003 s
% 0.22/0.52 # Total time : 0.012 s
% 0.22/0.52 # Maximum resident set size: 1696 pages
% 0.22/0.52 % E---3.1 exiting
% 0.22/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------