%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO017+1 : 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 : n008.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:35 PM UTC 2026
% Result : Theorem 88.08s 13.57s
% Output : CNFRefutation 88.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 14
% Syntax : Number of formulae : 98 ( 35 unt; 0 def)
% Number of atoms : 352 ( 38 equ)
% Maximal formula atoms : 38 ( 3 avg)
% Number of connectives : 393 ( 139 ~; 164 |; 74 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 7 con; 0-3 aty)
% Number of variables : 133 ( 2 sgn 64 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X112,X113] :
( ( ~ leaf_occ(X112,X113)
& arboreal(X112)
& subactivity_occurrence(X112,X113)
& occurrence_of(X113,tptp0) )
=> ? [X114,X115] :
( leaf(X115,tptp0)
& min_precedes(X114,X115,tptp0)
& ( occurrence_of(X115,tptp1)
| occurrence_of(X115,tptp2) )
& next_subocc(X112,X114,tptp0)
& occurrence_of(X114,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_35,axiom,
! [X106,X107] :
( ( ~ leaf_occ(X106,X107)
& arboreal(X106)
& subactivity_occurrence(X106,X107)
& occurrence_of(X107,tptp0) )
=> ? [X108,X109,X110] :
( ! [X111] :
( min_precedes(X108,X111,tptp0)
=> ( X111 = X110
| X111 = X109 ) )
& min_precedes(X109,X110,tptp0)
& ( occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& min_precedes(X108,X109,tptp0)
& occurrence_of(X109,tptp4)
& next_subocc(X106,X108,tptp0)
& occurrence_of(X108,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_35) ).
fof(sos_22,axiom,
! [X61,X62,X63] :
( next_subocc(X61,X62,X63)
<=> ( ~ ? [X64] :
( min_precedes(X64,X62,X63)
& min_precedes(X61,X64,X63) )
& min_precedes(X61,X62,X63) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_22) ).
fof(sos_25,axiom,
! [X70,X71,X72] :
( min_precedes(X71,X72,X70)
=> ? [X73] :
( subactivity_occurrence(X72,X73)
& subactivity_occurrence(X71,X73)
& occurrence_of(X73,X70) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_25) ).
fof(sos_07,axiom,
! [X17,X18] :
( occurrence_of(X17,X18)
=> ( arboreal(X17)
<=> atomic(X18) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
fof(sos_41,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_41) ).
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_34,axiom,
! [X103,X104] :
( leaf_occ(X103,X104)
<=> ? [X105] :
( leaf(X103,X105)
& subactivity_occurrence(X103,X104)
& occurrence_of(X104,X105) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_34) ).
fof(sos_21,axiom,
! [X57,X58] :
( leaf(X57,X58)
<=> ( ~ ? [X60] : min_precedes(X57,X60,X58)
& ( ? [X59] : min_precedes(X59,X57,X58)
| root(X57,X58) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_21) ).
fof(sos_42,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_42) ).
fof(sos_46,axiom,
tptp3 != tptp1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_46) ).
fof(sos_45,axiom,
tptp3 != tptp2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_45) ).
fof(c_0_14,negated_conjecture,
~ ! [X112,X113] :
( ( ~ leaf_occ(X112,X113)
& arboreal(X112)
& subactivity_occurrence(X112,X113)
& occurrence_of(X113,tptp0) )
=> ? [X114,X115] :
( leaf(X115,tptp0)
& min_precedes(X114,X115,tptp0)
& ( occurrence_of(X115,tptp1)
| occurrence_of(X115,tptp2) )
& next_subocc(X112,X114,tptp0)
& occurrence_of(X114,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_15,plain,
! [X106,X107] :
( ( ~ leaf_occ(X106,X107)
& arboreal(X106)
& subactivity_occurrence(X106,X107)
& occurrence_of(X107,tptp0) )
=> ? [X108,X109,X110] :
( ! [X111] :
( min_precedes(X108,X111,tptp0)
=> ( X111 = X110
| X111 = X109 ) )
& min_precedes(X109,X110,tptp0)
& ( occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& min_precedes(X108,X109,tptp0)
& occurrence_of(X109,tptp4)
& next_subocc(X106,X108,tptp0)
& occurrence_of(X108,tptp3) ) ),
inference(fof_simplification,[status(thm)],[sos_35]) ).
fof(c_0_16,negated_conjecture,
~ ! [X112,X113] :
( ( ~ leaf_occ(X112,X113)
& arboreal(X112)
& subactivity_occurrence(X112,X113)
& occurrence_of(X113,tptp0) )
=> ? [X114,X115] :
( leaf(X115,tptp0)
& min_precedes(X114,X115,tptp0)
& ( occurrence_of(X115,tptp1)
| occurrence_of(X115,tptp2) )
& next_subocc(X112,X114,tptp0)
& occurrence_of(X114,tptp3) ) ),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X238,X239,X243] :
( ( leaf_occ(X238,X239)
| ~ arboreal(X238)
| ~ subactivity_occurrence(X238,X239)
| ~ occurrence_of(X239,tptp0)
| X243 = esk18_1(X238)
| X243 = esk17_1(X238)
| ~ min_precedes(esk16_1(X238),X243,tptp0) )
& ( leaf_occ(X238,X239)
| ~ arboreal(X238)
| ~ subactivity_occurrence(X238,X239)
| ~ occurrence_of(X239,tptp0)
| min_precedes(esk17_1(X238),esk18_1(X238),tptp0) )
& ( leaf_occ(X238,X239)
| ~ arboreal(X238)
| ~ subactivity_occurrence(X238,X239)
| ~ occurrence_of(X239,tptp0)
| occurrence_of(esk18_1(X238),tptp1)
| occurrence_of(esk18_1(X238),tptp2) )
& ( leaf_occ(X238,X239)
| ~ arboreal(X238)
| ~ subactivity_occurrence(X238,X239)
| ~ occurrence_of(X239,tptp0)
| min_precedes(esk16_1(X238),esk17_1(X238),tptp0) )
& ( leaf_occ(X238,X239)
| ~ arboreal(X238)
| ~ subactivity_occurrence(X238,X239)
| ~ occurrence_of(X239,tptp0)
| occurrence_of(esk17_1(X238),tptp4) )
& ( leaf_occ(X238,X239)
| ~ arboreal(X238)
| ~ subactivity_occurrence(X238,X239)
| ~ occurrence_of(X239,tptp0)
| next_subocc(X238,esk16_1(X238),tptp0) )
& ( leaf_occ(X238,X239)
| ~ arboreal(X238)
| ~ subactivity_occurrence(X238,X239)
| ~ occurrence_of(X239,tptp0)
| occurrence_of(esk16_1(X238),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_15])])])])])])]) ).
fof(c_0_18,negated_conjecture,
! [X246,X247] :
( ( ~ leaf(X247,tptp0)
| ~ min_precedes(X246,X247,tptp0)
| ~ next_subocc(esk19_0,X246,tptp0)
| ~ occurrence_of(X246,tptp3)
| ~ occurrence_of(X247,tptp1) )
& ( ~ leaf(X247,tptp0)
| ~ min_precedes(X246,X247,tptp0)
| ~ next_subocc(esk19_0,X246,tptp0)
| ~ occurrence_of(X246,tptp3)
| ~ occurrence_of(X247,tptp2) )
& ~ leaf_occ(esk19_0,esk20_0)
& arboreal(esk19_0)
& subactivity_occurrence(esk19_0,esk20_0)
& occurrence_of(esk20_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_16])])])])])]) ).
cnf(c_0_19,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| next_subocc(X1,esk16_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_20,negated_conjecture,
occurrence_of(esk20_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X180,X181,X182,X183,X184,X185,X186] :
( ( next_subocc(X184,X185,X186)
| ~ min_precedes(X184,X185,X186)
| min_precedes(esk8_3(X184,X185,X186),X185,X186) )
& ( next_subocc(X184,X185,X186)
| ~ min_precedes(X184,X185,X186)
| min_precedes(X184,esk8_3(X184,X185,X186),X186) )
& ( ~ next_subocc(X180,X181,X182)
| ~ min_precedes(X183,X181,X182)
| ~ min_precedes(X180,X183,X182) )
& ( ~ next_subocc(X180,X181,X182)
| min_precedes(X180,X181,X182) ) ),
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_22])])])])])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk20_0)
| next_subocc(X1,esk16_1(X1),tptp0)
| leaf_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
subactivity_occurrence(esk19_0,esk20_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
arboreal(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
~ leaf_occ(esk19_0,esk20_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_26,plain,
! [X196,X197,X198] :
( ( ~ min_precedes(X197,X198,X196)
| subactivity_occurrence(X198,esk10_3(X196,X197,X198)) )
& ( ~ min_precedes(X197,X198,X196)
| subactivity_occurrence(X197,esk10_3(X196,X197,X198)) )
& ( ~ min_precedes(X197,X198,X196)
| occurrence_of(esk10_3(X196,X197,X198),X196) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_25])])])])]) ).
cnf(c_0_27,plain,
( ~ next_subocc(X1,X2,X3)
| min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,negated_conjecture,
next_subocc(esk19_0,esk16_1(esk19_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_29,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk16_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,plain,
( ~ min_precedes(X2,X3,X1)
| occurrence_of(esk10_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
min_precedes(esk19_0,esk16_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_32,plain,
! [X132,X133] :
( ( ~ occurrence_of(X132,X133)
| arboreal(X132)
| ~ atomic(X133) )
& ( ~ occurrence_of(X132,X133)
| atomic(X133)
| ~ arboreal(X132) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])])]) ).
cnf(c_0_33,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk20_0)
| occurrence_of(esk16_1(X1),tptp3)
| leaf_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_20]) ).
cnf(c_0_34,negated_conjecture,
occurrence_of(esk10_3(tptp0,esk19_0,esk16_1(esk19_0)),tptp0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( ~ min_precedes(X3,X1,X2)
| subactivity_occurrence(X1,esk10_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
( ~ occurrence_of(X2,X1)
| ~ atomic(X1)
| arboreal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,negated_conjecture,
occurrence_of(esk16_1(esk19_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_38,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_41]) ).
cnf(c_0_39,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
| next_subocc(X1,esk16_1(X1),tptp0)
| leaf_occ(X1,esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) ),
inference(spm,[status(thm)],[c_0_19,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
subactivity_occurrence(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))),
inference(spm,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_41,negated_conjecture,
arboreal(esk16_1(esk19_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
fof(c_0_42,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_02])])]) ).
fof(c_0_43,plain,
! [X118] :
( ( ~ activity_occurrence(X118)
| occurrence_of(X118,esk1_1(X118)) )
& ( ~ activity_occurrence(X118)
| activity(esk1_1(X118)) ) ),
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_44,plain,
! [X116,X117] :
( ( ~ occurrence_of(X117,X116)
| activity_occurrence(X117) )
& ( ~ occurrence_of(X117,X116)
| activity(X116) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])])]) ).
fof(c_0_45,plain,
! [X232,X233,X235,X236,X237] :
( ( leaf_occ(X235,X236)
| ~ leaf(X235,X237)
| ~ subactivity_occurrence(X235,X236)
| ~ occurrence_of(X236,X237) )
& ( ~ leaf_occ(X232,X233)
| leaf(X232,esk15_2(X232,X233)) )
& ( ~ leaf_occ(X232,X233)
| subactivity_occurrence(X232,X233) )
& ( ~ leaf_occ(X232,X233)
| occurrence_of(X233,esk15_2(X232,X233)) ) ),
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_34])])])])])])]) ).
cnf(c_0_46,negated_conjecture,
( next_subocc(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0)
| leaf_occ(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_47,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
( ~ activity_occurrence(X1)
| occurrence_of(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,plain,
( ~ occurrence_of(X1,X2)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,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_17]) ).
cnf(c_0_51,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
| occurrence_of(esk16_1(X1),tptp3)
| leaf_occ(X1,esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) ),
inference(spm,[status(thm)],[c_0_29,c_0_34]) ).
cnf(c_0_52,plain,
( ~ leaf_occ(X2,X1)
| occurrence_of(X1,esk15_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_53,negated_conjecture,
( min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0)
| leaf_occ(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) ),
inference(spm,[status(thm)],[c_0_27,c_0_46]) ).
cnf(c_0_54,plain,
( ~ occurrence_of(X2,X1)
| X1 = esk1_1(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
fof(c_0_55,plain,
! [X172,X173,X175,X176,X177,X178] :
( ( leaf(X176,X177)
| min_precedes(X176,esk7_2(X176,X177),X177)
| ~ min_precedes(X178,X176,X177) )
& ( leaf(X176,X177)
| min_precedes(X176,esk7_2(X176,X177),X177)
| ~ root(X176,X177) )
& ( ~ leaf(X172,X173)
| ~ min_precedes(X172,X175,X173) )
& ( ~ leaf(X172,X173)
| min_precedes(esk6_2(X172,X173),X172,X173)
| root(X172,X173) ) ),
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_21])])])])])])]) ).
cnf(c_0_56,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk20_0)
| min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
| leaf_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_50,c_0_20]) ).
cnf(c_0_57,negated_conjecture,
( occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3)
| leaf_occ(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_40]),c_0_41])]) ).
cnf(c_0_58,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X3)
| ~ occurrence_of(X3,tptp0)
| ~ min_precedes(esk16_1(X1),X2,tptp0)
| leaf_occ(X1,X3)
| X2 = esk18_1(X1)
| X2 = esk17_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_59,plain,
( ~ leaf_occ(X1,X2)
| leaf(X1,esk15_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_60,negated_conjecture,
( occurrence_of(esk10_3(tptp0,esk19_0,esk16_1(esk19_0)),esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))))
| min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_61,negated_conjecture,
esk1_1(esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) = tptp0,
inference(spm,[status(thm)],[c_0_54,c_0_34]) ).
cnf(c_0_62,plain,
( ~ leaf(X1,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_63,negated_conjecture,
min_precedes(esk16_1(esk19_0),esk17_1(esk19_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_64,negated_conjecture,
( occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3)
| occurrence_of(esk10_3(tptp0,esk19_0,esk16_1(esk19_0)),esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))) ),
inference(spm,[status(thm)],[c_0_52,c_0_57]) ).
cnf(c_0_65,negated_conjecture,
( ~ arboreal(X2)
| ~ min_precedes(esk16_1(X2),X1,tptp0)
| ~ subactivity_occurrence(X2,esk20_0)
| leaf_occ(X2,esk20_0)
| X1 = esk17_1(X2)
| X1 = esk18_1(X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_20]) ).
cnf(c_0_66,negated_conjecture,
( min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0)
| leaf(esk16_1(esk19_0),esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))) ),
inference(spm,[status(thm)],[c_0_59,c_0_53]) ).
cnf(c_0_67,negated_conjecture,
( min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0)
| esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) = tptp0 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_60]),c_0_61]) ).
cnf(c_0_68,negated_conjecture,
~ leaf(esk16_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk17_1(X1),tptp4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_70,negated_conjecture,
( occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3)
| leaf(esk16_1(esk19_0),esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))) ),
inference(spm,[status(thm)],[c_0_59,c_0_57]) ).
cnf(c_0_71,negated_conjecture,
( occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3)
| esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) = tptp0 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_64]),c_0_61]) ).
cnf(c_0_72,negated_conjecture,
( ~ min_precedes(esk16_1(esk19_0),X1,tptp0)
| X1 = esk18_1(esk19_0)
| X1 = esk17_1(esk19_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_23]),c_0_24])]),c_0_25]) ).
cnf(c_0_73,negated_conjecture,
min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]) ).
cnf(c_0_74,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk20_0)
| occurrence_of(esk17_1(X1),tptp4)
| leaf_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_69,c_0_20]) ).
fof(c_0_75,plain,
tptp4 != tptp3,
inference(fof_simplification,[status(thm)],[sos_42]) ).
cnf(c_0_76,plain,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| leaf_occ(X1,X2)
| occurrence_of(esk18_1(X1),tptp1)
| occurrence_of(esk18_1(X1),tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_77,negated_conjecture,
occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_68]) ).
cnf(c_0_78,negated_conjecture,
( esk16_1(esk16_1(esk19_0)) = esk17_1(esk19_0)
| esk16_1(esk16_1(esk19_0)) = esk18_1(esk19_0) ),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_79,negated_conjecture,
occurrence_of(esk17_1(esk19_0),tptp4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_23]),c_0_24])]),c_0_25]) ).
fof(c_0_80,plain,
tptp4 != tptp3,
inference(fof_nnf,[status(thm)],[c_0_75]) ).
cnf(c_0_81,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk20_0)
| occurrence_of(esk18_1(X1),tptp2)
| occurrence_of(esk18_1(X1),tptp1)
| leaf_occ(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_76,c_0_20]) ).
fof(c_0_82,plain,
tptp3 != tptp1,
inference(fof_simplification,[status(thm)],[sos_46]) ).
cnf(c_0_83,negated_conjecture,
esk1_1(esk16_1(esk16_1(esk19_0))) = tptp3,
inference(spm,[status(thm)],[c_0_54,c_0_77]) ).
cnf(c_0_84,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp3)
| esk16_1(esk16_1(esk19_0)) = esk17_1(esk19_0) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_85,negated_conjecture,
esk1_1(esk17_1(esk19_0)) = tptp4,
inference(spm,[status(thm)],[c_0_54,c_0_79]) ).
cnf(c_0_86,plain,
tptp4 != tptp3,
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_87,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp1)
| occurrence_of(esk18_1(esk19_0),tptp2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_23]),c_0_24])]),c_0_25]) ).
fof(c_0_88,plain,
tptp3 != tptp1,
inference(fof_nnf,[status(thm)],[c_0_82]) ).
fof(c_0_89,plain,
tptp3 != tptp2,
inference(fof_simplification,[status(thm)],[sos_45]) ).
cnf(c_0_90,negated_conjecture,
occurrence_of(esk18_1(esk19_0),tptp3),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85]),c_0_86]) ).
cnf(c_0_91,negated_conjecture,
( ~ occurrence_of(esk18_1(esk19_0),X1)
| occurrence_of(esk18_1(esk19_0),tptp2)
| X1 = tptp1 ),
inference(spm,[status(thm)],[c_0_47,c_0_87]) ).
cnf(c_0_92,plain,
tptp3 != tptp1,
inference(split_conjunct,[status(thm)],[c_0_88]) ).
fof(c_0_93,plain,
tptp3 != tptp2,
inference(fof_nnf,[status(thm)],[c_0_89]) ).
cnf(c_0_94,negated_conjecture,
( ~ occurrence_of(esk18_1(esk19_0),X1)
| X1 = tptp3 ),
inference(spm,[status(thm)],[c_0_47,c_0_90]) ).
cnf(c_0_95,negated_conjecture,
occurrence_of(esk18_1(esk19_0),tptp2),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_90]),c_0_92]) ).
cnf(c_0_96,plain,
tptp3 != tptp2,
inference(split_conjunct,[status(thm)],[c_0_93]) ).
cnf(c_0_97,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : PRO017+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.74 % Computer : n008.cluster.edu
% 0.12/0.74 % Model : x86_64 x86_64
% 0.12/0.74 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.74 % Memory : 8046.5625MB
% 0.12/0.74 % OS : Linux 6.8.0-71-generic
% 0.12/0.75 % CPULimit : 300
% 0.12/0.75 % WCLimit : 300
% 0.12/0.75 % DateTime : Mon Sep 21 03:44:26 UTC 2026
% 0.12/0.75 % CPUTime :
% 0.12/0.75 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.79 Running first-order theorem proving
% 0.12/0.79 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
% 88.08/13.57 % Version: 3.5.1
% 88.08/13.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 88.08/13.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.08/13.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 88.08/13.57 % Starting new_bool_3 with 300s (1) cores
% 88.08/13.57 % Starting new_bool_1 with 300s (1) cores
% 88.08/13.57 % Starting sh5l with 300s (1) cores
% 88.08/13.57 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 71695 completed with status 0
% 88.08/13.57 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 88.08/13.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 88.08/13.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.08/13.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 88.08/13.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 88.08/13.57 % No SInE strategy applied
% 88.08/13.57 % Search class: FGHSF-FFMM32-SFFFFFNN
% 88.08/13.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 88.08/13.57 % Starting SubtermCWHack with 136s (1) cores
% 88.08/13.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 88.08/13.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 88.08/13.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 88.08/13.57 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 88.08/13.57 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 71701 completed with status 0
% 88.08/13.57 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 88.08/13.57 % Preprocessing class: FSLSSMSSSSSNFFN.
% 88.08/13.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.08/13.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 88.08/13.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 88.08/13.57 % No SInE strategy applied
% 88.08/13.57 % Search class: FGHSF-FFMM32-SFFFFFNN
% 88.08/13.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 88.08/13.57 % Starting SubtermCWHack with 136s (1) cores
% 88.08/13.57 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 88.08/13.57 % Preprocessing time : 0.003 s
% 88.08/13.57 % Presaturation interreduction done
% 88.08/13.57
% 88.08/13.57 % Proof found!
% 88.08/13.57 % SZS status Theorem
% 88.08/13.57 % SZS output start CNFRefutation
% See solution above
% 88.08/13.58 % Parsed axioms : 49
% 88.08/13.58 % Removed by relevancy pruning/SinE : 0
% 88.08/13.58 % Initial clauses : 91
% 88.08/13.58 % Removed in clause preprocessing : 0
% 88.08/13.58 % Initial clauses in saturation : 91
% 88.08/13.58 % Processed clauses : 26179
% 88.08/13.58 % ...of these trivial : 369
% 88.08/13.58 % ...subsumed : 16877
% 88.08/13.58 % ...remaining for further processing : 8933
% 88.08/13.58 % Other redundant clauses eliminated : 0
% 88.08/13.58 % Clauses deleted for lack of memory : 0
% 88.08/13.58 % Backward-subsumed : 323
% 88.08/13.58 % Backward-rewritten : 1058
% 88.08/13.58 % Generated clauses : 140503
% 88.08/13.58 % ...of the previous two non-redundant : 125796
% 88.08/13.58 % ...aggressively subsumed : 0
% 88.08/13.58 % Contextual simplify-reflections : 520
% 88.08/13.58 % Paramodulations : 140499
% 88.08/13.58 % Factorizations : 4
% 88.08/13.58 % NegExts : 0
% 88.08/13.58 % Equation resolutions : 0
% 88.08/13.58 % Disequality decompositions : 0
% 88.08/13.58 % Total rewrite steps : 114946
% 88.08/13.58 % ...of those cached : 114241
% 88.08/13.58 % Propositional unsat checks : 1
% 88.08/13.58 % Propositional check models : 0
% 88.08/13.58 % Propositional check unsatisfiable : 0
% 88.08/13.58 % Propositional clauses : 0
% 88.08/13.58 % Propositional clauses after purity: 0
% 88.08/13.58 % Propositional unsat core size : 0
% 88.08/13.58 % Propositional preprocessing time : 0.000
% 88.08/13.58 % Propositional encoding time : 0.044
% 88.08/13.58 % Propositional solver time : 0.119
% 88.08/13.58 % Success case prop preproc time : 0.000
% 88.08/13.58 % Success case prop encoding time : 0.000
% 88.08/13.58 % Success case prop solver time : 0.000
% 88.08/13.58 % Current number of processed clauses : 7461
% 88.08/13.58 % Positive orientable unit clauses : 933
% 88.08/13.58 % Positive unorientable unit clauses: 0
% 88.08/13.58 % Negative unit clauses : 181
% 88.08/13.58 % Non-unit-clauses : 6347
% 88.08/13.58 % Current number of unprocessed clauses: 97869
% 88.08/13.58 % ...number of literals in the above : 367330
% 88.08/13.58 % Current number of archived formulas : 0
% 88.08/13.58 % Current number of archived clauses : 1472
% 88.08/13.58 % Clause-clause subsumption calls (NU) : 3079953
% 88.08/13.58 % Rec. Clause-clause subsumption calls : 1472693
% 88.08/13.58 % Non-unit clause-clause subsumptions : 15586
% 88.08/13.58 % Unit Clause-clause subsumption calls : 138156
% 88.08/13.58 % Rewrite failures with RHS unbound : 0
% 88.08/13.58 % BW rewrite match attempts : 2967
% 88.08/13.58 % BW rewrite match successes : 166
% 88.08/13.58 % Condensation attempts : 0
% 88.08/13.58 % Condensation successes : 0
% 88.08/13.58 % Termbank termtop insertions : 5989281
% 88.08/13.58 % Search garbage collected termcells : 1441
% 88.08/13.58
% 88.08/13.58 % -------------------------------------------------
% 88.08/13.58 % User time : 12.519 s
% 88.08/13.58 % System time : 0.145 s
% 88.08/13.58 % Total time : 12.664 s
% 88.08/13.58 % Maximum resident set size: 4004 pages
% 88.08/13.58
% 88.08/13.58 % -------------------------------------------------
% 88.08/13.58 % User time : 61.752 s
% 88.08/13.58 % System time : 0.864 s
% 88.08/13.58 % Total time : 62.616 s
% 88.08/13.58 % Maximum resident set size: 4864 pages
% 88.08/13.58 % E exiting
%------------------------------------------------------------------------------