%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO010+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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.28s 0.59s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 9 unt; 0 def)
% Number of atoms : 141 ( 9 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 163 ( 58 ~; 59 |; 35 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 67 ( 8 sgn 25 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108] :
( ( occurrence_of(X108,tptp2)
=> ~ ? [X110] :
( min_precedes(X107,X110,tptp0)
& occurrence_of(X110,tptp1) ) )
& ( occurrence_of(X108,tptp1)
=> ~ ? [X109] :
( min_precedes(X107,X109,tptp0)
& occurrence_of(X109,tptp2) ) )
& leaf_occ(X108,X106) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_09,axiom,
! [X32,X33,X34] :
( ( leaf_occ(X33,X32)
& occurrence_of(X32,X34) )
=> ~ ? [X35] : min_precedes(X33,X35,X34) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).
fof(sos_32,axiom,
! [X102] :
( occurrence_of(X102,tptp0)
=> ? [X103,X104,X105] :
( leaf_occ(X105,X102)
& next_subocc(X104,X105,tptp0)
& ( occurrence_of(X105,tptp2)
| occurrence_of(X105,tptp1) )
& next_subocc(X103,X104,tptp0)
& occurrence_of(X104,tptp4)
& root_occ(X103,X102)
& occurrence_of(X103,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(sos_08,axiom,
! [X29,X30,X31] :
( ( occurrence_of(X29,X31)
& occurrence_of(X29,X30) )
=> X30 = X31 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(sos_12,axiom,
! [X42] :
( activity_occurrence(X42)
=> ? [X43] :
( occurrence_of(X42,X43)
& activity(X43) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_12) ).
fof(sos_03,axiom,
! [X13,X14] :
( occurrence_of(X14,X13)
=> ( activity_occurrence(X14)
& activity(X13) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
fof(sos_44,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_44) ).
fof(c_0_7,negated_conjecture,
~ ! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108] :
( ( occurrence_of(X108,tptp2)
=> ~ ? [X110] :
( min_precedes(X107,X110,tptp0)
& occurrence_of(X110,tptp1) ) )
& ( occurrence_of(X108,tptp1)
=> ~ ? [X109] :
( min_precedes(X107,X109,tptp0)
& occurrence_of(X109,tptp2) ) )
& leaf_occ(X108,X106) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_8,plain,
! [X123,X124,X125,X126] :
( ~ min_precedes(X124,X126,X125)
| ~ leaf_occ(X124,X123)
| ~ occurrence_of(X123,X125) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])])])]) ).
fof(c_0_9,negated_conjecture,
! [X112,X113] :
( ( ~ leaf_occ(X113,esk1_0)
| min_precedes(X112,esk2_2(X112,X113),tptp0)
| min_precedes(X112,esk3_2(X112,X113),tptp0) )
& ( ~ leaf_occ(X113,esk1_0)
| min_precedes(X112,esk2_2(X112,X113),tptp0)
| occurrence_of(esk3_2(X112,X113),tptp1) )
& ( ~ leaf_occ(X113,esk1_0)
| min_precedes(X112,esk2_2(X112,X113),tptp0)
| occurrence_of(X113,tptp2) )
& ( ~ leaf_occ(X113,esk1_0)
| occurrence_of(esk2_2(X112,X113),tptp2)
| min_precedes(X112,esk3_2(X112,X113),tptp0) )
& ( ~ leaf_occ(X113,esk1_0)
| occurrence_of(esk2_2(X112,X113),tptp2)
| occurrence_of(esk3_2(X112,X113),tptp1) )
& ( ~ leaf_occ(X113,esk1_0)
| occurrence_of(esk2_2(X112,X113),tptp2)
| occurrence_of(X113,tptp2) )
& ( ~ leaf_occ(X113,esk1_0)
| occurrence_of(X113,tptp1)
| min_precedes(X112,esk3_2(X112,X113),tptp0) )
& ( ~ leaf_occ(X113,esk1_0)
| occurrence_of(X113,tptp1)
| occurrence_of(esk3_2(X112,X113),tptp1) )
& ( ~ leaf_occ(X113,esk1_0)
| occurrence_of(X113,tptp1)
| occurrence_of(X113,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_7])])])])])]) ).
cnf(c_0_10,plain,
( ~ min_precedes(X3,X4,X2)
| ~ leaf_occ(X3,X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,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_9]) ).
fof(c_0_12,plain,
! [X116] :
( ( ~ occurrence_of(X116,tptp0)
| leaf_occ(esk6_1(X116),X116) )
& ( ~ occurrence_of(X116,tptp0)
| next_subocc(esk5_1(X116),esk6_1(X116),tptp0) )
& ( ~ occurrence_of(X116,tptp0)
| occurrence_of(esk6_1(X116),tptp2)
| occurrence_of(esk6_1(X116),tptp1) )
& ( ~ occurrence_of(X116,tptp0)
| next_subocc(esk4_1(X116),esk5_1(X116),tptp0) )
& ( ~ occurrence_of(X116,tptp0)
| occurrence_of(esk5_1(X116),tptp4) )
& ( ~ occurrence_of(X116,tptp0)
| root_occ(esk4_1(X116),X116) )
& ( ~ occurrence_of(X116,tptp0)
| occurrence_of(esk4_1(X116),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_13,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_9]) ).
cnf(c_0_14,negated_conjecture,
( ~ occurrence_of(X3,tptp0)
| ~ leaf_occ(X2,X3)
| ~ leaf_occ(X1,esk1_0)
| occurrence_of(X1,tptp1) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ occurrence_of(X1,tptp0)
| leaf_occ(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
occurrence_of(esk1_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( ~ occurrence_of(X3,tptp0)
| ~ leaf_occ(X2,X3)
| ~ leaf_occ(X1,esk1_0)
| occurrence_of(X1,tptp2) ),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
fof(c_0_18,plain,
! [X120,X121,X122] :
( X121 = X122
| ~ occurrence_of(X120,X122)
| ~ occurrence_of(X120,X121) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])])]) ).
fof(c_0_19,plain,
! [X163] :
( ( ~ activity_occurrence(X163)
| occurrence_of(X163,esk9_1(X163)) )
& ( ~ activity_occurrence(X163)
| activity(esk9_1(X163)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_12])])])])]) ).
fof(c_0_20,plain,
! [X161,X162] :
( ( ~ occurrence_of(X162,X161)
| activity_occurrence(X162) )
& ( ~ occurrence_of(X162,X161)
| activity(X161) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_03])])])]) ).
cnf(c_0_21,negated_conjecture,
( ~ occurrence_of(X2,tptp0)
| ~ leaf_occ(X1,X2)
| occurrence_of(esk6_1(esk1_0),tptp1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_22,negated_conjecture,
( ~ occurrence_of(X2,tptp0)
| ~ leaf_occ(X1,X2)
| occurrence_of(esk6_1(esk1_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_16])]) ).
cnf(c_0_23,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( ~ activity_occurrence(X1)
| occurrence_of(X1,esk9_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( ~ occurrence_of(X1,X2)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk6_1(esk1_0),tptp1) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
fof(c_0_27,plain,
tptp1 != tptp2,
inference(fof_simplification,[status(thm)],[sos_44]) ).
cnf(c_0_28,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk6_1(esk1_0),tptp2) ),
inference(spm,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_29,plain,
( ~ occurrence_of(X2,X1)
| X1 = esk9_1(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,negated_conjecture,
occurrence_of(esk6_1(esk1_0),tptp1),
inference(spm,[status(thm)],[c_0_26,c_0_16]) ).
fof(c_0_31,plain,
tptp1 != tptp2,
inference(fof_nnf,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
occurrence_of(esk6_1(esk1_0),tptp2),
inference(spm,[status(thm)],[c_0_28,c_0_16]) ).
cnf(c_0_33,negated_conjecture,
esk9_1(esk6_1(esk1_0)) = tptp1,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
tptp1 != tptp2,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_32]),c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : PRO010+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n015.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 03:45:21 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.50 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.28/0.59 % Version: 3.5.1
% 0.28/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.59 % Starting sh5l with 300s (1) cores
% 0.28/0.59 % new_bool_3 with pid 483662 completed with status 0
% 0.28/0.59 % Result found by new_bool_3
% 0.28/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.59 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.28/0.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.59 % Starting SubtermCWHack with 31s (1) cores
% 0.28/0.59 % SubtermCWHack with pid 483668 completed with status 0
% 0.28/0.59 % Result found by SubtermCWHack
% 0.28/0.59 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.59 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.59 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.59 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.59 % Search class: FGHSF-FFMM31-SFFFFFNN
% 0.28/0.59 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.59 % Starting SubtermCWHack with 31s (1) cores
% 0.28/0.59 % Preprocessing time : 0.003 s
% 0.28/0.59
% 0.28/0.59 % Proof found!
% 0.28/0.59 % SZS status Theorem
% 0.28/0.59 % SZS output start CNFRefutation
% See solution above
% 0.28/0.59 % Parsed axioms : 46
% 0.28/0.59 % Removed by relevancy pruning/SinE : 12
% 0.28/0.59 % Initial clauses : 64
% 0.28/0.59 % Removed in clause preprocessing : 0
% 0.28/0.59 % Initial clauses in saturation : 64
% 0.28/0.59 % Processed clauses : 262
% 0.28/0.59 % ...of these trivial : 2
% 0.28/0.59 % ...subsumed : 80
% 0.28/0.59 % ...remaining for further processing : 180
% 0.28/0.59 % Other redundant clauses eliminated : 0
% 0.28/0.59 % Clauses deleted for lack of memory : 0
% 0.28/0.59 % Backward-subsumed : 15
% 0.28/0.59 % Backward-rewritten : 40
% 0.28/0.59 % Generated clauses : 405
% 0.28/0.59 % ...of the previous two non-redundant : 311
% 0.28/0.59 % ...aggressively subsumed : 0
% 0.28/0.59 % Contextual simplify-reflections : 4
% 0.28/0.59 % Paramodulations : 403
% 0.28/0.59 % Factorizations : 2
% 0.28/0.59 % NegExts : 0
% 0.28/0.59 % Equation resolutions : 0
% 0.28/0.59 % Disequality decompositions : 0
% 0.28/0.59 % Total rewrite steps : 199
% 0.28/0.59 % ...of those cached : 171
% 0.28/0.59 % Propositional unsat checks : 0
% 0.28/0.59 % Propositional check models : 0
% 0.28/0.59 % Propositional check unsatisfiable : 0
% 0.28/0.59 % Propositional clauses : 0
% 0.28/0.59 % Propositional clauses after purity: 0
% 0.28/0.59 % Propositional unsat core size : 0
% 0.28/0.59 % Propositional preprocessing time : 0.000
% 0.28/0.59 % Propositional encoding time : 0.000
% 0.28/0.59 % Propositional solver time : 0.000
% 0.28/0.59 % Success case prop preproc time : 0.000
% 0.28/0.59 % Success case prop encoding time : 0.000
% 0.28/0.59 % Success case prop solver time : 0.000
% 0.28/0.59 % Current number of processed clauses : 125
% 0.28/0.59 % Positive orientable unit clauses : 18
% 0.28/0.59 % Positive unorientable unit clauses: 0
% 0.28/0.59 % Negative unit clauses : 8
% 0.28/0.59 % Non-unit-clauses : 99
% 0.28/0.59 % Current number of unprocessed clauses: 76
% 0.28/0.59 % ...number of literals in the above : 337
% 0.28/0.59 % Current number of archived formulas : 0
% 0.28/0.59 % Current number of archived clauses : 55
% 0.28/0.59 % Clause-clause subsumption calls (NU) : 2589
% 0.28/0.59 % Rec. Clause-clause subsumption calls : 2254
% 0.28/0.59 % Non-unit clause-clause subsumptions : 81
% 0.28/0.59 % Unit Clause-clause subsumption calls : 201
% 0.28/0.59 % Rewrite failures with RHS unbound : 0
% 0.28/0.59 % BW rewrite match attempts : 18
% 0.28/0.59 % BW rewrite match successes : 18
% 0.28/0.59 % Condensation attempts : 0
% 0.28/0.59 % Condensation successes : 0
% 0.28/0.59 % Termbank termtop insertions : 8951
% 0.28/0.59 % Search garbage collected termcells : 1074
% 0.28/0.59
% 0.28/0.59 % -------------------------------------------------
% 0.28/0.59 % User time : 0.033 s
% 0.28/0.59 % System time : 0.004 s
% 0.28/0.59 % Total time : 0.037 s
% 0.28/0.59 % Maximum resident set size: 3996 pages
% 0.28/0.59
% 0.28/0.59 % -------------------------------------------------
% 0.28/0.59 % User time : 0.037 s
% 0.28/0.59 % System time : 0.011 s
% 0.28/0.59 % Total time : 0.048 s
% 0.28/0.59 % Maximum resident set size: 4608 pages
% 0.28/0.59 % E exiting
%------------------------------------------------------------------------------