%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO010+3 : 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 : n010.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.03s 15.68s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 43 ( 12 unt; 0 def)
% Number of atoms : 151 ( 10 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 162 ( 54 ~; 60 |; 35 &)
% ( 1 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 69 ( 12 sgn 28 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X166] :
( occurrence_of(X166,tptp0)
=> ? [X167,X168] :
( ( occurrence_of(X168,tptp2)
=> ~ ? [X170] :
( min_precedes(X167,X170,tptp0)
& occurrence_of(X170,tptp1) ) )
& ( occurrence_of(X168,tptp1)
=> ~ ? [X169] :
( min_precedes(X167,X169,tptp0)
& occurrence_of(X169,tptp2) ) )
& leaf_occ(X168,X166) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_46,axiom,
! [X149,X150,X151] :
( min_precedes(X149,X150,X151)
=> arboreal(X149) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_46) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X7)
& occurrence_of(X5,X6) )
=> X6 = X7 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).
fof(sos_01,axiom,
! [X3] :
( activity_occurrence(X3)
=> ? [X4] :
( occurrence_of(X3,X4)
& activity(X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_01) ).
fof(sos,axiom,
! [X1,X2] :
( occurrence_of(X2,X1)
=> ( activity_occurrence(X2)
& activity(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos) ).
fof(sos_49,axiom,
! [X162] :
( occurrence_of(X162,tptp0)
=> ? [X163,X164,X165] :
( leaf_occ(X165,X162)
& next_subocc(X164,X165,tptp0)
& ( occurrence_of(X165,tptp2)
| occurrence_of(X165,tptp1) )
& next_subocc(X163,X164,tptp0)
& occurrence_of(X164,tptp4)
& root_occ(X163,X162)
& occurrence_of(X163,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_49) ).
fof(sos_61,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_61) ).
fof(sos_51,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_51) ).
fof(sos_07,axiom,
! [X17,X18] :
( occurrence_of(X17,X18)
=> ( arboreal(X17)
<=> atomic(X18) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
fof(c_0_9,negated_conjecture,
~ ! [X166] :
( occurrence_of(X166,tptp0)
=> ? [X167,X168] :
( ( occurrence_of(X168,tptp2)
=> ~ ? [X170] :
( min_precedes(X167,X170,tptp0)
& occurrence_of(X170,tptp1) ) )
& ( occurrence_of(X168,tptp1)
=> ~ ? [X169] :
( min_precedes(X167,X169,tptp0)
& occurrence_of(X169,tptp2) ) )
& leaf_occ(X168,X166) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_10,plain,
! [X279,X280,X281] :
( arboreal(X279)
| ~ min_precedes(X279,X280,X281) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_46])])]) ).
fof(c_0_11,negated_conjecture,
! [X172,X173] :
( ( ~ leaf_occ(X173,esk1_0)
| min_precedes(X172,esk2_2(X172,X173),tptp0)
| min_precedes(X172,esk3_2(X172,X173),tptp0) )
& ( ~ leaf_occ(X173,esk1_0)
| min_precedes(X172,esk2_2(X172,X173),tptp0)
| occurrence_of(esk3_2(X172,X173),tptp1) )
& ( ~ leaf_occ(X173,esk1_0)
| min_precedes(X172,esk2_2(X172,X173),tptp0)
| occurrence_of(X173,tptp2) )
& ( ~ leaf_occ(X173,esk1_0)
| occurrence_of(esk2_2(X172,X173),tptp2)
| min_precedes(X172,esk3_2(X172,X173),tptp0) )
& ( ~ leaf_occ(X173,esk1_0)
| occurrence_of(esk2_2(X172,X173),tptp2)
| occurrence_of(esk3_2(X172,X173),tptp1) )
& ( ~ leaf_occ(X173,esk1_0)
| occurrence_of(esk2_2(X172,X173),tptp2)
| occurrence_of(X173,tptp2) )
& ( ~ leaf_occ(X173,esk1_0)
| occurrence_of(X173,tptp1)
| min_precedes(X172,esk3_2(X172,X173),tptp0) )
& ( ~ leaf_occ(X173,esk1_0)
| occurrence_of(X173,tptp1)
| occurrence_of(esk3_2(X172,X173),tptp1) )
& ( ~ leaf_occ(X173,esk1_0)
| occurrence_of(X173,tptp1)
| occurrence_of(X173,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_9])])])])])]) ).
fof(c_0_12,plain,
! [X188,X189,X190] :
( X189 = X190
| ~ occurrence_of(X188,X190)
| ~ occurrence_of(X188,X189) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])]) ).
fof(c_0_13,plain,
! [X260] :
( ( ~ activity_occurrence(X260)
| occurrence_of(X260,esk10_1(X260)) )
& ( ~ activity_occurrence(X260)
| activity(esk10_1(X260)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_01])])])])]) ).
fof(c_0_14,plain,
! [X258,X259] :
( ( ~ occurrence_of(X259,X258)
| activity_occurrence(X259) )
& ( ~ occurrence_of(X259,X258)
| activity(X258) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])])]) ).
cnf(c_0_15,plain,
( ~ min_precedes(X1,X2,X3)
| arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ leaf_occ(X2,esk1_0)
| occurrence_of(X2,tptp1)
| min_precedes(X1,esk3_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X184] :
( ( ~ occurrence_of(X184,tptp0)
| leaf_occ(esk7_1(X184),X184) )
& ( ~ occurrence_of(X184,tptp0)
| next_subocc(esk6_1(X184),esk7_1(X184),tptp0) )
& ( ~ occurrence_of(X184,tptp0)
| occurrence_of(esk7_1(X184),tptp2)
| occurrence_of(esk7_1(X184),tptp1) )
& ( ~ occurrence_of(X184,tptp0)
| next_subocc(esk5_1(X184),esk6_1(X184),tptp0) )
& ( ~ occurrence_of(X184,tptp0)
| occurrence_of(esk6_1(X184),tptp4) )
& ( ~ occurrence_of(X184,tptp0)
| root_occ(esk5_1(X184),X184) )
& ( ~ occurrence_of(X184,tptp0)
| occurrence_of(esk5_1(X184),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_49])])])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ leaf_occ(X1,esk1_0)
| min_precedes(X2,esk2_2(X2,X1),tptp0)
| occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( ~ activity_occurrence(X1)
| occurrence_of(X1,esk10_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
( ~ occurrence_of(X1,X2)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
( ~ leaf_occ(X2,esk1_0)
| occurrence_of(X2,tptp1)
| arboreal(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( ~ occurrence_of(X1,tptp0)
| leaf_occ(esk7_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
occurrence_of(esk1_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_25,negated_conjecture,
( ~ leaf_occ(X2,esk1_0)
| occurrence_of(X2,tptp2)
| arboreal(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
fof(c_0_26,plain,
tptp1 != tptp2,
inference(fof_simplification,[status(thm)],[sos_61]) ).
fof(c_0_27,plain,
~ atomic(tptp0),
inference(fof_simplification,[status(thm)],[sos_51]) ).
cnf(c_0_28,plain,
( ~ occurrence_of(X2,X1)
| X1 = esk10_1(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( occurrence_of(esk7_1(esk1_0),tptp1)
| arboreal(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_30,negated_conjecture,
( occurrence_of(esk7_1(esk1_0),tptp2)
| arboreal(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_24])]) ).
fof(c_0_31,plain,
tptp1 != tptp2,
inference(fof_nnf,[status(thm)],[c_0_26]) ).
fof(c_0_32,plain,
! [X272,X273] :
( ( ~ occurrence_of(X272,X273)
| arboreal(X272)
| ~ atomic(X273) )
& ( ~ occurrence_of(X272,X273)
| atomic(X273)
| ~ arboreal(X272) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])])]) ).
fof(c_0_33,plain,
~ atomic(tptp0),
inference(fof_nnf,[status(thm)],[c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( arboreal(X1)
| esk10_1(esk7_1(esk1_0)) = tptp1 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,negated_conjecture,
( arboreal(X1)
| esk10_1(esk7_1(esk1_0)) = tptp2 ),
inference(spm,[status(thm)],[c_0_28,c_0_30]) ).
cnf(c_0_36,plain,
tptp1 != tptp2,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
( ~ occurrence_of(X1,X2)
| ~ arboreal(X1)
| atomic(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
~ atomic(tptp0),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( arboreal(X2)
| arboreal(X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_40,negated_conjecture,
~ arboreal(esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_24]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
arboreal(X1),
inference(ef,[status(thm)],[c_0_39]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PRO010+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/15.60 % Computer : n010.cluster.edu
% 0.03/15.60 % Model : x86_64 x86_64
% 0.03/15.60 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/15.60 % Memory : 8046.5625MB
% 0.03/15.60 % OS : Linux 6.8.0-71-generic
% 0.03/15.60 % CPULimit : 300
% 0.03/15.60 % WCLimit : 300
% 0.03/15.60 % DateTime : Mon Sep 21 03:42:42 UTC 2026
% 0.03/15.60 % CPUTime :
% 0.03/15.60 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/15.64 Running first-order theorem proving
% 0.03/15.64 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.03/15.68 % Version: 3.5.1
% 0.03/15.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.03/15.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/15.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.03/15.68 % Starting new_bool_3 with 300s (1) cores
% 0.03/15.68 % Starting new_bool_1 with 300s (1) cores
% 0.03/15.68 % Starting sh5l with 300s (1) cores
% 0.03/15.68 % new_bool_3 with pid 4148659 completed with status 0
% 0.03/15.68 % Result found by new_bool_3
% 0.03/15.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.03/15.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/15.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.03/15.68 % Starting new_bool_3 with 300s (1) cores
% 0.03/15.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/15.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/15.68 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.03/15.68 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.03/15.68 % Starting SubtermCWHack with 28s (1) cores
% 0.03/15.68 % SubtermCWHack with pid 4148662 completed with status 0
% 0.03/15.68 % Result found by SubtermCWHack
% 0.03/15.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.03/15.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/15.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.03/15.68 % Starting new_bool_3 with 300s (1) cores
% 0.03/15.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/15.68 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/15.68 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.03/15.68 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.03/15.68 % Starting SubtermCWHack with 28s (1) cores
% 0.03/15.68 % Preprocessing time : 0.002 s
% 0.03/15.68
% 0.03/15.68 % Proof found!
% 0.03/15.68 % SZS status Theorem
% 0.03/15.68 % SZS output start CNFRefutation
% See solution above
% 0.03/15.68 % Parsed axioms : 63
% 0.03/15.68 % Removed by relevancy pruning/SinE : 9
% 0.03/15.68 % Initial clauses : 95
% 0.03/15.68 % Removed in clause preprocessing : 0
% 0.03/15.68 % Initial clauses in saturation : 95
% 0.03/15.68 % Processed clauses : 281
% 0.03/15.68 % ...of these trivial : 0
% 0.03/15.68 % ...subsumed : 81
% 0.03/15.68 % ...remaining for further processing : 200
% 0.03/15.68 % Other redundant clauses eliminated : 0
% 0.03/15.68 % Clauses deleted for lack of memory : 0
% 0.03/15.68 % Backward-subsumed : 15
% 0.03/15.68 % Backward-rewritten : 36
% 0.03/15.68 % Generated clauses : 520
% 0.03/15.68 % ...of the previous two non-redundant : 372
% 0.03/15.68 % ...aggressively subsumed : 0
% 0.03/15.68 % Contextual simplify-reflections : 6
% 0.03/15.68 % Paramodulations : 516
% 0.03/15.68 % Factorizations : 4
% 0.03/15.68 % NegExts : 0
% 0.03/15.68 % Equation resolutions : 0
% 0.03/15.68 % Disequality decompositions : 0
% 0.03/15.68 % Total rewrite steps : 230
% 0.03/15.68 % ...of those cached : 203
% 0.03/15.68 % Propositional unsat checks : 0
% 0.03/15.68 % Propositional check models : 0
% 0.03/15.68 % Propositional check unsatisfiable : 0
% 0.03/15.68 % Propositional clauses : 0
% 0.03/15.68 % Propositional clauses after purity: 0
% 0.03/15.68 % Propositional unsat core size : 0
% 0.03/15.68 % Propositional preprocessing time : 0.000
% 0.03/15.68 % Propositional encoding time : 0.000
% 0.03/15.68 % Propositional solver time : 0.000
% 0.03/15.68 % Success case prop preproc time : 0.000
% 0.03/15.68 % Success case prop encoding time : 0.000
% 0.03/15.68 % Success case prop solver time : 0.000
% 0.03/15.68 % Current number of processed clauses : 149
% 0.03/15.68 % Positive orientable unit clauses : 19
% 0.03/15.68 % Positive unorientable unit clauses: 0
% 0.03/15.68 % Negative unit clauses : 14
% 0.03/15.68 % Non-unit-clauses : 116
% 0.03/15.68 % Current number of unprocessed clauses: 181
% 0.03/15.68 % ...number of literals in the above : 588
% 0.03/15.68 % Current number of archived formulas : 0
% 0.03/15.68 % Current number of archived clauses : 51
% 0.03/15.68 % Clause-clause subsumption calls (NU) : 5342
% 0.03/15.68 % Rec. Clause-clause subsumption calls : 4768
% 0.03/15.68 % Non-unit clause-clause subsumptions : 68
% 0.03/15.68 % Unit Clause-clause subsumption calls : 266
% 0.03/15.68 % Rewrite failures with RHS unbound : 0
% 0.03/15.68 % BW rewrite match attempts : 15
% 0.03/15.68 % BW rewrite match successes : 15
% 0.03/15.68 % Condensation attempts : 0
% 0.03/15.68 % Condensation successes : 0
% 0.03/15.68 % Termbank termtop insertions : 11834
% 0.03/15.68 % Search garbage collected termcells : 1700
% 0.03/15.68
% 0.03/15.68 % -------------------------------------------------
% 0.03/15.68 % User time : 0.018 s
% 0.03/15.68 % System time : 0.004 s
% 0.03/15.68 % Total time : 0.023 s
% 0.03/15.68 % Maximum resident set size: 4068 pages
% 0.03/15.68
% 0.03/15.68 % -------------------------------------------------
% 0.03/15.68 % User time : 0.023 s
% 0.03/15.68 % System time : 0.007 s
% 0.03/15.68 % Total time : 0.030 s
% 0.03/15.68 % Maximum resident set size: 4864 pages
% 0.03/15.68 % E exiting
%------------------------------------------------------------------------------