%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ128+1 : 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 : n006.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.21s 0.49s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 21 ( 16 unt; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 31 ( 16 ~; 6 |; 9 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn 2 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(iokaste_parent_particide_parent_not_patricide,conjecture,
? [X1,X2] :
( ~ patricide(X2)
& parent_of(X1,X2)
& patricide(X1)
& parent_of(iokaste,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_parent_particide_parent_not_patricide) ).
fof(thersandros_not_patricidal,axiom,
~ patricide(thersandros),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thersandros_not_patricidal) ).
fof(polyneikes_thersandros,axiom,
parent_of(polyneikes,thersandros),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',polyneikes_thersandros) ).
fof(iokaste_polyneikes,axiom,
parent_of(iokaste,polyneikes),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_polyneikes) ).
fof(oedipus_polyneikes,axiom,
parent_of(oedipus,polyneikes),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oedipus_polyneikes) ).
fof(oedipus_patricidal,axiom,
patricide(oedipus),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oedipus_patricidal) ).
fof(iokaste_oedipus,axiom,
parent_of(iokaste,oedipus),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',iokaste_oedipus) ).
fof(c_0_7,negated_conjecture,
~ ? [X1,X2] :
( ~ patricide(X2)
& parent_of(X1,X2)
& patricide(X1)
& parent_of(iokaste,X1) ),
inference(assume_negation,[status(cth)],[iokaste_parent_particide_parent_not_patricide]) ).
fof(c_0_8,negated_conjecture,
~ ? [X1,X2] :
( ~ patricide(X2)
& parent_of(X1,X2)
& patricide(X1)
& parent_of(iokaste,X1) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
~ patricide(thersandros),
inference(fof_simplification,[status(thm)],[thersandros_not_patricidal]) ).
fof(c_0_10,negated_conjecture,
! [X3,X4] :
( patricide(X4)
| ~ parent_of(X3,X4)
| ~ patricide(X3)
| ~ parent_of(iokaste,X3) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
~ patricide(thersandros),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
( ~ parent_of(X1,X2)
| ~ patricide(X1)
| ~ parent_of(iokaste,X1)
| patricide(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
parent_of(polyneikes,thersandros),
inference(split_conjunct,[status(thm)],[polyneikes_thersandros]) ).
cnf(c_0_14,plain,
parent_of(iokaste,polyneikes),
inference(split_conjunct,[status(thm)],[iokaste_polyneikes]) ).
cnf(c_0_15,plain,
~ patricide(thersandros),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
parent_of(oedipus,polyneikes),
inference(split_conjunct,[status(thm)],[oedipus_polyneikes]) ).
cnf(c_0_17,plain,
patricide(oedipus),
inference(split_conjunct,[status(thm)],[oedipus_patricidal]) ).
cnf(c_0_18,plain,
parent_of(iokaste,oedipus),
inference(split_conjunct,[status(thm)],[iokaste_oedipus]) ).
cnf(c_0_19,negated_conjecture,
~ patricide(polyneikes),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_16]),c_0_17]),c_0_18])]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : PUZ128+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 % Computer : n006.cluster.edu
% 0.15/0.41 % Model : x86_64 x86_64
% 0.15/0.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41 % Memory : 8046.5625MB
% 0.15/0.41 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Mon Sep 21 03:52:27 UTC 2026
% 0.15/0.41 % CPUTime :
% 0.15/0.41 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 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.21/0.49 % Version: 3.5.1
% 0.21/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 % Starting sh5l with 300s (1) cores
% 0.21/0.49 % new_bool_1 with pid 1952047 completed with status 0
% 0.21/0.49 % Result found by new_bool_1
% 0.21/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 % Search class: FHUNF-FFSS00-SFFFFFNN
% 0.21/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.49 % SubtermCWHack with pid 1952053 completed with status 0
% 0.21/0.49 % Result found by SubtermCWHack
% 0.21/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.49 % Search class: FHUNF-FFSS00-SFFFFFNN
% 0.21/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.21/0.49 % Preprocessing time : 0.002 s
% 0.21/0.49
% 0.21/0.49 % Proof found!
% 0.21/0.49 % SZS status Theorem
% 0.21/0.49 % SZS output start CNFRefutation
% See solution above
% 0.21/0.49 % Parsed axioms : 7
% 0.21/0.49 % Removed by relevancy pruning/SinE : 0
% 0.21/0.49 % Initial clauses : 7
% 0.21/0.49 % Removed in clause preprocessing : 0
% 0.21/0.49 % Initial clauses in saturation : 7
% 0.21/0.49 % Processed clauses : 9
% 0.21/0.49 % ...of these trivial : 0
% 0.21/0.49 % ...subsumed : 0
% 0.21/0.49 % ...remaining for further processing : 8
% 0.21/0.49 % Other redundant clauses eliminated : 0
% 0.21/0.49 % Clauses deleted for lack of memory : 0
% 0.21/0.49 % Backward-subsumed : 0
% 0.21/0.49 % Backward-rewritten : 0
% 0.21/0.49 % Generated clauses : 4
% 0.21/0.49 % ...of the previous two non-redundant : 3
% 0.21/0.49 % ...aggressively subsumed : 0
% 0.21/0.49 % Contextual simplify-reflections : 0
% 0.21/0.49 % Paramodulations : 4
% 0.21/0.49 % Factorizations : 0
% 0.21/0.49 % NegExts : 0
% 0.21/0.49 % Equation resolutions : 0
% 0.21/0.49 % Disequality decompositions : 0
% 0.21/0.49 % Total rewrite steps : 4
% 0.21/0.49 % ...of those cached : 1
% 0.21/0.49 % Propositional unsat checks : 0
% 0.21/0.49 % Propositional check models : 0
% 0.21/0.49 % Propositional check unsatisfiable : 0
% 0.21/0.49 % Propositional clauses : 0
% 0.21/0.49 % Propositional clauses after purity: 0
% 0.21/0.49 % Propositional unsat core size : 0
% 0.21/0.49 % Propositional preprocessing time : 0.000
% 0.21/0.49 % Propositional encoding time : 0.000
% 0.21/0.49 % Propositional solver time : 0.000
% 0.21/0.49 % Success case prop preproc time : 0.000
% 0.21/0.49 % Success case prop encoding time : 0.000
% 0.21/0.49 % Success case prop solver time : 0.000
% 0.21/0.49 % Current number of processed clauses : 8
% 0.21/0.49 % Positive orientable unit clauses : 5
% 0.21/0.49 % Positive unorientable unit clauses: 0
% 0.21/0.49 % Negative unit clauses : 2
% 0.21/0.49 % Non-unit-clauses : 1
% 0.21/0.49 % Current number of unprocessed clauses: 1
% 0.21/0.49 % ...number of literals in the above : 3
% 0.21/0.49 % Current number of archived formulas : 0
% 0.21/0.49 % Current number of archived clauses : 0
% 0.21/0.49 % Clause-clause subsumption calls (NU) : 0
% 0.21/0.49 % Rec. Clause-clause subsumption calls : 0
% 0.21/0.49 % Non-unit clause-clause subsumptions : 0
% 0.21/0.49 % Unit Clause-clause subsumption calls : 2
% 0.21/0.49 % Rewrite failures with RHS unbound : 0
% 0.21/0.49 % BW rewrite match attempts : 0
% 0.21/0.49 % BW rewrite match successes : 0
% 0.21/0.49 % Condensation attempts : 0
% 0.21/0.49 % Condensation successes : 0
% 0.21/0.49 % Termbank termtop insertions : 301
% 0.21/0.49 % Search garbage collected termcells : 32
% 0.21/0.49
% 0.21/0.49 % -------------------------------------------------
% 0.21/0.49 % User time : 0.005 s
% 0.21/0.49 % System time : 0.002 s
% 0.21/0.49 % Total time : 0.007 s
% 0.21/0.49 % Maximum resident set size: 3628 pages
% 0.21/0.49
% 0.21/0.49 % -------------------------------------------------
% 0.21/0.49 % User time : 0.007 s
% 0.21/0.49 % System time : 0.008 s
% 0.21/0.49 % Total time : 0.014 s
% 0.21/0.49 % Maximum resident set size: 4608 pages
% 0.21/0.49 % E exiting
%------------------------------------------------------------------------------