%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO012+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 : n009.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:33 PM UTC 2026
% Result : Theorem 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 26 ( 7 unt; 0 def)
% Number of atoms : 92 ( 4 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 106 ( 40 ~; 40 |; 21 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 39 ( 0 sgn 16 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X101] :
( occurrence_of(X101,tptp0)
=> ? [X102,X103] :
( min_precedes(X102,X103,tptp0)
& ( occurrence_of(X103,tptp1)
| occurrence_of(X103,tptp2) )
& root_occ(X102,X101)
& occurrence_of(X102,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_32,axiom,
! [X96] :
( occurrence_of(X96,tptp0)
=> ? [X97,X98,X99] :
( ! [X100] :
( min_precedes(X97,X100,tptp0)
=> ( X100 = X99
| X100 = X98 ) )
& min_precedes(X98,X99,tptp0)
& ( occurrence_of(X99,tptp1)
| occurrence_of(X99,tptp2) )
& min_precedes(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,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_3,negated_conjecture,
~ ! [X101] :
( occurrence_of(X101,tptp0)
=> ? [X102,X103] :
( min_precedes(X102,X103,tptp0)
& ( occurrence_of(X103,tptp1)
| occurrence_of(X103,tptp2) )
& root_occ(X102,X101)
& occurrence_of(X102,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_4,plain,
! [X216,X220] :
( ( ~ occurrence_of(X216,tptp0)
| X220 = esk17_1(X216)
| X220 = esk16_1(X216)
| ~ min_precedes(esk15_1(X216),X220,tptp0) )
& ( ~ occurrence_of(X216,tptp0)
| min_precedes(esk16_1(X216),esk17_1(X216),tptp0) )
& ( ~ occurrence_of(X216,tptp0)
| occurrence_of(esk17_1(X216),tptp1)
| occurrence_of(esk17_1(X216),tptp2) )
& ( ~ occurrence_of(X216,tptp0)
| min_precedes(esk15_1(X216),esk16_1(X216),tptp0) )
& ( ~ occurrence_of(X216,tptp0)
| occurrence_of(esk16_1(X216),tptp4) )
& ( ~ occurrence_of(X216,tptp0)
| root_occ(esk15_1(X216),X216) )
& ( ~ occurrence_of(X216,tptp0)
| occurrence_of(esk15_1(X216),tptp3) ) ),
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)],[sos_32])])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X222,X223] :
( ( ~ min_precedes(X222,X223,tptp0)
| ~ root_occ(X222,esk18_0)
| ~ occurrence_of(X222,tptp3)
| ~ occurrence_of(X223,tptp1) )
& ( ~ min_precedes(X222,X223,tptp0)
| ~ root_occ(X222,esk18_0)
| ~ occurrence_of(X222,tptp3)
| ~ occurrence_of(X223,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_3])])])])])]) ).
cnf(c_0_6,plain,
( ~ occurrence_of(X1,tptp0)
| root_occ(esk15_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
occurrence_of(esk18_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk15_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_9,plain,
! [X104,X105,X106,X107] :
( min_precedes(X104,X106,X107)
| ~ min_precedes(X105,X106,X107)
| ~ min_precedes(X104,X105,X107) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])]) ).
cnf(c_0_10,plain,
( ~ occurrence_of(X1,tptp0)
| min_precedes(esk16_1(X1),esk17_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( ~ 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_5]) ).
cnf(c_0_12,negated_conjecture,
root_occ(esk15_1(esk18_0),esk18_0),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_13,negated_conjecture,
occurrence_of(esk15_1(esk18_0),tptp3),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_14,plain,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk17_1(X1),tptp1)
| occurrence_of(esk17_1(X1),tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,negated_conjecture,
( ~ 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_5]) ).
cnf(c_0_16,plain,
( ~ min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3)
| min_precedes(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
min_precedes(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_18,plain,
( ~ occurrence_of(X1,tptp0)
| min_precedes(esk15_1(X1),esk16_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,negated_conjecture,
( ~ min_precedes(esk15_1(esk18_0),X1,tptp0)
| ~ occurrence_of(X1,tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
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_14,c_0_7]) ).
cnf(c_0_21,negated_conjecture,
( ~ min_precedes(esk15_1(esk18_0),X1,tptp0)
| ~ occurrence_of(X1,tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_12]),c_0_13])]) ).
cnf(c_0_22,negated_conjecture,
( ~ min_precedes(X1,esk16_1(esk18_0),tptp0)
| min_precedes(X1,esk17_1(esk18_0),tptp0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,negated_conjecture,
min_precedes(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_18,c_0_7]) ).
cnf(c_0_24,negated_conjecture,
~ min_precedes(esk15_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PRO012+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n009.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 03:42:28 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 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.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 764874 completed with status 0
% 0.14/0.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.44 % No SInE strategy applied
% 0.14/0.44 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.14/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.14/0.44 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.14/0.44 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 764880 completed with status 0
% 0.14/0.44 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 0.14/0.44 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.44 % No SInE strategy applied
% 0.14/0.44 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.14/0.44 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.44 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.14/0.44 % Preprocessing time : 0.002 s
% 0.14/0.44 % Presaturation interreduction done
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Theorem
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 46
% 0.14/0.44 % Removed by relevancy pruning/SinE : 0
% 0.14/0.44 % Initial clauses : 85
% 0.14/0.44 % Removed in clause preprocessing : 0
% 0.14/0.44 % Initial clauses in saturation : 85
% 0.14/0.44 % Processed clauses : 277
% 0.14/0.44 % ...of these trivial : 7
% 0.14/0.44 % ...subsumed : 9
% 0.14/0.44 % ...remaining for further processing : 261
% 0.14/0.44 % Other redundant clauses eliminated : 0
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 0
% 0.14/0.44 % Backward-rewritten : 14
% 0.14/0.44 % Generated clauses : 208
% 0.14/0.44 % ...of the previous two non-redundant : 187
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 2
% 0.14/0.44 % Paramodulations : 208
% 0.14/0.44 % Factorizations : 0
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 0
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 76
% 0.14/0.44 % ...of those cached : 48
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 162
% 0.14/0.44 % Positive orientable unit clauses : 48
% 0.14/0.44 % Positive unorientable unit clauses: 0
% 0.14/0.44 % Negative unit clauses : 20
% 0.14/0.44 % Non-unit-clauses : 94
% 0.14/0.44 % Current number of unprocessed clauses: 64
% 0.14/0.44 % ...number of literals in the above : 92
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 99
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 3877
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 3006
% 0.14/0.44 % Non-unit clause-clause subsumptions : 4
% 0.14/0.44 % Unit Clause-clause subsumption calls : 417
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 6
% 0.14/0.44 % BW rewrite match successes : 5
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 8713
% 0.14/0.44 % Search garbage collected termcells : 1277
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.020 s
% 0.14/0.44 % System time : 0.002 s
% 0.14/0.44 % Total time : 0.022 s
% 0.14/0.44 % Maximum resident set size: 3992 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.074 s
% 0.14/0.44 % System time : 0.017 s
% 0.14/0.44 % Total time : 0.092 s
% 0.14/0.44 % Maximum resident set size: 4864 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------