%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO018+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 : n017.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:36 PM UTC 2026
% Result : Theorem 0.64s 0.69s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 77 ( 28 unt; 0 def)
% Number of atoms : 431 ( 25 equ)
% Maximal formula atoms : 130 ( 5 avg)
% Number of connectives : 568 ( 214 ~; 239 |; 94 &)
% ( 2 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-3 aty)
% Number of variables : 130 ( 2 sgn 56 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X102,X103] :
( ( ~ leaf_occ(X102,X103)
& arboreal(X102)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,tptp0) )
=> ? [X104,X105] :
( ( occurrence_of(X105,tptp2)
=> ~ ? [X107] :
( min_precedes(X104,X107,tptp0)
& occurrence_of(X107,tptp1) ) )
& ( occurrence_of(X105,tptp1)
=> ~ ? [X106] :
( min_precedes(X104,X106,tptp0)
& occurrence_of(X106,tptp2) ) )
& leaf_occ(X105,X103)
& min_precedes(X104,X105,tptp0)
& ( occurrence_of(X105,tptp2)
| occurrence_of(X105,tptp1) )
& next_subocc(X102,X104,tptp0)
& occurrence_of(X104,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_32,axiom,
! [X96,X97] :
( ( ~ leaf_occ(X96,X97)
& arboreal(X96)
& subactivity_occurrence(X96,X97)
& occurrence_of(X97,tptp0) )
=> ? [X98,X99,X100] :
( ! [X101] :
( min_precedes(X98,X101,tptp0)
=> ( X101 = X100
| X101 = X99 ) )
& min_precedes(X99,X100,tptp0)
& ( occurrence_of(X100,tptp2)
| occurrence_of(X100,tptp1) )
& min_precedes(X98,X99,tptp0)
& occurrence_of(X99,tptp4)
& next_subocc(X96,X98,tptp0)
& occurrence_of(X98,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(sos_04,axiom,
! [X16,X17,X18] :
( next_subocc(X16,X17,X18)
<=> ( ~ ? [X19] :
( min_precedes(X19,X17,X18)
& min_precedes(X16,X19,X18) )
& min_precedes(X16,X17,X18) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(sos_24,axiom,
! [X71,X72,X73] :
( min_precedes(X72,X73,X71)
=> ? [X74] :
( subactivity_occurrence(X73,X74)
& subactivity_occurrence(X72,X74)
& occurrence_of(X74,X71) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_24) ).
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_13,axiom,
! [X41,X42] :
( occurrence_of(X41,X42)
=> ( arboreal(X41)
<=> atomic(X42) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_13) ).
fof(sos_38,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_38) ).
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_18,axiom,
! [X53] :
( activity_occurrence(X53)
=> ? [X54] :
( occurrence_of(X53,X54)
& activity(X54) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_18) ).
fof(sos_29,axiom,
! [X90,X91] :
( occurrence_of(X91,X90)
=> ( activity_occurrence(X91)
& activity(X90) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_29) ).
fof(sos_39,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_39) ).
fof(c_0_11,negated_conjecture,
~ ! [X102,X103] :
( ( ~ leaf_occ(X102,X103)
& arboreal(X102)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,tptp0) )
=> ? [X104,X105] :
( ( occurrence_of(X105,tptp2)
=> ~ ? [X107] :
( min_precedes(X104,X107,tptp0)
& occurrence_of(X107,tptp1) ) )
& ( occurrence_of(X105,tptp1)
=> ~ ? [X106] :
( min_precedes(X104,X106,tptp0)
& occurrence_of(X106,tptp2) ) )
& leaf_occ(X105,X103)
& min_precedes(X104,X105,tptp0)
& ( occurrence_of(X105,tptp2)
| occurrence_of(X105,tptp1) )
& next_subocc(X102,X104,tptp0)
& occurrence_of(X104,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_12,plain,
! [X96,X97] :
( ( ~ leaf_occ(X96,X97)
& arboreal(X96)
& subactivity_occurrence(X96,X97)
& occurrence_of(X97,tptp0) )
=> ? [X98,X99,X100] :
( ! [X101] :
( min_precedes(X98,X101,tptp0)
=> ( X101 = X100
| X101 = X99 ) )
& min_precedes(X99,X100,tptp0)
& ( occurrence_of(X100,tptp2)
| occurrence_of(X100,tptp1) )
& min_precedes(X98,X99,tptp0)
& occurrence_of(X99,tptp4)
& next_subocc(X96,X98,tptp0)
& occurrence_of(X98,tptp3) ) ),
inference(fof_simplification,[status(thm)],[sos_32]) ).
fof(c_0_13,negated_conjecture,
~ ! [X102,X103] :
( ( ~ leaf_occ(X102,X103)
& arboreal(X102)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,tptp0) )
=> ? [X104,X105] :
( ( occurrence_of(X105,tptp2)
=> ~ ? [X107] :
( min_precedes(X104,X107,tptp0)
& occurrence_of(X107,tptp1) ) )
& ( occurrence_of(X105,tptp1)
=> ~ ? [X106] :
( min_precedes(X104,X106,tptp0)
& occurrence_of(X106,tptp2) ) )
& leaf_occ(X105,X103)
& min_precedes(X104,X105,tptp0)
& ( occurrence_of(X105,tptp2)
| occurrence_of(X105,tptp1) )
& next_subocc(X102,X104,tptp0)
& occurrence_of(X104,tptp3) ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X220,X221,X225] :
( ( leaf_occ(X220,X221)
| ~ arboreal(X220)
| ~ subactivity_occurrence(X220,X221)
| ~ occurrence_of(X221,tptp0)
| X225 = esk17_1(X220)
| X225 = esk16_1(X220)
| ~ min_precedes(esk15_1(X220),X225,tptp0) )
& ( leaf_occ(X220,X221)
| ~ arboreal(X220)
| ~ subactivity_occurrence(X220,X221)
| ~ occurrence_of(X221,tptp0)
| min_precedes(esk16_1(X220),esk17_1(X220),tptp0) )
& ( leaf_occ(X220,X221)
| ~ arboreal(X220)
| ~ subactivity_occurrence(X220,X221)
| ~ occurrence_of(X221,tptp0)
| occurrence_of(esk17_1(X220),tptp2)
| occurrence_of(esk17_1(X220),tptp1) )
& ( leaf_occ(X220,X221)
| ~ arboreal(X220)
| ~ subactivity_occurrence(X220,X221)
| ~ occurrence_of(X221,tptp0)
| min_precedes(esk15_1(X220),esk16_1(X220),tptp0) )
& ( leaf_occ(X220,X221)
| ~ arboreal(X220)
| ~ subactivity_occurrence(X220,X221)
| ~ occurrence_of(X221,tptp0)
| occurrence_of(esk16_1(X220),tptp4) )
& ( leaf_occ(X220,X221)
| ~ arboreal(X220)
| ~ subactivity_occurrence(X220,X221)
| ~ occurrence_of(X221,tptp0)
| next_subocc(X220,esk15_1(X220),tptp0) )
& ( leaf_occ(X220,X221)
| ~ arboreal(X220)
| ~ subactivity_occurrence(X220,X221)
| ~ occurrence_of(X221,tptp0)
| occurrence_of(esk15_1(X220),tptp3) ) ),
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)],[c_0_12])])])])])])]) ).
fof(c_0_15,negated_conjecture,
! [X228,X229] :
( ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp2)
| min_precedes(X228,esk20_2(X228,X229),tptp0)
| min_precedes(X228,esk21_2(X228,X229),tptp0) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp2)
| min_precedes(X228,esk20_2(X228,X229),tptp0)
| occurrence_of(esk21_2(X228,X229),tptp1) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp2)
| min_precedes(X228,esk20_2(X228,X229),tptp0)
| occurrence_of(X229,tptp2) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp2)
| occurrence_of(esk20_2(X228,X229),tptp2)
| min_precedes(X228,esk21_2(X228,X229),tptp0) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp2)
| occurrence_of(esk20_2(X228,X229),tptp2)
| occurrence_of(esk21_2(X228,X229),tptp1) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp2)
| occurrence_of(esk20_2(X228,X229),tptp2)
| occurrence_of(X229,tptp2) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp2)
| occurrence_of(X229,tptp1)
| min_precedes(X228,esk21_2(X228,X229),tptp0) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp2)
| occurrence_of(X229,tptp1)
| occurrence_of(esk21_2(X228,X229),tptp1) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp2)
| occurrence_of(X229,tptp1)
| occurrence_of(X229,tptp2) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp1)
| min_precedes(X228,esk20_2(X228,X229),tptp0)
| min_precedes(X228,esk21_2(X228,X229),tptp0) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp1)
| min_precedes(X228,esk20_2(X228,X229),tptp0)
| occurrence_of(esk21_2(X228,X229),tptp1) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp1)
| min_precedes(X228,esk20_2(X228,X229),tptp0)
| occurrence_of(X229,tptp2) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp1)
| occurrence_of(esk20_2(X228,X229),tptp2)
| min_precedes(X228,esk21_2(X228,X229),tptp0) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp1)
| occurrence_of(esk20_2(X228,X229),tptp2)
| occurrence_of(esk21_2(X228,X229),tptp1) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp1)
| occurrence_of(esk20_2(X228,X229),tptp2)
| occurrence_of(X229,tptp2) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp1)
| occurrence_of(X229,tptp1)
| min_precedes(X228,esk21_2(X228,X229),tptp0) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp1)
| occurrence_of(X229,tptp1)
| occurrence_of(esk21_2(X228,X229),tptp1) )
& ( ~ leaf_occ(X229,esk19_0)
| ~ min_precedes(X228,X229,tptp0)
| ~ next_subocc(esk18_0,X228,tptp0)
| ~ occurrence_of(X228,tptp3)
| ~ occurrence_of(X229,tptp1)
| occurrence_of(X229,tptp1)
| occurrence_of(X229,tptp2) )
& ~ leaf_occ(esk18_0,esk19_0)
& arboreal(esk18_0)
& subactivity_occurrence(esk18_0,esk19_0)
& occurrence_of(esk19_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_13])])])])])]) ).
cnf(c_0_16,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(X1,esk15_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
occurrence_of(esk19_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X123,X124,X125,X126,X127,X128,X129] :
( ( next_subocc(X127,X128,X129)
| ~ min_precedes(X127,X128,X129)
| min_precedes(esk1_3(X127,X128,X129),X128,X129) )
& ( next_subocc(X127,X128,X129)
| ~ min_precedes(X127,X128,X129)
| min_precedes(X127,esk1_3(X127,X128,X129),X129) )
& ( ~ next_subocc(X123,X124,X125)
| ~ min_precedes(X126,X124,X125)
| ~ min_precedes(X123,X126,X125) )
& ( ~ next_subocc(X123,X124,X125)
| min_precedes(X123,X124,X125) ) ),
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_04])])])])])])]) ).
cnf(c_0_19,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| leaf_occ(X1,esk19_0)
| next_subocc(X1,esk15_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
subactivity_occurrence(esk18_0,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
arboreal(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
~ leaf_occ(esk18_0,esk19_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| min_precedes(esk15_1(X1),esk16_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_24,plain,
! [X195,X196,X197] :
( ( ~ min_precedes(X196,X197,X195)
| subactivity_occurrence(X197,esk9_3(X195,X196,X197)) )
& ( ~ min_precedes(X196,X197,X195)
| subactivity_occurrence(X196,esk9_3(X195,X196,X197)) )
& ( ~ min_precedes(X196,X197,X195)
| occurrence_of(esk9_3(X195,X196,X197),X195) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_24])])])])]) ).
cnf(c_0_25,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,negated_conjecture,
next_subocc(esk18_0,esk15_1(esk18_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_27,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk15_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_28,plain,
! [X185,X186,X187,X188] :
( ~ min_precedes(X186,X188,X187)
| ~ leaf_occ(X186,X185)
| ~ occurrence_of(X185,X187) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_21])])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| min_precedes(esk15_1(X1),esk16_1(X1),tptp0)
| leaf_occ(X1,esk19_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_17]) ).
cnf(c_0_30,plain,
( ~ min_precedes(X2,X3,X1)
| occurrence_of(esk9_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
min_precedes(esk18_0,esk15_1(esk18_0),tptp0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_32,plain,
! [X158,X159] :
( ( ~ occurrence_of(X158,X159)
| arboreal(X158)
| ~ atomic(X159) )
& ( ~ occurrence_of(X158,X159)
| atomic(X159)
| ~ arboreal(X158) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_13])])])]) ).
cnf(c_0_33,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| occurrence_of(esk15_1(X1),tptp3)
| leaf_occ(X1,esk19_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_17]) ).
cnf(c_0_34,plain,
( ~ min_precedes(X3,X4,X2)
| ~ leaf_occ(X3,X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,negated_conjecture,
min_precedes(esk15_1(esk18_0),esk16_1(esk18_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_36,negated_conjecture,
occurrence_of(esk9_3(tptp0,esk18_0,esk15_1(esk18_0)),tptp0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,plain,
( ~ min_precedes(X3,X1,X2)
| subactivity_occurrence(X1,esk9_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_38,plain,
( ~ occurrence_of(X2,X1)
| ~ atomic(X1)
| arboreal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,negated_conjecture,
occurrence_of(esk15_1(esk18_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_40,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_38]) ).
cnf(c_0_41,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(esk15_1(esk18_0),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0)))
| leaf_occ(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0)))
| next_subocc(X1,esk15_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_16,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
subactivity_occurrence(esk15_1(esk18_0),esk9_3(tptp0,esk18_0,esk15_1(esk18_0))),
inference(spm,[status(thm)],[c_0_37,c_0_31]) ).
cnf(c_0_44,negated_conjecture,
arboreal(esk15_1(esk18_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_45,negated_conjecture,
~ leaf_occ(esk15_1(esk18_0),esk9_3(tptp0,esk18_0,esk15_1(esk18_0))),
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_46,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X3)
| ~ occurrence_of(X3,tptp0)
| ~ min_precedes(esk15_1(X1),X2,tptp0)
| leaf_occ(X1,X3)
| X2 = esk17_1(X1)
| X2 = esk16_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_47,plain,
! [X189,X190,X191] :
( X190 = X191
| ~ occurrence_of(X189,X191)
| ~ occurrence_of(X189,X190) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_22])])]) ).
fof(c_0_48,plain,
! [X177] :
( ( ~ activity_occurrence(X177)
| occurrence_of(X177,esk7_1(X177)) )
& ( ~ activity_occurrence(X177)
| activity(esk7_1(X177)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_18])])])])]) ).
fof(c_0_49,plain,
! [X214,X215] :
( ( ~ occurrence_of(X215,X214)
| activity_occurrence(X215) )
& ( ~ occurrence_of(X215,X214)
| activity(X214) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])])])]) ).
cnf(c_0_50,plain,
( ~ next_subocc(X1,X4,X3)
| ~ min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_51,negated_conjecture,
next_subocc(esk15_1(esk18_0),esk15_1(esk15_1(esk18_0)),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),c_0_45]) ).
cnf(c_0_52,negated_conjecture,
( ~ min_precedes(esk15_1(X2),X1,tptp0)
| ~ arboreal(X2)
| ~ subactivity_occurrence(X2,esk19_0)
| leaf_occ(X2,esk19_0)
| X1 = esk16_1(X2)
| X1 = esk17_1(X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_17]) ).
cnf(c_0_53,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| min_precedes(esk16_1(X1),esk17_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_54,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk16_1(X1),tptp4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_55,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_56,plain,
( ~ activity_occurrence(X1)
| occurrence_of(X1,esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_57,plain,
( ~ occurrence_of(X1,X2)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_58,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0)))
| occurrence_of(esk15_1(X1),tptp3)
| leaf_occ(X1,esk9_3(tptp0,esk18_0,esk15_1(esk18_0))) ),
inference(spm,[status(thm)],[c_0_27,c_0_36]) ).
cnf(c_0_59,negated_conjecture,
( ~ min_precedes(esk15_1(esk18_0),X1,tptp0)
| ~ min_precedes(X1,esk15_1(esk15_1(esk18_0)),tptp0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_60,negated_conjecture,
( ~ min_precedes(esk15_1(esk18_0),X1,tptp0)
| X1 = esk17_1(esk18_0)
| X1 = esk16_1(esk18_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_61,negated_conjecture,
min_precedes(esk15_1(esk18_0),esk15_1(esk15_1(esk18_0)),tptp0),
inference(spm,[status(thm)],[c_0_25,c_0_51]) ).
cnf(c_0_62,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
| leaf_occ(X1,esk19_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_17]) ).
cnf(c_0_63,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk19_0)
| occurrence_of(esk16_1(X1),tptp4)
| leaf_occ(X1,esk19_0) ),
inference(spm,[status(thm)],[c_0_54,c_0_17]) ).
fof(c_0_64,plain,
tptp4 != tptp3,
inference(fof_simplification,[status(thm)],[sos_39]) ).
cnf(c_0_65,plain,
( ~ occurrence_of(X2,X1)
| X1 = esk7_1(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_66,negated_conjecture,
occurrence_of(esk15_1(esk15_1(esk18_0)),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_43]),c_0_44])]),c_0_45]) ).
cnf(c_0_67,negated_conjecture,
~ min_precedes(esk16_1(esk18_0),esk15_1(esk15_1(esk18_0)),tptp0),
inference(spm,[status(thm)],[c_0_59,c_0_35]) ).
cnf(c_0_68,negated_conjecture,
( esk15_1(esk15_1(esk18_0)) = esk16_1(esk18_0)
| esk15_1(esk15_1(esk18_0)) = esk17_1(esk18_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_69,negated_conjecture,
min_precedes(esk16_1(esk18_0),esk17_1(esk18_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_70,negated_conjecture,
occurrence_of(esk16_1(esk18_0),tptp4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_20]),c_0_21])]),c_0_22]) ).
fof(c_0_71,plain,
tptp4 != tptp3,
inference(fof_nnf,[status(thm)],[c_0_64]) ).
cnf(c_0_72,negated_conjecture,
esk7_1(esk15_1(esk15_1(esk18_0))) = tptp3,
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_73,negated_conjecture,
esk15_1(esk15_1(esk18_0)) = esk16_1(esk18_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69])]) ).
cnf(c_0_74,negated_conjecture,
esk7_1(esk16_1(esk18_0)) = tptp4,
inference(spm,[status(thm)],[c_0_65,c_0_70]) ).
cnf(c_0_75,plain,
tptp4 != tptp3,
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_73]),c_0_74]),c_0_75]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO018+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n017.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 03:38:57 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.64/0.69 % Version: 3.5.1
% 0.64/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.64/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.64/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.64/0.69 % Starting new_bool_1 with 300s (1) cores
% 0.64/0.69 % Starting sh5l with 300s (1) cores
% 0.64/0.69 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1344155 completed with status 0
% 0.64/0.69 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.64/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.64/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.64/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.64/0.69 % No SInE strategy applied
% 0.64/0.69 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.64/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.64/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.64/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.64/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.64/0.69 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.64/0.69 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.64/0.69 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1344163 completed with status 0
% 0.64/0.69 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.64/0.69 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.64/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.64/0.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.64/0.69 % No SInE strategy applied
% 0.64/0.69 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.64/0.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.64/0.69 % Starting SubtermCWHack with 136s (1) cores
% 0.64/0.69 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.64/0.69 % Preprocessing time : 0.004 s
% 0.64/0.69 % Presaturation interreduction done
% 0.64/0.69
% 0.64/0.69 % Proof found!
% 0.64/0.69 % SZS status Theorem
% 0.64/0.69 % SZS output start CNFRefutation
% See solution above
% 0.64/0.69 % Parsed axioms : 46
% 0.64/0.69 % Removed by relevancy pruning/SinE : 0
% 0.64/0.69 % Initial clauses : 104
% 0.64/0.69 % Removed in clause preprocessing : 6
% 0.64/0.69 % Initial clauses in saturation : 98
% 0.64/0.69 % Processed clauses : 844
% 0.64/0.69 % ...of these trivial : 19
% 0.64/0.69 % ...subsumed : 130
% 0.64/0.69 % ...remaining for further processing : 695
% 0.64/0.69 % Other redundant clauses eliminated : 0
% 0.64/0.69 % Clauses deleted for lack of memory : 0
% 0.64/0.69 % Backward-subsumed : 3
% 0.64/0.69 % Backward-rewritten : 64
% 0.64/0.69 % Generated clauses : 1621
% 0.64/0.69 % ...of the previous two non-redundant : 1296
% 0.64/0.69 % ...aggressively subsumed : 0
% 0.64/0.69 % Contextual simplify-reflections : 5
% 0.64/0.69 % Paramodulations : 1620
% 0.64/0.69 % Factorizations : 1
% 0.64/0.69 % NegExts : 0
% 0.64/0.69 % Equation resolutions : 0
% 0.64/0.69 % Disequality decompositions : 0
% 0.64/0.69 % Total rewrite steps : 934
% 0.64/0.69 % ...of those cached : 819
% 0.64/0.69 % Propositional unsat checks : 0
% 0.64/0.69 % Propositional check models : 0
% 0.64/0.69 % Propositional check unsatisfiable : 0
% 0.64/0.69 % Propositional clauses : 0
% 0.64/0.69 % Propositional clauses after purity: 0
% 0.64/0.69 % Propositional unsat core size : 0
% 0.64/0.69 % Propositional preprocessing time : 0.000
% 0.64/0.69 % Propositional encoding time : 0.000
% 0.64/0.69 % Propositional solver time : 0.000
% 0.64/0.69 % Success case prop preproc time : 0.000
% 0.64/0.69 % Success case prop encoding time : 0.000
% 0.64/0.69 % Success case prop solver time : 0.000
% 0.64/0.69 % Current number of processed clauses : 530
% 0.64/0.69 % Positive orientable unit clauses : 158
% 0.64/0.69 % Positive unorientable unit clauses: 0
% 0.64/0.69 % Negative unit clauses : 114
% 0.64/0.69 % Non-unit-clauses : 258
% 0.64/0.69 % Current number of unprocessed clauses: 600
% 0.64/0.69 % ...number of literals in the above : 1416
% 0.64/0.69 % Current number of archived formulas : 0
% 0.64/0.69 % Current number of archived clauses : 165
% 0.64/0.69 % Clause-clause subsumption calls (NU) : 22073
% 0.64/0.69 % Rec. Clause-clause subsumption calls : 8252
% 0.64/0.69 % Non-unit clause-clause subsumptions : 66
% 0.64/0.69 % Unit Clause-clause subsumption calls : 3652
% 0.64/0.69 % Rewrite failures with RHS unbound : 0
% 0.64/0.69 % BW rewrite match attempts : 77
% 0.64/0.69 % BW rewrite match successes : 14
% 0.64/0.69 % Condensation attempts : 0
% 0.64/0.69 % Condensation successes : 0
% 0.64/0.69 % Termbank termtop insertions : 35161
% 0.64/0.69 % Search garbage collected termcells : 1473
% 0.64/0.69
% 0.64/0.69 % -------------------------------------------------
% 0.64/0.69 % User time : 0.108 s
% 0.64/0.69 % System time : 0.013 s
% 0.64/0.69 % Total time : 0.121 s
% 0.64/0.69 % Maximum resident set size: 3996 pages
% 0.64/0.69
% 0.64/0.69 % -------------------------------------------------
% 0.64/0.69 % User time : 0.538 s
% 0.64/0.69 % System time : 0.045 s
% 0.64/0.69 % Total time : 0.583 s
% 0.64/0.69 % Maximum resident set size: 4608 pages
% 0.64/0.69 % E exiting
%------------------------------------------------------------------------------