%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO010+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 : n018.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:32 PM UTC 2026
% Result : Theorem 0.21s 0.80s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 128 ( 5 equ)
% Maximal formula atoms : 28 ( 4 avg)
% Number of connectives : 149 ( 49 ~; 49 |; 41 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 58 ( 4 sgn 25 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X100] :
( occurrence_of(X100,tptp0)
=> ? [X101,X102] :
( ( occurrence_of(X102,tptp2)
=> ~ ? [X104] :
( min_precedes(X101,X104,tptp0)
& occurrence_of(X104,tptp1) ) )
& ( occurrence_of(X102,tptp1)
=> ~ ? [X103] :
( min_precedes(X101,X103,tptp0)
& occurrence_of(X103,tptp2) ) )
& leaf_occ(X102,X100) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_22,axiom,
! [X65,X66,X67] :
( ( occurrence_of(X65,X67)
& occurrence_of(X65,X66) )
=> X66 = X67 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_22) ).
fof(sos_15,axiom,
! [X47,X48] :
( atocc(X47,X48)
<=> ? [X49] :
( occurrence_of(X47,X49)
& atomic(X49)
& subactivity(X48,X49) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_15) ).
fof(sos_34,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_34) ).
fof(sos_26,axiom,
! [X78,X79,X80] :
( min_precedes(X79,X80,X78)
=> ? [X81,X82] :
( atocc(X80,X82)
& atocc(X79,X81)
& subactivity(X82,X78)
& subactivity(X81,X78) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_26) ).
fof(sos_32,axiom,
! [X96] :
( occurrence_of(X96,tptp0)
=> ? [X97,X98,X99] :
( leaf_occ(X99,X96)
& next_subocc(X98,X99,tptp0)
& ( occurrence_of(X99,tptp2)
| occurrence_of(X99,tptp1) )
& 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(c_0_6,negated_conjecture,
~ ! [X100] :
( occurrence_of(X100,tptp0)
=> ? [X101,X102] :
( ( occurrence_of(X102,tptp2)
=> ~ ? [X104] :
( min_precedes(X101,X104,tptp0)
& occurrence_of(X104,tptp1) ) )
& ( occurrence_of(X102,tptp1)
=> ~ ? [X103] :
( min_precedes(X101,X103,tptp0)
& occurrence_of(X103,tptp2) ) )
& leaf_occ(X102,X100) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,plain,
! [X118,X119,X120] :
( X119 = X120
| ~ occurrence_of(X118,X120)
| ~ occurrence_of(X118,X119) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_22])])]) ).
fof(c_0_8,negated_conjecture,
! [X106,X107] :
( ( ~ leaf_occ(X107,esk1_0)
| min_precedes(X106,esk2_2(X106,X107),tptp0)
| min_precedes(X106,esk3_2(X106,X107),tptp0) )
& ( ~ leaf_occ(X107,esk1_0)
| min_precedes(X106,esk2_2(X106,X107),tptp0)
| occurrence_of(esk3_2(X106,X107),tptp1) )
& ( ~ leaf_occ(X107,esk1_0)
| min_precedes(X106,esk2_2(X106,X107),tptp0)
| occurrence_of(X107,tptp2) )
& ( ~ leaf_occ(X107,esk1_0)
| occurrence_of(esk2_2(X106,X107),tptp2)
| min_precedes(X106,esk3_2(X106,X107),tptp0) )
& ( ~ leaf_occ(X107,esk1_0)
| occurrence_of(esk2_2(X106,X107),tptp2)
| occurrence_of(esk3_2(X106,X107),tptp1) )
& ( ~ leaf_occ(X107,esk1_0)
| occurrence_of(esk2_2(X106,X107),tptp2)
| occurrence_of(X107,tptp2) )
& ( ~ leaf_occ(X107,esk1_0)
| occurrence_of(X107,tptp1)
| min_precedes(X106,esk3_2(X106,X107),tptp0) )
& ( ~ leaf_occ(X107,esk1_0)
| occurrence_of(X107,tptp1)
| occurrence_of(esk3_2(X106,X107),tptp1) )
& ( ~ leaf_occ(X107,esk1_0)
| occurrence_of(X107,tptp1)
| occurrence_of(X107,tptp2) )
& occurrence_of(esk1_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_6])])])])])]) ).
cnf(c_0_9,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,negated_conjecture,
occurrence_of(esk1_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X184,X185,X187,X188,X189] :
( ( atocc(X187,X188)
| ~ occurrence_of(X187,X189)
| ~ atomic(X189)
| ~ subactivity(X188,X189) )
& ( ~ atocc(X184,X185)
| occurrence_of(X184,esk13_2(X184,X185)) )
& ( ~ atocc(X184,X185)
| atomic(esk13_2(X184,X185)) )
& ( ~ atocc(X184,X185)
| subactivity(X185,esk13_2(X184,X185)) ) ),
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_15])])])])])])]) ).
fof(c_0_12,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_34]) ).
cnf(c_0_13,negated_conjecture,
( ~ occurrence_of(esk1_0,X1)
| X1 = tptp0 ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ atocc(X1,X2)
| occurrence_of(X1,esk13_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
~ atomic(tptp0),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( ~ atocc(X1,X2)
| atomic(esk13_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( ~ atocc(esk1_0,X1)
| esk13_2(esk1_0,X1) = tptp0 ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X190,X191,X192] :
( ( ~ min_precedes(X191,X192,X190)
| atocc(X192,esk15_3(X190,X191,X192)) )
& ( ~ min_precedes(X191,X192,X190)
| atocc(X191,esk14_3(X190,X191,X192)) )
& ( ~ min_precedes(X191,X192,X190)
| subactivity(esk15_3(X190,X191,X192),X190) )
& ( ~ min_precedes(X191,X192,X190)
| subactivity(esk14_3(X190,X191,X192),X190) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_26])])])])]) ).
cnf(c_0_20,negated_conjecture,
~ atocc(esk1_0,X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,plain,
( ~ min_precedes(X1,X3,X2)
| atocc(X1,esk14_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ min_precedes(esk1_0,X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
( ~ leaf_occ(X2,esk1_0)
| min_precedes(X1,esk2_2(X1,X2),tptp0)
| min_precedes(X1,esk3_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_24,plain,
! [X114] :
( ( ~ occurrence_of(X114,tptp0)
| leaf_occ(esk6_1(X114),X114) )
& ( ~ occurrence_of(X114,tptp0)
| next_subocc(esk5_1(X114),esk6_1(X114),tptp0) )
& ( ~ occurrence_of(X114,tptp0)
| occurrence_of(esk6_1(X114),tptp2)
| occurrence_of(esk6_1(X114),tptp1) )
& ( ~ occurrence_of(X114,tptp0)
| next_subocc(esk4_1(X114),esk5_1(X114),tptp0) )
& ( ~ occurrence_of(X114,tptp0)
| occurrence_of(esk5_1(X114),tptp4) )
& ( ~ occurrence_of(X114,tptp0)
| root_occ(esk4_1(X114),X114) )
& ( ~ occurrence_of(X114,tptp0)
| occurrence_of(esk4_1(X114),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])])])])]) ).
cnf(c_0_25,negated_conjecture,
~ leaf_occ(X1,esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_22]) ).
cnf(c_0_26,plain,
( ~ occurrence_of(X1,tptp0)
| leaf_occ(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_10])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO010+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.64 % Computer : n018.cluster.edu
% 0.16/0.64 % Model : x86_64 x86_64
% 0.16/0.64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.64 % Memory : 8046.5625MB
% 0.16/0.64 % OS : Linux 6.8.0-71-generic
% 0.16/0.64 % CPULimit : 300
% 0.16/0.64 % WCLimit : 300
% 0.16/0.64 % DateTime : Mon Sep 21 03:44:14 UTC 2026
% 0.16/0.64 % CPUTime :
% 0.16/0.64 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.72 Running first-order theorem proving
% 0.21/0.72 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.80 % Version: 3.5.1
% 0.21/0.80 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.80 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.80 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.80 % Starting sh5l with 300s (1) cores
% 0.21/0.80 % new_bool_3 with pid 889504 completed with status 0
% 0.21/0.80 % Result found by new_bool_3
% 0.21/0.80 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.80 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.80 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.80 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.80 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.21/0.80 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.80 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.80 % SubtermCWHack with pid 889507 completed with status 0
% 0.21/0.80 % Result found by SubtermCWHack
% 0.21/0.80 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.80 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.80 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.80 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.21/0.80 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.80 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.21/0.80 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.80 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.80 % Preprocessing time : 0.004 s
% 0.21/0.80
% 0.21/0.80 % Proof found!
% 0.21/0.80 % SZS status Theorem
% 0.21/0.80 % SZS output start CNFRefutation
% See solution above
% 0.21/0.80 % Parsed axioms : 46
% 0.21/0.80 % Removed by relevancy pruning/SinE : 9
% 0.21/0.80 % Initial clauses : 76
% 0.21/0.80 % Removed in clause preprocessing : 0
% 0.21/0.80 % Initial clauses in saturation : 76
% 0.21/0.80 % Processed clauses : 310
% 0.21/0.80 % ...of these trivial : 1
% 0.21/0.80 % ...subsumed : 102
% 0.21/0.80 % ...remaining for further processing : 207
% 0.21/0.80 % Other redundant clauses eliminated : 0
% 0.21/0.80 % Clauses deleted for lack of memory : 0
% 0.21/0.80 % Backward-subsumed : 15
% 0.21/0.80 % Backward-rewritten : 10
% 0.21/0.80 % Generated clauses : 594
% 0.21/0.80 % ...of the previous two non-redundant : 437
% 0.21/0.80 % ...aggressively subsumed : 0
% 0.21/0.80 % Contextual simplify-reflections : 5
% 0.21/0.80 % Paramodulations : 594
% 0.21/0.80 % Factorizations : 0
% 0.21/0.80 % NegExts : 0
% 0.21/0.80 % Equation resolutions : 0
% 0.21/0.80 % Disequality decompositions : 0
% 0.21/0.80 % Total rewrite steps : 215
% 0.21/0.80 % ...of those cached : 197
% 0.21/0.80 % Propositional unsat checks : 0
% 0.21/0.80 % Propositional check models : 0
% 0.21/0.80 % Propositional check unsatisfiable : 0
% 0.21/0.80 % Propositional clauses : 0
% 0.21/0.80 % Propositional clauses after purity: 0
% 0.21/0.80 % Propositional unsat core size : 0
% 0.21/0.80 % Propositional preprocessing time : 0.000
% 0.21/0.80 % Propositional encoding time : 0.000
% 0.21/0.80 % Propositional solver time : 0.000
% 0.21/0.80 % Success case prop preproc time : 0.000
% 0.21/0.80 % Success case prop encoding time : 0.000
% 0.21/0.80 % Success case prop solver time : 0.000
% 0.21/0.80 % Current number of processed clauses : 182
% 0.21/0.80 % Positive orientable unit clauses : 18
% 0.21/0.80 % Positive unorientable unit clauses: 0
% 0.21/0.80 % Negative unit clauses : 17
% 0.21/0.80 % Non-unit-clauses : 147
% 0.21/0.80 % Current number of unprocessed clauses: 200
% 0.21/0.80 % ...number of literals in the above : 643
% 0.21/0.80 % Current number of archived formulas : 0
% 0.21/0.80 % Current number of archived clauses : 25
% 0.21/0.80 % Clause-clause subsumption calls (NU) : 6294
% 0.21/0.80 % Rec. Clause-clause subsumption calls : 5277
% 0.21/0.80 % Non-unit clause-clause subsumptions : 83
% 0.21/0.80 % Unit Clause-clause subsumption calls : 137
% 0.21/0.80 % Rewrite failures with RHS unbound : 0
% 0.21/0.80 % BW rewrite match attempts : 6
% 0.21/0.80 % BW rewrite match successes : 6
% 0.21/0.80 % Condensation attempts : 0
% 0.21/0.80 % Condensation successes : 0
% 0.21/0.80 % Termbank termtop insertions : 10223
% 0.21/0.80 % Search garbage collected termcells : 1142
% 0.21/0.80
% 0.21/0.80 % -------------------------------------------------
% 0.21/0.80 % User time : 0.033 s
% 0.21/0.80 % System time : 0.007 s
% 0.21/0.80 % Total time : 0.040 s
% 0.21/0.80 % Maximum resident set size: 3736 pages
% 0.21/0.80
% 0.21/0.80 % -------------------------------------------------
% 0.21/0.80 % User time : 0.037 s
% 0.21/0.80 % System time : 0.014 s
% 0.21/0.80 % Total time : 0.051 s
% 0.21/0.80 % Maximum resident set size: 4608 pages
% 0.21/0.80 % E exiting
%------------------------------------------------------------------------------