%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ128+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:01:56 PM UTC 2026
% Result : Theorem 0.10s 0.43s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of formulae : 37 ( 22 unt; 0 def)
% Number of atoms : 147 ( 41 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 177 ( 67 ~; 62 |; 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 : 46 ( 0 sgn 5 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove,conjecture,
? [X1,X2,X3,X4] :
( 'Iokaste' = X1
& relation(X1,of,X2)
& X2 = X3
& relation(X3,of,X4)
& ~ ? [X5] :
( X4 = X5
& patricide(X5) )
& $true
& parent(X3)
& patricide(X2)
& parent(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
fof(background,axiom,
? [X1,X2,X3,X4,X5] :
( ~ ? [X6] :
( 'Thersandros' = X6
& patricide(X6) )
& 'Oedipus' = X5
& patricide(X5)
& 'Polyneikes' = X4
& relation(X4,of,'Thersandros')
& parent(X4)
& 'Oedipus' = X3
& relation(X3,of,'Polyneikes')
& parent(X3)
& 'Iokaste' = X2
& relation(X2,of,'Polyneikes')
& parent(X2)
& 'Iokaste' = X1
& relation(X1,of,'Oedipus')
& parent(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',background) ).
fof(c_0_2,negated_conjecture,
~ ? [X1,X2,X3,X4] :
( 'Iokaste' = X1
& relation(X1,of,X2)
& X2 = X3
& relation(X3,of,X4)
& ~ ? [X5] :
( X4 = X5
& patricide(X5) )
& $true
& parent(X3)
& patricide(X2)
& parent(X1) ),
inference(assume_negation,[status(cth)],[prove]) ).
fof(c_0_3,negated_conjecture,
! [X7,X8,X9,X10] :
( ( 'Iokaste' != X7
| ~ relation(X7,of,X8)
| X8 != X9
| ~ relation(X9,of,X10)
| ~ $true
| ~ parent(X9)
| ~ patricide(X8)
| ~ parent(X7)
| X10 = esk1_4(X7,X8,X9,X10) )
& ( 'Iokaste' != X7
| ~ relation(X7,of,X8)
| X8 != X9
| ~ relation(X9,of,X10)
| ~ $true
| ~ parent(X9)
| ~ patricide(X8)
| ~ parent(X7)
| patricide(esk1_4(X7,X8,X9,X10)) ) ),
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,
! [X17] :
( ( 'Thersandros' != X17
| ~ patricide(X17) )
& 'Oedipus' = esk6_0
& patricide(esk6_0)
& 'Polyneikes' = esk5_0
& relation(esk5_0,of,'Thersandros')
& parent(esk5_0)
& 'Oedipus' = esk4_0
& relation(esk4_0,of,'Polyneikes')
& parent(esk4_0)
& 'Iokaste' = esk3_0
& relation(esk3_0,of,'Polyneikes')
& parent(esk3_0)
& 'Iokaste' = esk2_0
& relation(esk2_0,of,'Oedipus')
& parent(esk2_0) ),
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,
( 'Iokaste' != X1
| ~ relation(X1,of,X2)
| X2 != X3
| ~ relation(X3,of,X4)
| $false
| ~ parent(X3)
| ~ patricide(X2)
| ~ parent(X1)
| patricide(esk1_4(X1,X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
parent(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
'Iokaste' = esk2_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( 'Iokaste' != X2
| ~ relation(X2,of,X3)
| X3 != X4
| ~ relation(X4,of,X1)
| $false
| ~ parent(X4)
| ~ patricide(X3)
| ~ parent(X2)
| X1 = esk1_4(X2,X3,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,negated_conjecture,
( ~ relation(X1,of,X2)
| ~ relation(X3,of,X4)
| ~ patricide(X2)
| ~ parent(X1)
| ~ parent(X3)
| 'Iokaste' != X1
| X2 != X3
| patricide(esk1_4(X1,X2,X3,X4)) ),
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,
( ~ relation(X2,of,X3)
| ~ relation(X4,of,X1)
| ~ patricide(X3)
| ~ parent(X2)
| ~ parent(X4)
| 'Iokaste' != X2
| X3 != X4
| X1 = esk1_4(X2,X3,X4,X1) ),
inference(cn,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
'Oedipus' = esk6_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,plain,
'Oedipus' = esk4_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
( ~ parent(X1)
| ~ relation(X1,of,X2)
| ~ relation('Iokaste',of,X1)
| ~ patricide(X1)
| patricide(esk1_4('Iokaste',X1,X1,X2)) ),
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,
( ~ parent(X1)
| ~ relation(X1,of,X2)
| ~ relation('Iokaste',of,X1)
| ~ patricide(X1)
| esk1_4('Iokaste',X1,X1,X2) = X2 ),
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(esk2_0,of,'Oedipus'),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,plain,
patricide(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,plain,
esk6_0 = esk4_0,
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( ~ parent(X2)
| ~ relation(X2,of,X1)
| ~ relation('Iokaste',of,X2)
| ~ patricide(X2)
| patricide(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
relation('Iokaste',of,esk4_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_7]),c_0_13]) ).
cnf(c_0_21,plain,
patricide(esk4_0),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
parent(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_23,plain,
relation(esk4_0,of,'Polyneikes'),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_24,plain,
'Polyneikes' = esk5_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_25,plain,
relation(esk3_0,of,'Polyneikes'),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_26,plain,
'Iokaste' = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_27,negated_conjecture,
( ~ relation(esk4_0,of,X1)
| patricide(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_28,plain,
relation(esk4_0,of,esk5_0),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
relation('Iokaste',of,esk5_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_24]) ).
cnf(c_0_30,plain,
parent(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_31,negated_conjecture,
patricide(esk5_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
( 'Thersandros' != X1
| ~ patricide(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_33,negated_conjecture,
( ~ relation(esk5_0,of,X1)
| patricide(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_29]),c_0_30])]),c_0_31])]) ).
cnf(c_0_34,plain,
relation(esk5_0,of,'Thersandros'),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_35,plain,
~ patricide('Thersandros'),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ128+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n007.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 03:50:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.10/0.43 % Version: 3.5.1
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % sh5l with pid 109731 completed with status 0
% 0.10/0.43 % Result found by sh5l
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.43 % Search class: FHHSF-FFSM33-SFFFFFNN
% 0.10/0.43 % partial match(1): FHHSF-FFMM33-SFFFFFNN
% 0.10/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % SubtermCWHack with pid 109738 completed with status 0
% 0.10/0.43 % Result found by SubtermCWHack
% 0.10/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43 % Starting sh5l with 300s (1) cores
% 0.10/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.43 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.43 % Search class: FHHSF-FFSM33-SFFFFFNN
% 0.10/0.43 % partial match(1): FHHSF-FFMM33-SFFFFFNN
% 0.10/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43 % Preprocessing time : 0.001 s
% 0.10/0.43
% 0.10/0.43 % Proof found!
% 0.10/0.43 % SZS status Theorem
% 0.10/0.43 % SZS output start CNFRefutation
% See solution above
% 0.10/0.43 % Parsed axioms : 2
% 0.10/0.43 % Removed by relevancy pruning/SinE : 0
% 0.10/0.43 % Initial clauses : 17
% 0.10/0.43 % Removed in clause preprocessing : 0
% 0.10/0.43 % Initial clauses in saturation : 17
% 0.10/0.43 % Processed clauses : 26
% 0.10/0.43 % ...of these trivial : 0
% 0.10/0.43 % ...subsumed : 0
% 0.10/0.43 % ...remaining for further processing : 26
% 0.10/0.43 % Other redundant clauses eliminated : 5
% 0.10/0.43 % Clauses deleted for lack of memory : 0
% 0.10/0.43 % Backward-subsumed : 0
% 0.10/0.43 % Backward-rewritten : 3
% 0.10/0.43 % Generated clauses : 8
% 0.10/0.43 % ...of the previous two non-redundant : 9
% 0.10/0.43 % ...aggressively subsumed : 0
% 0.10/0.43 % Contextual simplify-reflections : 0
% 0.10/0.43 % Paramodulations : 5
% 0.10/0.43 % Factorizations : 0
% 0.10/0.43 % NegExts : 0
% 0.10/0.43 % Equation resolutions : 5
% 0.10/0.43 % Disequality decompositions : 0
% 0.10/0.43 % Total rewrite steps : 16
% 0.10/0.43 % ...of those cached : 6
% 0.10/0.43 % Propositional unsat checks : 0
% 0.10/0.43 % Propositional check models : 0
% 0.10/0.43 % Propositional check unsatisfiable : 0
% 0.10/0.43 % Propositional clauses : 0
% 0.10/0.43 % Propositional clauses after purity: 0
% 0.10/0.43 % Propositional unsat core size : 0
% 0.10/0.43 % Propositional preprocessing time : 0.000
% 0.10/0.43 % Propositional encoding time : 0.000
% 0.10/0.43 % Propositional solver time : 0.000
% 0.10/0.43 % Success case prop preproc time : 0.000
% 0.10/0.43 % Success case prop encoding time : 0.000
% 0.10/0.43 % Success case prop solver time : 0.000
% 0.10/0.43 % Current number of processed clauses : 20
% 0.10/0.43 % Positive orientable unit clauses : 14
% 0.10/0.43 % Positive unorientable unit clauses: 0
% 0.10/0.43 % Negative unit clauses : 1
% 0.10/0.43 % Non-unit-clauses : 5
% 0.10/0.43 % Current number of unprocessed clauses: 0
% 0.10/0.43 % ...number of literals in the above : 0
% 0.10/0.43 % Current number of archived formulas : 0
% 0.10/0.43 % Current number of archived clauses : 3
% 0.10/0.43 % Clause-clause subsumption calls (NU) : 11
% 0.10/0.43 % Rec. Clause-clause subsumption calls : 2
% 0.10/0.43 % Non-unit clause-clause subsumptions : 0
% 0.10/0.43 % Unit Clause-clause subsumption calls : 0
% 0.10/0.43 % Rewrite failures with RHS unbound : 0
% 0.10/0.43 % BW rewrite match attempts : 4
% 0.10/0.43 % BW rewrite match successes : 3
% 0.10/0.43 % Condensation attempts : 0
% 0.10/0.43 % Condensation successes : 0
% 0.10/0.43 % Termbank termtop insertions : 964
% 0.10/0.43 % Search garbage collected termcells : 201
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.005 s
% 0.10/0.43 % System time : 0.001 s
% 0.10/0.43 % Total time : 0.006 s
% 0.10/0.43 % Maximum resident set size: 3636 pages
% 0.10/0.43
% 0.10/0.43 % -------------------------------------------------
% 0.10/0.43 % User time : 0.007 s
% 0.10/0.43 % System time : 0.005 s
% 0.10/0.43 % Total time : 0.012 s
% 0.10/0.43 % Maximum resident set size: 4608 pages
% 0.10/0.43 % E exiting
%------------------------------------------------------------------------------