%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO018+3 : 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 : n011.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.25s 0.64s
% Output : CNFRefutation 0.25s
% 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,
! [X168,X169] :
( ( ~ leaf_occ(X168,X169)
& arboreal(X168)
& subactivity_occurrence(X168,X169)
& occurrence_of(X169,tptp0) )
=> ? [X170,X171] :
( ( occurrence_of(X171,tptp2)
=> ~ ? [X173] :
( min_precedes(X170,X173,tptp0)
& occurrence_of(X173,tptp1) ) )
& ( occurrence_of(X171,tptp1)
=> ~ ? [X172] :
( min_precedes(X170,X172,tptp0)
& occurrence_of(X172,tptp2) ) )
& leaf_occ(X171,X169)
& min_precedes(X170,X171,tptp0)
& ( occurrence_of(X171,tptp2)
| occurrence_of(X171,tptp1) )
& next_subocc(X168,X170,tptp0)
& occurrence_of(X170,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_49,axiom,
! [X162,X163] :
( ( ~ leaf_occ(X162,X163)
& arboreal(X162)
& subactivity_occurrence(X162,X163)
& occurrence_of(X163,tptp0) )
=> ? [X164,X165,X166] :
( ! [X167] :
( min_precedes(X164,X167,tptp0)
=> ( X167 = X166
| X167 = X165 ) )
& min_precedes(X165,X166,tptp0)
& ( occurrence_of(X166,tptp2)
| occurrence_of(X166,tptp1) )
& min_precedes(X164,X165,tptp0)
& occurrence_of(X165,tptp4)
& next_subocc(X162,X164,tptp0)
& occurrence_of(X164,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_49) ).
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_37,axiom,
! [X114,X115,X116] :
( ( leaf_occ(X115,X114)
& occurrence_of(X114,X116) )
=> ~ ? [X117] : min_precedes(X115,X117,X116) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_37) ).
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_55,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_55) ).
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_56,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_56) ).
fof(c_0_11,negated_conjecture,
~ ! [X168,X169] :
( ( ~ leaf_occ(X168,X169)
& arboreal(X168)
& subactivity_occurrence(X168,X169)
& occurrence_of(X169,tptp0) )
=> ? [X170,X171] :
( ( occurrence_of(X171,tptp2)
=> ~ ? [X173] :
( min_precedes(X170,X173,tptp0)
& occurrence_of(X173,tptp1) ) )
& ( occurrence_of(X171,tptp1)
=> ~ ? [X172] :
( min_precedes(X170,X172,tptp0)
& occurrence_of(X172,tptp2) ) )
& leaf_occ(X171,X169)
& min_precedes(X170,X171,tptp0)
& ( occurrence_of(X171,tptp2)
| occurrence_of(X171,tptp1) )
& next_subocc(X168,X170,tptp0)
& occurrence_of(X170,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_12,plain,
! [X162,X163] :
( ( ~ leaf_occ(X162,X163)
& arboreal(X162)
& subactivity_occurrence(X162,X163)
& occurrence_of(X163,tptp0) )
=> ? [X164,X165,X166] :
( ! [X167] :
( min_precedes(X164,X167,tptp0)
=> ( X167 = X166
| X167 = X165 ) )
& min_precedes(X165,X166,tptp0)
& ( occurrence_of(X166,tptp2)
| occurrence_of(X166,tptp1) )
& min_precedes(X164,X165,tptp0)
& occurrence_of(X165,tptp4)
& next_subocc(X162,X164,tptp0)
& occurrence_of(X164,tptp3) ) ),
inference(fof_simplification,[status(thm)],[sos_49]) ).
fof(c_0_13,negated_conjecture,
~ ! [X168,X169] :
( ( ~ leaf_occ(X168,X169)
& arboreal(X168)
& subactivity_occurrence(X168,X169)
& occurrence_of(X169,tptp0) )
=> ? [X170,X171] :
( ( occurrence_of(X171,tptp2)
=> ~ ? [X173] :
( min_precedes(X170,X173,tptp0)
& occurrence_of(X173,tptp1) ) )
& ( occurrence_of(X171,tptp1)
=> ~ ? [X172] :
( min_precedes(X170,X172,tptp0)
& occurrence_of(X172,tptp2) ) )
& leaf_occ(X171,X169)
& min_precedes(X170,X171,tptp0)
& ( occurrence_of(X171,tptp2)
| occurrence_of(X171,tptp1) )
& next_subocc(X168,X170,tptp0)
& occurrence_of(X170,tptp3) ) ),
inference(fof_simplification,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X352,X353,X357] :
( ( leaf_occ(X352,X353)
| ~ arboreal(X352)
| ~ subactivity_occurrence(X352,X353)
| ~ occurrence_of(X353,tptp0)
| X357 = esk19_1(X352)
| X357 = esk18_1(X352)
| ~ min_precedes(esk17_1(X352),X357,tptp0) )
& ( leaf_occ(X352,X353)
| ~ arboreal(X352)
| ~ subactivity_occurrence(X352,X353)
| ~ occurrence_of(X353,tptp0)
| min_precedes(esk18_1(X352),esk19_1(X352),tptp0) )
& ( leaf_occ(X352,X353)
| ~ arboreal(X352)
| ~ subactivity_occurrence(X352,X353)
| ~ occurrence_of(X353,tptp0)
| occurrence_of(esk19_1(X352),tptp2)
| occurrence_of(esk19_1(X352),tptp1) )
& ( leaf_occ(X352,X353)
| ~ arboreal(X352)
| ~ subactivity_occurrence(X352,X353)
| ~ occurrence_of(X353,tptp0)
| min_precedes(esk17_1(X352),esk18_1(X352),tptp0) )
& ( leaf_occ(X352,X353)
| ~ arboreal(X352)
| ~ subactivity_occurrence(X352,X353)
| ~ occurrence_of(X353,tptp0)
| occurrence_of(esk18_1(X352),tptp4) )
& ( leaf_occ(X352,X353)
| ~ arboreal(X352)
| ~ subactivity_occurrence(X352,X353)
| ~ occurrence_of(X353,tptp0)
| next_subocc(X352,esk17_1(X352),tptp0) )
& ( leaf_occ(X352,X353)
| ~ arboreal(X352)
| ~ subactivity_occurrence(X352,X353)
| ~ occurrence_of(X353,tptp0)
| occurrence_of(esk17_1(X352),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,
! [X360,X361] :
( ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp2)
| min_precedes(X360,esk22_2(X360,X361),tptp0)
| min_precedes(X360,esk23_2(X360,X361),tptp0) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp2)
| min_precedes(X360,esk22_2(X360,X361),tptp0)
| occurrence_of(esk23_2(X360,X361),tptp1) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp2)
| min_precedes(X360,esk22_2(X360,X361),tptp0)
| occurrence_of(X361,tptp2) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp2)
| occurrence_of(esk22_2(X360,X361),tptp2)
| min_precedes(X360,esk23_2(X360,X361),tptp0) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp2)
| occurrence_of(esk22_2(X360,X361),tptp2)
| occurrence_of(esk23_2(X360,X361),tptp1) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp2)
| occurrence_of(esk22_2(X360,X361),tptp2)
| occurrence_of(X361,tptp2) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp2)
| occurrence_of(X361,tptp1)
| min_precedes(X360,esk23_2(X360,X361),tptp0) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp2)
| occurrence_of(X361,tptp1)
| occurrence_of(esk23_2(X360,X361),tptp1) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp2)
| occurrence_of(X361,tptp1)
| occurrence_of(X361,tptp2) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp1)
| min_precedes(X360,esk22_2(X360,X361),tptp0)
| min_precedes(X360,esk23_2(X360,X361),tptp0) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp1)
| min_precedes(X360,esk22_2(X360,X361),tptp0)
| occurrence_of(esk23_2(X360,X361),tptp1) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp1)
| min_precedes(X360,esk22_2(X360,X361),tptp0)
| occurrence_of(X361,tptp2) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp1)
| occurrence_of(esk22_2(X360,X361),tptp2)
| min_precedes(X360,esk23_2(X360,X361),tptp0) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp1)
| occurrence_of(esk22_2(X360,X361),tptp2)
| occurrence_of(esk23_2(X360,X361),tptp1) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp1)
| occurrence_of(esk22_2(X360,X361),tptp2)
| occurrence_of(X361,tptp2) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp1)
| occurrence_of(X361,tptp1)
| min_precedes(X360,esk23_2(X360,X361),tptp0) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp1)
| occurrence_of(X361,tptp1)
| occurrence_of(esk23_2(X360,X361),tptp1) )
& ( ~ leaf_occ(X361,esk21_0)
| ~ min_precedes(X360,X361,tptp0)
| ~ next_subocc(esk20_0,X360,tptp0)
| ~ occurrence_of(X360,tptp3)
| ~ occurrence_of(X361,tptp1)
| occurrence_of(X361,tptp1)
| occurrence_of(X361,tptp2) )
& ~ leaf_occ(esk20_0,esk21_0)
& arboreal(esk20_0)
& subactivity_occurrence(esk20_0,esk21_0)
& occurrence_of(esk21_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,esk17_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
occurrence_of(esk21_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X238,X239,X240,X241,X242,X243,X244] :
( ( next_subocc(X242,X243,X244)
| ~ min_precedes(X242,X243,X244)
| min_precedes(esk8_3(X242,X243,X244),X243,X244) )
& ( next_subocc(X242,X243,X244)
| ~ min_precedes(X242,X243,X244)
| min_precedes(X242,esk8_3(X242,X243,X244),X244) )
& ( ~ next_subocc(X238,X239,X240)
| ~ min_precedes(X241,X239,X240)
| ~ min_precedes(X238,X241,X240) )
& ( ~ next_subocc(X238,X239,X240)
| min_precedes(X238,X239,X240) ) ),
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_19,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| next_subocc(X1,esk17_1(X1),tptp0)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
subactivity_occurrence(esk20_0,esk21_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
arboreal(esk20_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
~ leaf_occ(esk20_0,esk21_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(esk17_1(X1),esk18_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_24,plain,
! [X254,X255,X256] :
( ( ~ min_precedes(X255,X256,X254)
| subactivity_occurrence(X256,esk10_3(X254,X255,X256)) )
& ( ~ min_precedes(X255,X256,X254)
| subactivity_occurrence(X255,esk10_3(X254,X255,X256)) )
& ( ~ min_precedes(X255,X256,X254)
| occurrence_of(esk10_3(X254,X255,X256),X254) ) ),
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_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(esk20_0,esk17_1(esk20_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(esk17_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_28,plain,
! [X304,X305,X306,X307] :
( ~ min_precedes(X305,X307,X306)
| ~ leaf_occ(X305,X304)
| ~ occurrence_of(X304,X306) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_37])])])]) ).
cnf(c_0_29,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| min_precedes(esk17_1(X1),esk18_1(X1),tptp0)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_23,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_24]) ).
cnf(c_0_31,negated_conjecture,
min_precedes(esk20_0,esk17_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_32,plain,
! [X190,X191] :
( ( ~ occurrence_of(X190,X191)
| arboreal(X190)
| ~ atomic(X191) )
& ( ~ occurrence_of(X190,X191)
| atomic(X191)
| ~ arboreal(X190) ) ),
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,esk21_0)
| occurrence_of(esk17_1(X1),tptp3)
| leaf_occ(X1,esk21_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(esk17_1(esk20_0),esk18_1(esk20_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(esk10_3(tptp0,esk20_0,esk17_1(esk20_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,esk10_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(esk17_1(esk20_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_55]) ).
cnf(c_0_41,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ leaf_occ(esk17_1(esk20_0),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk20_0,esk17_1(esk20_0)))
| next_subocc(X1,esk17_1(X1),tptp0)
| leaf_occ(X1,esk10_3(tptp0,esk20_0,esk17_1(esk20_0))) ),
inference(spm,[status(thm)],[c_0_16,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
subactivity_occurrence(esk17_1(esk20_0),esk10_3(tptp0,esk20_0,esk17_1(esk20_0))),
inference(spm,[status(thm)],[c_0_37,c_0_31]) ).
cnf(c_0_44,negated_conjecture,
arboreal(esk17_1(esk20_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(esk17_1(esk20_0),esk10_3(tptp0,esk20_0,esk17_1(esk20_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(esk17_1(X1),X2,tptp0)
| leaf_occ(X1,X3)
| X2 = esk19_1(X1)
| X2 = esk18_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_47,plain,
! [X178,X179,X180] :
( X179 = X180
| ~ occurrence_of(X178,X180)
| ~ occurrence_of(X178,X179) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])]) ).
fof(c_0_48,plain,
! [X176] :
( ( ~ activity_occurrence(X176)
| occurrence_of(X176,esk1_1(X176)) )
& ( ~ activity_occurrence(X176)
| activity(esk1_1(X176)) ) ),
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_49,plain,
! [X174,X175] :
( ( ~ occurrence_of(X175,X174)
| activity_occurrence(X175) )
& ( ~ occurrence_of(X175,X174)
| activity(X174) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])])]) ).
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(esk17_1(esk20_0),esk17_1(esk17_1(esk20_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,
( ~ arboreal(X2)
| ~ min_precedes(esk17_1(X2),X1,tptp0)
| ~ subactivity_occurrence(X2,esk21_0)
| leaf_occ(X2,esk21_0)
| X1 = esk18_1(X2)
| X1 = esk19_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(esk18_1(X1),esk19_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(esk18_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,esk1_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,esk10_3(tptp0,esk20_0,esk17_1(esk20_0)))
| occurrence_of(esk17_1(X1),tptp3)
| leaf_occ(X1,esk10_3(tptp0,esk20_0,esk17_1(esk20_0))) ),
inference(spm,[status(thm)],[c_0_27,c_0_36]) ).
cnf(c_0_59,negated_conjecture,
( ~ min_precedes(esk17_1(esk20_0),X1,tptp0)
| ~ min_precedes(X1,esk17_1(esk17_1(esk20_0)),tptp0) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_60,negated_conjecture,
( ~ min_precedes(esk17_1(esk20_0),X1,tptp0)
| X1 = esk19_1(esk20_0)
| X1 = esk18_1(esk20_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(esk17_1(esk20_0),esk17_1(esk17_1(esk20_0)),tptp0),
inference(spm,[status(thm)],[c_0_25,c_0_51]) ).
cnf(c_0_62,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| min_precedes(esk18_1(X1),esk19_1(X1),tptp0)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_53,c_0_17]) ).
cnf(c_0_63,negated_conjecture,
( ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk21_0)
| occurrence_of(esk18_1(X1),tptp4)
| leaf_occ(X1,esk21_0) ),
inference(spm,[status(thm)],[c_0_54,c_0_17]) ).
fof(c_0_64,plain,
tptp4 != tptp3,
inference(fof_simplification,[status(thm)],[sos_56]) ).
cnf(c_0_65,plain,
( ~ occurrence_of(X2,X1)
| X1 = esk1_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(esk17_1(esk17_1(esk20_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(esk18_1(esk20_0),esk17_1(esk17_1(esk20_0)),tptp0),
inference(spm,[status(thm)],[c_0_59,c_0_35]) ).
cnf(c_0_68,negated_conjecture,
( esk17_1(esk17_1(esk20_0)) = esk18_1(esk20_0)
| esk17_1(esk17_1(esk20_0)) = esk19_1(esk20_0) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_69,negated_conjecture,
min_precedes(esk18_1(esk20_0),esk19_1(esk20_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(esk18_1(esk20_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,
esk1_1(esk17_1(esk17_1(esk20_0))) = tptp3,
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_73,negated_conjecture,
esk17_1(esk17_1(esk20_0)) = esk18_1(esk20_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,
esk1_1(esk18_1(esk20_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.04 % Problem : PRO018+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 % Computer : n011.cluster.edu
% 0.14/0.42 % Model : x86_64 x86_64
% 0.14/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.42 % Memory : 8046.5625MB
% 0.14/0.42 % OS : Linux 6.8.0-71-generic
% 0.14/0.42 % CPULimit : 300
% 0.14/0.42 % WCLimit : 300
% 0.14/0.42 % DateTime : Mon Sep 21 03:43:55 UTC 2026
% 0.14/0.42 % CPUTime :
% 0.14/0.42 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.49 Running first-order theorem proving
% 0.14/0.49 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
% 0.25/0.64 % Version: 3.5.1
% 0.25/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.64 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.64 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.64 % Starting sh5l with 300s (1) cores
% 0.25/0.64 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 894792 completed with status 0
% 0.25/0.64 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.25/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.64 % No SInE strategy applied
% 0.25/0.64 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.25/0.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.25/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 0.25/0.64 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 0.25/0.64 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.25/0.64 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 894800 completed with status 0
% 0.25/0.64 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.25/0.64 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/0.64 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/0.64 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.64 % No SInE strategy applied
% 0.25/0.64 % Search class: FGHSF-FFMM32-SFFFFFNN
% 0.25/0.64 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.64 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.64 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.25/0.64 % Preprocessing time : 0.002 s
% 0.25/0.64 % Presaturation interreduction done
% 0.25/0.64
% 0.25/0.64 % Proof found!
% 0.25/0.64 % SZS status Theorem
% 0.25/0.64 % SZS output start CNFRefutation
% See solution above
% 0.25/0.65 % Parsed axioms : 63
% 0.25/0.65 % Removed by relevancy pruning/SinE : 0
% 0.25/0.65 % Initial clauses : 123
% 0.25/0.65 % Removed in clause preprocessing : 6
% 0.25/0.65 % Initial clauses in saturation : 117
% 0.25/0.65 % Processed clauses : 1223
% 0.25/0.65 % ...of these trivial : 27
% 0.25/0.65 % ...subsumed : 249
% 0.25/0.65 % ...remaining for further processing : 947
% 0.25/0.65 % Other redundant clauses eliminated : 0
% 0.25/0.65 % Clauses deleted for lack of memory : 0
% 0.25/0.65 % Backward-subsumed : 4
% 0.25/0.65 % Backward-rewritten : 60
% 0.25/0.65 % Generated clauses : 2749
% 0.25/0.65 % ...of the previous two non-redundant : 2192
% 0.25/0.65 % ...aggressively subsumed : 0
% 0.25/0.65 % Contextual simplify-reflections : 15
% 0.25/0.65 % Paramodulations : 2747
% 0.25/0.65 % Factorizations : 2
% 0.25/0.65 % NegExts : 0
% 0.25/0.65 % Equation resolutions : 0
% 0.25/0.65 % Disequality decompositions : 0
% 0.25/0.65 % Total rewrite steps : 1491
% 0.25/0.65 % ...of those cached : 1363
% 0.25/0.65 % Propositional unsat checks : 0
% 0.25/0.65 % Propositional check models : 0
% 0.25/0.65 % Propositional check unsatisfiable : 0
% 0.25/0.65 % Propositional clauses : 0
% 0.25/0.65 % Propositional clauses after purity: 0
% 0.25/0.65 % Propositional unsat core size : 0
% 0.25/0.65 % Propositional preprocessing time : 0.000
% 0.25/0.65 % Propositional encoding time : 0.000
% 0.25/0.65 % Propositional solver time : 0.000
% 0.25/0.65 % Success case prop preproc time : 0.000
% 0.25/0.65 % Success case prop encoding time : 0.000
% 0.25/0.65 % Success case prop solver time : 0.000
% 0.25/0.65 % Current number of processed clauses : 766
% 0.25/0.65 % Positive orientable unit clauses : 174
% 0.25/0.65 % Positive unorientable unit clauses: 0
% 0.25/0.65 % Negative unit clauses : 98
% 0.25/0.65 % Non-unit-clauses : 494
% 0.25/0.65 % Current number of unprocessed clauses: 1134
% 0.25/0.65 % ...number of literals in the above : 3308
% 0.25/0.65 % Current number of archived formulas : 0
% 0.25/0.65 % Current number of archived clauses : 181
% 0.25/0.65 % Clause-clause subsumption calls (NU) : 44239
% 0.25/0.65 % Rec. Clause-clause subsumption calls : 19569
% 0.25/0.65 % Non-unit clause-clause subsumptions : 176
% 0.25/0.65 % Unit Clause-clause subsumption calls : 8669
% 0.25/0.65 % Rewrite failures with RHS unbound : 0
% 0.25/0.65 % BW rewrite match attempts : 19
% 0.25/0.65 % BW rewrite match successes : 17
% 0.25/0.65 % Condensation attempts : 0
% 0.25/0.65 % Condensation successes : 0
% 0.25/0.65 % Termbank termtop insertions : 61101
% 0.25/0.65 % Search garbage collected termcells : 2085
% 0.25/0.65
% 0.25/0.65 % -------------------------------------------------
% 0.25/0.65 % User time : 0.109 s
% 0.25/0.65 % System time : 0.013 s
% 0.25/0.65 % Total time : 0.121 s
% 0.25/0.65 % Maximum resident set size: 4072 pages
% 0.25/0.65
% 0.25/0.65 % -------------------------------------------------
% 0.25/0.65 % User time : 0.520 s
% 0.25/0.65 % System time : 0.044 s
% 0.25/0.65 % Total time : 0.564 s
% 0.25/0.65 % Maximum resident set size: 5120 pages
% 0.25/0.65 % E exiting
%------------------------------------------------------------------------------