%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO009+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 : n014.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 01:59:31 PM UTC 2026
% Result : Theorem 1.73s 1.08s
% Output : CNFRefutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 10 unt; 0 def)
% Number of atoms : 123 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 148 ( 59 ~; 56 |; 28 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 53 ( 0 sgn 24 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X100] :
( occurrence_of(X100,tptp0)
=> ? [X101,X102] :
( leaf_occ(X102,X100)
& min_precedes(X101,X102,tptp0)
& ( occurrence_of(X102,tptp1)
| occurrence_of(X102,tptp2) )
& root_occ(X101,X100)
& occurrence_of(X101,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_32,axiom,
! [X96] :
( occurrence_of(X96,tptp0)
=> ? [X97,X98,X99] :
( leaf_occ(X99,X96)
& next_subocc(X98,X99,tptp0)
& ( occurrence_of(X99,tptp1)
| occurrence_of(X99,tptp2) )
& next_subocc(X97,X98,tptp0)
& occurrence_of(X98,tptp4)
& root_occ(X97,X96)
& occurrence_of(X97,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(sos_04,axiom,
! [X16,X17,X18] :
( next_subocc(X16,X17,X18)
<=> ( ~ ? [X19] :
( min_precedes(X19,X17,X18)
& min_precedes(X16,X19,X18) )
& min_precedes(X16,X17,X18) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_04) ).
fof(sos,axiom,
! [X1,X2,X3,X4] :
( ( min_precedes(X2,X3,X4)
& min_precedes(X1,X2,X4) )
=> min_precedes(X1,X3,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
fof(c_0_4,negated_conjecture,
~ ! [X100] :
( occurrence_of(X100,tptp0)
=> ? [X101,X102] :
( leaf_occ(X102,X100)
& min_precedes(X101,X102,tptp0)
& ( occurrence_of(X102,tptp1)
| occurrence_of(X102,tptp2) )
& root_occ(X101,X100)
& occurrence_of(X101,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_5,plain,
! [X215] :
( ( ~ occurrence_of(X215,tptp0)
| leaf_occ(esk17_1(X215),X215) )
& ( ~ occurrence_of(X215,tptp0)
| next_subocc(esk16_1(X215),esk17_1(X215),tptp0) )
& ( ~ occurrence_of(X215,tptp0)
| occurrence_of(esk17_1(X215),tptp1)
| occurrence_of(esk17_1(X215),tptp2) )
& ( ~ occurrence_of(X215,tptp0)
| next_subocc(esk15_1(X215),esk16_1(X215),tptp0) )
& ( ~ occurrence_of(X215,tptp0)
| occurrence_of(esk16_1(X215),tptp4) )
& ( ~ occurrence_of(X215,tptp0)
| root_occ(esk15_1(X215),X215) )
& ( ~ occurrence_of(X215,tptp0)
| occurrence_of(esk15_1(X215),tptp3) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_32])])])])]) ).
fof(c_0_6,negated_conjecture,
! [X220,X221] :
( ( ~ leaf_occ(X221,esk18_0)
| ~ min_precedes(X220,X221,tptp0)
| ~ root_occ(X220,esk18_0)
| ~ occurrence_of(X220,tptp3)
| ~ occurrence_of(X221,tptp1) )
& ( ~ leaf_occ(X221,esk18_0)
| ~ min_precedes(X220,X221,tptp0)
| ~ root_occ(X220,esk18_0)
| ~ occurrence_of(X220,tptp3)
| ~ occurrence_of(X221,tptp2) )
& occurrence_of(esk18_0,tptp0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])]) ).
cnf(c_0_7,plain,
( ~ occurrence_of(X1,tptp0)
| leaf_occ(esk17_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
occurrence_of(esk18_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X118,X119,X120,X121,X122,X123,X124] :
( ( next_subocc(X122,X123,X124)
| ~ min_precedes(X122,X123,X124)
| min_precedes(esk1_3(X122,X123,X124),X123,X124) )
& ( next_subocc(X122,X123,X124)
| ~ min_precedes(X122,X123,X124)
| min_precedes(X122,esk1_3(X122,X123,X124),X124) )
& ( ~ next_subocc(X118,X119,X120)
| ~ min_precedes(X121,X119,X120)
| ~ min_precedes(X118,X121,X120) )
& ( ~ next_subocc(X118,X119,X120)
| min_precedes(X118,X119,X120) ) ),
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)],[sos_04])])])])])])]) ).
cnf(c_0_10,plain,
( ~ occurrence_of(X1,tptp0)
| next_subocc(esk16_1(X1),esk17_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( ~ leaf_occ(X1,esk18_0)
| ~ min_precedes(X2,X1,tptp0)
| ~ root_occ(X2,esk18_0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
leaf_occ(esk17_1(esk18_0),esk18_0),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,plain,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk17_1(X1),tptp1)
| occurrence_of(esk17_1(X1),tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
( ~ leaf_occ(X1,esk18_0)
| ~ min_precedes(X2,X1,tptp0)
| ~ root_occ(X2,esk18_0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_15,plain,
! [X103,X104,X105,X106] :
( min_precedes(X103,X105,X106)
| ~ min_precedes(X104,X105,X106)
| ~ min_precedes(X103,X104,X106) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])]) ).
cnf(c_0_16,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
next_subocc(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_10,c_0_8]) ).
cnf(c_0_18,plain,
( ~ occurrence_of(X1,tptp0)
| next_subocc(esk15_1(X1),esk16_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
( ~ min_precedes(X1,esk17_1(esk18_0),tptp0)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(esk17_1(esk18_0),tptp1)
| ~ root_occ(X1,esk18_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_20,negated_conjecture,
( occurrence_of(esk17_1(esk18_0),tptp2)
| occurrence_of(esk17_1(esk18_0),tptp1) ),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_21,negated_conjecture,
( ~ min_precedes(X1,esk17_1(esk18_0),tptp0)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(esk17_1(esk18_0),tptp2)
| ~ root_occ(X1,esk18_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_22,plain,
( ~ occurrence_of(X1,tptp0)
| root_occ(esk15_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,plain,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk15_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,plain,
( ~ min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3)
| min_precedes(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
min_precedes(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,negated_conjecture,
next_subocc(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
cnf(c_0_27,negated_conjecture,
( ~ min_precedes(X1,esk17_1(esk18_0),tptp0)
| ~ occurrence_of(X1,tptp3)
| ~ root_occ(X1,esk18_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_28,negated_conjecture,
root_occ(esk15_1(esk18_0),esk18_0),
inference(spm,[status(thm)],[c_0_22,c_0_8]) ).
cnf(c_0_29,negated_conjecture,
occurrence_of(esk15_1(esk18_0),tptp3),
inference(spm,[status(thm)],[c_0_23,c_0_8]) ).
cnf(c_0_30,negated_conjecture,
( ~ min_precedes(X1,esk16_1(esk18_0),tptp0)
| min_precedes(X1,esk17_1(esk18_0),tptp0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
min_precedes(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_16,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
~ min_precedes(esk15_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : PRO009+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n014.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Mon Sep 21 03:42:20 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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
% 1.73/1.08 % Version: 3.5.1
% 1.73/1.08 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.73/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.73/1.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.73/1.08 % Starting new_bool_3 with 300s (1) cores
% 1.73/1.08 % Starting new_bool_1 with 300s (1) cores
% 1.73/1.08 % Starting sh5l with 300s (1) cores
% 1.73/1.08 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3053676 completed with status 0
% 1.73/1.08 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.73/1.08 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.73/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.73/1.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.73/1.08 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.73/1.08 % No SInE strategy applied
% 1.73/1.08 % Search class: FGHSF-FFMM32-SFFFFFNN
% 1.73/1.08 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.73/1.08 % Starting SubtermCWHack with 136s (1) cores
% 1.73/1.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.73/1.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 1.73/1.08 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 1.73/1.08 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 1.73/1.08 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 3053682 completed with status 0
% 1.73/1.08 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 1.73/1.08 % Preprocessing class: FSLSSMSSSSSNFFN.
% 1.73/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.73/1.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.73/1.08 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.73/1.08 % No SInE strategy applied
% 1.73/1.08 % Search class: FGHSF-FFMM32-SFFFFFNN
% 1.73/1.08 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.73/1.08 % Starting SubtermCWHack with 136s (1) cores
% 1.73/1.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.73/1.08 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 1.73/1.08 % Preprocessing time : 0.003 s
% 1.73/1.08 % Presaturation interreduction done
% 1.73/1.08
% 1.73/1.08 % Proof found!
% 1.73/1.08 % SZS status Theorem
% 1.73/1.08 % SZS output start CNFRefutation
% See solution above
% 1.73/1.08 % Parsed axioms : 46
% 1.73/1.08 % Removed by relevancy pruning/SinE : 0
% 1.73/1.08 % Initial clauses : 85
% 1.73/1.08 % Removed in clause preprocessing : 0
% 1.73/1.08 % Initial clauses in saturation : 85
% 1.73/1.08 % Processed clauses : 321
% 1.73/1.08 % ...of these trivial : 10
% 1.73/1.08 % ...subsumed : 11
% 1.73/1.08 % ...remaining for further processing : 300
% 1.73/1.08 % Other redundant clauses eliminated : 0
% 1.73/1.08 % Clauses deleted for lack of memory : 0
% 1.73/1.08 % Backward-subsumed : 2
% 1.73/1.08 % Backward-rewritten : 17
% 1.73/1.08 % Generated clauses : 319
% 1.73/1.08 % ...of the previous two non-redundant : 273
% 1.73/1.08 % ...aggressively subsumed : 0
% 1.73/1.08 % Contextual simplify-reflections : 1
% 1.73/1.08 % Paramodulations : 318
% 1.73/1.08 % Factorizations : 0
% 1.73/1.08 % NegExts : 0
% 1.73/1.08 % Equation resolutions : 0
% 1.73/1.08 % Disequality decompositions : 0
% 1.73/1.08 % Total rewrite steps : 117
% 1.73/1.08 % ...of those cached : 77
% 1.73/1.08 % Propositional unsat checks : 0
% 1.73/1.08 % Propositional check models : 0
% 1.73/1.08 % Propositional check unsatisfiable : 0
% 1.73/1.08 % Propositional clauses : 0
% 1.73/1.08 % Propositional clauses after purity: 0
% 1.73/1.08 % Propositional unsat core size : 0
% 1.73/1.08 % Propositional preprocessing time : 0.000
% 1.73/1.08 % Propositional encoding time : 0.000
% 1.73/1.08 % Propositional solver time : 0.000
% 1.73/1.08 % Success case prop preproc time : 0.000
% 1.73/1.08 % Success case prop encoding time : 0.000
% 1.73/1.08 % Success case prop solver time : 0.000
% 1.73/1.08 % Current number of processed clauses : 195
% 1.73/1.08 % Positive orientable unit clauses : 64
% 1.73/1.08 % Positive unorientable unit clauses: 0
% 1.73/1.08 % Negative unit clauses : 34
% 1.73/1.08 % Non-unit-clauses : 97
% 1.73/1.08 % Current number of unprocessed clauses: 98
% 1.73/1.08 % ...number of literals in the above : 153
% 1.73/1.08 % Current number of archived formulas : 0
% 1.73/1.08 % Current number of archived clauses : 105
% 1.73/1.08 % Clause-clause subsumption calls (NU) : 3590
% 1.73/1.08 % Rec. Clause-clause subsumption calls : 2592
% 1.73/1.08 % Non-unit clause-clause subsumptions : 5
% 1.73/1.08 % Unit Clause-clause subsumption calls : 728
% 1.73/1.08 % Rewrite failures with RHS unbound : 0
% 1.73/1.08 % BW rewrite match attempts : 8
% 1.73/1.08 % BW rewrite match successes : 7
% 1.73/1.08 % Condensation attempts : 0
% 1.73/1.08 % Condensation successes : 0
% 1.73/1.08 % Termbank termtop insertions : 10079
% 1.73/1.08 % Search garbage collected termcells : 1267
% 1.73/1.08
% 1.73/1.08 % -------------------------------------------------
% 1.73/1.08 % User time : 0.032 s
% 1.73/1.08 % System time : 0.004 s
% 1.73/1.08 % Total time : 0.037 s
% 1.73/1.08 % Maximum resident set size: 3992 pages
% 1.73/1.08
% 1.73/1.08 % -------------------------------------------------
% 1.73/1.08 % User time : 0.081 s
% 1.73/1.08 % System time : 0.011 s
% 1.73/1.08 % Total time : 0.092 s
% 1.73/1.08 % Maximum resident set size: 4608 pages
% 1.73/1.08 % E exiting
%------------------------------------------------------------------------------