%------------------------------------------------------------------------------
% File : E---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 : n016.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.11s 5.43s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 8 unt; 0 def)
% Number of atoms : 147 ( 8 equ)
% Maximal formula atoms : 49 ( 5 avg)
% Number of connectives : 177 ( 59 ~; 67 |; 42 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 56 ( 7 sgn 19 !; 12 ?)
% 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_21,axiom,
! [X61,X62,X63] :
( ( leaf_occ(X62,X61)
& occurrence_of(X61,X63) )
=> ~ ? [X64] : min_precedes(X62,X64,X63) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
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(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_44,axiom,
tptp1 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_44) ).
fof(c_0_5,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_6,plain,
! [X182,X183,X184,X185] :
( ~ min_precedes(X183,X185,X184)
| ~ leaf_occ(X183,X182)
| ~ occurrence_of(X182,X184) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_21])])])]) ).
fof(c_0_7,negated_conjecture,
! [X222,X223] :
( ( ~ leaf_occ(X223,esk18_0)
| min_precedes(X222,esk19_2(X222,X223),tptp0)
| min_precedes(X222,esk20_2(X222,X223),tptp0) )
& ( ~ leaf_occ(X223,esk18_0)
| min_precedes(X222,esk19_2(X222,X223),tptp0)
| subactivity_occurrence(esk20_2(X222,X223),esk18_0) )
& ( ~ leaf_occ(X223,esk18_0)
| min_precedes(X222,esk19_2(X222,X223),tptp0)
| occurrence_of(esk20_2(X222,X223),tptp1) )
& ( ~ leaf_occ(X223,esk18_0)
| min_precedes(X222,esk19_2(X222,X223),tptp0)
| occurrence_of(X223,tptp2) )
& ( ~ leaf_occ(X223,esk18_0)
| subactivity_occurrence(esk19_2(X222,X223),esk18_0)
| min_precedes(X222,esk20_2(X222,X223),tptp0) )
& ( ~ leaf_occ(X223,esk18_0)
| subactivity_occurrence(esk19_2(X222,X223),esk18_0)
| subactivity_occurrence(esk20_2(X222,X223),esk18_0) )
& ( ~ leaf_occ(X223,esk18_0)
| subactivity_occurrence(esk19_2(X222,X223),esk18_0)
| occurrence_of(esk20_2(X222,X223),tptp1) )
& ( ~ leaf_occ(X223,esk18_0)
| subactivity_occurrence(esk19_2(X222,X223),esk18_0)
| occurrence_of(X223,tptp2) )
& ( ~ leaf_occ(X223,esk18_0)
| occurrence_of(esk19_2(X222,X223),tptp2)
| min_precedes(X222,esk20_2(X222,X223),tptp0) )
& ( ~ leaf_occ(X223,esk18_0)
| occurrence_of(esk19_2(X222,X223),tptp2)
| subactivity_occurrence(esk20_2(X222,X223),esk18_0) )
& ( ~ leaf_occ(X223,esk18_0)
| occurrence_of(esk19_2(X222,X223),tptp2)
| occurrence_of(esk20_2(X222,X223),tptp1) )
& ( ~ leaf_occ(X223,esk18_0)
| occurrence_of(esk19_2(X222,X223),tptp2)
| occurrence_of(X223,tptp2) )
& ( ~ leaf_occ(X223,esk18_0)
| occurrence_of(X223,tptp1)
| min_precedes(X222,esk20_2(X222,X223),tptp0) )
& ( ~ leaf_occ(X223,esk18_0)
| occurrence_of(X223,tptp1)
| subactivity_occurrence(esk20_2(X222,X223),esk18_0) )
& ( ~ leaf_occ(X223,esk18_0)
| occurrence_of(X223,tptp1)
| occurrence_of(esk20_2(X222,X223),tptp1) )
& ( ~ leaf_occ(X223,esk18_0)
| occurrence_of(X223,tptp1)
| 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_5])])])])])]) ).
cnf(c_0_8,plain,
( ~ min_precedes(X3,X4,X2)
| ~ leaf_occ(X3,X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( ~ leaf_occ(X2,esk18_0)
| occurrence_of(X2,tptp1)
| min_precedes(X1,esk20_2(X1,X2),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X217] :
( ( ~ occurrence_of(X217,tptp0)
| leaf_occ(esk17_1(X217),X217) )
& ( ~ occurrence_of(X217,tptp0)
| next_subocc(esk16_1(X217),esk17_1(X217),tptp0) )
& ( ~ occurrence_of(X217,tptp0)
| occurrence_of(esk17_1(X217),tptp2)
| occurrence_of(esk17_1(X217),tptp1) )
& ( ~ occurrence_of(X217,tptp0)
| next_subocc(esk15_1(X217),esk16_1(X217),tptp0) )
& ( ~ occurrence_of(X217,tptp0)
| occurrence_of(esk16_1(X217),tptp4) )
& ( ~ occurrence_of(X217,tptp0)
| root_occ(esk15_1(X217),X217) )
& ( ~ occurrence_of(X217,tptp0)
| occurrence_of(esk15_1(X217),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_11,negated_conjecture,
( ~ occurrence_of(X3,tptp0)
| ~ leaf_occ(X2,X3)
| ~ leaf_occ(X1,esk18_0)
| occurrence_of(X1,tptp1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( ~ occurrence_of(X1,tptp0)
| leaf_occ(esk17_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
occurrence_of(esk18_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( ~ leaf_occ(X1,esk18_0)
| min_precedes(X2,esk19_2(X2,X1),tptp0)
| occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
( ~ occurrence_of(X2,tptp0)
| ~ leaf_occ(X1,X2)
| occurrence_of(esk17_1(esk18_0),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_16,negated_conjecture,
( ~ occurrence_of(X3,tptp0)
| ~ leaf_occ(X2,X3)
| ~ leaf_occ(X1,esk18_0)
| occurrence_of(X1,tptp2) ),
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
fof(c_0_17,plain,
! [X186,X187,X188] :
( X187 = X188
| ~ occurrence_of(X186,X188)
| ~ occurrence_of(X186,X187) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_22])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk17_1(esk18_0),tptp1) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( ~ occurrence_of(X2,tptp0)
| ~ leaf_occ(X1,X2)
| occurrence_of(esk17_1(esk18_0),tptp2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_12]),c_0_13])]) ).
fof(c_0_20,plain,
tptp1 != tptp2,
inference(fof_simplification,[status(thm)],[sos_44]) ).
cnf(c_0_21,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
occurrence_of(esk17_1(esk18_0),tptp1),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk17_1(esk18_0),tptp2) ),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
fof(c_0_24,plain,
tptp1 != tptp2,
inference(fof_nnf,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ occurrence_of(esk17_1(esk18_0),X1)
| X1 = tptp1 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
occurrence_of(esk17_1(esk18_0),tptp2),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
cnf(c_0_27,plain,
tptp1 != tptp2,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),
[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.07/5.35 % Computer : n016.cluster.edu
% 0.07/5.35 % Model : x86_64 x86_64
% 0.07/5.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/5.35 % Memory : 8046.5625MB
% 0.07/5.35 % OS : Linux 6.8.0-71-generic
% 0.07/5.35 % CPULimit : 300
% 0.07/5.35 % WCLimit : 300
% 0.07/5.35 % DateTime : Mon Sep 21 03:47:28 UTC 2026
% 0.07/5.35 % CPUTime :
% 0.07/5.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/5.40 Running first-order theorem proving
% 0.07/5.40 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.11/5.43 % Version: 3.5.1
% 0.11/5.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/5.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/5.43 % Starting new_bool_3 with 300s (1) cores
% 0.11/5.43 % Starting new_bool_1 with 300s (1) cores
% 0.11/5.43 % Starting sh5l with 300s (1) cores
% 0.11/5.43 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1475915 completed with status 0
% 0.11/5.43 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.11/5.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/5.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/5.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/5.43 % No SInE strategy applied
% 0.11/5.43 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.11/5.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/5.43 % Starting SubtermCWHack with 136s (1) cores
% 0.11/5.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.11/5.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.11/5.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.11/5.43 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.11/5.43 % G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 1475923 completed with status 0
% 0.11/5.43 % Result found by G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.11/5.43 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/5.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/5.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/5.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/5.43 % No SInE strategy applied
% 0.11/5.43 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.11/5.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/5.43 % Starting SubtermCWHack with 136s (1) cores
% 0.11/5.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.11/5.43 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.11/5.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.11/5.43 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.11/5.43 % Preprocessing time : 0.001 s
% 0.11/5.43 % Presaturation interreduction done
% 0.11/5.43
% 0.11/5.43 % Proof found!
% 0.11/5.43 % SZS status Theorem
% 0.11/5.43 % SZS output start CNFRefutation
% See solution above
% 0.11/5.43 % Parsed axioms : 46
% 0.11/5.43 % Removed by relevancy pruning/SinE : 0
% 0.11/5.43 % Initial clauses : 99
% 0.11/5.43 % Removed in clause preprocessing : 0
% 0.11/5.43 % Initial clauses in saturation : 99
% 0.11/5.43 % Processed clauses : 229
% 0.11/5.43 % ...of these trivial : 1
% 0.11/5.43 % ...subsumed : 4
% 0.11/5.43 % ...remaining for further processing : 224
% 0.11/5.43 % Other redundant clauses eliminated : 0
% 0.11/5.43 % Clauses deleted for lack of memory : 0
% 0.11/5.43 % Backward-subsumed : 2
% 0.11/5.43 % Backward-rewritten : 4
% 0.11/5.43 % Generated clauses : 257
% 0.11/5.43 % ...of the previous two non-redundant : 232
% 0.11/5.43 % ...aggressively subsumed : 0
% 0.11/5.43 % Contextual simplify-reflections : 0
% 0.11/5.43 % Paramodulations : 257
% 0.11/5.43 % Factorizations : 0
% 0.11/5.43 % NegExts : 0
% 0.11/5.43 % Equation resolutions : 0
% 0.11/5.43 % Disequality decompositions : 0
% 0.11/5.43 % Total rewrite steps : 40
% 0.11/5.43 % ...of those cached : 26
% 0.11/5.43 % Propositional unsat checks : 0
% 0.11/5.43 % Propositional check models : 0
% 0.11/5.43 % Propositional check unsatisfiable : 0
% 0.11/5.43 % Propositional clauses : 0
% 0.11/5.43 % Propositional clauses after purity: 0
% 0.11/5.43 % Propositional unsat core size : 0
% 0.11/5.43 % Propositional preprocessing time : 0.000
% 0.11/5.43 % Propositional encoding time : 0.000
% 0.11/5.43 % Propositional solver time : 0.000
% 0.11/5.43 % Success case prop preproc time : 0.000
% 0.11/5.43 % Success case prop encoding time : 0.000
% 0.11/5.43 % Success case prop solver time : 0.000
% 0.11/5.43 % Current number of processed clauses : 119
% 0.11/5.43 % Positive orientable unit clauses : 16
% 0.11/5.43 % Positive unorientable unit clauses: 0
% 0.11/5.43 % Negative unit clauses : 8
% 0.11/5.43 % Non-unit-clauses : 95
% 0.11/5.43 % Current number of unprocessed clauses: 192
% 0.11/5.43 % ...number of literals in the above : 661
% 0.11/5.43 % Current number of archived formulas : 0
% 0.11/5.43 % Current number of archived clauses : 105
% 0.11/5.43 % Clause-clause subsumption calls (NU) : 5236
% 0.11/5.43 % Rec. Clause-clause subsumption calls : 4336
% 0.11/5.43 % Non-unit clause-clause subsumptions : 5
% 0.11/5.43 % Unit Clause-clause subsumption calls : 154
% 0.11/5.43 % Rewrite failures with RHS unbound : 0
% 0.11/5.43 % BW rewrite match attempts : 4
% 0.11/5.43 % BW rewrite match successes : 4
% 0.11/5.43 % Condensation attempts : 0
% 0.11/5.43 % Condensation successes : 0
% 0.11/5.43 % Termbank termtop insertions : 9417
% 0.11/5.43 % Search garbage collected termcells : 1350
% 0.11/5.43
% 0.11/5.43 % -------------------------------------------------
% 0.11/5.43 % User time : 0.013 s
% 0.11/5.43 % System time : 0.001 s
% 0.11/5.43 % Total time : 0.014 s
% 0.11/5.43 % Maximum resident set size: 3992 pages
% 0.11/5.43
% 0.11/5.43 % -------------------------------------------------
% 0.11/5.43 % User time : 0.050 s
% 0.11/5.43 % System time : 0.017 s
% 0.11/5.43 % Total time : 0.066 s
% 0.11/5.43 % Maximum resident set size: 4864 pages
% 0.11/5.43 % E exiting
%------------------------------------------------------------------------------