%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PRO018+1 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:01:57 PM UTC 2026
% Result : Theorem 27.28s 15.95s
% Output : CNFRefutation 27.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 14
% Syntax : Number of formulae : 99 ( 31 unt; 0 def)
% Number of atoms : 481 ( 36 equ)
% Maximal formula atoms : 130 ( 4 avg)
% Number of connectives : 599 ( 217 ~; 272 |; 91 &)
% ( 4 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 7 con; 0-3 aty)
% Number of variables : 134 ( 2 sgn 62 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(sos_35,axiom,
! [X106,X107] :
( ( occurrence_of(X107,tptp0)
& subactivity_occurrence(X106,X107)
& arboreal(X106)
& ~ leaf_occ(X106,X107) )
=> ? [X108,X109,X110] :
( occurrence_of(X108,tptp3)
& next_subocc(X106,X108,tptp0)
& occurrence_of(X109,tptp4)
& min_precedes(X108,X109,tptp0)
& ( occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& min_precedes(X109,X110,tptp0)
& ! [X111] :
( min_precedes(X108,X111,tptp0)
=> ( X111 = X109
| X111 = X110 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_35) ).
fof(goals,conjecture,
! [X112,X113] :
( ( occurrence_of(X113,tptp0)
& subactivity_occurrence(X112,X113)
& arboreal(X112)
& ~ leaf_occ(X112,X113) )
=> ? [X114,X115] :
( occurrence_of(X114,tptp3)
& next_subocc(X112,X114,tptp0)
& ( occurrence_of(X115,tptp1)
| occurrence_of(X115,tptp2) )
& min_precedes(X114,X115,tptp0)
& leaf_occ(X115,X113)
& ( occurrence_of(X115,tptp1)
=> ~ ? [X116] :
( occurrence_of(X116,tptp2)
& min_precedes(X114,X116,tptp0) ) )
& ( occurrence_of(X115,tptp2)
=> ~ ? [X117] :
( occurrence_of(X117,tptp1)
& min_precedes(X114,X117,tptp0) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_22,axiom,
! [X61,X62,X63] :
( next_subocc(X61,X62,X63)
<=> ( min_precedes(X61,X62,X63)
& ~ ? [X64] :
( min_precedes(X61,X64,X63)
& min_precedes(X64,X62,X63) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_22) ).
fof(sos_25,axiom,
! [X70,X71,X72] :
( min_precedes(X71,X72,X70)
=> ? [X73] :
( occurrence_of(X73,X70)
& subactivity_occurrence(X71,X73)
& subactivity_occurrence(X72,X73) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_25) ).
fof(sos_07,axiom,
! [X17,X18] :
( occurrence_of(X17,X18)
=> ( arboreal(X17)
<=> atomic(X18) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_07) ).
fof(sos_41,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_41) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X6)
& occurrence_of(X5,X7) )
=> X6 = X7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(sos_34,axiom,
! [X103,X104] :
( leaf_occ(X103,X104)
<=> ? [X105] :
( occurrence_of(X104,X105)
& subactivity_occurrence(X103,X104)
& leaf(X103,X105) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_34) ).
fof(sos_21,axiom,
! [X57,X58] :
( leaf(X57,X58)
<=> ( ( root(X57,X58)
| ? [X59] : min_precedes(X59,X57,X58) )
& ~ ? [X60] : min_precedes(X57,X60,X58) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(sos,axiom,
! [X1,X2] :
( occurrence_of(X2,X1)
=> ( activity(X1)
& activity_occurrence(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
fof(sos_01,axiom,
! [X3] :
( activity_occurrence(X3)
=> ? [X4] :
( activity(X4)
& occurrence_of(X3,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
fof(sos_42,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_42) ).
fof(sos_46,axiom,
tptp3 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_46) ).
fof(sos_45,axiom,
tptp3 != tptp1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_45) ).
fof(c_0_14,plain,
! [X106,X107] :
( ( occurrence_of(X107,tptp0)
& subactivity_occurrence(X106,X107)
& arboreal(X106)
& ~ leaf_occ(X106,X107) )
=> ? [X108,X109,X110] :
( occurrence_of(X108,tptp3)
& next_subocc(X106,X108,tptp0)
& occurrence_of(X109,tptp4)
& min_precedes(X108,X109,tptp0)
& ( occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& min_precedes(X109,X110,tptp0)
& ! [X111] :
( min_precedes(X108,X111,tptp0)
=> ( X111 = X109
| X111 = X110 ) ) ) ),
inference(fof_simplification,[status(thm)],[sos_35]) ).
fof(c_0_15,negated_conjecture,
~ ! [X112,X113] :
( ( occurrence_of(X113,tptp0)
& subactivity_occurrence(X112,X113)
& arboreal(X112)
& ~ leaf_occ(X112,X113) )
=> ? [X114,X115] :
( occurrence_of(X114,tptp3)
& next_subocc(X112,X114,tptp0)
& ( occurrence_of(X115,tptp1)
| occurrence_of(X115,tptp2) )
& min_precedes(X114,X115,tptp0)
& leaf_occ(X115,X113)
& ( occurrence_of(X115,tptp1)
=> ~ ? [X116] :
( occurrence_of(X116,tptp2)
& min_precedes(X114,X116,tptp0) ) )
& ( occurrence_of(X115,tptp2)
=> ~ ? [X117] :
( occurrence_of(X117,tptp1)
& min_precedes(X114,X117,tptp0) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[goals])]) ).
fof(c_0_16,plain,
! [X357,X358,X362] :
( ( occurrence_of(esk16_1(X357),tptp3)
| ~ occurrence_of(X358,tptp0)
| ~ subactivity_occurrence(X357,X358)
| ~ arboreal(X357)
| leaf_occ(X357,X358) )
& ( next_subocc(X357,esk16_1(X357),tptp0)
| ~ occurrence_of(X358,tptp0)
| ~ subactivity_occurrence(X357,X358)
| ~ arboreal(X357)
| leaf_occ(X357,X358) )
& ( occurrence_of(esk17_1(X357),tptp4)
| ~ occurrence_of(X358,tptp0)
| ~ subactivity_occurrence(X357,X358)
| ~ arboreal(X357)
| leaf_occ(X357,X358) )
& ( min_precedes(esk16_1(X357),esk17_1(X357),tptp0)
| ~ occurrence_of(X358,tptp0)
| ~ subactivity_occurrence(X357,X358)
| ~ arboreal(X357)
| leaf_occ(X357,X358) )
& ( occurrence_of(esk18_1(X357),tptp1)
| occurrence_of(esk18_1(X357),tptp2)
| ~ occurrence_of(X358,tptp0)
| ~ subactivity_occurrence(X357,X358)
| ~ arboreal(X357)
| leaf_occ(X357,X358) )
& ( min_precedes(esk17_1(X357),esk18_1(X357),tptp0)
| ~ occurrence_of(X358,tptp0)
| ~ subactivity_occurrence(X357,X358)
| ~ arboreal(X357)
| leaf_occ(X357,X358) )
& ( ~ min_precedes(esk16_1(X357),X362,tptp0)
| X362 = esk17_1(X357)
| X362 = esk18_1(X357)
| ~ occurrence_of(X358,tptp0)
| ~ subactivity_occurrence(X357,X358)
| ~ arboreal(X357)
| leaf_occ(X357,X358) ) ),
inference(distribute,[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_14])])])])])]) ).
fof(c_0_17,negated_conjecture,
! [X365,X366] :
( occurrence_of(esk20_0,tptp0)
& subactivity_occurrence(esk19_0,esk20_0)
& arboreal(esk19_0)
& ~ leaf_occ(esk19_0,esk20_0)
& ( occurrence_of(X366,tptp2)
| occurrence_of(X366,tptp1)
| ~ occurrence_of(X366,tptp1)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( occurrence_of(esk22_2(X365,X366),tptp1)
| occurrence_of(X366,tptp1)
| ~ occurrence_of(X366,tptp1)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( min_precedes(X365,esk22_2(X365,X366),tptp0)
| occurrence_of(X366,tptp1)
| ~ occurrence_of(X366,tptp1)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( occurrence_of(X366,tptp2)
| occurrence_of(esk21_2(X365,X366),tptp2)
| ~ occurrence_of(X366,tptp1)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( occurrence_of(esk22_2(X365,X366),tptp1)
| occurrence_of(esk21_2(X365,X366),tptp2)
| ~ occurrence_of(X366,tptp1)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( min_precedes(X365,esk22_2(X365,X366),tptp0)
| occurrence_of(esk21_2(X365,X366),tptp2)
| ~ occurrence_of(X366,tptp1)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( occurrence_of(X366,tptp2)
| min_precedes(X365,esk21_2(X365,X366),tptp0)
| ~ occurrence_of(X366,tptp1)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( occurrence_of(esk22_2(X365,X366),tptp1)
| min_precedes(X365,esk21_2(X365,X366),tptp0)
| ~ occurrence_of(X366,tptp1)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( min_precedes(X365,esk22_2(X365,X366),tptp0)
| min_precedes(X365,esk21_2(X365,X366),tptp0)
| ~ occurrence_of(X366,tptp1)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( occurrence_of(X366,tptp2)
| occurrence_of(X366,tptp1)
| ~ occurrence_of(X366,tptp2)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( occurrence_of(esk22_2(X365,X366),tptp1)
| occurrence_of(X366,tptp1)
| ~ occurrence_of(X366,tptp2)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( min_precedes(X365,esk22_2(X365,X366),tptp0)
| occurrence_of(X366,tptp1)
| ~ occurrence_of(X366,tptp2)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( occurrence_of(X366,tptp2)
| occurrence_of(esk21_2(X365,X366),tptp2)
| ~ occurrence_of(X366,tptp2)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( occurrence_of(esk22_2(X365,X366),tptp1)
| occurrence_of(esk21_2(X365,X366),tptp2)
| ~ occurrence_of(X366,tptp2)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( min_precedes(X365,esk22_2(X365,X366),tptp0)
| occurrence_of(esk21_2(X365,X366),tptp2)
| ~ occurrence_of(X366,tptp2)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( occurrence_of(X366,tptp2)
| min_precedes(X365,esk21_2(X365,X366),tptp0)
| ~ occurrence_of(X366,tptp2)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( occurrence_of(esk22_2(X365,X366),tptp1)
| min_precedes(X365,esk21_2(X365,X366),tptp0)
| ~ occurrence_of(X366,tptp2)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) )
& ( min_precedes(X365,esk22_2(X365,X366),tptp0)
| min_precedes(X365,esk21_2(X365,X366),tptp0)
| ~ occurrence_of(X366,tptp2)
| ~ occurrence_of(X365,tptp3)
| ~ next_subocc(esk19_0,X365,tptp0)
| ~ min_precedes(X365,X366,tptp0)
| ~ leaf_occ(X366,esk20_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])]) ).
cnf(c_0_18,plain,
( next_subocc(X1,esk16_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
occurrence_of(esk20_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_20,plain,
! [X299,X300,X301,X302,X303,X304,X305] :
( ( min_precedes(X299,X300,X301)
| ~ next_subocc(X299,X300,X301) )
& ( ~ min_precedes(X299,X302,X301)
| ~ min_precedes(X302,X300,X301)
| ~ next_subocc(X299,X300,X301) )
& ( min_precedes(X303,esk8_3(X303,X304,X305),X305)
| ~ min_precedes(X303,X304,X305)
| next_subocc(X303,X304,X305) )
& ( min_precedes(esk8_3(X303,X304,X305),X304,X305)
| ~ min_precedes(X303,X304,X305)
| next_subocc(X303,X304,X305) ) ),
inference(distribute,[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_21,negated_conjecture,
( leaf_occ(X1,esk20_0)
| next_subocc(X1,esk16_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
subactivity_occurrence(esk19_0,esk20_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
arboreal(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
~ leaf_occ(esk19_0,esk20_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_25,plain,
! [X315,X316,X317] :
( ( occurrence_of(esk10_3(X315,X316,X317),X315)
| ~ min_precedes(X316,X317,X315) )
& ( subactivity_occurrence(X316,esk10_3(X315,X316,X317))
| ~ min_precedes(X316,X317,X315) )
& ( subactivity_occurrence(X317,esk10_3(X315,X316,X317))
| ~ min_precedes(X316,X317,X315) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_25])])])]) ).
cnf(c_0_26,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,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_21,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_28,plain,
( occurrence_of(esk16_1(X1),tptp3)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,plain,
( occurrence_of(esk10_3(X1,X2,X3),X1)
| ~ min_precedes(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
min_precedes(esk19_0,esk16_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_31,plain,
! [X251,X252] :
( ( ~ arboreal(X251)
| atomic(X252)
| ~ occurrence_of(X251,X252) )
& ( ~ atomic(X252)
| arboreal(X251)
| ~ occurrence_of(X251,X252) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])]) ).
cnf(c_0_32,negated_conjecture,
( leaf_occ(X1,esk20_0)
| occurrence_of(esk16_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_19]) ).
cnf(c_0_33,negated_conjecture,
occurrence_of(esk10_3(tptp0,esk19_0,esk16_1(esk19_0)),tptp0),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( subactivity_occurrence(X1,esk10_3(X2,X3,X1))
| ~ min_precedes(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_35,plain,
( arboreal(X2)
| ~ atomic(X1)
| ~ occurrence_of(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,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_32,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_37,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_41]) ).
fof(c_0_38,plain,
! [X239,X240,X241] :
( ~ occurrence_of(X239,X240)
| ~ occurrence_of(X239,X241)
| X240 = X241 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])]) ).
fof(c_0_39,plain,
! [X351,X352,X354,X355,X356] :
( ( occurrence_of(X352,esk15_2(X351,X352))
| ~ leaf_occ(X351,X352) )
& ( subactivity_occurrence(X351,X352)
| ~ leaf_occ(X351,X352) )
& ( leaf(X351,esk15_2(X351,X352))
| ~ leaf_occ(X351,X352) )
& ( ~ occurrence_of(X355,X356)
| ~ subactivity_occurrence(X354,X355)
| ~ leaf(X354,X356)
| leaf_occ(X354,X355) ) ),
inference(distribute,[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_40,negated_conjecture,
( leaf_occ(X1,esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
| occurrence_of(esk16_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
subactivity_occurrence(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))),
inference(spm,[status(thm)],[c_0_34,c_0_30]) ).
cnf(c_0_42,negated_conjecture,
arboreal(esk16_1(esk19_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_43,plain,
( min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_44,plain,
( X2 = X3
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
( occurrence_of(X1,esk15_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( leaf_occ(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
| occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
fof(c_0_47,plain,
! [X291,X292,X294,X295,X296,X297] :
( ( root(X291,X292)
| min_precedes(esk6_2(X291,X292),X291,X292)
| ~ leaf(X291,X292) )
& ( ~ min_precedes(X291,X294,X292)
| ~ leaf(X291,X292) )
& ( ~ root(X295,X296)
| min_precedes(X295,esk7_2(X295,X296),X296)
| leaf(X295,X296) )
& ( ~ min_precedes(X297,X295,X296)
| min_precedes(X295,esk7_2(X295,X296),X296)
| leaf(X295,X296) ) ),
inference(distribute,[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_48,negated_conjecture,
( leaf_occ(X1,esk20_0)
| min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_19]) ).
cnf(c_0_49,plain,
( leaf(X1,esk15_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_50,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk10_3(tptp0,esk19_0,esk16_1(esk19_0)),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_33]) ).
cnf(c_0_51,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))))
| occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,plain,
( ~ min_precedes(X1,X2,X3)
| ~ leaf(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_53,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_48,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_54,negated_conjecture,
( leaf_occ(X1,esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
| next_subocc(X1,esk16_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_33]) ).
cnf(c_0_55,plain,
( occurrence_of(esk17_1(X1),tptp4)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_56,plain,
! [X235,X236] :
( ( activity(X235)
| ~ occurrence_of(X236,X235) )
& ( activity_occurrence(X236)
| ~ occurrence_of(X236,X235) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])]) ).
cnf(c_0_57,negated_conjecture,
( leaf(esk16_1(esk19_0),esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))))
| occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3) ),
inference(spm,[status(thm)],[c_0_49,c_0_46]) ).
cnf(c_0_58,negated_conjecture,
( esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) = tptp0
| occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_59,negated_conjecture,
~ leaf(esk16_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
( X2 = esk17_1(X1)
| X2 = esk18_1(X1)
| leaf_occ(X1,X3)
| ~ min_precedes(esk16_1(X1),X2,tptp0)
| ~ occurrence_of(X3,tptp0)
| ~ subactivity_occurrence(X1,X3)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_61,negated_conjecture,
( leaf_occ(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
| next_subocc(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_41]),c_0_42])]) ).
cnf(c_0_62,negated_conjecture,
( leaf_occ(X1,esk20_0)
| occurrence_of(esk17_1(X1),tptp4)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_19]) ).
fof(c_0_63,plain,
! [X237] :
( ( activity(esk1_1(X237))
| ~ activity_occurrence(X237) )
& ( occurrence_of(X237,esk1_1(X237))
| ~ activity_occurrence(X237) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_01])])])]) ).
cnf(c_0_64,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_65,negated_conjecture,
occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_66,negated_conjecture,
( X1 = esk18_1(X2)
| X1 = esk17_1(X2)
| leaf_occ(X2,esk20_0)
| ~ subactivity_occurrence(X2,esk20_0)
| ~ min_precedes(esk16_1(X2),X1,tptp0)
| ~ arboreal(X2) ),
inference(spm,[status(thm)],[c_0_60,c_0_19]) ).
cnf(c_0_67,negated_conjecture,
( leaf_occ(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_26,c_0_61]) ).
cnf(c_0_68,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_62,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_69,plain,
( occurrence_of(X1,esk1_1(X1))
| ~ activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_70,negated_conjecture,
activity_occurrence(esk16_1(esk16_1(esk19_0))),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_71,negated_conjecture,
( X1 = esk17_1(esk19_0)
| X1 = esk18_1(esk19_0)
| ~ min_precedes(esk16_1(esk19_0),X1,tptp0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_72,negated_conjecture,
( min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0)
| 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_45,c_0_67]) ).
cnf(c_0_73,negated_conjecture,
activity_occurrence(esk17_1(esk19_0)),
inference(spm,[status(thm)],[c_0_64,c_0_68]) ).
cnf(c_0_74,negated_conjecture,
( X1 = tptp3
| ~ occurrence_of(esk16_1(esk16_1(esk19_0)),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_65]) ).
cnf(c_0_75,negated_conjecture,
occurrence_of(esk16_1(esk16_1(esk19_0)),esk1_1(esk16_1(esk16_1(esk19_0)))),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_76,negated_conjecture,
( esk16_1(esk16_1(esk19_0)) = esk18_1(esk19_0)
| esk16_1(esk16_1(esk19_0)) = esk17_1(esk19_0)
| 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_71,c_0_72]) ).
cnf(c_0_77,negated_conjecture,
( X1 = tptp4
| ~ occurrence_of(esk17_1(esk19_0),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_68]) ).
cnf(c_0_78,negated_conjecture,
occurrence_of(esk17_1(esk19_0),esk1_1(esk17_1(esk19_0))),
inference(spm,[status(thm)],[c_0_69,c_0_73]) ).
cnf(c_0_79,negated_conjecture,
esk1_1(esk16_1(esk16_1(esk19_0))) = tptp3,
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_80,negated_conjecture,
( esk16_1(esk16_1(esk19_0)) = esk17_1(esk19_0)
| 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))))
| occurrence_of(esk18_1(esk19_0),tptp3) ),
inference(spm,[status(thm)],[c_0_65,c_0_76]) ).
cnf(c_0_81,negated_conjecture,
esk1_1(esk17_1(esk19_0)) = tptp4,
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_82,plain,
tptp4 != tptp3,
inference(split_conjunct,[status(thm)],[sos_42]) ).
cnf(c_0_83,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))))
| occurrence_of(esk18_1(esk19_0),tptp3) ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_81]),c_0_82]) ).
cnf(c_0_84,negated_conjecture,
( leaf(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_49,c_0_67]) ).
cnf(c_0_85,negated_conjecture,
( esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) = tptp0
| occurrence_of(esk18_1(esk19_0),tptp3) ),
inference(spm,[status(thm)],[c_0_50,c_0_83]) ).
cnf(c_0_86,negated_conjecture,
( min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0)
| occurrence_of(esk18_1(esk19_0),tptp3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_59]) ).
cnf(c_0_87,plain,
( occurrence_of(esk18_1(X1),tptp1)
| occurrence_of(esk18_1(X1),tptp2)
| leaf_occ(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ subactivity_occurrence(X1,X2)
| ~ arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_88,negated_conjecture,
( esk16_1(esk16_1(esk19_0)) = esk18_1(esk19_0)
| esk16_1(esk16_1(esk19_0)) = esk17_1(esk19_0)
| occurrence_of(esk18_1(esk19_0),tptp3) ),
inference(spm,[status(thm)],[c_0_71,c_0_86]) ).
cnf(c_0_89,negated_conjecture,
( leaf_occ(X1,esk20_0)
| occurrence_of(esk18_1(X1),tptp2)
| occurrence_of(esk18_1(X1),tptp1)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_87,c_0_19]) ).
cnf(c_0_90,negated_conjecture,
( esk16_1(esk16_1(esk19_0)) = esk17_1(esk19_0)
| occurrence_of(esk18_1(esk19_0),tptp3) ),
inference(spm,[status(thm)],[c_0_65,c_0_88]) ).
cnf(c_0_91,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_89,c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_92,negated_conjecture,
occurrence_of(esk18_1(esk19_0),tptp3),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_90]),c_0_81]),c_0_82]) ).
cnf(c_0_93,negated_conjecture,
( X1 = tptp2
| occurrence_of(esk18_1(esk19_0),tptp1)
| ~ occurrence_of(esk18_1(esk19_0),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_91]) ).
cnf(c_0_94,plain,
tptp3 != tptp2,
inference(split_conjunct,[status(thm)],[sos_46]) ).
cnf(c_0_95,negated_conjecture,
( X1 = tptp3
| ~ occurrence_of(esk18_1(esk19_0),X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_92]) ).
cnf(c_0_96,negated_conjecture,
occurrence_of(esk18_1(esk19_0),tptp1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_92]),c_0_94]) ).
cnf(c_0_97,plain,
tptp3 != tptp1,
inference(split_conjunct,[status(thm)],[sos_45]) ).
cnf(c_0_98,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PRO018+1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n021.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 01:32:25 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 27.28/15.95 % Version : CSE_E---1.7
% 27.28/15.95 % Problem : theBenchmark.p
% 27.28/15.95 % SZS status Theorem for theBenchmark.p
% 27.28/15.95 % SZS output start CNFRefutation
% See solution above
% 27.41/16.04 % Total time : 12.392s
%------------------------------------------------------------------------------