TSTP Solution File: SEU371+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU371+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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 : Tue Jul 19 09:19:27 EDT 2022
% Result : Theorem 0.33s 14.53s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 57 ( 23 unt; 0 def)
% Number of atoms : 185 ( 21 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 188 ( 60 ~; 53 |; 65 &)
% ( 2 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 27 ( 25 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-1 aty)
% Number of variables : 95 ( 30 sgn 57 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t2_yellow_1,lemma,
! [X1,X2] :
( element(X2,the_carrier(boole_POSet(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_POSet(X1)))
=> ( related_reflexive(boole_POSet(X1),X2,X3)
<=> subset(X2,X3) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t2_yellow_1) ).
fof(t4_yellow_1,lemma,
! [X1] : boole_POSet(X1) = incl_POSet(powerset(X1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t4_yellow_1) ).
fof(t1_yellow_1,lemma,
! [X1] :
( the_carrier(incl_POSet(X1)) = X1
& the_InternalRel(incl_POSet(X1)) = inclusion_order(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t1_yellow_1) ).
fof(fc7_yellow_1,axiom,
! [X1] :
( ~ empty_carrier(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1))
& reflexive_relstr(boole_POSet(X1))
& transitive_relstr(boole_POSet(X1))
& antisymmetric_relstr(boole_POSet(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fc7_yellow_1) ).
fof(redefinition_r3_orders_2,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& reflexive_relstr(X1)
& rel_str(X1)
& element(X2,the_carrier(X1))
& element(X3,the_carrier(X1)) )
=> ( related_reflexive(X1,X2,X3)
<=> related(X1,X2,X3) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',redefinition_r3_orders_2) ).
fof(fc5_yellow_1,axiom,
! [X1] :
( strict_rel_str(incl_POSet(X1))
& reflexive_relstr(incl_POSet(X1))
& transitive_relstr(incl_POSet(X1))
& antisymmetric_relstr(incl_POSet(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fc5_yellow_1) ).
fof(dt_k2_yellow_1,axiom,
! [X1] :
( strict_rel_str(incl_POSet(X1))
& rel_str(incl_POSet(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',dt_k2_yellow_1) ).
fof(dt_k3_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> element(bottom_of_relstr(X1),the_carrier(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',dt_k3_yellow_0) ).
fof(fc8_yellow_1,axiom,
! [X1] :
( ~ empty_carrier(boole_POSet(X1))
& strict_rel_str(boole_POSet(X1))
& reflexive_relstr(boole_POSet(X1))
& transitive_relstr(boole_POSet(X1))
& antisymmetric_relstr(boole_POSet(X1))
& lower_bounded_relstr(boole_POSet(X1))
& upper_bounded_relstr(boole_POSet(X1))
& bounded_relstr(boole_POSet(X1))
& with_suprema_relstr(boole_POSet(X1))
& with_infima_relstr(boole_POSet(X1))
& complete_relstr(boole_POSet(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fc8_yellow_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t6_boole) ).
fof(rc2_finset_1,axiom,
! [X1] :
? [X2] :
( element(X2,powerset(X1))
& empty(X2)
& relation(X2)
& function(X2)
& one_to_one(X2)
& epsilon_transitive(X2)
& epsilon_connected(X2)
& ordinal(X2)
& natural(X2)
& finite(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',rc2_finset_1) ).
fof(t18_yellow_1,conjecture,
! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t18_yellow_1) ).
fof(t44_yellow_0,lemma,
! [X1] :
( ( ~ empty_carrier(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> related(X1,bottom_of_relstr(X1),X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t44_yellow_0) ).
fof(t3_xboole_1,lemma,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t3_xboole_1) ).
fof(c_0_14,lemma,
! [X4,X5,X6] :
( ( ~ related_reflexive(boole_POSet(X4),X5,X6)
| subset(X5,X6)
| ~ element(X6,the_carrier(boole_POSet(X4)))
| ~ element(X5,the_carrier(boole_POSet(X4))) )
& ( ~ subset(X5,X6)
| related_reflexive(boole_POSet(X4),X5,X6)
| ~ element(X6,the_carrier(boole_POSet(X4)))
| ~ element(X5,the_carrier(boole_POSet(X4))) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_yellow_1])])])])])]) ).
fof(c_0_15,lemma,
! [X2] : boole_POSet(X2) = incl_POSet(powerset(X2)),
inference(variable_rename,[status(thm)],[t4_yellow_1]) ).
cnf(c_0_16,lemma,
( subset(X1,X3)
| ~ element(X1,the_carrier(boole_POSet(X2)))
| ~ element(X3,the_carrier(boole_POSet(X2)))
| ~ related_reflexive(boole_POSet(X2),X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,lemma,
boole_POSet(X1) = incl_POSet(powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,lemma,
! [X2,X2] :
( the_carrier(incl_POSet(X2)) = X2
& the_InternalRel(incl_POSet(X2)) = inclusion_order(X2) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[t1_yellow_1])])]) ).
fof(c_0_19,plain,
! [X2,X2,X2,X2,X2] :
( ~ empty_carrier(boole_POSet(X2))
& strict_rel_str(boole_POSet(X2))
& reflexive_relstr(boole_POSet(X2))
& transitive_relstr(boole_POSet(X2))
& antisymmetric_relstr(boole_POSet(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc7_yellow_1])])])]) ).
cnf(c_0_20,lemma,
( subset(X1,X3)
| ~ related_reflexive(incl_POSet(powerset(X2)),X1,X3)
| ~ element(X3,the_carrier(incl_POSet(powerset(X2))))
| ~ element(X1,the_carrier(incl_POSet(powerset(X2)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_21,lemma,
the_carrier(incl_POSet(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_22,plain,
! [X4,X5,X6] :
( ( ~ related_reflexive(X4,X5,X6)
| related(X4,X5,X6)
| empty_carrier(X4)
| ~ reflexive_relstr(X4)
| ~ rel_str(X4)
| ~ element(X5,the_carrier(X4))
| ~ element(X6,the_carrier(X4)) )
& ( ~ related(X4,X5,X6)
| related_reflexive(X4,X5,X6)
| empty_carrier(X4)
| ~ reflexive_relstr(X4)
| ~ rel_str(X4)
| ~ element(X5,the_carrier(X4))
| ~ element(X6,the_carrier(X4)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[redefinition_r3_orders_2])])])]) ).
fof(c_0_23,plain,
! [X2,X2,X2,X2] :
( strict_rel_str(incl_POSet(X2))
& reflexive_relstr(incl_POSet(X2))
& transitive_relstr(incl_POSet(X2))
& antisymmetric_relstr(incl_POSet(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[fc5_yellow_1])])]) ).
fof(c_0_24,plain,
! [X2,X2] :
( strict_rel_str(incl_POSet(X2))
& rel_str(incl_POSet(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[dt_k2_yellow_1])])]) ).
cnf(c_0_25,plain,
~ empty_carrier(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_26,plain,
! [X2] :
( ~ rel_str(X2)
| element(bottom_of_relstr(X2),the_carrier(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_yellow_0])]) ).
fof(c_0_27,plain,
! [X2,X2,X2,X2,X2,X2,X2,X2,X2,X2,X2] :
( ~ empty_carrier(boole_POSet(X2))
& strict_rel_str(boole_POSet(X2))
& reflexive_relstr(boole_POSet(X2))
& transitive_relstr(boole_POSet(X2))
& antisymmetric_relstr(boole_POSet(X2))
& lower_bounded_relstr(boole_POSet(X2))
& upper_bounded_relstr(boole_POSet(X2))
& bounded_relstr(boole_POSet(X2))
& with_suprema_relstr(boole_POSet(X2))
& with_infima_relstr(boole_POSet(X2))
& complete_relstr(boole_POSet(X2)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[fc8_yellow_1])])])]) ).
fof(c_0_28,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_29,plain,
! [X3] :
( element(esk178_1(X3),powerset(X3))
& empty(esk178_1(X3))
& relation(esk178_1(X3))
& function(esk178_1(X3))
& one_to_one(esk178_1(X3))
& epsilon_transitive(esk178_1(X3))
& epsilon_connected(esk178_1(X3))
& ordinal(esk178_1(X3))
& natural(esk178_1(X3))
& finite(esk178_1(X3)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_finset_1])]) ).
fof(c_0_30,negated_conjecture,
~ ! [X1] : bottom_of_relstr(boole_POSet(X1)) = empty_set,
inference(assume_negation,[status(cth)],[t18_yellow_1]) ).
cnf(c_0_31,lemma,
( subset(X1,X2)
| ~ related_reflexive(incl_POSet(powerset(X3)),X1,X2)
| ~ element(X2,powerset(X3))
| ~ element(X1,powerset(X3)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21]) ).
cnf(c_0_32,plain,
( empty_carrier(X2)
| related_reflexive(X2,X3,X1)
| ~ element(X1,the_carrier(X2))
| ~ element(X3,the_carrier(X2))
| ~ rel_str(X2)
| ~ reflexive_relstr(X2)
| ~ related(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
reflexive_relstr(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,plain,
rel_str(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
~ empty_carrier(incl_POSet(powerset(X1))),
inference(rw,[status(thm)],[c_0_25,c_0_17]) ).
fof(c_0_36,lemma,
! [X3,X4] :
( empty_carrier(X3)
| ~ antisymmetric_relstr(X3)
| ~ lower_bounded_relstr(X3)
| ~ rel_str(X3)
| ~ element(X4,the_carrier(X3))
| related(X3,bottom_of_relstr(X3),X4) ),
inference(shift_quantors,[status(thm)],[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)],[t44_yellow_0])])])])])]) ).
cnf(c_0_37,plain,
( element(bottom_of_relstr(X1),the_carrier(X1))
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,plain,
lower_bounded_relstr(boole_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,plain,
empty(esk178_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_41,negated_conjecture,
bottom_of_relstr(boole_POSet(esk464_0)) != empty_set,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])]) ).
fof(c_0_42,lemma,
! [X2] :
( ~ subset(X2,empty_set)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_xboole_1])]) ).
cnf(c_0_43,lemma,
( subset(X1,X2)
| ~ related(incl_POSet(powerset(X3)),X1,X2)
| ~ element(X2,powerset(X3))
| ~ element(X1,powerset(X3)) ),
inference(sr,[status(thm)],[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_31,c_0_32]),c_0_33]),c_0_21]),c_0_21]),c_0_34])]),c_0_35]) ).
cnf(c_0_44,lemma,
( related(X1,bottom_of_relstr(X1),X2)
| empty_carrier(X1)
| ~ element(X2,the_carrier(X1))
| ~ rel_str(X1)
| ~ lower_bounded_relstr(X1)
| ~ antisymmetric_relstr(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,lemma,
element(bottom_of_relstr(incl_POSet(X1)),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_21]),c_0_34])]) ).
cnf(c_0_46,plain,
lower_bounded_relstr(incl_POSet(powerset(X1))),
inference(rw,[status(thm)],[c_0_38,c_0_17]) ).
cnf(c_0_47,plain,
antisymmetric_relstr(incl_POSet(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_48,plain,
element(esk178_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_49,plain,
esk178_1(X1) = empty_set,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_50,negated_conjecture,
bottom_of_relstr(boole_POSet(esk464_0)) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_51,lemma,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_52,lemma,
( subset(bottom_of_relstr(incl_POSet(powerset(X1))),X2)
| ~ element(X2,powerset(X1)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46]),c_0_47]),c_0_21]),c_0_34])]),c_0_35]) ).
cnf(c_0_53,plain,
element(empty_set,powerset(X1)),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,negated_conjecture,
bottom_of_relstr(incl_POSet(powerset(esk464_0))) != empty_set,
inference(rw,[status(thm)],[c_0_50,c_0_17]) ).
cnf(c_0_55,lemma,
bottom_of_relstr(incl_POSet(powerset(X1))) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU371+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n007.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 : Sun Jun 19 09:54:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.33/14.53 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.33/14.53 # Preprocessing time : 0.189 s
% 0.33/14.53
% 0.33/14.53 # Proof found!
% 0.33/14.53 # SZS status Theorem
% 0.33/14.53 # SZS output start CNFRefutation
% See solution above
% 0.33/14.53 # Proof object total steps : 57
% 0.33/14.53 # Proof object clause steps : 28
% 0.33/14.53 # Proof object formula steps : 29
% 0.33/14.53 # Proof object conjectures : 6
% 0.33/14.53 # Proof object clause conjectures : 3
% 0.33/14.53 # Proof object formula conjectures : 3
% 0.33/14.53 # Proof object initial clauses used : 16
% 0.33/14.53 # Proof object initial formulas used : 14
% 0.33/14.53 # Proof object generating inferences : 5
% 0.33/14.53 # Proof object simplifying inferences : 28
% 0.33/14.53 # Training examples: 0 positive, 0 negative
% 0.33/14.53 # Parsed axioms : 756
% 0.33/14.53 # Removed by relevancy pruning/SinE : 0
% 0.33/14.53 # Initial clauses : 3317
% 0.33/14.53 # Removed in clause preprocessing : 74
% 0.33/14.53 # Initial clauses in saturation : 3243
% 0.33/14.53 # Processed clauses : 22210
% 0.33/14.53 # ...of these trivial : 209
% 0.33/14.53 # ...subsumed : 11520
% 0.33/14.53 # ...remaining for further processing : 10481
% 0.33/14.53 # Other redundant clauses eliminated : 897
% 0.33/14.53 # Clauses deleted for lack of memory : 309553
% 0.33/14.53 # Backward-subsumed : 278
% 0.33/14.53 # Backward-rewritten : 576
% 0.33/14.53 # Generated clauses : 446790
% 0.33/14.53 # ...of the previous two non-trivial : 435683
% 0.33/14.53 # Contextual simplify-reflections : 3297
% 0.33/14.53 # Paramodulations : 445463
% 0.33/14.53 # Factorizations : 20
% 0.33/14.53 # Equation resolutions : 1378
% 0.33/14.53 # Current number of processed clauses : 9360
% 0.33/14.53 # Positive orientable unit clauses : 546
% 0.33/14.53 # Positive unorientable unit clauses: 3
% 0.33/14.53 # Negative unit clauses : 486
% 0.33/14.53 # Non-unit-clauses : 8325
% 0.33/14.53 # Current number of unprocessed clauses: 84797
% 0.33/14.53 # ...number of literals in the above : 448652
% 0.33/14.53 # Current number of archived formulas : 0
% 0.33/14.53 # Current number of archived clauses : 864
% 0.33/14.53 # Clause-clause subsumption calls (NU) : 17032955
% 0.33/14.53 # Rec. Clause-clause subsumption calls : 5462052
% 0.33/14.53 # Non-unit clause-clause subsumptions : 9750
% 0.33/14.53 # Unit Clause-clause subsumption calls : 675802
% 0.33/14.53 # Rewrite failures with RHS unbound : 0
% 0.33/14.53 # BW rewrite match attempts : 343
% 0.33/14.53 # BW rewrite match successes : 192
% 0.33/14.53 # Condensation attempts : 0
% 0.33/14.53 # Condensation successes : 0
% 0.33/14.53 # Termbank termtop insertions : 10117473
% 0.33/14.53
% 0.33/14.53 # -------------------------------------------------
% 0.33/14.53 # User time : 13.508 s
% 0.33/14.53 # System time : 0.144 s
% 0.33/14.53 # Total time : 13.652 s
% 0.33/14.53 # Maximum resident set size: 152440 pages
% 0.33/23.43 eprover: CPU time limit exceeded, terminating
% 0.33/23.44 eprover: CPU time limit exceeded, terminating
% 0.33/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.33/23.45 eprover: No such file or directory
% 0.33/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.33/23.45 eprover: No such file or directory
% 0.33/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.33/23.46 eprover: No such file or directory
% 0.33/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.33/23.46 eprover: No such file or directory
% 0.33/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.33/23.46 eprover: No such file or directory
% 0.33/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.33/23.46 eprover: No such file or directory
% 0.33/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.33/23.47 eprover: No such file or directory
% 0.33/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.33/23.47 eprover: No such file or directory
% 0.33/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.33/23.47 eprover: No such file or directory
% 0.33/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.33/23.47 eprover: No such file or directory
% 0.33/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.33/23.48 eprover: No such file or directory
% 0.33/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.33/23.48 eprover: No such file or directory
% 0.33/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.33/23.48 eprover: No such file or directory
% 0.33/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.33/23.48 eprover: No such file or directory
% 0.33/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.33/23.48 eprover: No such file or directory
% 0.33/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.33/23.49 eprover: No such file or directory
% 0.33/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.33/23.49 eprover: No such file or directory
% 0.33/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.33/23.49 eprover: No such file or directory
% 0.33/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.33/23.50 eprover: No such file or directory
% 0.33/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.33/23.50 eprover: No such file or directory
% 0.33/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.33/23.51 eprover: No such file or directory
% 0.33/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.33/23.51 eprover: No such file or directory
%------------------------------------------------------------------------------