%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PRO009+3 : TPTP v9.2.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n023.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:53 PM UTC 2026
% Result : Theorem 1.34s 1.74s
% Output : CNFRefutation 1.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 87 ( 26 unt; 0 def)
% Number of atoms : 275 ( 12 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 311 ( 123 ~; 119 |; 53 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-3 aty)
% Number of variables : 158 ( 5 sgn 88 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X166] :
( occurrence_of(X166,tptp0)
=> ? [X167,X168] :
( occurrence_of(X167,tptp3)
& root_occ(X167,X166)
& ( occurrence_of(X168,tptp2)
| occurrence_of(X168,tptp1) )
& min_precedes(X167,X168,tptp0)
& leaf_occ(X168,X166) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(sos_49,axiom,
! [X162] :
( occurrence_of(X162,tptp0)
=> ? [X163,X164,X165] :
( occurrence_of(X163,tptp3)
& root_occ(X163,X162)
& occurrence_of(X164,tptp4)
& next_subocc(X163,X164,tptp0)
& ( occurrence_of(X165,tptp2)
| occurrence_of(X165,tptp1) )
& next_subocc(X164,X165,tptp0)
& leaf_occ(X165,X162) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_49) ).
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/sandbox/benchmark/theBenchmark.p',sos_22) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X6)
& occurrence_of(X5,X7) )
=> X6 = X7 ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',sos_34) ).
fof(sos_15,axiom,
! [X39,X40,X41] :
( min_precedes(X39,X40,X41)
=> precedes(X39,X40) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_15) ).
fof(sos_14,axiom,
! [X36,X37,X38] :
( min_precedes(X36,X37,X38)
=> ~ root(X37,X38) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_14) ).
fof(sos_10,axiom,
! [X22,X23] :
( precedes(X22,X23)
<=> ( earlier(X22,X23)
& legal(X23) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_10) ).
fof(sos_05,axiom,
! [X11,X12,X13] :
( ( earlier(X11,X12)
& earlier(X12,X13) )
=> earlier(X11,X13) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_05) ).
fof(sos_42,axiom,
! [X135,X136,X137,X138] :
( ( occurrence_of(X136,X135)
& subactivity_occurrence(X137,X136)
& root_occ(X138,X136)
& arboreal(X137)
& ~ min_precedes(X138,X137,X135) )
=> X138 = X137 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_42) ).
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/sandbox/benchmark/theBenchmark.p',sos_21) ).
fof(sos_44,axiom,
! [X143,X144,X145] :
( next_subocc(X143,X144,X145)
=> ( arboreal(X143)
& arboreal(X144) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_44) ).
fof(sos_18,axiom,
! [X46,X47,X48,X49] :
( ( min_precedes(X46,X47,X49)
& min_precedes(X46,X48,X49)
& precedes(X47,X48) )
=> min_precedes(X47,X48,X49) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_18) ).
fof(c_0_13,negated_conjecture,
~ ! [X166] :
( occurrence_of(X166,tptp0)
=> ? [X167,X168] :
( occurrence_of(X167,tptp3)
& root_occ(X167,X166)
& ( occurrence_of(X168,tptp2)
| occurrence_of(X168,tptp1) )
& min_precedes(X167,X168,tptp0)
& leaf_occ(X168,X166) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_14,plain,
! [X515] :
( ( occurrence_of(esk17_1(X515),tptp3)
| ~ occurrence_of(X515,tptp0) )
& ( root_occ(esk17_1(X515),X515)
| ~ occurrence_of(X515,tptp0) )
& ( occurrence_of(esk18_1(X515),tptp4)
| ~ occurrence_of(X515,tptp0) )
& ( next_subocc(esk17_1(X515),esk18_1(X515),tptp0)
| ~ occurrence_of(X515,tptp0) )
& ( occurrence_of(esk19_1(X515),tptp2)
| occurrence_of(esk19_1(X515),tptp1)
| ~ occurrence_of(X515,tptp0) )
& ( next_subocc(esk18_1(X515),esk19_1(X515),tptp0)
| ~ occurrence_of(X515,tptp0) )
& ( leaf_occ(esk19_1(X515),X515)
| ~ occurrence_of(X515,tptp0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_49])])])]) ).
fof(c_0_15,negated_conjecture,
! [X520,X521] :
( occurrence_of(esk20_0,tptp0)
& ( ~ occurrence_of(X521,tptp2)
| ~ occurrence_of(X520,tptp3)
| ~ root_occ(X520,esk20_0)
| ~ min_precedes(X520,X521,tptp0)
| ~ leaf_occ(X521,esk20_0) )
& ( ~ occurrence_of(X521,tptp1)
| ~ occurrence_of(X520,tptp3)
| ~ root_occ(X520,esk20_0)
| ~ min_precedes(X520,X521,tptp0)
| ~ leaf_occ(X521,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_13])])])])]) ).
fof(c_0_16,plain,
! [X401,X402,X403,X404,X405,X406,X407] :
( ( min_precedes(X401,X402,X403)
| ~ next_subocc(X401,X402,X403) )
& ( ~ min_precedes(X401,X404,X403)
| ~ min_precedes(X404,X402,X403)
| ~ next_subocc(X401,X402,X403) )
& ( min_precedes(X405,esk8_3(X405,X406,X407),X407)
| ~ min_precedes(X405,X406,X407)
| next_subocc(X405,X406,X407) )
& ( min_precedes(esk8_3(X405,X406,X407),X406,X407)
| ~ min_precedes(X405,X406,X407)
| next_subocc(X405,X406,X407) ) ),
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_17,plain,
( next_subocc(esk18_1(X1),esk19_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,negated_conjecture,
occurrence_of(esk20_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [X341,X342,X343] :
( ~ occurrence_of(X341,X342)
| ~ occurrence_of(X341,X343)
| X342 = X343 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])]) ).
fof(c_0_20,plain,
! [X453,X454,X456,X457,X458] :
( ( occurrence_of(X454,esk15_2(X453,X454))
| ~ leaf_occ(X453,X454) )
& ( subactivity_occurrence(X453,X454)
| ~ leaf_occ(X453,X454) )
& ( leaf(X453,esk15_2(X453,X454))
| ~ leaf_occ(X453,X454) )
& ( ~ occurrence_of(X457,X458)
| ~ subactivity_occurrence(X456,X457)
| ~ leaf(X456,X458)
| leaf_occ(X456,X457) ) ),
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_21,plain,
( leaf_occ(esk19_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,plain,
! [X375,X376,X377] :
( ~ min_precedes(X375,X376,X377)
| precedes(X375,X376) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_15])]) ).
cnf(c_0_23,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
next_subocc(esk18_1(esk20_0),esk19_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( next_subocc(esk17_1(X1),esk18_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_26,plain,
( X2 = X3
| ~ occurrence_of(X1,X2)
| ~ occurrence_of(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( occurrence_of(X1,esk15_2(X2,X1))
| ~ leaf_occ(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
leaf_occ(esk19_1(esk20_0),esk20_0),
inference(spm,[status(thm)],[c_0_21,c_0_18]) ).
fof(c_0_29,plain,
! [X36,X37,X38] :
( min_precedes(X36,X37,X38)
=> ~ root(X37,X38) ),
inference(fof_simplification,[status(thm)],[sos_14]) ).
fof(c_0_30,plain,
! [X358,X359] :
( ( earlier(X358,X359)
| ~ precedes(X358,X359) )
& ( legal(X359)
| ~ precedes(X358,X359) )
& ( ~ earlier(X358,X359)
| ~ legal(X359)
| precedes(X358,X359) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])]) ).
cnf(c_0_31,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,negated_conjecture,
min_precedes(esk18_1(esk20_0),esk19_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,negated_conjecture,
next_subocc(esk17_1(esk20_0),esk18_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_34,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk20_0,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_35,negated_conjecture,
occurrence_of(esk20_0,esk15_2(esk19_1(esk20_0),esk20_0)),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_36,plain,
! [X372,X373,X374] :
( ~ min_precedes(X372,X373,X374)
| ~ root(X373,X374) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])]) ).
fof(c_0_37,plain,
! [X347,X348,X349] :
( ~ earlier(X347,X348)
| ~ earlier(X348,X349)
| earlier(X347,X349) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_05])]) ).
cnf(c_0_38,plain,
( earlier(X1,X2)
| ~ precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,negated_conjecture,
precedes(esk18_1(esk20_0),esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,negated_conjecture,
min_precedes(esk17_1(esk20_0),esk18_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_23,c_0_33]) ).
fof(c_0_41,plain,
! [X135,X136,X137,X138] :
( ( occurrence_of(X136,X135)
& subactivity_occurrence(X137,X136)
& root_occ(X138,X136)
& arboreal(X137)
& ~ min_precedes(X138,X137,X135) )
=> X138 = X137 ),
inference(fof_simplification,[status(thm)],[sos_42]) ).
fof(c_0_42,plain,
! [X393,X394,X396,X397,X398,X399] :
( ( root(X393,X394)
| min_precedes(esk6_2(X393,X394),X393,X394)
| ~ leaf(X393,X394) )
& ( ~ min_precedes(X393,X396,X394)
| ~ leaf(X393,X394) )
& ( ~ root(X397,X398)
| min_precedes(X397,esk7_2(X397,X398),X398)
| leaf(X397,X398) )
& ( ~ min_precedes(X399,X397,X398)
| min_precedes(X397,esk7_2(X397,X398),X398)
| leaf(X397,X398) ) ),
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_43,plain,
( leaf(X1,esk15_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_44,negated_conjecture,
esk15_2(esk19_1(esk20_0),esk20_0) = tptp0,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,plain,
( ~ min_precedes(X1,X2,X3)
| ~ root(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_46,plain,
( earlier(X1,X3)
| ~ earlier(X1,X2)
| ~ earlier(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_47,negated_conjecture,
earlier(esk18_1(esk20_0),esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_48,negated_conjecture,
precedes(esk17_1(esk20_0),esk18_1(esk20_0)),
inference(spm,[status(thm)],[c_0_31,c_0_40]) ).
cnf(c_0_49,negated_conjecture,
( ~ occurrence_of(X1,tptp1)
| ~ occurrence_of(X2,tptp3)
| ~ root_occ(X2,esk20_0)
| ~ min_precedes(X2,X1,tptp0)
| ~ leaf_occ(X1,esk20_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_50,plain,
( occurrence_of(esk19_1(X1),tptp2)
| occurrence_of(esk19_1(X1),tptp1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_51,negated_conjecture,
( ~ occurrence_of(X1,tptp2)
| ~ occurrence_of(X2,tptp3)
| ~ root_occ(X2,esk20_0)
| ~ min_precedes(X2,X1,tptp0)
| ~ leaf_occ(X1,esk20_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_52,plain,
! [X488,X489,X490,X491] :
( ~ occurrence_of(X489,X488)
| ~ subactivity_occurrence(X490,X489)
| ~ root_occ(X491,X489)
| ~ arboreal(X490)
| min_precedes(X491,X490,X488)
| X491 = X490 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])]) ).
cnf(c_0_53,plain,
( root_occ(esk17_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_54,plain,
! [X496,X497,X498] :
( ( arboreal(X496)
| ~ next_subocc(X496,X497,X498) )
& ( arboreal(X497)
| ~ next_subocc(X496,X497,X498) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_44])])]) ).
fof(c_0_55,plain,
! [X382,X383,X384,X385] :
( ~ min_precedes(X382,X383,X385)
| ~ min_precedes(X382,X384,X385)
| ~ precedes(X383,X384)
| min_precedes(X383,X384,X385) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_18])]) ).
cnf(c_0_56,plain,
( root(X1,X2)
| min_precedes(esk6_2(X1,X2),X1,X2)
| ~ leaf(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_57,negated_conjecture,
leaf(esk19_1(esk20_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_28]),c_0_44]) ).
cnf(c_0_58,negated_conjecture,
~ root(esk19_1(esk20_0),tptp0),
inference(spm,[status(thm)],[c_0_45,c_0_32]) ).
cnf(c_0_59,negated_conjecture,
( earlier(X1,esk19_1(esk20_0))
| ~ earlier(X1,esk18_1(esk20_0)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_60,negated_conjecture,
earlier(esk17_1(esk20_0),esk18_1(esk20_0)),
inference(spm,[status(thm)],[c_0_38,c_0_48]) ).
cnf(c_0_61,plain,
( legal(X1)
| ~ precedes(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_62,negated_conjecture,
( ~ root_occ(X1,esk20_0)
| ~ min_precedes(X1,esk19_1(esk20_0),tptp0)
| ~ occurrence_of(esk19_1(esk20_0),tptp1)
| ~ occurrence_of(X1,tptp3) ),
inference(spm,[status(thm)],[c_0_49,c_0_28]) ).
cnf(c_0_63,negated_conjecture,
( occurrence_of(esk19_1(esk20_0),tptp1)
| occurrence_of(esk19_1(esk20_0),tptp2) ),
inference(spm,[status(thm)],[c_0_50,c_0_18]) ).
cnf(c_0_64,negated_conjecture,
( ~ root_occ(X1,esk20_0)
| ~ min_precedes(X1,esk19_1(esk20_0),tptp0)
| ~ occurrence_of(esk19_1(esk20_0),tptp2)
| ~ occurrence_of(X1,tptp3) ),
inference(spm,[status(thm)],[c_0_51,c_0_28]) ).
cnf(c_0_65,plain,
( occurrence_of(esk17_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_66,plain,
( min_precedes(X4,X3,X2)
| X4 = X3
| ~ occurrence_of(X1,X2)
| ~ subactivity_occurrence(X3,X1)
| ~ root_occ(X4,X1)
| ~ arboreal(X3) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_67,negated_conjecture,
root_occ(esk17_1(esk20_0),esk20_0),
inference(spm,[status(thm)],[c_0_53,c_0_18]) ).
cnf(c_0_68,plain,
( subactivity_occurrence(X1,X2)
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_69,plain,
( arboreal(X1)
| ~ next_subocc(X2,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_70,plain,
( min_precedes(X2,X4,X3)
| ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X1,X4,X3)
| ~ precedes(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_71,negated_conjecture,
min_precedes(esk6_2(esk19_1(esk20_0),tptp0),esk19_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_72,plain,
( precedes(X1,X2)
| ~ earlier(X1,X2)
| ~ legal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_73,negated_conjecture,
earlier(esk17_1(esk20_0),esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_74,negated_conjecture,
legal(esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_61,c_0_39]) ).
cnf(c_0_75,negated_conjecture,
( ~ root_occ(X1,esk20_0)
| ~ min_precedes(X1,esk19_1(esk20_0),tptp0)
| ~ occurrence_of(X1,tptp3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).
cnf(c_0_76,negated_conjecture,
occurrence_of(esk17_1(esk20_0),tptp3),
inference(spm,[status(thm)],[c_0_65,c_0_18]) ).
cnf(c_0_77,negated_conjecture,
( X1 = esk17_1(esk20_0)
| min_precedes(esk17_1(esk20_0),X1,X2)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1)
| ~ occurrence_of(esk20_0,X2) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_78,negated_conjecture,
subactivity_occurrence(esk19_1(esk20_0),esk20_0),
inference(spm,[status(thm)],[c_0_68,c_0_28]) ).
cnf(c_0_79,negated_conjecture,
arboreal(esk19_1(esk20_0)),
inference(spm,[status(thm)],[c_0_69,c_0_24]) ).
cnf(c_0_80,negated_conjecture,
( min_precedes(X1,esk19_1(esk20_0),tptp0)
| ~ min_precedes(esk6_2(esk19_1(esk20_0),tptp0),X1,tptp0)
| ~ precedes(X1,esk19_1(esk20_0)) ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_81,negated_conjecture,
precedes(esk17_1(esk20_0),esk19_1(esk20_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).
cnf(c_0_82,negated_conjecture,
~ min_precedes(esk17_1(esk20_0),esk19_1(esk20_0),tptp0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_67]),c_0_76])]) ).
cnf(c_0_83,negated_conjecture,
( esk17_1(esk20_0) = esk19_1(esk20_0)
| min_precedes(esk17_1(esk20_0),esk19_1(esk20_0),X1)
| ~ occurrence_of(esk20_0,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79])]) ).
cnf(c_0_84,negated_conjecture,
~ min_precedes(esk6_2(esk19_1(esk20_0),tptp0),esk17_1(esk20_0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]) ).
cnf(c_0_85,negated_conjecture,
esk17_1(esk20_0) = esk19_1(esk20_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_18]),c_0_82]) ).
cnf(c_0_86,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85]),c_0_71])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PRO009+3 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n023.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:31:38 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.34/1.74 % Version : CSE_E---1.7
% 1.34/1.74 % Problem : theBenchmark.p
% 1.34/1.74 % SZS status Theorem for theBenchmark.p
% 1.34/1.74 % SZS output start CNFRefutation
% See solution above
% 1.34/1.74 % Total time : 1.372s
%------------------------------------------------------------------------------