%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PRO012+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:33 PM UTC 2026
% Result : Theorem 2.62s 0.83s
% Output : CNFRefutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 24
% Syntax : Number of formulae : 160 ( 58 unt; 0 def)
% Number of atoms : 414 ( 49 equ)
% Maximal formula atoms : 17 ( 2 avg)
% Number of connectives : 421 ( 167 ~; 173 |; 57 &)
% ( 5 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-3 aty)
% Number of variables : 206 ( 6 sgn 103 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X111] :
( occurrence_of(X111,tptp0)
=> ? [X112,X113] :
( min_precedes(X112,X113,tptp0)
& ( occurrence_of(X113,tptp1)
| occurrence_of(X113,tptp2) )
& root_occ(X112,X111)
& occurrence_of(X112,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(sos_35,axiom,
! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108,X109] :
( ! [X110] :
( min_precedes(X107,X110,tptp0)
=> ( X110 = X109
| X110 = X108 ) )
& min_precedes(X108,X109,tptp0)
& ( occurrence_of(X109,tptp1)
| occurrence_of(X109,tptp2) )
& min_precedes(X107,X108,tptp0)
& occurrence_of(X108,tptp4)
& root_occ(X107,X106)
& occurrence_of(X107,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_35) ).
fof(sos,axiom,
! [X1,X2] :
( occurrence_of(X2,X1)
=> ( activity_occurrence(X2)
& activity(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X7)
& occurrence_of(X5,X6) )
=> X6 = X7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_02) ).
fof(sos_33,axiom,
! [X100,X101] :
( root_occ(X100,X101)
<=> ? [X102] :
( root(X100,X102)
& subactivity_occurrence(X100,X101)
& occurrence_of(X101,X102) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_33) ).
fof(sos_01,axiom,
! [X3] :
( activity_occurrence(X3)
=> ? [X4] :
( occurrence_of(X3,X4)
& activity(X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_01) ).
fof(sos_15,axiom,
! [X39,X40,X41] :
( min_precedes(X39,X40,X41)
=> precedes(X39,X40) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_15) ).
fof(sos_03,axiom,
! [X8] :
( activity(X8)
=> subactivity(X8,X8) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_03) ).
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_10,axiom,
! [X22,X23] :
( precedes(X22,X23)
<=> ( legal(X23)
& earlier(X22,X23) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_10) ).
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/sandbox2/benchmark/theBenchmark.p',sos_21) ).
fof(sos_08,axiom,
! [X19] :
( legal(X19)
=> arboreal(X19) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(sos_23,axiom,
! [X65,X66] :
( atocc(X65,X66)
<=> ? [X67] :
( occurrence_of(X65,X67)
& atomic(X67)
& subactivity(X66,X67) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_23) ).
fof(sos_29,axiom,
! [X84,X85,X86,X87] :
( ( subactivity_occurrence(X85,X87)
& occurrence_of(X87,X86)
& min_precedes(X84,X85,X86) )
=> subactivity_occurrence(X84,X87) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_29) ).
fof(sos_41,axiom,
atomic(tptp3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_41) ).
fof(sos_17,axiom,
! [X44,X45] :
( ( legal(X44)
& atocc(X44,X45) )
=> root(X44,X45) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_17) ).
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/sandbox2/benchmark/theBenchmark.p',sos_25) ).
fof(sos_09,axiom,
! [X20,X21] :
( ( earlier(X21,X20)
& legal(X20) )
=> legal(X21) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_09) ).
fof(sos_12,axiom,
! [X29,X30] :
( root(X30,X29)
=> ? [X31] :
( atocc(X30,X31)
& subactivity(X31,X29) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_12) ).
fof(sos_28,axiom,
! [X80,X81,X82,X83] :
( ( subactivity_occurrence(X83,X81)
& subactivity_occurrence(X82,X81)
& arboreal(X83)
& arboreal(X82)
& occurrence_of(X81,X80) )
=> ( X82 = X83
| min_precedes(X83,X82,X80)
| min_precedes(X82,X83,X80) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_28) ).
fof(sos_47,axiom,
tptp2 != tptp1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_47) ).
fof(sos_14,axiom,
! [X36,X37,X38] :
( min_precedes(X36,X37,X38)
=> ~ root(X37,X38) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_14) ).
fof(sos_46,axiom,
tptp3 != tptp1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_46) ).
fof(sos_45,axiom,
tptp3 != tptp2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_45) ).
fof(c_0_24,negated_conjecture,
~ ! [X111] :
( occurrence_of(X111,tptp0)
=> ? [X112,X113] :
( min_precedes(X112,X113,tptp0)
& ( occurrence_of(X113,tptp1)
| occurrence_of(X113,tptp2) )
& root_occ(X112,X111)
& occurrence_of(X112,tptp3) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_25,plain,
! [X236,X240] :
( ( ~ occurrence_of(X236,tptp0)
| X240 = esk18_1(X236)
| X240 = esk17_1(X236)
| ~ min_precedes(esk16_1(X236),X240,tptp0) )
& ( ~ occurrence_of(X236,tptp0)
| min_precedes(esk17_1(X236),esk18_1(X236),tptp0) )
& ( ~ occurrence_of(X236,tptp0)
| occurrence_of(esk18_1(X236),tptp1)
| occurrence_of(esk18_1(X236),tptp2) )
& ( ~ occurrence_of(X236,tptp0)
| min_precedes(esk16_1(X236),esk17_1(X236),tptp0) )
& ( ~ occurrence_of(X236,tptp0)
| occurrence_of(esk17_1(X236),tptp4) )
& ( ~ occurrence_of(X236,tptp0)
| root_occ(esk16_1(X236),X236) )
& ( ~ occurrence_of(X236,tptp0)
| occurrence_of(esk16_1(X236),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(fof_nnf,[status(thm)],[sos_35])])])])])]) ).
fof(c_0_26,negated_conjecture,
! [X242,X243] :
( ( ~ min_precedes(X242,X243,tptp0)
| ~ root_occ(X242,esk19_0)
| ~ occurrence_of(X242,tptp3)
| ~ occurrence_of(X243,tptp1) )
& ( ~ min_precedes(X242,X243,tptp0)
| ~ root_occ(X242,esk19_0)
| ~ occurrence_of(X242,tptp3)
| ~ occurrence_of(X243,tptp2) )
& occurrence_of(esk19_0,tptp0) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])])])])]) ).
fof(c_0_27,plain,
! [X114,X115] :
( ( ~ occurrence_of(X115,X114)
| activity_occurrence(X115) )
& ( ~ occurrence_of(X115,X114)
| activity(X114) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])])]) ).
cnf(c_0_28,plain,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk18_1(X1),tptp1)
| occurrence_of(esk18_1(X1),tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,negated_conjecture,
occurrence_of(esk19_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_30,plain,
! [X118,X119,X120] :
( X119 = X120
| ~ occurrence_of(X118,X120)
| ~ occurrence_of(X118,X119) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])])]) ).
fof(c_0_31,plain,
! [X224,X225,X227,X228,X229] :
( ( root_occ(X227,X228)
| ~ root(X227,X229)
| ~ subactivity_occurrence(X227,X228)
| ~ occurrence_of(X228,X229) )
& ( ~ root_occ(X224,X225)
| root(X224,esk14_2(X224,X225)) )
& ( ~ root_occ(X224,X225)
| subactivity_occurrence(X224,X225) )
& ( ~ root_occ(X224,X225)
| occurrence_of(X225,esk14_2(X224,X225)) ) ),
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_33])])])])])])]) ).
cnf(c_0_32,plain,
( ~ occurrence_of(X1,tptp0)
| root_occ(esk16_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_33,plain,
! [X116] :
( ( ~ activity_occurrence(X116)
| occurrence_of(X116,esk1_1(X116)) )
& ( ~ activity_occurrence(X116)
| activity(esk1_1(X116)) ) ),
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])])])])]) ).
cnf(c_0_34,plain,
( ~ occurrence_of(X1,X2)
| activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp2)
| occurrence_of(esk18_1(esk19_0),tptp1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_36,plain,
! [X152,X153,X154] :
( precedes(X152,X153)
| ~ min_precedes(X152,X153,X154) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_15])])]) ).
cnf(c_0_37,plain,
( ~ occurrence_of(X1,tptp0)
| min_precedes(esk17_1(X1),esk18_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,plain,
( ~ occurrence_of(X1,X3)
| ~ occurrence_of(X1,X2)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
( ~ root_occ(X2,X1)
| occurrence_of(X1,esk14_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,negated_conjecture,
root_occ(esk16_1(esk19_0),esk19_0),
inference(spm,[status(thm)],[c_0_32,c_0_29]) ).
fof(c_0_41,plain,
! [X121] :
( subactivity(X121,X121)
| ~ activity(X121) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_03])])]) ).
fof(c_0_42,plain,
! [X130,X131] :
( ( ~ occurrence_of(X130,X131)
| arboreal(X130)
| ~ atomic(X131) )
& ( ~ occurrence_of(X130,X131)
| atomic(X131)
| ~ arboreal(X130) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])])]) ).
cnf(c_0_43,plain,
( ~ activity_occurrence(X1)
| occurrence_of(X1,esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_44,negated_conjecture,
activity_occurrence(esk18_1(esk19_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_34]) ).
fof(c_0_45,plain,
! [X135,X136] :
( ( precedes(X135,X136)
| ~ legal(X136)
| ~ earlier(X135,X136) )
& ( ~ precedes(X135,X136)
| legal(X136) )
& ( ~ precedes(X135,X136)
| earlier(X135,X136) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])])]) ).
cnf(c_0_46,plain,
( ~ min_precedes(X1,X2,X3)
| precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_47,negated_conjecture,
min_precedes(esk17_1(esk19_0),esk18_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_37,c_0_29]) ).
cnf(c_0_48,negated_conjecture,
( ~ occurrence_of(esk19_0,X1)
| X1 = tptp0 ),
inference(spm,[status(thm)],[c_0_38,c_0_29]) ).
cnf(c_0_49,negated_conjecture,
occurrence_of(esk19_0,esk14_2(esk16_1(esk19_0),esk19_0)),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_50,plain,
! [X170,X171,X173,X174,X175,X176] :
( ( leaf(X174,X175)
| min_precedes(X174,esk7_2(X174,X175),X175)
| ~ min_precedes(X176,X174,X175) )
& ( leaf(X174,X175)
| min_precedes(X174,esk7_2(X174,X175),X175)
| ~ root(X174,X175) )
& ( ~ leaf(X170,X171)
| ~ min_precedes(X170,X173,X171) )
& ( ~ leaf(X170,X171)
| min_precedes(esk6_2(X170,X171),X170,X171)
| root(X170,X171) ) ),
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_51,plain,
( ~ occurrence_of(X1,tptp0)
| min_precedes(esk16_1(X1),esk17_1(X1),tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_52,plain,
( ~ occurrence_of(X1,tptp0)
| occurrence_of(esk16_1(X1),tptp3) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_53,plain,
( ~ activity(X1)
| subactivity(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_54,plain,
( ~ activity_occurrence(X1)
| activity(esk1_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_55,plain,
( ~ occurrence_of(X1,X2)
| ~ arboreal(X1)
| atomic(X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_56,negated_conjecture,
occurrence_of(esk18_1(esk19_0),esk1_1(esk18_1(esk19_0))),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
fof(c_0_57,plain,
! [X132] :
( arboreal(X132)
| ~ legal(X132) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_08])])]) ).
cnf(c_0_58,plain,
( ~ precedes(X2,X1)
| legal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_59,negated_conjecture,
precedes(esk17_1(esk19_0),esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_60,plain,
( ~ root_occ(X1,X2)
| root(X1,esk14_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_61,negated_conjecture,
esk14_2(esk16_1(esk19_0),esk19_0) = tptp0,
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_62,plain,
( ~ leaf(X1,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_63,negated_conjecture,
min_precedes(esk16_1(esk19_0),esk17_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_51,c_0_29]) ).
cnf(c_0_64,plain,
( ~ occurrence_of(X2,X1)
| activity(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_65,negated_conjecture,
occurrence_of(esk16_1(esk19_0),tptp3),
inference(spm,[status(thm)],[c_0_52,c_0_29]) ).
fof(c_0_66,plain,
! [X186,X187,X189,X190,X191] :
( ( atocc(X189,X190)
| ~ occurrence_of(X189,X191)
| ~ atomic(X191)
| ~ subactivity(X190,X191) )
& ( ~ atocc(X186,X187)
| occurrence_of(X186,esk9_2(X186,X187)) )
& ( ~ atocc(X186,X187)
| atomic(esk9_2(X186,X187)) )
& ( ~ atocc(X186,X187)
| subactivity(X187,esk9_2(X186,X187)) ) ),
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_23])])])])])])]) ).
cnf(c_0_67,plain,
( ~ activity_occurrence(X1)
| subactivity(esk1_1(X1),esk1_1(X1)) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_68,negated_conjecture,
( ~ arboreal(esk18_1(esk19_0))
| atomic(esk1_1(esk18_1(esk19_0))) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_69,plain,
( ~ legal(X1)
| arboreal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_70,negated_conjecture,
legal(esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_71,plain,
( ~ occurrence_of(X1,tptp0)
| ~ min_precedes(esk16_1(X1),X2,tptp0)
| X2 = esk18_1(X1)
| X2 = esk17_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_72,plain,
( ~ root(X1,X2)
| leaf(X1,X2)
| min_precedes(X1,esk7_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_73,negated_conjecture,
root(esk16_1(esk19_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_40]),c_0_61]) ).
cnf(c_0_74,negated_conjecture,
~ leaf(esk16_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_75,negated_conjecture,
( ~ min_precedes(X2,X1,tptp0)
| ~ root_occ(X2,esk19_0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_76,negated_conjecture,
( ~ min_precedes(X2,X1,tptp0)
| ~ root_occ(X2,esk19_0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_77,negated_conjecture,
activity(tptp3),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_78,plain,
( ~ occurrence_of(X3,X2)
| ~ atomic(X2)
| ~ subactivity(X1,X2)
| atocc(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_79,negated_conjecture,
subactivity(esk1_1(esk18_1(esk19_0)),esk1_1(esk18_1(esk19_0))),
inference(spm,[status(thm)],[c_0_67,c_0_44]) ).
cnf(c_0_80,negated_conjecture,
atomic(esk1_1(esk18_1(esk19_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]) ).
fof(c_0_81,plain,
! [X208,X209,X210,X211] :
( subactivity_occurrence(X208,X211)
| ~ subactivity_occurrence(X209,X211)
| ~ occurrence_of(X211,X210)
| ~ min_precedes(X208,X209,X210) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])])]) ).
cnf(c_0_82,negated_conjecture,
( ~ min_precedes(esk16_1(esk19_0),X1,tptp0)
| X1 = esk17_1(esk19_0)
| X1 = esk18_1(esk19_0) ),
inference(spm,[status(thm)],[c_0_71,c_0_29]) ).
cnf(c_0_83,negated_conjecture,
min_precedes(esk16_1(esk19_0),esk7_2(esk16_1(esk19_0),tptp0),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]) ).
cnf(c_0_84,negated_conjecture,
( ~ occurrence_of(X1,tptp1)
| ~ min_precedes(esk16_1(esk19_0),X1,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_40]),c_0_65])]) ).
cnf(c_0_85,negated_conjecture,
( ~ occurrence_of(X1,tptp2)
| ~ min_precedes(esk16_1(esk19_0),X1,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_40]),c_0_65])]) ).
cnf(c_0_86,negated_conjecture,
subactivity(tptp3,tptp3),
inference(spm,[status(thm)],[c_0_53,c_0_77]) ).
cnf(c_0_87,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_41]) ).
fof(c_0_88,plain,
! [X157,X158] :
( root(X157,X158)
| ~ legal(X157)
| ~ atocc(X157,X158) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_17])])]) ).
cnf(c_0_89,negated_conjecture,
( ~ occurrence_of(X1,esk1_1(esk18_1(esk19_0)))
| atocc(X1,esk1_1(esk18_1(esk19_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]) ).
fof(c_0_90,plain,
! [X194,X195,X196] :
( ( ~ min_precedes(X195,X196,X194)
| subactivity_occurrence(X196,esk10_3(X194,X195,X196)) )
& ( ~ min_precedes(X195,X196,X194)
| subactivity_occurrence(X195,esk10_3(X194,X195,X196)) )
& ( ~ min_precedes(X195,X196,X194)
| occurrence_of(esk10_3(X194,X195,X196),X194) ) ),
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_91,plain,
( ~ subactivity_occurrence(X2,X4)
| ~ occurrence_of(X4,X3)
| ~ min_precedes(X1,X2,X3)
| subactivity_occurrence(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_92,negated_conjecture,
( esk7_2(esk16_1(esk19_0),tptp0) = esk18_1(esk19_0)
| esk7_2(esk16_1(esk19_0),tptp0) = esk17_1(esk19_0) ),
inference(spm,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_93,negated_conjecture,
~ min_precedes(esk16_1(esk19_0),esk18_1(esk19_0),tptp0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_35]),c_0_85]) ).
cnf(c_0_94,negated_conjecture,
( ~ occurrence_of(X1,tptp3)
| atocc(X1,tptp3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_86]),c_0_87])]) ).
fof(c_0_95,plain,
! [X133,X134] :
( legal(X134)
| ~ earlier(X134,X133)
| ~ legal(X133) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_09])])]) ).
cnf(c_0_96,plain,
( ~ precedes(X1,X2)
| earlier(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_97,negated_conjecture,
precedes(esk16_1(esk19_0),esk17_1(esk19_0)),
inference(spm,[status(thm)],[c_0_46,c_0_63]) ).
cnf(c_0_98,negated_conjecture,
( ~ occurrence_of(esk18_1(esk19_0),X1)
| occurrence_of(esk18_1(esk19_0),tptp2)
| X1 = tptp1 ),
inference(spm,[status(thm)],[c_0_38,c_0_35]) ).
fof(c_0_99,plain,
! [X142,X143] :
( ( ~ root(X143,X142)
| atocc(X143,esk4_2(X142,X143)) )
& ( ~ root(X143,X142)
| subactivity(esk4_2(X142,X143),X142) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_12])])])])]) ).
cnf(c_0_100,plain,
( ~ legal(X1)
| ~ atocc(X1,X2)
| root(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_88]) ).
cnf(c_0_101,negated_conjecture,
atocc(esk18_1(esk19_0),esk1_1(esk18_1(esk19_0))),
inference(spm,[status(thm)],[c_0_89,c_0_56]) ).
fof(c_0_102,plain,
! [X204,X205,X206,X207] :
( X206 = X207
| min_precedes(X207,X206,X204)
| min_precedes(X206,X207,X204)
| ~ subactivity_occurrence(X207,X205)
| ~ subactivity_occurrence(X206,X205)
| ~ arboreal(X207)
| ~ arboreal(X206)
| ~ occurrence_of(X205,X204) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_28])])]) ).
cnf(c_0_103,plain,
( ~ min_precedes(X3,X1,X2)
| subactivity_occurrence(X1,esk10_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_104,plain,
( ~ occurrence_of(X2,X1)
| ~ atomic(X1)
| arboreal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_105,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(esk7_2(esk16_1(esk19_0),tptp0),X1)
| subactivity_occurrence(esk16_1(esk19_0),X1) ),
inference(spm,[status(thm)],[c_0_91,c_0_83]) ).
cnf(c_0_106,negated_conjecture,
esk7_2(esk16_1(esk19_0),tptp0) = esk17_1(esk19_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_92]),c_0_93]) ).
cnf(c_0_107,plain,
( ~ min_precedes(X2,X3,X1)
| occurrence_of(esk10_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_108,plain,
( ~ min_precedes(X1,X3,X2)
| subactivity_occurrence(X1,esk10_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_90]) ).
cnf(c_0_109,negated_conjecture,
atocc(esk16_1(esk19_0),tptp3),
inference(spm,[status(thm)],[c_0_94,c_0_65]) ).
cnf(c_0_110,plain,
( ~ earlier(X2,X1)
| ~ legal(X1)
| legal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_95]) ).
cnf(c_0_111,negated_conjecture,
earlier(esk16_1(esk19_0),esk17_1(esk19_0)),
inference(spm,[status(thm)],[c_0_96,c_0_97]) ).
cnf(c_0_112,negated_conjecture,
legal(esk17_1(esk19_0)),
inference(spm,[status(thm)],[c_0_58,c_0_97]) ).
cnf(c_0_113,negated_conjecture,
( ~ occurrence_of(esk18_1(esk19_0),X1)
| X1 = esk1_1(esk18_1(esk19_0)) ),
inference(spm,[status(thm)],[c_0_38,c_0_56]) ).
cnf(c_0_114,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp2)
| esk1_1(esk18_1(esk19_0)) = tptp1 ),
inference(spm,[status(thm)],[c_0_98,c_0_56]) ).
cnf(c_0_115,plain,
( ~ root(X1,X2)
| atocc(X1,esk4_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_99]) ).
cnf(c_0_116,negated_conjecture,
root(esk18_1(esk19_0),esk1_1(esk18_1(esk19_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_70])]) ).
cnf(c_0_117,plain,
( ~ subactivity_occurrence(X4,X1)
| ~ subactivity_occurrence(X3,X1)
| ~ arboreal(X4)
| ~ arboreal(X3)
| ~ occurrence_of(X1,X2)
| X3 = X4
| min_precedes(X4,X3,X2)
| min_precedes(X3,X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_102]) ).
cnf(c_0_118,negated_conjecture,
subactivity_occurrence(esk18_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
inference(spm,[status(thm)],[c_0_103,c_0_47]) ).
cnf(c_0_119,negated_conjecture,
arboreal(esk18_1(esk19_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_56]),c_0_80])]) ).
cnf(c_0_120,negated_conjecture,
( ~ occurrence_of(X1,tptp0)
| ~ subactivity_occurrence(esk17_1(esk19_0),X1)
| subactivity_occurrence(esk16_1(esk19_0),X1) ),
inference(rw,[status(thm)],[c_0_105,c_0_106]) ).
cnf(c_0_121,negated_conjecture,
occurrence_of(esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)),tptp0),
inference(spm,[status(thm)],[c_0_107,c_0_47]) ).
cnf(c_0_122,negated_conjecture,
subactivity_occurrence(esk17_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
inference(spm,[status(thm)],[c_0_108,c_0_47]) ).
cnf(c_0_123,negated_conjecture,
( ~ legal(esk16_1(esk19_0))
| root(esk16_1(esk19_0),tptp3) ),
inference(spm,[status(thm)],[c_0_100,c_0_109]) ).
cnf(c_0_124,negated_conjecture,
legal(esk16_1(esk19_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112])]) ).
cnf(c_0_125,negated_conjecture,
( esk1_1(esk18_1(esk19_0)) = tptp2
| esk1_1(esk18_1(esk19_0)) = tptp1 ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_126,plain,
( ~ atocc(X1,X2)
| occurrence_of(X1,esk9_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_127,negated_conjecture,
atocc(esk18_1(esk19_0),esk4_2(esk1_1(esk18_1(esk19_0)),esk18_1(esk19_0))),
inference(spm,[status(thm)],[c_0_115,c_0_116]) ).
fof(c_0_128,plain,
tptp2 != tptp1,
inference(fof_simplification,[status(thm)],[sos_47]) ).
fof(c_0_129,plain,
! [X36,X37,X38] :
( min_precedes(X36,X37,X38)
=> ~ root(X37,X38) ),
inference(fof_simplification,[status(thm)],[sos_14]) ).
cnf(c_0_130,negated_conjecture,
( ~ occurrence_of(esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)),X2)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)))
| min_precedes(esk18_1(esk19_0),X1,X2)
| min_precedes(X1,esk18_1(esk19_0),X2)
| X1 = esk18_1(esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_119])]) ).
cnf(c_0_131,negated_conjecture,
subactivity_occurrence(esk16_1(esk19_0),esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_120,c_0_121]),c_0_122])]) ).
cnf(c_0_132,negated_conjecture,
arboreal(esk16_1(esk19_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_65]),c_0_87])]) ).
cnf(c_0_133,negated_conjecture,
root(esk16_1(esk19_0),tptp3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_123,c_0_124])]) ).
cnf(c_0_134,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp1)
| esk1_1(esk18_1(esk19_0)) = tptp2 ),
inference(spm,[status(thm)],[c_0_56,c_0_125]) ).
cnf(c_0_135,negated_conjecture,
occurrence_of(esk18_1(esk19_0),esk9_2(esk18_1(esk19_0),esk4_2(esk1_1(esk18_1(esk19_0)),esk18_1(esk19_0)))),
inference(spm,[status(thm)],[c_0_126,c_0_127]) ).
fof(c_0_136,plain,
tptp2 != tptp1,
inference(fof_nnf,[status(thm)],[c_0_128]) ).
fof(c_0_137,plain,
! [X149,X150,X151] :
( ~ root(X150,X151)
| ~ min_precedes(X149,X150,X151) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_129])])]) ).
cnf(c_0_138,negated_conjecture,
( ~ occurrence_of(esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)),X1)
| min_precedes(esk16_1(esk19_0),esk18_1(esk19_0),X1)
| min_precedes(esk18_1(esk19_0),esk16_1(esk19_0),X1)
| esk18_1(esk19_0) = esk16_1(esk19_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_132])]) ).
cnf(c_0_139,negated_conjecture,
activity_occurrence(esk16_1(esk19_0)),
inference(spm,[status(thm)],[c_0_34,c_0_65]) ).
cnf(c_0_140,negated_conjecture,
atocc(esk16_1(esk19_0),esk4_2(tptp3,esk16_1(esk19_0))),
inference(spm,[status(thm)],[c_0_115,c_0_133]) ).
fof(c_0_141,plain,
tptp3 != tptp1,
inference(fof_simplification,[status(thm)],[sos_46]) ).
fof(c_0_142,plain,
tptp3 != tptp2,
inference(fof_simplification,[status(thm)],[sos_45]) ).
cnf(c_0_143,negated_conjecture,
( ~ occurrence_of(esk18_1(esk19_0),X1)
| X1 = tptp1
| esk1_1(esk18_1(esk19_0)) = tptp2 ),
inference(spm,[status(thm)],[c_0_38,c_0_134]) ).
cnf(c_0_144,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp2)
| esk9_2(esk18_1(esk19_0),esk4_2(esk1_1(esk18_1(esk19_0)),esk18_1(esk19_0))) = tptp1 ),
inference(spm,[status(thm)],[c_0_98,c_0_135]) ).
cnf(c_0_145,plain,
tptp2 != tptp1,
inference(split_conjunct,[status(thm)],[c_0_136]) ).
cnf(c_0_146,plain,
( ~ root(X2,X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_137]) ).
cnf(c_0_147,negated_conjecture,
( min_precedes(esk18_1(esk19_0),esk16_1(esk19_0),tptp0)
| esk18_1(esk19_0) = esk16_1(esk19_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_121]),c_0_93]) ).
cnf(c_0_148,negated_conjecture,
( ~ occurrence_of(esk16_1(esk19_0),X1)
| X1 = tptp3 ),
inference(spm,[status(thm)],[c_0_38,c_0_65]) ).
cnf(c_0_149,negated_conjecture,
occurrence_of(esk16_1(esk19_0),esk1_1(esk16_1(esk19_0))),
inference(spm,[status(thm)],[c_0_43,c_0_139]) ).
cnf(c_0_150,negated_conjecture,
occurrence_of(esk16_1(esk19_0),esk9_2(esk16_1(esk19_0),esk4_2(tptp3,esk16_1(esk19_0)))),
inference(spm,[status(thm)],[c_0_126,c_0_140]) ).
fof(c_0_151,plain,
tptp3 != tptp1,
inference(fof_nnf,[status(thm)],[c_0_141]) ).
fof(c_0_152,plain,
tptp3 != tptp2,
inference(fof_nnf,[status(thm)],[c_0_142]) ).
cnf(c_0_153,negated_conjecture,
( esk1_1(esk18_1(esk19_0)) = tptp2
| esk9_2(esk18_1(esk19_0),esk4_2(esk1_1(esk18_1(esk19_0)),esk18_1(esk19_0))) = tptp1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_145]) ).
cnf(c_0_154,negated_conjecture,
esk18_1(esk19_0) = esk16_1(esk19_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_73])]) ).
cnf(c_0_155,negated_conjecture,
esk1_1(esk16_1(esk19_0)) = tptp3,
inference(spm,[status(thm)],[c_0_148,c_0_149]) ).
cnf(c_0_156,negated_conjecture,
esk9_2(esk16_1(esk19_0),esk4_2(tptp3,esk16_1(esk19_0))) = tptp3,
inference(spm,[status(thm)],[c_0_148,c_0_150]) ).
cnf(c_0_157,plain,
tptp3 != tptp1,
inference(split_conjunct,[status(thm)],[c_0_151]) ).
cnf(c_0_158,plain,
tptp3 != tptp2,
inference(split_conjunct,[status(thm)],[c_0_152]) ).
cnf(c_0_159,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_153,c_0_154]),c_0_154]),c_0_155]),c_0_154]),c_0_156]),c_0_154]),c_0_155]),c_0_157]),c_0_158]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PRO012+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 03:42:35 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.62/0.83 % Version: 3.5.1
% 2.62/0.83 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.62/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.62/0.83 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.62/0.83 % Starting new_bool_3 with 300s (1) cores
% 2.62/0.83 % Starting new_bool_1 with 300s (1) cores
% 2.62/0.83 % Starting sh5l with 300s (1) cores
% 2.62/0.83 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2167092 completed with status 0
% 2.62/0.83 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.62/0.83 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.62/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.62/0.83 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.62/0.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.62/0.83 % No SInE strategy applied
% 2.62/0.83 % Search class: FGHSF-FFMM32-SFFFFFNN
% 2.62/0.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.62/0.83 % Starting SubtermCWHack with 136s (1) cores
% 2.62/0.83 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.62/0.83 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 2.62/0.83 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 136s (1) cores
% 2.62/0.83 % Starting G-E--_107_C48_F1_PI_AE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 2.62/0.83 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with pid 2167109 completed with status 0
% 2.62/0.83 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI
% 2.62/0.83 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.62/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.62/0.83 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.62/0.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.62/0.83 % No SInE strategy applied
% 2.62/0.83 % Search class: FGHSF-FFMM32-SFFFFFNN
% 2.62/0.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.62/0.83 % Starting SubtermCWHack with 136s (1) cores
% 2.62/0.83 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.62/0.83 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2SI with 136s (1) cores
% 2.62/0.83 % Preprocessing time : 0.002 s
% 2.62/0.83 % Presaturation interreduction done
% 2.62/0.83
% 2.62/0.83 % Proof found!
% 2.62/0.83 % SZS status Theorem
% 2.62/0.83 % SZS output start CNFRefutation
% See solution above
% 2.62/0.83 % Parsed axioms : 49
% 2.62/0.83 % Removed by relevancy pruning/SinE : 0
% 2.62/0.83 % Initial clauses : 88
% 2.62/0.83 % Removed in clause preprocessing : 0
% 2.62/0.83 % Initial clauses in saturation : 88
% 2.62/0.83 % Processed clauses : 3532
% 2.62/0.83 % ...of these trivial : 87
% 2.62/0.83 % ...subsumed : 1367
% 2.62/0.83 % ...remaining for further processing : 2078
% 2.62/0.83 % Other redundant clauses eliminated : 0
% 2.62/0.83 % Clauses deleted for lack of memory : 0
% 2.62/0.83 % Backward-subsumed : 3
% 2.62/0.83 % Backward-rewritten : 670
% 2.62/0.83 % Generated clauses : 9174
% 2.62/0.83 % ...of the previous two non-redundant : 8043
% 2.62/0.83 % ...aggressively subsumed : 0
% 2.62/0.83 % Contextual simplify-reflections : 23
% 2.62/0.83 % Paramodulations : 9168
% 2.62/0.83 % Factorizations : 6
% 2.62/0.83 % NegExts : 0
% 2.62/0.83 % Equation resolutions : 0
% 2.62/0.83 % Disequality decompositions : 0
% 2.62/0.83 % Total rewrite steps : 2879
% 2.62/0.83 % ...of those cached : 2581
% 2.62/0.83 % Propositional unsat checks : 0
% 2.62/0.83 % Propositional check models : 0
% 2.62/0.83 % Propositional check unsatisfiable : 0
% 2.62/0.83 % Propositional clauses : 0
% 2.62/0.83 % Propositional clauses after purity: 0
% 2.62/0.83 % Propositional unsat core size : 0
% 2.62/0.83 % Propositional preprocessing time : 0.000
% 2.62/0.83 % Propositional encoding time : 0.000
% 2.62/0.83 % Propositional solver time : 0.000
% 2.62/0.83 % Success case prop preproc time : 0.000
% 2.62/0.83 % Success case prop encoding time : 0.000
% 2.62/0.83 % Success case prop solver time : 0.000
% 2.62/0.83 % Current number of processed clauses : 1317
% 2.62/0.83 % Positive orientable unit clauses : 606
% 2.62/0.83 % Positive unorientable unit clauses: 0
% 2.62/0.83 % Negative unit clauses : 122
% 2.62/0.83 % Non-unit-clauses : 589
% 2.62/0.83 % Current number of unprocessed clauses: 4318
% 2.62/0.83 % ...number of literals in the above : 10662
% 2.62/0.83 % Current number of archived formulas : 0
% 2.62/0.83 % Current number of archived clauses : 761
% 2.62/0.83 % Clause-clause subsumption calls (NU) : 106651
% 2.62/0.83 % Rec. Clause-clause subsumption calls : 68241
% 2.62/0.83 % Non-unit clause-clause subsumptions : 1241
% 2.62/0.83 % Unit Clause-clause subsumption calls : 7487
% 2.62/0.83 % Rewrite failures with RHS unbound : 0
% 2.62/0.83 % BW rewrite match attempts : 1146
% 2.62/0.83 % BW rewrite match successes : 61
% 2.62/0.83 % Condensation attempts : 0
% 2.62/0.83 % Condensation successes : 0
% 2.62/0.83 % Termbank termtop insertions : 214542
% 2.62/0.83 % Search garbage collected termcells : 1363
% 2.62/0.83
% 2.62/0.83 % -------------------------------------------------
% 2.62/0.83 % User time : 0.345 s
% 2.62/0.83 % System time : 0.033 s
% 2.62/0.83 % Total time : 0.378 s
% 2.62/0.83 % Maximum resident set size: 4000 pages
% 2.62/0.83
% 2.62/0.83 % -------------------------------------------------
% 2.62/0.83 % User time : 1.643 s
% 2.62/0.83 % System time : 0.099 s
% 2.62/0.83 % Total time : 1.742 s
% 2.62/0.83 % Maximum resident set size: 4608 pages
% 2.62/0.83 % E exiting
%------------------------------------------------------------------------------