TSTP Solution File: MGT027+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : MGT027+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 22:09:41 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 51 ( 3 unt; 0 def)
% Number of atoms : 249 ( 9 equ)
% Maximal formula atoms : 15 ( 4 avg)
% Number of connectives : 346 ( 148 ~; 158 |; 28 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 97 ( 2 sgn 40 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mp_greater_transitivity,axiom,
! [X6,X7,X8] :
( ( greater(X6,X7)
& greater(X7,X8) )
=> greater(X6,X8) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_greater_transitivity) ).
fof(l10,hypothesis,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X2] :
( greater(X2,appear(efficient_producers,X1))
& ! [X3] :
( ( subpopulations(first_movers,efficient_producers,X1,X3)
& greater_or_equal(X3,X2) )
=> greater(zero,growth_rate(first_movers,X3)) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l10) ).
fof(mp_greater_or_equal,axiom,
! [X6,X7] :
( greater_or_equal(X6,X7)
<=> ( greater(X6,X7)
| X6 = X7 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_greater_or_equal) ).
fof(mp_contracts_from,axiom,
! [X1,X2] :
( ( environment(X1)
& stable(X1)
& in_environment(X1,X2)
& ! [X3] :
( ( greater(cardinality_at_time(first_movers,X3),zero)
& greater_or_equal(X3,X2) )
=> greater(zero,growth_rate(first_movers,X3)) ) )
=> contracts_from(X2,first_movers) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_contracts_from) ).
fof(mp_non_empty_fm_and_ep,axiom,
! [X1,X3] :
( ( environment(X1)
& in_environment(X1,X3)
& greater(cardinality_at_time(first_movers,X3),zero)
& greater(cardinality_at_time(efficient_producers,X3),zero) )
=> subpopulations(first_movers,efficient_producers,X1,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_non_empty_fm_and_ep) ).
fof(t6,hypothesis,
! [X1,X3] :
( ( environment(X1)
& in_environment(X1,X3)
& greater_or_equal(X3,appear(efficient_producers,X1)) )
=> greater(cardinality_at_time(efficient_producers,X3),zero) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6) ).
fof(mp_long_stable_environments,axiom,
! [X1,X4,X5] :
( ( environment(X1)
& stable(X1)
& in_environment(X1,X4)
& greater(X5,X4) )
=> in_environment(X1,X5) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_long_stable_environments) ).
fof(mp_EP_in_stable_environments,axiom,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> in_environment(X1,appear(efficient_producers,X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mp_EP_in_stable_environments) ).
fof(prove_l9,conjecture,
! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X2] :
( greater(X2,appear(efficient_producers,X1))
& contracts_from(X2,first_movers) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_l9) ).
fof(c_0_9,plain,
! [X9,X10,X11] :
( ~ greater(X9,X10)
| ~ greater(X10,X11)
| greater(X9,X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_transitivity])]) ).
fof(c_0_10,hypothesis,
! [X4,X6] :
( ( greater(esk1_1(X4),appear(efficient_producers,X4))
| ~ environment(X4)
| ~ stable(X4) )
& ( ~ subpopulations(first_movers,efficient_producers,X4,X6)
| ~ greater_or_equal(X6,esk1_1(X4))
| greater(zero,growth_rate(first_movers,X6))
| ~ environment(X4)
| ~ stable(X4) ) ),
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)],[l10])])])])])])]) ).
fof(c_0_11,plain,
! [X8,X9,X8,X9] :
( ( ~ greater_or_equal(X8,X9)
| greater(X8,X9)
| X8 = X9 )
& ( ~ greater(X8,X9)
| greater_or_equal(X8,X9) )
& ( X8 != X9
| greater_or_equal(X8,X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_greater_or_equal])])])])]) ).
fof(c_0_12,plain,
! [X4,X5] :
( ( greater(cardinality_at_time(first_movers,esk3_2(X4,X5)),zero)
| ~ environment(X4)
| ~ stable(X4)
| ~ in_environment(X4,X5)
| contracts_from(X5,first_movers) )
& ( greater_or_equal(esk3_2(X4,X5),X5)
| ~ environment(X4)
| ~ stable(X4)
| ~ in_environment(X4,X5)
| contracts_from(X5,first_movers) )
& ( ~ greater(zero,growth_rate(first_movers,esk3_2(X4,X5)))
| ~ environment(X4)
| ~ stable(X4)
| ~ in_environment(X4,X5)
| contracts_from(X5,first_movers) ) ),
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)],[mp_contracts_from])])])])])]) ).
fof(c_0_13,plain,
! [X4,X5] :
( ~ environment(X4)
| ~ in_environment(X4,X5)
| ~ greater(cardinality_at_time(first_movers,X5),zero)
| ~ greater(cardinality_at_time(efficient_producers,X5),zero)
| subpopulations(first_movers,efficient_producers,X4,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_non_empty_fm_and_ep])]) ).
fof(c_0_14,hypothesis,
! [X4,X5] :
( ~ environment(X4)
| ~ in_environment(X4,X5)
| ~ greater_or_equal(X5,appear(efficient_producers,X4))
| greater(cardinality_at_time(efficient_producers,X5),zero) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6])]) ).
cnf(c_0_15,plain,
( greater(X1,X2)
| ~ greater(X3,X2)
| ~ greater(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,hypothesis,
( greater(esk1_1(X1),appear(efficient_producers,X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( X1 = X2
| greater(X1,X2)
| ~ greater_or_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( contracts_from(X1,first_movers)
| greater_or_equal(esk3_2(X2,X1),X1)
| ~ in_environment(X2,X1)
| ~ stable(X2)
| ~ environment(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,hypothesis,
( greater(zero,growth_rate(first_movers,X2))
| ~ stable(X1)
| ~ environment(X1)
| ~ greater_or_equal(X2,esk1_1(X1))
| ~ subpopulations(first_movers,efficient_producers,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( subpopulations(first_movers,efficient_producers,X1,X2)
| ~ greater(cardinality_at_time(efficient_producers,X2),zero)
| ~ greater(cardinality_at_time(first_movers,X2),zero)
| ~ in_environment(X1,X2)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,hypothesis,
( greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ greater_or_equal(X1,appear(efficient_producers,X2))
| ~ in_environment(X2,X1)
| ~ environment(X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( greater_or_equal(X1,X2)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,hypothesis,
( greater(X1,appear(efficient_producers,X2))
| ~ greater(X1,esk1_1(X2))
| ~ stable(X2)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
( esk3_2(X1,X2) = X2
| contracts_from(X2,first_movers)
| greater(esk3_2(X1,X2),X2)
| ~ in_environment(X1,X2)
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,hypothesis,
( greater(zero,growth_rate(first_movers,X1))
| ~ greater_or_equal(X1,esk1_1(X2))
| ~ greater(cardinality_at_time(first_movers,X1),zero)
| ~ greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ in_environment(X2,X1)
| ~ stable(X2)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( contracts_from(X1,first_movers)
| greater(cardinality_at_time(first_movers,esk3_2(X2,X1)),zero)
| ~ in_environment(X2,X1)
| ~ stable(X2)
| ~ environment(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,plain,
( contracts_from(X1,first_movers)
| ~ in_environment(X2,X1)
| ~ stable(X2)
| ~ environment(X2)
| ~ greater(zero,growth_rate(first_movers,esk3_2(X2,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_28,plain,
! [X6,X7,X8] :
( ~ environment(X6)
| ~ stable(X6)
| ~ in_environment(X6,X7)
| ~ greater(X8,X7)
| in_environment(X6,X8) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_long_stable_environments])]) ).
cnf(c_0_29,hypothesis,
( greater(cardinality_at_time(efficient_producers,X1),zero)
| ~ greater(X1,appear(efficient_producers,X2))
| ~ in_environment(X2,X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,hypothesis,
( esk3_2(X1,esk1_1(X2)) = esk1_1(X2)
| contracts_from(esk1_1(X2),first_movers)
| greater(esk3_2(X1,esk1_1(X2)),appear(efficient_producers,X2))
| ~ in_environment(X1,esk1_1(X2))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,hypothesis,
( contracts_from(esk1_1(X1),first_movers)
| ~ greater(cardinality_at_time(efficient_producers,esk3_2(X2,esk1_1(X1))),zero)
| ~ in_environment(X1,esk3_2(X2,esk1_1(X1)))
| ~ in_environment(X2,esk1_1(X1))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_18]),c_0_26]),c_0_27]) ).
cnf(c_0_32,plain,
( in_environment(X1,X2)
| ~ greater(X2,X3)
| ~ in_environment(X1,X3)
| ~ stable(X1)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_33,plain,
! [X2] :
( ~ environment(X2)
| ~ stable(X2)
| in_environment(X2,appear(efficient_producers,X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp_EP_in_stable_environments])]) ).
cnf(c_0_34,hypothesis,
( esk3_2(X1,esk1_1(X2)) = esk1_1(X2)
| contracts_from(esk1_1(X2),first_movers)
| ~ in_environment(X2,esk3_2(X1,esk1_1(X2)))
| ~ in_environment(X1,esk1_1(X2))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_35,hypothesis,
( esk3_2(X1,esk1_1(X2)) = esk1_1(X2)
| contracts_from(esk1_1(X2),first_movers)
| in_environment(X3,esk3_2(X1,esk1_1(X2)))
| ~ in_environment(X3,appear(efficient_producers,X2))
| ~ in_environment(X1,esk1_1(X2))
| ~ stable(X3)
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X3)
| ~ environment(X2)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_30]) ).
cnf(c_0_36,plain,
( in_environment(X1,appear(efficient_producers,X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,hypothesis,
( esk3_2(X1,esk1_1(X2)) = esk1_1(X2)
| contracts_from(esk1_1(X2),first_movers)
| ~ in_environment(X1,esk1_1(X2))
| ~ stable(X2)
| ~ stable(X1)
| ~ environment(X2)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_38,hypothesis,
( greater(cardinality_at_time(efficient_producers,esk1_1(X1)),zero)
| ~ in_environment(X1,esk1_1(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_16]) ).
fof(c_0_39,negated_conjecture,
~ ! [X1] :
( ( environment(X1)
& stable(X1) )
=> ? [X2] :
( greater(X2,appear(efficient_producers,X1))
& contracts_from(X2,first_movers) ) ),
inference(assume_negation,[status(cth)],[prove_l9]) ).
cnf(c_0_40,hypothesis,
( contracts_from(esk1_1(X1),first_movers)
| ~ in_environment(X1,esk1_1(X1))
| ~ in_environment(X2,esk1_1(X1))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_37]),c_0_38]) ).
cnf(c_0_41,hypothesis,
( in_environment(X1,esk1_1(X2))
| ~ in_environment(X1,appear(efficient_producers,X2))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_16]) ).
fof(c_0_42,negated_conjecture,
! [X4] :
( environment(esk2_0)
& stable(esk2_0)
& ( ~ greater(X4,appear(efficient_producers,esk2_0))
| ~ contracts_from(X4,first_movers) ) ),
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_39])])])])])]) ).
cnf(c_0_43,hypothesis,
( contracts_from(esk1_1(X1),first_movers)
| ~ in_environment(X2,appear(efficient_producers,X1))
| ~ in_environment(X1,esk1_1(X1))
| ~ stable(X1)
| ~ stable(X2)
| ~ environment(X1)
| ~ environment(X2) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( ~ contracts_from(X1,first_movers)
| ~ greater(X1,appear(efficient_producers,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_45,hypothesis,
( contracts_from(esk1_1(X1),first_movers)
| ~ in_environment(X1,esk1_1(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_36]) ).
cnf(c_0_46,negated_conjecture,
( ~ greater(esk1_1(X1),appear(efficient_producers,esk2_0))
| ~ in_environment(X1,esk1_1(X1))
| ~ stable(X1)
| ~ environment(X1) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_47,hypothesis,
( ~ greater(esk1_1(X1),appear(efficient_producers,esk2_0))
| ~ stable(X1)
| ~ environment(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_41]),c_0_36]) ).
cnf(c_0_48,negated_conjecture,
stable(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_49,negated_conjecture,
environment(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_16]),c_0_48]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : MGT027+1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 9 12:06:53 EDT 2022
% 0.12/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.015 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 : 51
% 0.23/1.41 # Proof object clause steps : 32
% 0.23/1.41 # Proof object formula steps : 19
% 0.23/1.41 # Proof object conjectures : 7
% 0.23/1.41 # Proof object clause conjectures : 4
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 15
% 0.23/1.41 # Proof object initial formulas used : 9
% 0.23/1.41 # Proof object generating inferences : 17
% 0.23/1.41 # Proof object simplifying inferences : 9
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 9
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 16
% 0.23/1.41 # Removed in clause preprocessing : 0
% 0.23/1.41 # Initial clauses in saturation : 16
% 0.23/1.41 # Processed clauses : 71
% 0.23/1.41 # ...of these trivial : 0
% 0.23/1.41 # ...subsumed : 2
% 0.23/1.41 # ...remaining for further processing : 69
% 0.23/1.41 # Other redundant clauses eliminated : 1
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 11
% 0.23/1.41 # Backward-rewritten : 0
% 0.23/1.41 # Generated clauses : 104
% 0.23/1.41 # ...of the previous two non-trivial : 101
% 0.23/1.41 # Contextual simplify-reflections : 12
% 0.23/1.41 # Paramodulations : 103
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 1
% 0.23/1.41 # Current number of processed clauses : 57
% 0.23/1.41 # Positive orientable unit clauses : 3
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 0
% 0.23/1.41 # Non-unit-clauses : 54
% 0.23/1.41 # Current number of unprocessed clauses: 39
% 0.23/1.41 # ...number of literals in the above : 549
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 11
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 1713
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 220
% 0.23/1.41 # Non-unit clause-clause subsumptions : 25
% 0.23/1.41 # Unit Clause-clause subsumption calls : 2
% 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 : 0
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 6586
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.023 s
% 0.23/1.41 # System time : 0.004 s
% 0.23/1.41 # Total time : 0.027 s
% 0.23/1.41 # Maximum resident set size: 3044 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------