TSTP Solution File: PRO014+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PRO014+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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:03 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 42 ( 7 unt; 0 def)
% Number of atoms : 216 ( 0 equ)
% Maximal formula atoms : 36 ( 5 avg)
% Number of connectives : 292 ( 118 ~; 129 |; 40 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 72 ( 3 sgn 28 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X101,X102] :
( ( occurrence_of(X102,tptp0)
& subactivity_occurrence(X101,X102)
& arboreal(X101)
& ~ leaf_occ(X101,X102) )
=> ? [X103,X104] :
( occurrence_of(X103,tptp3)
& next_subocc(X101,X103,tptp0)
& ( occurrence_of(X104,tptp2)
| occurrence_of(X104,tptp1) )
& min_precedes(X103,X104,tptp0)
& leaf(X104,tptp0) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(sos_32,axiom,
! [X96,X97] :
( ( occurrence_of(X97,tptp0)
& subactivity_occurrence(X96,X97)
& arboreal(X96)
& ~ leaf_occ(X96,X97) )
=> ? [X98,X99,X100] :
( occurrence_of(X98,tptp3)
& next_subocc(X96,X98,tptp0)
& occurrence_of(X99,tptp4)
& next_subocc(X98,X99,tptp0)
& ( occurrence_of(X100,tptp2)
| occurrence_of(X100,tptp1) )
& next_subocc(X99,X100,tptp0)
& leaf(X100,tptp0) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_32) ).
fof(sos_04,axiom,
! [X16,X17,X18] :
( next_subocc(X16,X17,X18)
<=> ( min_precedes(X16,X17,X18)
& ~ ? [X19] :
( min_precedes(X16,X19,X18)
& min_precedes(X19,X17,X18) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos_04) ).
fof(sos,axiom,
! [X1,X2,X3,X4] :
( ( min_precedes(X1,X2,X4)
& min_precedes(X2,X3,X4) )
=> min_precedes(X1,X3,X4) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',sos) ).
fof(c_0_4,negated_conjecture,
~ ! [X101,X102] :
( ( occurrence_of(X102,tptp0)
& subactivity_occurrence(X101,X102)
& arboreal(X101)
& ~ leaf_occ(X101,X102) )
=> ? [X103,X104] :
( occurrence_of(X103,tptp3)
& next_subocc(X101,X103,tptp0)
& ( occurrence_of(X104,tptp2)
| occurrence_of(X104,tptp1) )
& min_precedes(X103,X104,tptp0)
& leaf(X104,tptp0) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_5,plain,
! [X101,X102] :
( ( occurrence_of(esk8_1(X101),tptp3)
| ~ occurrence_of(X102,tptp0)
| ~ subactivity_occurrence(X101,X102)
| ~ arboreal(X101)
| leaf_occ(X101,X102) )
& ( next_subocc(X101,esk8_1(X101),tptp0)
| ~ occurrence_of(X102,tptp0)
| ~ subactivity_occurrence(X101,X102)
| ~ arboreal(X101)
| leaf_occ(X101,X102) )
& ( occurrence_of(esk9_1(X101),tptp4)
| ~ occurrence_of(X102,tptp0)
| ~ subactivity_occurrence(X101,X102)
| ~ arboreal(X101)
| leaf_occ(X101,X102) )
& ( next_subocc(esk8_1(X101),esk9_1(X101),tptp0)
| ~ occurrence_of(X102,tptp0)
| ~ subactivity_occurrence(X101,X102)
| ~ arboreal(X101)
| leaf_occ(X101,X102) )
& ( occurrence_of(esk10_1(X101),tptp2)
| occurrence_of(esk10_1(X101),tptp1)
| ~ occurrence_of(X102,tptp0)
| ~ subactivity_occurrence(X101,X102)
| ~ arboreal(X101)
| leaf_occ(X101,X102) )
& ( next_subocc(esk9_1(X101),esk10_1(X101),tptp0)
| ~ occurrence_of(X102,tptp0)
| ~ subactivity_occurrence(X101,X102)
| ~ arboreal(X101)
| leaf_occ(X101,X102) )
& ( leaf(esk10_1(X101),tptp0)
| ~ occurrence_of(X102,tptp0)
| ~ subactivity_occurrence(X101,X102)
| ~ arboreal(X101)
| leaf_occ(X101,X102) ) ),
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_32])])])])])])])]) ).
fof(c_0_6,negated_conjecture,
! [X107,X108] :
( occurrence_of(esk2_0,tptp0)
& subactivity_occurrence(esk1_0,esk2_0)
& arboreal(esk1_0)
& ~ leaf_occ(esk1_0,esk2_0)
& ( ~ occurrence_of(X108,tptp2)
| ~ occurrence_of(X107,tptp3)
| ~ next_subocc(esk1_0,X107,tptp0)
| ~ min_precedes(X107,X108,tptp0)
| ~ leaf(X108,tptp0) )
& ( ~ occurrence_of(X108,tptp1)
| ~ occurrence_of(X107,tptp3)
| ~ next_subocc(esk1_0,X107,tptp0)
| ~ min_precedes(X107,X108,tptp0)
| ~ leaf(X108,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)],[inference(fof_simplification,[status(thm)],[c_0_4])])])])])])])]) ).
fof(c_0_7,plain,
! [X20,X21,X22,X23,X20,X21,X22] :
( ( min_precedes(X20,X21,X22)
| ~ next_subocc(X20,X21,X22) )
& ( ~ min_precedes(X20,X23,X22)
| ~ min_precedes(X23,X21,X22)
| ~ next_subocc(X20,X21,X22) )
& ( min_precedes(X20,esk12_3(X20,X21,X22),X22)
| ~ min_precedes(X20,X21,X22)
| next_subocc(X20,X21,X22) )
& ( min_precedes(esk12_3(X20,X21,X22),X21,X22)
| ~ min_precedes(X20,X21,X22)
| next_subocc(X20,X21,X22) ) ),
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_04])])])])])])]) ).
cnf(c_0_8,plain,
( leaf_occ(X1,X2)
| next_subocc(esk9_1(X1),esk10_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
occurrence_of(esk2_0,tptp0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X5,X6,X7,X8] :
( ~ min_precedes(X5,X6,X8)
| ~ min_precedes(X6,X7,X8)
| min_precedes(X5,X7,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[sos])]) ).
cnf(c_0_11,plain,
( min_precedes(X1,X2,X3)
| ~ next_subocc(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( next_subocc(esk9_1(X1),esk10_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( leaf_occ(X1,X2)
| next_subocc(esk8_1(X1),esk9_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( leaf_occ(X1,X2)
| next_subocc(X1,esk8_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( min_precedes(X1,X2,X3)
| ~ min_precedes(X4,X2,X3)
| ~ min_precedes(X1,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( leaf_occ(X1,esk2_0)
| min_precedes(esk9_1(X1),esk10_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( next_subocc(esk8_1(X1),esk9_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ next_subocc(esk1_0,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,negated_conjecture,
( next_subocc(X1,esk8_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_20,negated_conjecture,
subactivity_occurrence(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_21,negated_conjecture,
arboreal(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
~ leaf_occ(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
( leaf_occ(X1,esk2_0)
| min_precedes(X2,esk10_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1)
| ~ min_precedes(X2,esk9_1(X1),tptp0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
( leaf_occ(X1,esk2_0)
| min_precedes(esk8_1(X1),esk9_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ min_precedes(X2,X1,tptp0)
| ~ next_subocc(esk1_0,X2,tptp0)
| ~ occurrence_of(X2,tptp3)
| ~ occurrence_of(X1,tptp2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_26,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ occurrence_of(esk8_1(esk1_0),tptp3)
| ~ occurrence_of(X1,tptp1)
| ~ min_precedes(esk8_1(esk1_0),X1,tptp0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( leaf_occ(X1,esk2_0)
| min_precedes(esk8_1(X1),esk10_1(X1),tptp0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk8_1(X1),tptp3)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_29,negated_conjecture,
( ~ leaf(X1,tptp0)
| ~ occurrence_of(esk8_1(esk1_0),tptp3)
| ~ occurrence_of(X1,tptp2)
| ~ min_precedes(esk8_1(esk1_0),X1,tptp0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_30,negated_conjecture,
( ~ leaf(esk10_1(esk1_0),tptp0)
| ~ occurrence_of(esk8_1(esk1_0),tptp3)
| ~ occurrence_of(esk10_1(esk1_0),tptp1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_31,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk8_1(X1),tptp3)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_9]) ).
cnf(c_0_32,plain,
( leaf_occ(X1,X2)
| leaf(esk10_1(X1),tptp0)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_33,negated_conjecture,
( ~ leaf(esk10_1(esk1_0),tptp0)
| ~ occurrence_of(esk8_1(esk1_0),tptp3)
| ~ occurrence_of(esk10_1(esk1_0),tptp2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_27]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_34,negated_conjecture,
( ~ leaf(esk10_1(esk1_0),tptp0)
| ~ occurrence_of(esk10_1(esk1_0),tptp1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_35,negated_conjecture,
( leaf(esk10_1(X1),tptp0)
| leaf_occ(X1,esk2_0)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_9]) ).
cnf(c_0_36,plain,
( leaf_occ(X1,X2)
| occurrence_of(esk10_1(X1),tptp1)
| occurrence_of(esk10_1(X1),tptp2)
| ~ arboreal(X1)
| ~ subactivity_occurrence(X1,X2)
| ~ occurrence_of(X2,tptp0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_37,negated_conjecture,
( ~ leaf(esk10_1(esk1_0),tptp0)
| ~ occurrence_of(esk10_1(esk1_0),tptp2) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_31]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_38,negated_conjecture,
~ occurrence_of(esk10_1(esk1_0),tptp1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_39,negated_conjecture,
( leaf_occ(X1,esk2_0)
| occurrence_of(esk10_1(X1),tptp2)
| occurrence_of(esk10_1(X1),tptp1)
| ~ subactivity_occurrence(X1,esk2_0)
| ~ arboreal(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_9]) ).
cnf(c_0_40,negated_conjecture,
~ occurrence_of(esk10_1(esk1_0),tptp2),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_35]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_20]),c_0_21])]),c_0_22]),c_0_40]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PRO014+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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:24:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.019 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 42
% 0.23/1.41 # Proof object clause steps : 33
% 0.23/1.41 # Proof object formula steps : 9
% 0.23/1.41 # Proof object conjectures : 28
% 0.23/1.41 # Proof object clause conjectures : 25
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 14
% 0.23/1.41 # Proof object initial formulas used : 4
% 0.23/1.41 # Proof object generating inferences : 19
% 0.23/1.41 # Proof object simplifying inferences : 37
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 46
% 0.23/1.41 # Removed by relevancy pruning/SinE : 9
% 0.23/1.41 # Initial clauses : 74
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 74
% 0.23/1.41 # Processed clauses : 6751
% 0.23/1.41 # ...of these trivial : 2
% 0.23/1.41 # ...subsumed : 5049
% 0.23/1.41 # ...remaining for further processing : 1700
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 126
% 0.23/1.41 # Backward-rewritten : 77
% 0.23/1.41 # Generated clauses : 21301
% 0.23/1.41 # ...of the previous two non-trivial : 19557
% 0.23/1.41 # Contextual simplify-reflections : 7436
% 0.23/1.41 # Paramodulations : 21301
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 1497
% 0.23/1.41 # Positive orientable unit clauses : 18
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 22
% 0.23/1.41 # Non-unit-clauses : 1457
% 0.23/1.41 # Current number of unprocessed clauses: 10749
% 0.23/1.41 # ...number of literals in the above : 63597
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 203
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 1733556
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 561290
% 0.23/1.41 # Non-unit clause-clause subsumptions : 11922
% 0.23/1.41 # Unit Clause-clause subsumption calls : 1887
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 4
% 0.23/1.41 # BW rewrite match successes : 4
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 379947
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.940 s
% 0.23/1.41 # System time : 0.014 s
% 0.23/1.41 # Total time : 0.954 s
% 0.23/1.41 # Maximum resident set size: 16648 pages
% 0.26/23.41 eprover: CPU time limit exceeded, terminating
% 0.26/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.42 eprover: No such file or directory
% 0.26/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.43 eprover: No such file or directory
% 0.26/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.44 eprover: No such file or directory
% 0.26/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.44 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.45 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.46 eprover: No such file or directory
% 0.26/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.47 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.48 eprover: No such file or directory
% 0.26/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.26/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------