TSTP Solution File: SEU325+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU325+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n014.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:00 EDT 2022
% Result : Theorem 0.24s 1.41s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 12
% Syntax : Number of formulae : 59 ( 19 unt; 0 def)
% Number of atoms : 160 ( 35 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 174 ( 73 ~; 62 |; 25 &)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 87 ( 21 sgn 43 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).
fof(rc2_subset_1,axiom,
! [X1] :
? [X2] :
( element(X2,powerset(X1))
& empty(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc2_subset_1) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t5_subset) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_tarski) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',existence_m1_subset_1) ).
fof(fc6_membered,axiom,
( empty(empty_set)
& v1_membered(empty_set)
& v2_membered(empty_set)
& v3_membered(empty_set)
& v4_membered(empty_set)
& v5_membered(empty_set) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc6_membered) ).
fof(t5_tops_2,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( element(X2,powerset(powerset(the_carrier(X1))))
=> ~ ( is_a_cover_of_carrier(X1,X2)
& X2 = empty_set ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t5_tops_2) ).
fof(redefinition_k5_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> union_of_subsets(X1,X2) = union(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_k5_setfam_1) ).
fof(d8_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( element(X2,powerset(powerset(the_carrier(X1))))
=> ( is_a_cover_of_carrier(X1,X2)
<=> cast_as_carrier_subset(X1) = union_of_subsets(the_carrier(X1),X2) ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d8_pre_topc) ).
fof(fc1_struct_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(the_carrier(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_struct_0) ).
fof(d3_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_pre_topc) ).
fof(c_0_12,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_13,plain,
! [X3] :
( element(esk8_1(X3),powerset(X3))
& empty(esk8_1(X3)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_subset_1])]) ).
cnf(c_0_14,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,plain,
empty(esk8_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ element(X5,powerset(X6))
| ~ empty(X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).
cnf(c_0_17,plain,
element(esk8_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
esk8_1(X1) = empty_set,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ empty(X1)
| ~ element(X2,powerset(X1))
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,plain,
element(empty_set,powerset(X1)),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_21,plain,
! [X5,X6,X7,X7,X9,X5,X6,X11] :
( ( in(X7,esk1_3(X5,X6,X7))
| ~ in(X7,X6)
| X6 != union(X5) )
& ( in(esk1_3(X5,X6,X7),X5)
| ~ in(X7,X6)
| X6 != union(X5) )
& ( ~ in(X7,X9)
| ~ in(X9,X5)
| in(X7,X6)
| X6 != union(X5) )
& ( ~ in(esk2_2(X5,X6),X6)
| ~ in(esk2_2(X5,X6),X11)
| ~ in(X11,X5)
| X6 = union(X5) )
& ( in(esk2_2(X5,X6),esk3_2(X5,X6))
| in(esk2_2(X5,X6),X6)
| X6 = union(X5) )
& ( in(esk3_2(X5,X6),X5)
| in(esk2_2(X5,X6),X6)
| X6 = union(X5) ) ),
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)],[d4_tarski])])])])])])]) ).
cnf(c_0_22,plain,
( ~ empty(X1)
| ~ in(X2,empty_set) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( in(esk1_3(X2,X1,X3),X2)
| X1 != union(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
( X1 != union(empty_set)
| ~ empty(X2)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_25,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_26,plain,
( ~ empty(X1)
| ~ in(X2,union(empty_set)) ),
inference(er,[status(thm)],[c_0_24]) ).
cnf(c_0_27,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_28,plain,
! [X3] : element(esk5_1(X3),X3),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_29,plain,
( empty(union(empty_set))
| ~ empty(X1)
| ~ element(X2,union(empty_set)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
element(esk5_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_31,plain,
( empty(union(empty_set))
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc6_membered]) ).
cnf(c_0_33,plain,
empty(union(empty_set)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,plain,
union(empty_set) = empty_set,
inference(spm,[status(thm)],[c_0_14,c_0_33]) ).
fof(c_0_35,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( element(X2,powerset(powerset(the_carrier(X1))))
=> ~ ( is_a_cover_of_carrier(X1,X2)
& X2 = empty_set ) ) ),
inference(assume_negation,[status(cth)],[t5_tops_2]) ).
cnf(c_0_36,plain,
( X1 != empty_set
| ~ empty(X2)
| ~ in(X3,X1) ),
inference(rw,[status(thm)],[c_0_24,c_0_34]) ).
fof(c_0_37,plain,
! [X3,X4] :
( ~ element(X4,powerset(powerset(X3)))
| union_of_subsets(X3,X4) = union(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_setfam_1])]) ).
fof(c_0_38,plain,
! [X3,X4] :
( ( ~ is_a_cover_of_carrier(X3,X4)
| cast_as_carrier_subset(X3) = union_of_subsets(the_carrier(X3),X4)
| ~ element(X4,powerset(powerset(the_carrier(X3))))
| ~ one_sorted_str(X3) )
& ( cast_as_carrier_subset(X3) != union_of_subsets(the_carrier(X3),X4)
| is_a_cover_of_carrier(X3,X4)
| ~ element(X4,powerset(powerset(the_carrier(X3))))
| ~ one_sorted_str(X3) ) ),
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)],[d8_pre_topc])])])])])]) ).
fof(c_0_39,negated_conjecture,
( ~ empty_carrier(esk11_0)
& one_sorted_str(esk11_0)
& element(esk12_0,powerset(powerset(the_carrier(esk11_0))))
& is_a_cover_of_carrier(esk11_0,esk12_0)
& esk12_0 = empty_set ),
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_35])])])])])]) ).
fof(c_0_40,plain,
! [X2] :
( empty_carrier(X2)
| ~ one_sorted_str(X2)
| ~ empty(the_carrier(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_struct_0])])]) ).
cnf(c_0_41,plain,
( empty(X1)
| X1 != empty_set
| ~ empty(X2)
| ~ element(X3,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_27]) ).
cnf(c_0_42,plain,
( union_of_subsets(X1,X2) = union(X2)
| ~ element(X2,powerset(powerset(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,plain,
( cast_as_carrier_subset(X1) = union_of_subsets(the_carrier(X1),X2)
| ~ one_sorted_str(X1)
| ~ element(X2,powerset(powerset(the_carrier(X1))))
| ~ is_a_cover_of_carrier(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_44,negated_conjecture,
is_a_cover_of_carrier(esk11_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,negated_conjecture,
esk12_0 = empty_set,
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,negated_conjecture,
~ empty_carrier(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_47,plain,
( empty_carrier(X1)
| ~ empty(the_carrier(X1))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,negated_conjecture,
one_sorted_str(esk11_0),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_49,plain,
( empty(X1)
| X1 != empty_set
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_41,c_0_30]) ).
fof(c_0_50,plain,
! [X2] :
( ~ one_sorted_str(X2)
| cast_as_carrier_subset(X2) = the_carrier(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])]) ).
cnf(c_0_51,plain,
( cast_as_carrier_subset(X1) = union(X2)
| ~ is_a_cover_of_carrier(X1,X2)
| ~ one_sorted_str(X1)
| ~ element(X2,powerset(powerset(the_carrier(X1)))) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_52,negated_conjecture,
is_a_cover_of_carrier(esk11_0,empty_set),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_53,negated_conjecture,
~ empty(the_carrier(esk11_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_54,plain,
( empty(X1)
| X1 != empty_set ),
inference(spm,[status(thm)],[c_0_49,c_0_32]) ).
cnf(c_0_55,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_56,negated_conjecture,
cast_as_carrier_subset(esk11_0) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_34]),c_0_48]),c_0_20])]) ).
cnf(c_0_57,negated_conjecture,
the_carrier(esk11_0) != empty_set,
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_48])]),c_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU325+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jun 19 10:00:18 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.41 # Preprocessing time : 0.017 s
% 0.24/1.41
% 0.24/1.41 # Failure: Out of unprocessed clauses!
% 0.24/1.41 # OLD status GaveUp
% 0.24/1.41 # Parsed axioms : 49
% 0.24/1.41 # Removed by relevancy pruning/SinE : 21
% 0.24/1.41 # Initial clauses : 61
% 0.24/1.41 # Removed in clause preprocessing : 0
% 0.24/1.41 # Initial clauses in saturation : 61
% 0.24/1.41 # Processed clauses : 216
% 0.24/1.41 # ...of these trivial : 0
% 0.24/1.41 # ...subsumed : 69
% 0.24/1.41 # ...remaining for further processing : 147
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 0
% 0.24/1.41 # Backward-rewritten : 3
% 0.24/1.41 # Generated clauses : 217
% 0.24/1.41 # ...of the previous two non-trivial : 171
% 0.24/1.41 # Contextual simplify-reflections : 44
% 0.24/1.41 # Paramodulations : 217
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 0
% 0.24/1.41 # Current number of processed clauses : 144
% 0.24/1.41 # Positive orientable unit clauses : 19
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 6
% 0.24/1.41 # Non-unit-clauses : 119
% 0.24/1.41 # Current number of unprocessed clauses: 0
% 0.24/1.41 # ...number of literals in the above : 0
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 3
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 2922
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 2004
% 0.24/1.41 # Non-unit clause-clause subsumptions : 113
% 0.24/1.41 # Unit Clause-clause subsumption calls : 10
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 2
% 0.24/1.41 # BW rewrite match successes : 2
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 5990
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.025 s
% 0.24/1.41 # System time : 0.001 s
% 0.24/1.41 # Total time : 0.026 s
% 0.24/1.41 # Maximum resident set size: 3320 pages
% 0.24/1.41 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.24/1.41 # Preprocessing time : 0.018 s
% 0.24/1.41
% 0.24/1.41 # Proof found!
% 0.24/1.41 # SZS status Theorem
% 0.24/1.41 # SZS output start CNFRefutation
% See solution above
% 0.24/1.41 # Proof object total steps : 59
% 0.24/1.41 # Proof object clause steps : 35
% 0.24/1.41 # Proof object formula steps : 24
% 0.24/1.41 # Proof object conjectures : 12
% 0.24/1.41 # Proof object clause conjectures : 9
% 0.24/1.41 # Proof object formula conjectures : 3
% 0.24/1.41 # Proof object initial clauses used : 16
% 0.24/1.41 # Proof object initial formulas used : 12
% 0.24/1.41 # Proof object generating inferences : 16
% 0.24/1.41 # Proof object simplifying inferences : 12
% 0.24/1.41 # Training examples: 0 positive, 0 negative
% 0.24/1.41 # Parsed axioms : 49
% 0.24/1.41 # Removed by relevancy pruning/SinE : 0
% 0.24/1.41 # Initial clauses : 98
% 0.24/1.41 # Removed in clause preprocessing : 6
% 0.24/1.41 # Initial clauses in saturation : 92
% 0.24/1.41 # Processed clauses : 389
% 0.24/1.41 # ...of these trivial : 2
% 0.24/1.41 # ...subsumed : 106
% 0.24/1.41 # ...remaining for further processing : 281
% 0.24/1.41 # Other redundant clauses eliminated : 0
% 0.24/1.41 # Clauses deleted for lack of memory : 0
% 0.24/1.41 # Backward-subsumed : 10
% 0.24/1.41 # Backward-rewritten : 7
% 0.24/1.41 # Generated clauses : 1294
% 0.24/1.41 # ...of the previous two non-trivial : 1240
% 0.24/1.41 # Contextual simplify-reflections : 48
% 0.24/1.41 # Paramodulations : 1264
% 0.24/1.41 # Factorizations : 0
% 0.24/1.41 # Equation resolutions : 30
% 0.24/1.41 # Current number of processed clauses : 264
% 0.24/1.41 # Positive orientable unit clauses : 23
% 0.24/1.41 # Positive unorientable unit clauses: 0
% 0.24/1.41 # Negative unit clauses : 10
% 0.24/1.41 # Non-unit-clauses : 231
% 0.24/1.41 # Current number of unprocessed clauses: 894
% 0.24/1.41 # ...number of literals in the above : 3081
% 0.24/1.41 # Current number of archived formulas : 0
% 0.24/1.41 # Current number of archived clauses : 17
% 0.24/1.41 # Clause-clause subsumption calls (NU) : 13639
% 0.24/1.41 # Rec. Clause-clause subsumption calls : 12310
% 0.24/1.41 # Non-unit clause-clause subsumptions : 140
% 0.24/1.41 # Unit Clause-clause subsumption calls : 253
% 0.24/1.41 # Rewrite failures with RHS unbound : 0
% 0.24/1.41 # BW rewrite match attempts : 14
% 0.24/1.41 # BW rewrite match successes : 4
% 0.24/1.41 # Condensation attempts : 0
% 0.24/1.41 # Condensation successes : 0
% 0.24/1.41 # Termbank termtop insertions : 36385
% 0.24/1.41
% 0.24/1.41 # -------------------------------------------------
% 0.24/1.41 # User time : 0.044 s
% 0.24/1.41 # System time : 0.005 s
% 0.24/1.41 # Total time : 0.049 s
% 0.24/1.41 # Maximum resident set size: 4344 pages
% 0.24/23.41 eprover: CPU time limit exceeded, terminating
% 0.24/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46 eprover: No such file or directory
% 0.24/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.49 eprover: No such file or directory
% 0.24/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------