TSTP Solution File: PRO018+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PRO018+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:06 EDT 2022
% Result : Theorem 0.61s 63.78s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 12
% Syntax : Number of formulae : 85 ( 25 unt; 0 def)
% Number of atoms : 440 ( 21 equ)
% Maximal formula atoms : 130 ( 5 avg)
% Number of connectives : 573 ( 218 ~; 258 |; 80 &)
% ( 4 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-3 aty)
% Number of variables : 141 ( 9 sgn 67 !; 16 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X112,X113] :
( ( occurrence_of(X113,tptp0)
& subactivity_occurrence(X112,X113)
& arboreal(X112)
& ~ leaf_occ(X112,X113) )
=> ? [X114,X115] :
( occurrence_of(X114,tptp3)
& next_subocc(X112,X114,tptp0)
& ( occurrence_of(X115,tptp1)
| occurrence_of(X115,tptp2) )
& min_precedes(X114,X115,tptp0)
& leaf_occ(X115,X113)
& ( occurrence_of(X115,tptp1)
=> ~ ? [X116] :
( occurrence_of(X116,tptp2)
& min_precedes(X114,X116,tptp0) ) )
& ( occurrence_of(X115,tptp2)
=> ~ ? [X117] :
( occurrence_of(X117,tptp1)
& min_precedes(X114,X117,tptp0) ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',goals) ).
fof(sos_35,axiom,
! [X106,X107] :
( ( occurrence_of(X107,tptp0)
& subactivity_occurrence(X106,X107)
& arboreal(X106)
& ~ leaf_occ(X106,X107) )
=> ? [X108,X109,X110] :
( occurrence_of(X108,tptp3)
& next_subocc(X106,X108,tptp0)
& occurrence_of(X109,tptp4)
& min_precedes(X108,X109,tptp0)
& ( occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& min_precedes(X109,X110,tptp0)
& ! [X111] :
( min_precedes(X108,X111,tptp0)
=> ( X111 = X109
| X111 = X110 ) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_35) ).
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/solver/bin/../tmp/theBenchmark.p',sos_22) ).
fof(sos_25,axiom,
! [X70,X71,X72] :
( min_precedes(X71,X72,X70)
=> ? [X73] :
( occurrence_of(X73,X70)
& subactivity_occurrence(X71,X73)
& subactivity_occurrence(X72,X73) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_25) ).
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_41,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_41) ).
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_34,axiom,
! [X103,X104] :
( leaf_occ(X103,X104)
<=> ? [X105] :
( occurrence_of(X104,X105)
& subactivity_occurrence(X103,X104)
& leaf(X103,X105) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_34) ).
fof(sos_21,axiom,
! [X57,X58] :
( leaf(X57,X58)
<=> ( ( root(X57,X58)
| ? [X59] : min_precedes(X59,X57,X58) )
& ~ ? [X60] : min_precedes(X57,X60,X58) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_21) ).
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/solver/bin/../tmp/theBenchmark.p',sos_18) ).
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_42,axiom,
tptp4 != tptp3,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',sos_42) ).
fof(c_0_12,negated_conjecture,
~ ! [X112,X113] :
( ( occurrence_of(X113,tptp0)
& subactivity_occurrence(X112,X113)
& arboreal(X112)
& ~ leaf_occ(X112,X113) )
=> ? [X114,X115] :
( occurrence_of(X114,tptp3)
& next_subocc(X112,X114,tptp0)
& ( occurrence_of(X115,tptp1)
| occurrence_of(X115,tptp2) )
& min_precedes(X114,X115,tptp0)
& leaf_occ(X115,X113)
& ( occurrence_of(X115,tptp1)
=> ~ ? [X116] :
( occurrence_of(X116,tptp2)
& min_precedes(X114,X116,tptp0) ) )
& ( occurrence_of(X115,tptp2)
=> ~ ? [X117] :
( occurrence_of(X117,tptp1)
& min_precedes(X114,X117,tptp0) ) ) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_13,plain,
! [X112,X113,X117] :
( ( occurrence_of(esk16_1(X112),tptp3)
| ~ occurrence_of(X113,tptp0)
| ~ subactivity_occurrence(X112,X113)
| ~ arboreal(X112)
| leaf_occ(X112,X113) )
& ( next_subocc(X112,esk16_1(X112),tptp0)
| ~ occurrence_of(X113,tptp0)
| ~ subactivity_occurrence(X112,X113)
| ~ arboreal(X112)
| leaf_occ(X112,X113) )
& ( occurrence_of(esk17_1(X112),tptp4)
| ~ occurrence_of(X113,tptp0)
| ~ subactivity_occurrence(X112,X113)
| ~ arboreal(X112)
| leaf_occ(X112,X113) )
& ( min_precedes(esk16_1(X112),esk17_1(X112),tptp0)
| ~ occurrence_of(X113,tptp0)
| ~ subactivity_occurrence(X112,X113)
| ~ arboreal(X112)
| leaf_occ(X112,X113) )
& ( occurrence_of(esk18_1(X112),tptp1)
| occurrence_of(esk18_1(X112),tptp2)
| ~ occurrence_of(X113,tptp0)
| ~ subactivity_occurrence(X112,X113)
| ~ arboreal(X112)
| leaf_occ(X112,X113) )
& ( min_precedes(esk17_1(X112),esk18_1(X112),tptp0)
| ~ occurrence_of(X113,tptp0)
| ~ subactivity_occurrence(X112,X113)
| ~ arboreal(X112)
| leaf_occ(X112,X113) )
& ( ~ min_precedes(esk16_1(X112),X117,tptp0)
| X117 = esk17_1(X112)
| X117 = esk18_1(X112)
| ~ occurrence_of(X113,tptp0)
| ~ subactivity_occurrence(X112,X113)
| ~ arboreal(X112)
| leaf_occ(X112,X113) ) ),
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)],[inference(fof_simplification,[status(thm)],[sos_35])])])])])])])]) ).
fof(c_0_14,negated_conjecture,
! [X120,X121] :
( occurrence_of(esk20_0,tptp0)
& subactivity_occurrence(esk19_0,esk20_0)
& arboreal(esk19_0)
& ~ leaf_occ(esk19_0,esk20_0)
& ( occurrence_of(X121,tptp2)
| occurrence_of(X121,tptp1)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( occurrence_of(esk22_2(X120,X121),tptp1)
| occurrence_of(X121,tptp1)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( min_precedes(X120,esk22_2(X120,X121),tptp0)
| occurrence_of(X121,tptp1)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( occurrence_of(X121,tptp2)
| occurrence_of(esk21_2(X120,X121),tptp2)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( occurrence_of(esk22_2(X120,X121),tptp1)
| occurrence_of(esk21_2(X120,X121),tptp2)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( min_precedes(X120,esk22_2(X120,X121),tptp0)
| occurrence_of(esk21_2(X120,X121),tptp2)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( occurrence_of(X121,tptp2)
| min_precedes(X120,esk21_2(X120,X121),tptp0)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( occurrence_of(esk22_2(X120,X121),tptp1)
| min_precedes(X120,esk21_2(X120,X121),tptp0)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( min_precedes(X120,esk22_2(X120,X121),tptp0)
| min_precedes(X120,esk21_2(X120,X121),tptp0)
| ~ occurrence_of(X121,tptp1)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( occurrence_of(X121,tptp2)
| occurrence_of(X121,tptp1)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( occurrence_of(esk22_2(X120,X121),tptp1)
| occurrence_of(X121,tptp1)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( min_precedes(X120,esk22_2(X120,X121),tptp0)
| occurrence_of(X121,tptp1)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( occurrence_of(X121,tptp2)
| occurrence_of(esk21_2(X120,X121),tptp2)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( occurrence_of(esk22_2(X120,X121),tptp1)
| occurrence_of(esk21_2(X120,X121),tptp2)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( min_precedes(X120,esk22_2(X120,X121),tptp0)
| occurrence_of(esk21_2(X120,X121),tptp2)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( occurrence_of(X121,tptp2)
| min_precedes(X120,esk21_2(X120,X121),tptp0)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( occurrence_of(esk22_2(X120,X121),tptp1)
| min_precedes(X120,esk21_2(X120,X121),tptp0)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) )
& ( min_precedes(X120,esk22_2(X120,X121),tptp0)
| min_precedes(X120,esk21_2(X120,X121),tptp0)
| ~ occurrence_of(X121,tptp2)
| ~ occurrence_of(X120,tptp3)
| ~ next_subocc(esk19_0,X120,tptp0)
| ~ min_precedes(X120,X121,tptp0)
| ~ leaf_occ(X121,esk20_0) ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_12])])])])])])])]) ).
cnf(c_0_15,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk16_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
occurrence_of(esk20_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X65,X66,X67,X68,X65,X66,X67] :
( ( min_precedes(X65,X66,X67)
| ~ next_subocc(X65,X66,X67) )
& ( ~ min_precedes(X65,X68,X67)
| ~ min_precedes(X68,X66,X67)
| ~ next_subocc(X65,X66,X67) )
& ( min_precedes(X65,esk8_3(X65,X66,X67),X67)
| ~ min_precedes(X65,X66,X67)
| next_subocc(X65,X66,X67) )
& ( min_precedes(esk8_3(X65,X66,X67),X66,X67)
| ~ min_precedes(X65,X66,X67)
| next_subocc(X65,X66,X67) ) ),
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_22])])])])])])]) ).
cnf(c_0_18,negated_conjecture,
( leaf_occ(X1,esk20_0)
| next_subocc(X1,esk16_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
subactivity_occurrence(esk19_0,esk20_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
arboreal(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
~ leaf_occ(esk19_0,esk20_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,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_23,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
next_subocc(esk19_0,esk16_1(esk19_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_25,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk16_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_26,plain,
( occurrence_of(esk10_3(X3,X1,X2),X3)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,negated_conjecture,
min_precedes(esk19_0,esk16_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_28,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_29,negated_conjecture,
( leaf_occ(X1,esk20_0)
| occurrence_of(esk16_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_30,negated_conjecture,
occurrence_of(esk10_3(tptp0,esk19_0,esk16_1(esk19_0)),tptp0),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( subactivity_occurrence(X2,esk10_3(X3,X1,X2))
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
( arboreal(X1)
| ~ occurrence_of(X1,X2)
| ~ atomic(X2) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,negated_conjecture,
occurrence_of(esk16_1(esk19_0),tptp3),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_34,plain,
atomic(tptp3),
inference(split_conjunct,[status(thm)],[sos_41]) ).
fof(c_0_35,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_36,plain,
! [X106,X107,X106,X107,X109] :
( ( occurrence_of(X107,esk15_2(X106,X107))
| ~ leaf_occ(X106,X107) )
& ( subactivity_occurrence(X106,X107)
| ~ leaf_occ(X106,X107) )
& ( leaf(X106,esk15_2(X106,X107))
| ~ leaf_occ(X106,X107) )
& ( ~ occurrence_of(X107,X109)
| ~ subactivity_occurrence(X106,X107)
| ~ leaf(X106,X109)
| leaf_occ(X106,X107) ) ),
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_34])])])])])])]) ).
cnf(c_0_37,negated_conjecture,
( leaf_occ(X1,esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
| next_subocc(X1,esk16_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_30]) ).
cnf(c_0_38,negated_conjecture,
subactivity_occurrence(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_39,negated_conjecture,
arboreal(esk16_1(esk19_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]) ).
cnf(c_0_40,plain,
( leaf_occ(X1,X2)
| min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_41,plain,
( X1 = X2
| ~ occurrence_of(X3,X2)
| ~ occurrence_of(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,plain,
( occurrence_of(X2,esk15_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,negated_conjecture,
( leaf_occ(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
| next_subocc(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39])]) ).
fof(c_0_44,plain,
! [X61,X62,X64,X61,X62,X65] :
( ( root(X61,X62)
| min_precedes(esk6_2(X61,X62),X61,X62)
| ~ leaf(X61,X62) )
& ( ~ min_precedes(X61,X64,X62)
| ~ leaf(X61,X62) )
& ( ~ root(X61,X62)
| min_precedes(X61,esk7_2(X61,X62),X62)
| leaf(X61,X62) )
& ( ~ min_precedes(X65,X61,X62)
| min_precedes(X61,esk7_2(X61,X62),X62)
| leaf(X61,X62) ) ),
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_21])])])])])])]) ).
cnf(c_0_45,negated_conjecture,
( leaf_occ(X1,esk20_0)
| min_precedes(esk16_1(X1),esk17_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_16]) ).
cnf(c_0_46,plain,
( leaf(X1,esk15_2(X1,X2))
| ~ leaf_occ(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_47,negated_conjecture,
( X1 = tptp0
| ~ occurrence_of(esk10_3(tptp0,esk19_0,esk16_1(esk19_0)),X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_30]) ).
cnf(c_0_48,negated_conjecture,
( next_subocc(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0)
| occurrence_of(esk10_3(tptp0,esk19_0,esk16_1(esk19_0)),esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,plain,
( ~ leaf(X1,X2)
| ~ min_precedes(X1,X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,negated_conjecture,
min_precedes(esk16_1(esk19_0),esk17_1(esk19_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_51,negated_conjecture,
( next_subocc(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0)
| leaf(esk16_1(esk19_0),esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))) ),
inference(spm,[status(thm)],[c_0_46,c_0_43]) ).
cnf(c_0_52,negated_conjecture,
( esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) = tptp0
| next_subocc(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,negated_conjecture,
~ leaf(esk16_1(esk19_0),tptp0),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
( leaf_occ(X1,X2)
| min_precedes(esk17_1(X1),esk18_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_55,negated_conjecture,
next_subocc(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]) ).
fof(c_0_56,plain,
! [X50,X51,X52,X53] :
( ~ min_precedes(X50,X51,X53)
| ~ min_precedes(X50,X52,X53)
| ~ precedes(X51,X52)
| min_precedes(X51,X52,X53) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos_18])]) ).
cnf(c_0_57,plain,
( ~ next_subocc(X1,X2,X3)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_58,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk17_1(X1),tptp4)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_59,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_60,negated_conjecture,
( leaf_occ(X1,esk20_0)
| min_precedes(esk17_1(X1),esk18_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_16]) ).
cnf(c_0_61,plain,
( leaf_occ(X1,X2)
| X3 = esk18_1(X1)
| X3 = esk17_1(X1)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0)
| ~ min_precedes(esk16_1(X1),X3,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_62,negated_conjecture,
min_precedes(esk16_1(esk19_0),esk16_1(esk16_1(esk19_0)),tptp0),
inference(spm,[status(thm)],[c_0_23,c_0_55]) ).
cnf(c_0_63,plain,
( min_precedes(X1,X2,X3)
| ~ precedes(X1,X2)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X4,X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_64,negated_conjecture,
( ~ min_precedes(X1,esk16_1(esk16_1(esk19_0)),tptp0)
| ~ min_precedes(esk16_1(esk19_0),X1,tptp0) ),
inference(spm,[status(thm)],[c_0_57,c_0_55]) ).
cnf(c_0_65,negated_conjecture,
( leaf_occ(X1,esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
| occurrence_of(esk16_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
cnf(c_0_66,negated_conjecture,
( leaf_occ(X1,esk20_0)
| occurrence_of(esk17_1(X1),tptp4)
| ~ subactivity_occurrence(X1,esk20_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_58,c_0_16]) ).
cnf(c_0_67,plain,
( precedes(X1,X2)
| ~ min_precedes(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_68,negated_conjecture,
min_precedes(esk17_1(esk19_0),esk18_1(esk19_0),tptp0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_69,negated_conjecture,
( esk17_1(esk19_0) = esk16_1(esk16_1(esk19_0))
| esk18_1(esk19_0) = esk16_1(esk16_1(esk19_0))
| leaf_occ(esk19_0,X1)
| ~ subactivity_occurrence(esk19_0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_20])]) ).
cnf(c_0_70,negated_conjecture,
( ~ min_precedes(esk16_1(esk19_0),X1,tptp0)
| ~ precedes(X1,esk16_1(esk16_1(esk19_0))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_62]),c_0_64]) ).
cnf(c_0_71,negated_conjecture,
( leaf_occ(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0)))
| occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_38]),c_0_39])]) ).
cnf(c_0_72,negated_conjecture,
occurrence_of(esk17_1(esk19_0),tptp4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_19]),c_0_20])]),c_0_21]) ).
cnf(c_0_73,negated_conjecture,
precedes(esk17_1(esk19_0),esk18_1(esk19_0)),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_74,negated_conjecture,
( esk18_1(esk19_0) = esk16_1(esk16_1(esk19_0))
| esk17_1(esk19_0) = esk16_1(esk16_1(esk19_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_19]),c_0_16])]),c_0_21]) ).
cnf(c_0_75,negated_conjecture,
~ precedes(esk17_1(esk19_0),esk16_1(esk16_1(esk19_0))),
inference(spm,[status(thm)],[c_0_70,c_0_50]) ).
cnf(c_0_76,negated_conjecture,
( occurrence_of(esk10_3(tptp0,esk19_0,esk16_1(esk19_0)),esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))))
| occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3) ),
inference(spm,[status(thm)],[c_0_42,c_0_71]) ).
cnf(c_0_77,negated_conjecture,
( X1 = tptp4
| ~ occurrence_of(esk17_1(esk19_0),X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_72]) ).
cnf(c_0_78,negated_conjecture,
esk17_1(esk19_0) = esk16_1(esk16_1(esk19_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]) ).
cnf(c_0_79,negated_conjecture,
( leaf(esk16_1(esk19_0),esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))))
| occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3) ),
inference(spm,[status(thm)],[c_0_46,c_0_71]) ).
cnf(c_0_80,negated_conjecture,
( esk15_2(esk16_1(esk19_0),esk10_3(tptp0,esk19_0,esk16_1(esk19_0))) = tptp0
| occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3) ),
inference(spm,[status(thm)],[c_0_47,c_0_76]) ).
cnf(c_0_81,negated_conjecture,
( X1 = tptp4
| ~ occurrence_of(esk16_1(esk16_1(esk19_0)),X1) ),
inference(rw,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_82,negated_conjecture,
occurrence_of(esk16_1(esk16_1(esk19_0)),tptp3),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_53]) ).
cnf(c_0_83,plain,
tptp4 != tptp3,
inference(split_conjunct,[status(thm)],[sos_42]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_83]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : PRO018+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 01:51:20 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.37/23.42 eprover: CPU time limit exceeded, terminating
% 0.37/23.42 eprover: CPU time limit exceeded, terminating
% 0.37/23.43 eprover: CPU time limit exceeded, terminating
% 0.37/23.43 eprover: CPU time limit exceeded, terminating
% 0.50/46.44 eprover: CPU time limit exceeded, terminating
% 0.50/46.44 eprover: CPU time limit exceeded, terminating
% 0.50/46.45 eprover: CPU time limit exceeded, terminating
% 0.50/46.45 eprover: CPU time limit exceeded, terminating
% 0.61/63.78 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.61/63.78
% 0.61/63.78 # Failure: Resource limit exceeded (time)
% 0.61/63.78 # OLD status Res
% 0.61/63.78 # Preprocessing time : 0.020 s
% 0.61/63.78 # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.61/63.78
% 0.61/63.78 # Failure: Resource limit exceeded (time)
% 0.61/63.78 # OLD status Res
% 0.61/63.78 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.61/63.78 # Preprocessing time : 0.024 s
% 0.61/63.78 # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 0.61/63.78 # Preprocessing time : 0.010 s
% 0.61/63.78
% 0.61/63.78 # Proof found!
% 0.61/63.78 # SZS status Theorem
% 0.61/63.78 # SZS output start CNFRefutation
% See solution above
% 0.61/63.78 # Proof object total steps : 85
% 0.61/63.78 # Proof object clause steps : 62
% 0.61/63.78 # Proof object formula steps : 23
% 0.61/63.78 # Proof object conjectures : 46
% 0.61/63.78 # Proof object clause conjectures : 43
% 0.61/63.78 # Proof object formula conjectures : 3
% 0.61/63.78 # Proof object initial clauses used : 23
% 0.61/63.78 # Proof object initial formulas used : 12
% 0.61/63.78 # Proof object generating inferences : 38
% 0.61/63.78 # Proof object simplifying inferences : 32
% 0.61/63.78 # Training examples: 0 positive, 0 negative
% 0.61/63.78 # Parsed axioms : 49
% 0.61/63.78 # Removed by relevancy pruning/SinE : 0
% 0.61/63.78 # Initial clauses : 107
% 0.61/63.78 # Removed in clause preprocessing : 6
% 0.61/63.78 # Initial clauses in saturation : 101
% 0.61/63.78 # Processed clauses : 24642
% 0.61/63.78 # ...of these trivial : 480
% 0.61/63.78 # ...subsumed : 6989
% 0.61/63.78 # ...remaining for further processing : 17173
% 0.61/63.78 # Other redundant clauses eliminated : 0
% 0.61/63.78 # Clauses deleted for lack of memory : 174373
% 0.61/63.78 # Backward-subsumed : 1638
% 0.61/63.78 # Backward-rewritten : 9117
% 0.61/63.78 # Generated clauses : 362433
% 0.61/63.78 # ...of the previous two non-trivial : 345933
% 0.61/63.78 # Contextual simplify-reflections : 6839
% 0.61/63.78 # Paramodulations : 362374
% 0.61/63.78 # Factorizations : 9
% 0.61/63.78 # Equation resolutions : 0
% 0.61/63.78 # Current number of processed clauses : 6368
% 0.61/63.78 # Positive orientable unit clauses : 799
% 0.61/63.78 # Positive unorientable unit clauses: 0
% 0.61/63.78 # Negative unit clauses : 180
% 0.61/63.78 # Non-unit-clauses : 5389
% 0.61/63.78 # Current number of unprocessed clauses: 31840
% 0.61/63.78 # ...number of literals in the above : 115428
% 0.61/63.78 # Current number of archived formulas : 0
% 0.61/63.78 # Current number of archived clauses : 10805
% 0.61/63.78 # Clause-clause subsumption calls (NU) : 11958689
% 0.61/63.78 # Rec. Clause-clause subsumption calls : 4245959
% 0.61/63.78 # Non-unit clause-clause subsumptions : 14068
% 0.61/63.78 # Unit Clause-clause subsumption calls : 529337
% 0.61/63.78 # Rewrite failures with RHS unbound : 0
% 0.61/63.78 # BW rewrite match attempts : 31958
% 0.61/63.78 # BW rewrite match successes : 175
% 0.61/63.78 # Condensation attempts : 0
% 0.61/63.78 # Condensation successes : 0
% 0.61/63.78 # Termbank termtop insertions : 22788255
% 0.61/63.78
% 0.61/63.78 # -------------------------------------------------
% 0.61/63.78 # User time : 16.474 s
% 0.61/63.78 # System time : 0.131 s
% 0.61/63.78 # Total time : 16.605 s
% 0.61/63.78 # Maximum resident set size: 162512 pages
% 0.61/69.45 eprover: CPU time limit exceeded, terminating
% 0.61/69.46 eprover: CPU time limit exceeded, terminating
% 0.61/69.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.46 eprover: No such file or directory
% 0.61/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.47 eprover: No such file or directory
% 0.61/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.47 eprover: No such file or directory
% 0.61/69.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.61/69.47 eprover: No such file or directory
% 0.61/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.48 eprover: No such file or directory
% 0.61/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.61/69.48 eprover: No such file or directory
% 0.61/69.48 eprover: CPU time limit exceeded, terminating
% 0.61/69.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.48 eprover: No such file or directory
% 0.61/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.61/69.49 eprover: No such file or directory
% 0.61/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.49 eprover: No such file or directory
% 0.61/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.61/69.49 eprover: No such file or directory
% 0.61/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.49 eprover: No such file or directory
% 0.61/69.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.49 eprover: No such file or directory
% 0.61/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.61/69.50 eprover: No such file or directory
% 0.61/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.50 eprover: No such file or directory
% 0.61/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.50 eprover: No such file or directory
% 0.61/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.50 eprover: No such file or directory
% 0.61/69.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.61/69.50 eprover: No such file or directory
% 0.61/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.51 eprover: No such file or directory
% 0.61/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.61/69.51 eprover: No such file or directory
% 0.61/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.51 eprover: No such file or directory
% 0.61/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.51 eprover: No such file or directory
% 0.61/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.61/69.51 eprover: No such file or directory
% 0.61/69.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.51 eprover: No such file or directory
% 0.61/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.52 eprover: No such file or directory
% 0.61/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.61/69.52 eprover: No such file or directory
% 0.61/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.52 eprover: No such file or directory
% 0.61/69.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.61/69.52 eprover: No such file or directory
%------------------------------------------------------------------------------