%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : PRO011+2 : 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 : 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:42 PM UTC 2026
% Result : Theorem 0.13s 0.42s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 9 unt; 0 def)
% Number of atoms : 153 ( 5 equ)
% Maximal formula atoms : 49 ( 5 avg)
% Number of connectives : 181 ( 56 ~; 63 |; 52 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 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)
& subactivity_occurrence(X104,X100)
& occurrence_of(X104,tptp1) ) )
& ( occurrence_of(X102,tptp1)
=> ~ ? [X103] :
( min_precedes(X101,X103,tptp0)
& subactivity_occurrence(X103,X100)
& occurrence_of(X103,tptp2) ) )
& leaf_occ(X102,X100) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_22,axiom,
! [X65,X66,X67] :
( ( occurrence_of(X65,X67)
& occurrence_of(X65,X66) )
=> X66 = X67 ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',sos_15) ).
fof(sos_34,axiom,
~ atomic(tptp0),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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)
& subactivity_occurrence(X104,X100)
& occurrence_of(X104,tptp1) ) )
& ( occurrence_of(X102,tptp1)
=> ~ ? [X103] :
( min_precedes(X101,X103,tptp0)
& subactivity_occurrence(X103,X100)
& occurrence_of(X103,tptp2) ) )
& leaf_occ(X102,X100) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_7,plain,
! [X125,X126,X127] :
( X126 = X127
| ~ occurrence_of(X125,X127)
| ~ occurrence_of(X125,X126) ),
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)
| subactivity_occurrence(esk3_2(X106,X107),esk1_0) )
& ( ~ 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)
| subactivity_occurrence(esk2_2(X106,X107),esk1_0)
| min_precedes(X106,esk3_2(X106,X107),tptp0) )
& ( ~ leaf_occ(X107,esk1_0)
| subactivity_occurrence(esk2_2(X106,X107),esk1_0)
| subactivity_occurrence(esk3_2(X106,X107),esk1_0) )
& ( ~ leaf_occ(X107,esk1_0)
| subactivity_occurrence(esk2_2(X106,X107),esk1_0)
| occurrence_of(esk3_2(X106,X107),tptp1) )
& ( ~ leaf_occ(X107,esk1_0)
| subactivity_occurrence(esk2_2(X106,X107),esk1_0)
| 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)
| subactivity_occurrence(esk3_2(X106,X107),esk1_0) )
& ( ~ 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)
| subactivity_occurrence(esk3_2(X106,X107),esk1_0) )
& ( ~ 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,
! [X178,X179,X181,X182,X183] :
( ( atocc(X181,X182)
| ~ occurrence_of(X181,X183)
| ~ atomic(X183)
| ~ subactivity(X182,X183) )
& ( ~ atocc(X178,X179)
| occurrence_of(X178,esk12_2(X178,X179)) )
& ( ~ atocc(X178,X179)
| atomic(esk12_2(X178,X179)) )
& ( ~ atocc(X178,X179)
| subactivity(X179,esk12_2(X178,X179)) ) ),
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,esk12_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(esk12_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( ~ atocc(esk1_0,X1)
| esk12_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,
! [X184,X185,X186] :
( ( ~ min_precedes(X185,X186,X184)
| atocc(X186,esk14_3(X184,X185,X186)) )
& ( ~ min_precedes(X185,X186,X184)
| atocc(X185,esk13_3(X184,X185,X186)) )
& ( ~ min_precedes(X185,X186,X184)
| subactivity(esk14_3(X184,X185,X186),X184) )
& ( ~ min_precedes(X185,X186,X184)
| subactivity(esk13_3(X184,X185,X186),X184) ) ),
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,esk13_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.02 % Problem : PRO011+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n014.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 03:42:35 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 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.13/0.42 % Version: 3.5.1
% 0.13/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % Starting sh5l with 300s (1) cores
% 0.13/0.42 % new_bool_1 with pid 3054489 completed with status 0
% 0.13/0.42 % Result found by new_bool_1
% 0.13/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.42 % SubtermCWHack with pid 3054492 completed with status 0
% 0.13/0.42 % Result found by SubtermCWHack
% 0.13/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.42 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.13/0.42 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.42 % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.42 % Preprocessing time : 0.001 s
% 0.13/0.42
% 0.13/0.42 % Proof found!
% 0.13/0.42 % SZS status Theorem
% 0.13/0.42 % SZS output start CNFRefutation
% See solution above
% 0.13/0.42 % Parsed axioms : 46
% 0.13/0.42 % Removed by relevancy pruning/SinE : 10
% 0.13/0.42 % Initial clauses : 79
% 0.13/0.42 % Removed in clause preprocessing : 0
% 0.13/0.42 % Initial clauses in saturation : 79
% 0.13/0.42 % Processed clauses : 336
% 0.13/0.42 % ...of these trivial : 1
% 0.13/0.42 % ...subsumed : 123
% 0.13/0.42 % ...remaining for further processing : 212
% 0.13/0.42 % Other redundant clauses eliminated : 0
% 0.13/0.42 % Clauses deleted for lack of memory : 0
% 0.13/0.42 % Backward-subsumed : 44
% 0.13/0.42 % Backward-rewritten : 46
% 0.13/0.42 % Generated clauses : 649
% 0.13/0.42 % ...of the previous two non-redundant : 454
% 0.13/0.42 % ...aggressively subsumed : 0
% 0.13/0.42 % Contextual simplify-reflections : 5
% 0.13/0.42 % Paramodulations : 647
% 0.13/0.42 % Factorizations : 2
% 0.13/0.42 % NegExts : 0
% 0.13/0.42 % Equation resolutions : 0
% 0.13/0.42 % Disequality decompositions : 0
% 0.13/0.42 % Total rewrite steps : 308
% 0.13/0.42 % ...of those cached : 276
% 0.13/0.42 % Propositional unsat checks : 0
% 0.13/0.42 % Propositional check models : 0
% 0.13/0.42 % Propositional check unsatisfiable : 0
% 0.13/0.42 % Propositional clauses : 0
% 0.13/0.42 % Propositional clauses after purity: 0
% 0.13/0.42 % Propositional unsat core size : 0
% 0.13/0.42 % Propositional preprocessing time : 0.000
% 0.13/0.42 % Propositional encoding time : 0.000
% 0.13/0.42 % Propositional solver time : 0.000
% 0.13/0.42 % Success case prop preproc time : 0.000
% 0.13/0.42 % Success case prop encoding time : 0.000
% 0.13/0.42 % Success case prop solver time : 0.000
% 0.13/0.42 % Current number of processed clauses : 122
% 0.13/0.42 % Positive orientable unit clauses : 20
% 0.13/0.42 % Positive unorientable unit clauses: 0
% 0.13/0.42 % Negative unit clauses : 17
% 0.13/0.42 % Non-unit-clauses : 85
% 0.13/0.42 % Current number of unprocessed clauses: 181
% 0.13/0.42 % ...number of literals in the above : 568
% 0.13/0.42 % Current number of archived formulas : 0
% 0.13/0.42 % Current number of archived clauses : 90
% 0.13/0.42 % Clause-clause subsumption calls (NU) : 8742
% 0.13/0.42 % Rec. Clause-clause subsumption calls : 7695
% 0.13/0.42 % Non-unit clause-clause subsumptions : 109
% 0.13/0.42 % Unit Clause-clause subsumption calls : 439
% 0.13/0.42 % Rewrite failures with RHS unbound : 0
% 0.13/0.42 % BW rewrite match attempts : 20
% 0.13/0.42 % BW rewrite match successes : 20
% 0.13/0.42 % Condensation attempts : 0
% 0.13/0.42 % Condensation successes : 0
% 0.13/0.42 % Termbank termtop insertions : 10696
% 0.13/0.42 % Search garbage collected termcells : 1115
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.015 s
% 0.13/0.42 % System time : 0.003 s
% 0.13/0.42 % Total time : 0.018 s
% 0.13/0.42 % Maximum resident set size: 3684 pages
% 0.13/0.42
% 0.13/0.42 % -------------------------------------------------
% 0.13/0.42 % User time : 0.016 s
% 0.13/0.42 % System time : 0.008 s
% 0.13/0.42 % Total time : 0.024 s
% 0.13/0.42 % Maximum resident set size: 4608 pages
% 0.13/0.42 % E exiting
%------------------------------------------------------------------------------