TSTP Solution File: PUZ128+2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : PUZ128+2 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:26:22 EDT 2024
% Result : Theorem 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 38 ( 22 unt; 0 def)
% Number of atoms : 150 ( 41 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 181 ( 69 ~; 64 |; 48 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 3 usr; 2 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 10 con; 0-4 aty)
% Number of variables : 47 ( 0 sgn 5 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove,conjecture,
? [X1,X2,X3,X4] :
( parent(X1)
& patricide(X2)
& parent(X3)
& $true
& ~ ? [X5] :
( patricide(X5)
& X4 = X5 )
& relation(X3,of,X4)
& X2 = X3
& relation(X1,of,X2)
& 'Iokaste' = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
fof(background,axiom,
? [X1,X2,X3,X4,X5] :
( parent(X1)
& relation(X1,of,'Oedipus')
& 'Iokaste' = X1
& parent(X2)
& relation(X2,of,'Polyneikes')
& 'Iokaste' = X2
& parent(X3)
& relation(X3,of,'Polyneikes')
& 'Oedipus' = X3
& parent(X4)
& relation(X4,of,'Thersandros')
& 'Polyneikes' = X4
& patricide(X5)
& 'Oedipus' = X5
& ~ ? [X6] :
( patricide(X6)
& 'Thersandros' = X6 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',background) ).
fof(c_0_2,negated_conjecture,
~ ? [X1,X2,X3,X4] :
( parent(X1)
& patricide(X2)
& parent(X3)
& $true
& ~ ? [X5] :
( patricide(X5)
& X4 = X5 )
& relation(X3,of,X4)
& X2 = X3
& relation(X1,of,X2)
& 'Iokaste' = X1 ),
inference(assume_negation,[status(cth)],[prove]) ).
fof(c_0_3,negated_conjecture,
! [X13,X14,X15,X16] :
( ( patricide(esk6_4(X13,X14,X15,X16))
| ~ parent(X13)
| ~ patricide(X14)
| ~ parent(X15)
| ~ $true
| ~ relation(X15,of,X16)
| X14 != X15
| ~ relation(X13,of,X14)
| 'Iokaste' != X13 )
& ( X16 = esk6_4(X13,X14,X15,X16)
| ~ parent(X13)
| ~ patricide(X14)
| ~ parent(X15)
| ~ $true
| ~ relation(X15,of,X16)
| X14 != X15
| ~ relation(X13,of,X14)
| 'Iokaste' != X13 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])])]) ).
fof(c_0_4,plain,
! [X12] :
( parent(esk1_0)
& relation(esk1_0,of,'Oedipus')
& 'Iokaste' = esk1_0
& parent(esk2_0)
& relation(esk2_0,of,'Polyneikes')
& 'Iokaste' = esk2_0
& parent(esk3_0)
& relation(esk3_0,of,'Polyneikes')
& 'Oedipus' = esk3_0
& parent(esk4_0)
& relation(esk4_0,of,'Thersandros')
& 'Polyneikes' = esk4_0
& patricide(esk5_0)
& 'Oedipus' = esk5_0
& ( ~ patricide(X12)
| 'Thersandros' != X12 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[background])])])])]) ).
cnf(c_0_5,negated_conjecture,
( patricide(esk6_4(X1,X2,X3,X4))
| ~ parent(X1)
| ~ patricide(X2)
| ~ parent(X3)
| $false
| ~ relation(X3,of,X4)
| X2 != X3
| ~ relation(X1,of,X2)
| 'Iokaste' != X1 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
parent(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
'Iokaste' = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( X1 = esk6_4(X2,X3,X4,X1)
| ~ parent(X2)
| ~ patricide(X3)
| ~ parent(X4)
| $false
| ~ relation(X4,of,X1)
| X3 != X4
| ~ relation(X2,of,X3)
| 'Iokaste' != X2 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( patricide(esk6_4(X1,X2,X3,X4))
| X2 != X3
| 'Iokaste' != X1
| ~ parent(X3)
| ~ parent(X1)
| ~ patricide(X2)
| ~ relation(X3,of,X4)
| ~ relation(X1,of,X2) ),
inference(cn,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
parent('Iokaste'),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( X1 = esk6_4(X2,X3,X4,X1)
| X3 != X4
| 'Iokaste' != X2
| ~ parent(X4)
| ~ parent(X2)
| ~ patricide(X3)
| ~ relation(X4,of,X1)
| ~ relation(X2,of,X3) ),
inference(cn,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
'Oedipus' = esk5_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,plain,
'Oedipus' = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
( patricide(esk6_4('Iokaste',X1,X1,X2))
| ~ patricide(X1)
| ~ relation('Iokaste',of,X1)
| ~ relation(X1,of,X2)
| ~ parent(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]),c_0_10])]) ).
cnf(c_0_15,negated_conjecture,
( esk6_4('Iokaste',X1,X1,X2) = X2
| ~ patricide(X1)
| ~ relation('Iokaste',of,X1)
| ~ relation(X1,of,X2)
| ~ parent(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_11])]),c_0_10])]) ).
cnf(c_0_16,plain,
relation(esk1_0,of,'Oedipus'),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,plain,
patricide(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,plain,
esk5_0 = esk3_0,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
relation(esk2_0,of,'Polyneikes'),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_20,plain,
'Iokaste' = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,plain,
'Polyneikes' = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_22,negated_conjecture,
( patricide(X1)
| ~ patricide(X2)
| ~ relation('Iokaste',of,X2)
| ~ relation(X2,of,X1)
| ~ parent(X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
relation('Iokaste',of,esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_7]),c_0_13]) ).
cnf(c_0_24,plain,
patricide(esk3_0),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
parent(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_26,plain,
relation(esk3_0,of,'Polyneikes'),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_27,plain,
relation('Iokaste',of,esk4_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_28,plain,
parent(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_29,negated_conjecture,
( patricide(X1)
| ~ relation(esk3_0,of,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_30,plain,
relation(esk3_0,of,esk4_0),
inference(rw,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_31,negated_conjecture,
( patricide(X1)
| ~ patricide(esk4_0)
| ~ relation(esk4_0,of,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_27]),c_0_28])]) ).
cnf(c_0_32,negated_conjecture,
patricide(esk4_0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( ~ patricide(X1)
| 'Thersandros' != X1 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_34,negated_conjecture,
( patricide(X1)
| ~ relation(esk4_0,of,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_35,plain,
relation(esk4_0,of,'Thersandros'),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_36,plain,
~ patricide('Thersandros'),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : PUZ128+2 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n016.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Sat May 18 10:32:52 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.20/0.51 Running first-order model finding
% 0.20/0.51 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52 # Version: 3.1.0
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.52 # Starting sh5l with 300s (1) cores
% 0.20/0.52 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 14891 completed with status 0
% 0.20/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FHHSF-FFSM33-SFFFFFNN
% 0.20/0.52 # partial match(1): FHHSF-FFMM33-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.20/0.52 # Starting new_bool_3 with 136s (1) cores
% 0.20/0.52 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.52 # Starting sh5l with 136s (1) cores
% 0.20/0.52 # SAT001_MinMin_p005000_rr_RG with pid 14896 completed with status 0
% 0.20/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.52 # No SInE strategy applied
% 0.20/0.52 # Search class: FHHSF-FFSM33-SFFFFFNN
% 0.20/0.52 # partial match(1): FHHSF-FFMM33-SFFFFFNN
% 0.20/0.52 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.52 # Preprocessing time : 0.001 s
% 0.20/0.52 # Presaturation interreduction done
% 0.20/0.52
% 0.20/0.52 # Proof found!
% 0.20/0.52 # SZS status Theorem
% 0.20/0.52 # SZS output start CNFRefutation
% See solution above
% 0.20/0.52 # Parsed axioms : 2
% 0.20/0.52 # Removed by relevancy pruning/SinE : 0
% 0.20/0.52 # Initial clauses : 17
% 0.20/0.52 # Removed in clause preprocessing : 0
% 0.20/0.52 # Initial clauses in saturation : 17
% 0.20/0.52 # Processed clauses : 41
% 0.20/0.52 # ...of these trivial : 1
% 0.20/0.52 # ...subsumed : 0
% 0.20/0.52 # ...remaining for further processing : 40
% 0.20/0.52 # Other redundant clauses eliminated : 5
% 0.20/0.52 # Clauses deleted for lack of memory : 0
% 0.20/0.52 # Backward-subsumed : 0
% 0.20/0.52 # Backward-rewritten : 1
% 0.20/0.52 # Generated clauses : 9
% 0.20/0.52 # ...of the previous two non-redundant : 9
% 0.20/0.52 # ...aggressively subsumed : 0
% 0.20/0.52 # Contextual simplify-reflections : 0
% 0.20/0.52 # Paramodulations : 6
% 0.20/0.52 # Factorizations : 0
% 0.20/0.52 # NegExts : 0
% 0.20/0.52 # Equation resolutions : 5
% 0.20/0.52 # Disequality decompositions : 0
% 0.20/0.52 # Total rewrite steps : 16
% 0.20/0.52 # ...of those cached : 6
% 0.20/0.52 # Propositional unsat checks : 0
% 0.20/0.52 # Propositional check models : 0
% 0.20/0.52 # Propositional check unsatisfiable : 0
% 0.20/0.52 # Propositional clauses : 0
% 0.20/0.52 # Propositional clauses after purity: 0
% 0.20/0.52 # Propositional unsat core size : 0
% 0.20/0.52 # Propositional preprocessing time : 0.000
% 0.20/0.52 # Propositional encoding time : 0.000
% 0.20/0.52 # Propositional solver time : 0.000
% 0.20/0.52 # Success case prop preproc time : 0.000
% 0.20/0.52 # Success case prop encoding time : 0.000
% 0.20/0.52 # Success case prop solver time : 0.000
% 0.20/0.52 # Current number of processed clauses : 20
% 0.20/0.52 # Positive orientable unit clauses : 14
% 0.20/0.52 # Positive unorientable unit clauses: 0
% 0.20/0.52 # Negative unit clauses : 1
% 0.20/0.52 # Non-unit-clauses : 5
% 0.20/0.52 # Current number of unprocessed clauses: 0
% 0.20/0.52 # ...number of literals in the above : 0
% 0.20/0.52 # Current number of archived formulas : 0
% 0.20/0.52 # Current number of archived clauses : 17
% 0.20/0.52 # Clause-clause subsumption calls (NU) : 23
% 0.20/0.52 # Rec. Clause-clause subsumption calls : 5
% 0.20/0.52 # Non-unit clause-clause subsumptions : 0
% 0.20/0.52 # Unit Clause-clause subsumption calls : 0
% 0.20/0.52 # Rewrite failures with RHS unbound : 0
% 0.20/0.52 # BW rewrite match attempts : 3
% 0.20/0.52 # BW rewrite match successes : 1
% 0.20/0.52 # Condensation attempts : 0
% 0.20/0.52 # Condensation successes : 0
% 0.20/0.52 # Termbank termtop insertions : 958
% 0.20/0.52 # Search garbage collected termcells : 202
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.004 s
% 0.20/0.52 # System time : 0.002 s
% 0.20/0.52 # Total time : 0.006 s
% 0.20/0.52 # Maximum resident set size: 1776 pages
% 0.20/0.52
% 0.20/0.52 # -------------------------------------------------
% 0.20/0.52 # User time : 0.014 s
% 0.20/0.52 # System time : 0.007 s
% 0.20/0.52 # Total time : 0.021 s
% 0.20/0.52 # Maximum resident set size: 1696 pages
% 0.20/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------