%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PRO012+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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 : 600s
% DateTime : Mon Jul 18 17:45:01 EDT 2022
% Result : Theorem 0.43s 41.60s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 17
% Syntax : Number of formulae : 99 ( 28 unt; 0 def)
% Number of atoms : 310 ( 22 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 338 ( 127 ~; 137 |; 55 &)
% ( 4 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 16 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-3 aty)
% Number of variables : 167 ( 9 sgn 88 !; 13 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X111] :
( occurrence_of(X111,tptp0)
=> ? [X112,X113] :
( occurrence_of(X112,tptp3)
& root_occ(X112,X111)
& ( occurrence_of(X113,tptp2)
| occurrence_of(X113,tptp1) )
& min_precedes(X112,X113,tptp0) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(sos_35,axiom,
! [X106] :
( occurrence_of(X106,tptp0)
=> ? [X107,X108,X109] :
( occurrence_of(X107,tptp3)
& root_occ(X107,X106)
& occurrence_of(X108,tptp4)
& min_precedes(X107,X108,tptp0)
& ( occurrence_of(X109,tptp2)
| occurrence_of(X109,tptp1) )
& min_precedes(X108,X109,tptp0)
& ! [X110] :
( min_precedes(X107,X110,tptp0)
=> ( X110 = X108
| X110 = X109 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_35) ).
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/sandbox/solver/bin/../tmp/theBenchmark.p',sos_25) ).
fof(sos_11,axiom,
! [X24,X25,X26] :
( min_precedes(X25,X26,X24)
=> ? [X27,X28] :
( subactivity(X27,X24)
& subactivity(X28,X24)
& atocc(X25,X27)
& atocc(X26,X28) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_11) ).
fof(sos_02,axiom,
! [X5,X6,X7] :
( ( occurrence_of(X5,X6)
& occurrence_of(X5,X7) )
=> X6 = X7 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_02) ).
fof(sos_01,axiom,
! [X3] :
( activity_occurrence(X3)
=> ? [X4] :
( activity(X4)
& occurrence_of(X3,X4) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_01) ).
fof(sos,axiom,
! [X1,X2] :
( occurrence_of(X2,X1)
=> ( activity(X1)
& activity_occurrence(X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos) ).
fof(sos_23,axiom,
! [X65,X66] :
( atocc(X65,X66)
<=> ? [X67] :
( subactivity(X66,X67)
& atomic(X67)
& occurrence_of(X65,X67) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_23) ).
fof(sos_28,axiom,
! [X80,X81,X82,X83] :
( ( occurrence_of(X81,X80)
& arboreal(X82)
& arboreal(X83)
& subactivity_occurrence(X82,X81)
& subactivity_occurrence(X83,X81) )
=> ( min_precedes(X82,X83,X80)
| min_precedes(X83,X82,X80)
| X82 = X83 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_28) ).
fof(sos_07,axiom,
! [X17,X18] :
( occurrence_of(X17,X18)
=> ( arboreal(X17)
<=> atomic(X18) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_07) ).
fof(sos_29,axiom,
! [X84,X85,X86,X87] :
( ( min_precedes(X84,X85,X86)
& occurrence_of(X87,X86)
& subactivity_occurrence(X85,X87) )
=> subactivity_occurrence(X84,X87) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_29) ).
fof(sos_33,axiom,
! [X100,X101] :
( root_occ(X100,X101)
<=> ? [X102] :
( occurrence_of(X101,X102)
& subactivity_occurrence(X100,X101)
& root(X100,X102) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_33) ).
fof(sos_41,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_41) ).
fof(sos_14,axiom,
! [X36,X37,X38] :
( min_precedes(X36,X37,X38)
=> ~ root(X37,X38) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_14) ).
fof(sos_15,axiom,
! [X39,X40,X41] :
( min_precedes(X39,X40,X41)
=> precedes(X39,X40) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_15) ).
fof(sos_10,axiom,
! [X22,X23] :
( precedes(X22,X23)
<=> ( earlier(X22,X23)
& legal(X23) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_10) ).
fof(sos_04,axiom,
! [X9,X10] :
( earlier(X9,X10)
=> ~ earlier(X10,X9) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_04) ).
fof(c_0_17,negated_conjecture,
~ ! [X111] :
( occurrence_of(X111,tptp0)
=> ? [X112,X113] :
( occurrence_of(X112,tptp3)
& root_occ(X112,X111)
& ( occurrence_of(X113,tptp2)
| occurrence_of(X113,tptp1) )
& min_precedes(X112,X113,tptp0) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_18,plain,
! [X111,X115] :
( ( occurrence_of(esk16_1(X111),tptp3)
| ~ occurrence_of(X111,tptp0) )
& ( root_occ(esk16_1(X111),X111)
| ~ occurrence_of(X111,tptp0) )
& ( occurrence_of(esk17_1(X111),tptp4)
| ~ occurrence_of(X111,tptp0) )
& ( min_precedes(esk16_1(X111),esk17_1(X111),tptp0)
| ~ occurrence_of(X111,tptp0) )
& ( occurrence_of(esk18_1(X111),tptp2)
| occurrence_of(esk18_1(X111),tptp1)
| ~ occurrence_of(X111,tptp0) )
& ( min_precedes(esk17_1(X111),esk18_1(X111),tptp0)
| ~ occurrence_of(X111,tptp0) )
& ( ~ min_precedes(esk16_1(X111),X115,tptp0)
| X115 = esk17_1(X111)
| X115 = esk18_1(X111)
| ~ occurrence_of(X111,tptp0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_35])])])])])])]) ).
fof(c_0_19,negated_conjecture,
! [X115,X116] :
( occurrence_of(esk19_0,tptp0)
& ( ~ occurrence_of(X116,tptp2)
| ~ occurrence_of(X115,tptp3)
| ~ root_occ(X115,esk19_0)
| ~ min_precedes(X115,X116,tptp0) )
& ( ~ occurrence_of(X116,tptp1)
| ~ occurrence_of(X115,tptp3)
| ~ root_occ(X115,esk19_0)
| ~ min_precedes(X115,X116,tptp0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])])])])]) ).
fof(c_0_20,plain,
! [X74,X75,X76] :
( ( occurrence_of(esk10_3(X74,X75,X76),X74)
| ~ min_precedes(X75,X76,X74) )
& ( subactivity_occurrence(X75,esk10_3(X74,X75,X76))
| ~ min_precedes(X75,X76,X74) )
& ( subactivity_occurrence(X76,esk10_3(X74,X75,X76))
| ~ min_precedes(X75,X76,X74) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_25])])])])])]) ).
cnf(c_0_21,plain,
( min_precedes(esk17_1(X1),esk18_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,negated_conjecture,
occurrence_of(esk19_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_23,plain,
! [X29,X30,X31] :
( ( subactivity(esk2_3(X29,X30,X31),X29)
| ~ min_precedes(X30,X31,X29) )
& ( subactivity(esk3_3(X29,X30,X31),X29)
| ~ min_precedes(X30,X31,X29) )
& ( atocc(X30,esk2_3(X29,X30,X31))
| ~ min_precedes(X30,X31,X29) )
& ( atocc(X31,esk3_3(X29,X30,X31))
| ~ min_precedes(X30,X31,X29) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_11])])])])])]) ).
fof(c_0_24,plain,
! [X8,X9,X10] :
( ~ occurrence_of(X8,X9)
| ~ occurrence_of(X8,X10)
| X9 = X10 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_02])]) ).
fof(c_0_25,plain,
! [X5] :
( ( activity(esk1_1(X5))
| ~ activity_occurrence(X5) )
& ( occurrence_of(X5,esk1_1(X5))
| ~ activity_occurrence(X5) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_01])])])])])]) ).
fof(c_0_26,plain,
! [X3,X4] :
( ( activity(X3)
| ~ occurrence_of(X4,X3) )
& ( activity_occurrence(X4)
| ~ occurrence_of(X4,X3) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])])]) ).
cnf(c_0_27,plain,
( occurrence_of(esk10_3(X3,X1,X2),X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
min_precedes(esk17_1(esk19_0),esk18_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_29,plain,
! [X68,X69,X68,X69,X71] :
( ( subactivity(X69,esk9_2(X68,X69))
| ~ atocc(X68,X69) )
& ( atomic(esk9_2(X68,X69))
| ~ atocc(X68,X69) )
& ( occurrence_of(X68,esk9_2(X68,X69))
| ~ atocc(X68,X69) )
& ( ~ subactivity(X69,X71)
| ~ atomic(X71)
| ~ occurrence_of(X68,X71)
| atocc(X68,X69) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_23])])])])])])]) ).
cnf(c_0_30,plain,
( atocc(X2,esk3_3(X3,X1,X2))
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_31,plain,
! [X84,X85,X86,X87] :
( ~ occurrence_of(X85,X84)
| ~ arboreal(X86)
| ~ arboreal(X87)
| ~ subactivity_occurrence(X86,X85)
| ~ subactivity_occurrence(X87,X85)
| min_precedes(X86,X87,X84)
| min_precedes(X87,X86,X84)
| X86 = X87 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_28])]) ).
cnf(c_0_32,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
( occurrence_of(X1,esk1_1(X1))
| ~ activity_occurrence(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
( activity_occurrence(X1)
| ~ occurrence_of(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,negated_conjecture,
occurrence_of(esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)),tptp0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_36,plain,
! [X19,X20] :
( ( ~ arboreal(X19)
| atomic(X20)
| ~ occurrence_of(X19,X20) )
& ( ~ atomic(X20)
| arboreal(X19)
| ~ occurrence_of(X19,X20) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_07])])]) ).
cnf(c_0_37,plain,
( occurrence_of(X1,esk9_2(X1,X2))
| ~ atocc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_38,negated_conjecture,
atocc(esk18_1(esk19_0),esk3_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
inference(spm,[status(thm)],[c_0_30,c_0_28]) ).
cnf(c_0_39,plain,
( atomic(esk9_2(X1,X2))
| ~ atocc(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_40,plain,
! [X88,X89,X90,X91] :
( ~ min_precedes(X88,X89,X90)
| ~ occurrence_of(X91,X90)
| ~ subactivity_occurrence(X89,X91)
| subactivity_occurrence(X88,X91) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_29])]) ).
fof(c_0_41,plain,
! [X103,X104,X103,X104,X106] :
( ( occurrence_of(X104,esk14_2(X103,X104))
| ~ root_occ(X103,X104) )
& ( subactivity_occurrence(X103,X104)
| ~ root_occ(X103,X104) )
& ( root(X103,esk14_2(X103,X104))
| ~ root_occ(X103,X104) )
& ( ~ occurrence_of(X104,X106)
| ~ subactivity_occurrence(X103,X104)
| ~ root(X103,X106)
| root_occ(X103,X104) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_33])])])])])])]) ).
cnf(c_0_42,plain,
( root_occ(esk16_1(X1),X1)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_43,plain,
( X1 = X2
| min_precedes(X2,X1,X3)
| min_precedes(X1,X2,X3)
| ~ subactivity_occurrence(X2,X4)
| ~ subactivity_occurrence(X1,X4)
| ~ arboreal(X2)
| ~ arboreal(X1)
| ~ occurrence_of(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_44,plain,
( subactivity_occurrence(X2,esk10_3(X3,X1,X2))
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_45,plain,
( X1 = esk1_1(X2)
| ~ activity_occurrence(X2)
| ~ occurrence_of(X2,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_46,negated_conjecture,
activity_occurrence(esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_47,plain,
( arboreal(X1)
| ~ occurrence_of(X1,X2)
| ~ atomic(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_48,negated_conjecture,
occurrence_of(esk18_1(esk19_0),esk9_2(esk18_1(esk19_0),esk3_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_49,negated_conjecture,
atomic(esk9_2(esk18_1(esk19_0),esk3_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)))),
inference(spm,[status(thm)],[c_0_39,c_0_38]) ).
cnf(c_0_50,plain,
( subactivity_occurrence(X1,X2)
| ~ subactivity_occurrence(X3,X2)
| ~ occurrence_of(X2,X4)
| ~ min_precedes(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_51,plain,
( min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_52,plain,
( subactivity_occurrence(X1,esk10_3(X3,X1,X2))
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_53,plain,
( occurrence_of(esk16_1(X1),tptp3)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_54,plain,
( occurrence_of(X2,esk14_2(X1,X2))
| ~ root_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_55,negated_conjecture,
root_occ(esk16_1(esk19_0),esk19_0),
inference(spm,[status(thm)],[c_0_42,c_0_22]) ).
cnf(c_0_56,plain,
( occurrence_of(esk18_1(X1),tptp1)
| occurrence_of(esk18_1(X1),tptp2)
| ~ occurrence_of(X1,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_57,plain,
( X1 = X2
| min_precedes(X2,X1,esk1_1(X3))
| min_precedes(X1,X2,esk1_1(X3))
| ~ subactivity_occurrence(X2,X3)
| ~ subactivity_occurrence(X1,X3)
| ~ arboreal(X2)
| ~ arboreal(X1)
| ~ activity_occurrence(X3) ),
inference(spm,[status(thm)],[c_0_43,c_0_33]) ).
cnf(c_0_58,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_44,c_0_28]) ).
cnf(c_0_59,negated_conjecture,
esk1_1(esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0))) = tptp0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_35]),c_0_46])]) ).
cnf(c_0_60,negated_conjecture,
arboreal(esk18_1(esk19_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]) ).
cnf(c_0_61,negated_conjecture,
( subactivity_occurrence(X1,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)))
| ~ subactivity_occurrence(X2,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)))
| ~ min_precedes(X1,X2,tptp0) ),
inference(spm,[status(thm)],[c_0_50,c_0_35]) ).
cnf(c_0_62,negated_conjecture,
min_precedes(esk16_1(esk19_0),esk17_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_51,c_0_22]) ).
cnf(c_0_63,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_52,c_0_28]) ).
cnf(c_0_64,negated_conjecture,
occurrence_of(esk16_1(esk19_0),tptp3),
inference(spm,[status(thm)],[c_0_53,c_0_22]) ).
cnf(c_0_65,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_41]) ).
cnf(c_0_66,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk19_0,X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_22]) ).
cnf(c_0_67,negated_conjecture,
occurrence_of(esk19_0,esk14_2(esk16_1(esk19_0),esk19_0)),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_68,negated_conjecture,
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,esk19_0)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_69,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp2)
| occurrence_of(esk18_1(esk19_0),tptp1) ),
inference(spm,[status(thm)],[c_0_56,c_0_22]) ).
fof(c_0_70,plain,
! [X39,X40,X41] :
( ~ min_precedes(X39,X40,X41)
| ~ root(X40,X41) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[sos_14])])]) ).
cnf(c_0_71,negated_conjecture,
( X1 = esk18_1(esk19_0)
| min_precedes(esk18_1(esk19_0),X1,tptp0)
| min_precedes(X1,esk18_1(esk19_0),tptp0)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk17_1(esk19_0),esk18_1(esk19_0)))
| ~ arboreal(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_59]),c_0_60]),c_0_46])]) ).
cnf(c_0_72,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_61,c_0_62]),c_0_63])]) ).
cnf(c_0_73,negated_conjecture,
arboreal(esk16_1(esk19_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_64]),c_0_65])]) ).
cnf(c_0_74,plain,
( root(X1,esk14_2(X1,X2))
| ~ root_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_75,negated_conjecture,
esk14_2(esk16_1(esk19_0),esk19_0) = tptp0,
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_76,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp2)
| ~ root_occ(X1,esk19_0)
| ~ min_precedes(X1,esk18_1(esk19_0),tptp0)
| ~ occurrence_of(X1,tptp3) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_77,plain,
( ~ root(X1,X2)
| ~ min_precedes(X3,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_70]) ).
cnf(c_0_78,negated_conjecture,
( esk18_1(esk19_0) = esk16_1(esk19_0)
| min_precedes(esk18_1(esk19_0),esk16_1(esk19_0),tptp0)
| min_precedes(esk16_1(esk19_0),esk18_1(esk19_0),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73])]) ).
cnf(c_0_79,negated_conjecture,
root(esk16_1(esk19_0),tptp0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_55]),c_0_75]) ).
fof(c_0_80,plain,
! [X42,X43,X44] :
( ~ min_precedes(X42,X43,X44)
| precedes(X42,X43) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_15])])])]) ).
cnf(c_0_81,negated_conjecture,
( occurrence_of(esk18_1(esk19_0),tptp2)
| ~ min_precedes(esk16_1(esk19_0),esk18_1(esk19_0),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_64]),c_0_55])]) ).
cnf(c_0_82,negated_conjecture,
( esk18_1(esk19_0) = esk16_1(esk19_0)
| min_precedes(esk16_1(esk19_0),esk18_1(esk19_0),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79])]) ).
fof(c_0_83,plain,
! [X24,X25,X24,X25] :
( ( earlier(X24,X25)
| ~ precedes(X24,X25) )
& ( legal(X25)
| ~ precedes(X24,X25) )
& ( ~ earlier(X24,X25)
| ~ legal(X25)
| precedes(X24,X25) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_10])])])])]) ).
cnf(c_0_84,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_80]) ).
cnf(c_0_85,negated_conjecture,
( ~ min_precedes(X1,X2,tptp0)
| ~ root_occ(X1,esk19_0)
| ~ occurrence_of(X1,tptp3)
| ~ occurrence_of(X2,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_86,negated_conjecture,
( esk18_1(esk19_0) = esk16_1(esk19_0)
| occurrence_of(esk18_1(esk19_0),tptp2) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
fof(c_0_87,plain,
! [X11,X12] :
( ~ earlier(X11,X12)
| ~ earlier(X12,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[sos_04])])]) ).
cnf(c_0_88,plain,
( earlier(X1,X2)
| ~ precedes(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_83]) ).
cnf(c_0_89,negated_conjecture,
precedes(esk17_1(esk19_0),esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_84,c_0_28]) ).
cnf(c_0_90,negated_conjecture,
( esk18_1(esk19_0) = esk16_1(esk19_0)
| ~ root_occ(X1,esk19_0)
| ~ min_precedes(X1,esk18_1(esk19_0),tptp0)
| ~ occurrence_of(X1,tptp3) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_91,plain,
( ~ earlier(X1,X2)
| ~ earlier(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_87]) ).
cnf(c_0_92,negated_conjecture,
earlier(esk17_1(esk19_0),esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_88,c_0_89]) ).
cnf(c_0_93,negated_conjecture,
( esk18_1(esk19_0) = esk16_1(esk19_0)
| ~ min_precedes(esk16_1(esk19_0),esk18_1(esk19_0),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_64]),c_0_55])]) ).
cnf(c_0_94,negated_conjecture,
precedes(esk16_1(esk19_0),esk17_1(esk19_0)),
inference(spm,[status(thm)],[c_0_84,c_0_62]) ).
cnf(c_0_95,negated_conjecture,
~ earlier(esk18_1(esk19_0),esk17_1(esk19_0)),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_96,negated_conjecture,
esk18_1(esk19_0) = esk16_1(esk19_0),
inference(spm,[status(thm)],[c_0_93,c_0_82]) ).
cnf(c_0_97,negated_conjecture,
earlier(esk16_1(esk19_0),esk17_1(esk19_0)),
inference(spm,[status(thm)],[c_0_88,c_0_94]) ).
cnf(c_0_98,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96]),c_0_97])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PRO012+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 01:01:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.33/23.40 eprover: CPU time limit exceeded, terminating
% 0.33/23.41 eprover: CPU time limit exceeded, terminating
% 0.33/23.42 eprover: CPU time limit exceeded, terminating
% 0.42/39.50 eprover: CPU time limit exceeded, terminating
% 0.43/41.60 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.43/41.60 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.43/41.60 # Preprocessing time : 0.016 s
% 0.43/41.60
% 0.43/41.60 # Failure: Out of unprocessed clauses!
% 0.43/41.60 # OLD status GaveUp
% 0.43/41.60 # Parsed axioms : 49
% 0.43/41.60 # Removed by relevancy pruning/SinE : 24
% 0.43/41.60 # Initial clauses : 41
% 0.43/41.60 # Removed in clause preprocessing : 0
% 0.43/41.60 # Initial clauses in saturation : 41
% 0.43/41.60 # Processed clauses : 35597
% 0.43/41.60 # ...of these trivial : 344
% 0.43/41.60 # ...subsumed : 3228
% 0.43/41.60 # ...remaining for further processing : 32025
% 0.43/41.60 # Other redundant clauses eliminated : 0
% 0.43/41.60 # Clauses deleted for lack of memory : 25800
% 0.43/41.60 # Backward-subsumed : 406
% 0.43/41.60 # Backward-rewritten : 2255
% 0.43/41.60 # Generated clauses : 73639
% 0.43/41.60 # ...of the previous two non-trivial : 65052
% 0.43/41.60 # Contextual simplify-reflections : 203
% 0.43/41.60 # Paramodulations : 73639
% 0.43/41.60 # Factorizations : 0
% 0.43/41.60 # Equation resolutions : 0
% 0.43/41.60 # Current number of processed clauses : 29364
% 0.43/41.60 # Positive orientable unit clauses : 14502
% 0.43/41.60 # Positive unorientable unit clauses: 0
% 0.43/41.60 # Negative unit clauses : 1343
% 0.43/41.60 # Non-unit-clauses : 13519
% 0.43/41.60 # Current number of unprocessed clauses: 0
% 0.43/41.60 # ...number of literals in the above : 0
% 0.43/41.60 # Current number of archived formulas : 0
% 0.43/41.60 # Current number of archived clauses : 2661
% 0.43/41.60 # Clause-clause subsumption calls (NU) : 24416384
% 0.43/41.60 # Rec. Clause-clause subsumption calls : 22477988
% 0.43/41.60 # Non-unit clause-clause subsumptions : 968
% 0.43/41.60 # Unit Clause-clause subsumption calls : 2593997
% 0.43/41.60 # Rewrite failures with RHS unbound : 0
% 0.43/41.60 # BW rewrite match attempts : 2211631
% 0.43/41.60 # BW rewrite match successes : 1502
% 0.43/41.60 # Condensation attempts : 0
% 0.43/41.60 # Condensation successes : 0
% 0.43/41.60 # Termbank termtop insertions : 6002662
% 0.43/41.60
% 0.43/41.60 # -------------------------------------------------
% 0.43/41.60 # User time : 15.816 s
% 0.43/41.60 # System time : 0.221 s
% 0.43/41.60 # Total time : 16.037 s
% 0.43/41.60 # Maximum resident set size: 259872 pages
% 0.43/41.60 # Running protocol protocol_eprover_230b6c199cce1dcf6700db59e75a93feb83d1bd9 for 23 seconds:
% 0.43/41.60 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,01,20000,1.0)
% 0.43/41.60 # Preprocessing time : 0.008 s
% 0.43/41.60
% 0.43/41.60 # Failure: Out of unprocessed clauses!
% 0.43/41.60 # OLD status GaveUp
% 0.43/41.60 # Parsed axioms : 49
% 0.43/41.60 # Removed by relevancy pruning/SinE : 37
% 0.43/41.60 # Initial clauses : 23
% 0.43/41.60 # Removed in clause preprocessing : 0
% 0.43/41.60 # Initial clauses in saturation : 23
% 0.43/41.60 # Processed clauses : 75
% 0.43/41.60 # ...of these trivial : 0
% 0.43/41.60 # ...subsumed : 28
% 0.43/41.60 # ...remaining for further processing : 47
% 0.43/41.60 # Other redundant clauses eliminated : 0
% 0.43/41.60 # Clauses deleted for lack of memory : 0
% 0.43/41.60 # Backward-subsumed : 0
% 0.43/41.60 # Backward-rewritten : 0
% 0.43/41.60 # Generated clauses : 54
% 0.43/41.60 # ...of the previous two non-trivial : 52
% 0.43/41.60 # Contextual simplify-reflections : 25
% 0.43/41.60 # Paramodulations : 54
% 0.43/41.60 # Factorizations : 0
% 0.43/41.60 # Equation resolutions : 0
% 0.43/41.60 # Current number of processed clauses : 47
% 0.43/41.60 # Positive orientable unit clauses : 5
% 0.43/41.60 # Positive unorientable unit clauses: 0
% 0.43/41.60 # Negative unit clauses : 6
% 0.43/41.60 # Non-unit-clauses : 36
% 0.43/41.60 # Current number of unprocessed clauses: 0
% 0.43/41.60 # ...number of literals in the above : 0
% 0.43/41.60 # Current number of archived formulas : 0
% 0.43/41.60 # Current number of archived clauses : 0
% 0.43/41.60 # Clause-clause subsumption calls (NU) : 657
% 0.43/41.60 # Rec. Clause-clause subsumption calls : 459
% 0.43/41.60 # Non-unit clause-clause subsumptions : 53
% 0.43/41.60 # Unit Clause-clause subsumption calls : 9
% 0.43/41.60 # Rewrite failures with RHS unbound : 0
% 0.43/41.60 # BW rewrite match attempts : 0
% 0.43/41.60 # BW rewrite match successes : 0
% 0.43/41.60 # Condensation attempts : 0
% 0.43/41.60 # Condensation successes : 0
% 0.43/41.60 # Termbank termtop insertions : 2422
% 0.43/41.60
% 0.43/41.60 # -------------------------------------------------
% 0.43/41.60 # User time : 0.010 s
% 0.43/41.60 # System time : 0.000 s
% 0.43/41.60 # Total time : 0.010 s
% 0.43/41.60 # Maximum resident set size: 3100 pages
% 0.43/41.60 # Running protocol protocol_eprover_48e494e00e0717ec2eabf59b73b2d711334607de for 23 seconds:
% 0.43/41.60
% 0.43/41.60 # Failure: Resource limit exceeded (time)
% 0.43/41.60 # OLD status Res
% 0.43/41.60 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,03,20000,1.0)
% 0.43/41.60 # Preprocessing time : 0.009 s
% 0.43/41.60 # Running protocol protocol_eprover_33aa8a325940064c53b389b41203bb48a5cb5006 for 23 seconds:
% 0.43/41.60 # Preprocessing time : 0.010 s
% 0.43/41.60
% 0.43/41.60 # Proof found!
% 0.43/41.60 # SZS status Theorem
% 0.43/41.60 # SZS output start CNFRefutation
% See solution above
% 0.43/41.60 # Proof object total steps : 99
% 0.43/41.60 # Proof object clause steps : 65
% 0.43/41.60 # Proof object formula steps : 34
% 0.43/41.60 # Proof object conjectures : 42
% 0.43/41.60 # Proof object clause conjectures : 39
% 0.43/41.60 # Proof object formula conjectures : 3
% 0.43/41.60 # Proof object initial clauses used : 27
% 0.43/41.60 # Proof object initial formulas used : 17
% 0.43/41.60 # Proof object generating inferences : 37
% 0.43/41.60 # Proof object simplifying inferences : 25
% 0.43/41.60 # Training examples: 0 positive, 0 negative
% 0.43/41.60 # Parsed axioms : 49
% 0.43/41.60 # Removed by relevancy pruning/SinE : 0
% 0.43/41.60 # Initial clauses : 88
% 0.43/41.60 # Removed in clause preprocessing : 0
% 0.43/41.60 # Initial clauses in saturation : 88
% 0.43/41.60 # Processed clauses : 16742
% 0.43/41.60 # ...of these trivial : 146
% 0.43/41.60 # ...subsumed : 7440
% 0.43/41.60 # ...remaining for further processing : 9156
% 0.43/41.60 # Other redundant clauses eliminated : 0
% 0.43/41.60 # Clauses deleted for lack of memory : 0
% 0.43/41.60 # Backward-subsumed : 58
% 0.43/41.60 # Backward-rewritten : 5119
% 0.43/41.60 # Generated clauses : 103076
% 0.43/41.60 # ...of the previous two non-trivial : 71066
% 0.43/41.60 # Contextual simplify-reflections : 0
% 0.43/41.60 # Paramodulations : 103075
% 0.43/41.60 # Factorizations : 1
% 0.43/41.60 # Equation resolutions : 0
% 0.43/41.60 # Current number of processed clauses : 3979
% 0.43/41.60 # Positive orientable unit clauses : 1857
% 0.43/41.60 # Positive unorientable unit clauses: 0
% 0.43/41.60 # Negative unit clauses : 256
% 0.43/41.60 # Non-unit-clauses : 1866
% 0.43/41.60 # Current number of unprocessed clauses: 14194
% 0.43/41.60 # ...number of literals in the above : 37035
% 0.43/41.60 # Current number of archived formulas : 0
% 0.43/41.60 # Current number of archived clauses : 5177
% 0.43/41.60 # Clause-clause subsumption calls (NU) : 731360
% 0.43/41.60 # Rec. Clause-clause subsumption calls : 620036
% 0.43/41.60 # Non-unit clause-clause subsumptions : 6659
% 0.43/41.60 # Unit Clause-clause subsumption calls : 53498
% 0.43/41.60 # Rewrite failures with RHS unbound : 0
% 0.43/41.60 # BW rewrite match attempts : 36780
% 0.43/41.60 # BW rewrite match successes : 147
% 0.43/41.60 # Condensation attempts : 0
% 0.43/41.60 # Condensation successes : 0
% 0.43/41.60 # Termbank termtop insertions : 3511177
% 0.43/41.60
% 0.43/41.60 # -------------------------------------------------
% 0.43/41.60 # User time : 1.962 s
% 0.43/41.60 # System time : 0.034 s
% 0.43/41.60 # Total time : 1.996 s
% 0.43/41.60 # Maximum resident set size: 69688 pages
% 0.43/46.42 eprover: CPU time limit exceeded, terminating
% 0.43/46.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.43 eprover: No such file or directory
% 0.43/46.43 eprover: CPU time limit exceeded, terminating
% 0.43/46.43 eprover: CPU time limit exceeded, terminating
% 0.43/46.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.43 eprover: No such file or directory
% 0.43/46.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.44 eprover: No such file or directory
% 0.43/46.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.44 eprover: No such file or directory
% 0.43/46.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.44 eprover: No such file or directory
% 0.43/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.45 eprover: No such file or directory
% 0.43/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.45 eprover: No such file or directory
% 0.43/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.45 eprover: No such file or directory
% 0.43/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.45 eprover: No such file or directory
% 0.43/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.45 eprover: No such file or directory
% 0.43/46.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.45 eprover: No such file or directory
% 0.43/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.46 eprover: No such file or directory
% 0.43/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.46 eprover: No such file or directory
% 0.43/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.46 eprover: No such file or directory
% 0.43/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.46 eprover: No such file or directory
% 0.43/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.46 eprover: No such file or directory
% 0.43/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.46 eprover: No such file or directory
% 0.43/46.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.46 eprover: No such file or directory
% 0.43/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.47 eprover: No such file or directory
% 0.43/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.47 eprover: No such file or directory
% 0.43/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.47 eprover: No such file or directory
% 0.43/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.47 eprover: No such file or directory
% 0.43/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.47 eprover: No such file or directory
% 0.43/46.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.47 eprover: No such file or directory
% 0.43/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.48 eprover: No such file or directory
% 0.43/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.48 eprover: No such file or directory
% 0.43/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.48 eprover: No such file or directory
% 0.43/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.43/46.48 eprover: No such file or directory
% 0.43/46.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.48 eprover: No such file or directory
% 0.43/46.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.43/46.49 eprover: No such file or directory
%------------------------------------------------------------------------------