TSTP Solution File: SEU176+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU176+2 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 09:17:29 EDT 2022
% Result : Theorem 0.46s 44.63s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 61 ( 21 unt; 0 def)
% Number of atoms : 119 ( 57 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 106 ( 48 ~; 39 |; 5 &)
% ( 1 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 94 ( 2 sgn 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t48_setfam_1,conjecture,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ( X2 != empty_set
=> union_of_subsets(X1,complements_of_subsets(X1,X2)) = subset_difference(X1,cast_to_subset(X1),meet_of_subsets(X1,X2)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t48_setfam_1) ).
fof(d4_subset_1,axiom,
! [X1] : cast_to_subset(X1) = X1,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_subset_1) ).
fof(dt_k2_subset_1,axiom,
! [X1] : element(cast_to_subset(X1),powerset(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k2_subset_1) ).
fof(redefinition_k6_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X1))
& element(X3,powerset(X1)) )
=> subset_difference(X1,X2,X3) = set_difference(X2,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',redefinition_k6_subset_1) ).
fof(t47_setfam_1,lemma,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ( X2 != empty_set
=> subset_difference(X1,cast_to_subset(X1),union_of_subsets(X1,X2)) = meet_of_subsets(X1,complements_of_subsets(X1,X2)) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t47_setfam_1) ).
fof(dt_k6_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> element(meet_of_subsets(X1,X2),powerset(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k6_setfam_1) ).
fof(involutiveness_k7_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',involutiveness_k7_setfam_1) ).
fof(dt_k7_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> element(complements_of_subsets(X1,X2),powerset(powerset(X1))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k7_setfam_1) ).
fof(t28_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t28_xboole_1) ).
fof(t48_xboole_1,lemma,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t48_xboole_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_subset) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k3_xboole_0) ).
fof(dt_k5_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> element(union_of_subsets(X1,X2),powerset(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k5_setfam_1) ).
fof(t46_setfam_1,lemma,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ~ ( X2 != empty_set
& complements_of_subsets(X1,X2) = empty_set ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t46_setfam_1) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ( X2 != empty_set
=> union_of_subsets(X1,complements_of_subsets(X1,X2)) = subset_difference(X1,cast_to_subset(X1),meet_of_subsets(X1,X2)) ) ),
inference(assume_negation,[status(cth)],[t48_setfam_1]) ).
fof(c_0_15,negated_conjecture,
( element(esk2_0,powerset(powerset(esk1_0)))
& esk2_0 != empty_set
& union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)) != subset_difference(esk1_0,cast_to_subset(esk1_0),meet_of_subsets(esk1_0,esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_16,plain,
! [X2] : cast_to_subset(X2) = X2,
inference(variable_rename,[status(thm)],[d4_subset_1]) ).
fof(c_0_17,plain,
! [X2] : element(cast_to_subset(X2),powerset(X2)),
inference(variable_rename,[status(thm)],[dt_k2_subset_1]) ).
cnf(c_0_18,negated_conjecture,
union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)) != subset_difference(esk1_0,cast_to_subset(esk1_0),meet_of_subsets(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
cast_to_subset(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X4,X5,X6] :
( ~ element(X5,powerset(X4))
| ~ element(X6,powerset(X4))
| subset_difference(X4,X5,X6) = set_difference(X5,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k6_subset_1])]) ).
cnf(c_0_21,plain,
element(cast_to_subset(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,lemma,
! [X3,X4] :
( ~ element(X4,powerset(powerset(X3)))
| X4 = empty_set
| subset_difference(X3,cast_to_subset(X3),union_of_subsets(X3,X4)) = meet_of_subsets(X3,complements_of_subsets(X3,X4)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t47_setfam_1])]) ).
cnf(c_0_23,negated_conjecture,
union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)) != subset_difference(esk1_0,esk1_0,meet_of_subsets(esk1_0,esk2_0)),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( subset_difference(X1,X2,X3) = set_difference(X2,X3)
| ~ element(X3,powerset(X1))
| ~ element(X2,powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
element(X1,powerset(X1)),
inference(rw,[status(thm)],[c_0_21,c_0_19]) ).
fof(c_0_26,plain,
! [X3,X4] :
( ~ element(X4,powerset(powerset(X3)))
| element(meet_of_subsets(X3,X4),powerset(X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_setfam_1])]) ).
cnf(c_0_27,lemma,
( subset_difference(X1,cast_to_subset(X1),union_of_subsets(X1,X2)) = meet_of_subsets(X1,complements_of_subsets(X1,X2))
| X2 = empty_set
| ~ element(X2,powerset(powerset(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,plain,
! [X3,X4] :
( ~ element(X4,powerset(powerset(X3)))
| complements_of_subsets(X3,complements_of_subsets(X3,X4)) = X4 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k7_setfam_1])]) ).
fof(c_0_29,plain,
! [X3,X4] :
( ~ element(X4,powerset(powerset(X3)))
| element(complements_of_subsets(X3,X4),powerset(powerset(X3))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_setfam_1])]) ).
cnf(c_0_30,negated_conjecture,
( set_difference(esk1_0,meet_of_subsets(esk1_0,esk2_0)) != union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))
| ~ element(meet_of_subsets(esk1_0,esk2_0),powerset(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_31,plain,
( element(meet_of_subsets(X1,X2),powerset(X1))
| ~ element(X2,powerset(powerset(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,negated_conjecture,
element(esk2_0,powerset(powerset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_33,lemma,
( X2 = empty_set
| subset_difference(X1,X1,union_of_subsets(X1,X2)) = meet_of_subsets(X1,complements_of_subsets(X1,X2))
| ~ element(X2,powerset(powerset(X1))) ),
inference(rw,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_34,plain,
( complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2
| ~ element(X2,powerset(powerset(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( element(complements_of_subsets(X1,X2),powerset(powerset(X1)))
| ~ element(X2,powerset(powerset(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_36,lemma,
! [X3,X4] :
( ~ subset(X3,X4)
| set_intersection2(X3,X4) = X3 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])]) ).
fof(c_0_37,lemma,
! [X3,X4] : set_difference(X3,set_difference(X3,X4)) = set_intersection2(X3,X4),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
cnf(c_0_38,negated_conjecture,
set_difference(esk1_0,meet_of_subsets(esk1_0,esk2_0)) != union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_39,lemma,
( meet_of_subsets(X1,X2) = subset_difference(X1,X1,union_of_subsets(X1,complements_of_subsets(X1,X2)))
| complements_of_subsets(X1,X2) = empty_set
| ~ element(X2,powerset(powerset(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_40,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
fof(c_0_42,plain,
! [X3,X4,X3,X4] :
( ( ~ element(X3,powerset(X4))
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| element(X3,powerset(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])])]) ).
fof(c_0_43,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_44,negated_conjecture,
( complements_of_subsets(esk1_0,esk2_0) = empty_set
| set_difference(esk1_0,subset_difference(esk1_0,esk1_0,union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)))) != union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_32])]) ).
fof(c_0_45,plain,
! [X3,X4] :
( ~ element(X4,powerset(powerset(X3)))
| element(union_of_subsets(X3,X4),powerset(X3)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_setfam_1])]) ).
cnf(c_0_46,lemma,
( set_difference(X1,set_difference(X1,X2)) = X1
| ~ subset(X1,X2) ),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
( subset(X1,X2)
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,negated_conjecture,
( complements_of_subsets(esk1_0,esk2_0) = empty_set
| set_difference(esk1_0,set_difference(esk1_0,union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)))) != union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))
| ~ element(union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)),powerset(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_24]),c_0_25])]) ).
cnf(c_0_50,plain,
( element(union_of_subsets(X1,X2),powerset(X1))
| ~ element(X2,powerset(powerset(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_51,lemma,
( set_difference(X1,set_difference(X1,X2)) = X1
| ~ element(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
set_difference(X1,set_difference(X1,X2)) = set_difference(X2,set_difference(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_41]),c_0_41]) ).
cnf(c_0_53,negated_conjecture,
( complements_of_subsets(esk1_0,esk2_0) = empty_set
| set_difference(esk1_0,set_difference(esk1_0,union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)))) != union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))
| ~ element(complements_of_subsets(esk1_0,esk2_0),powerset(powerset(esk1_0))) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,lemma,
( set_difference(X1,set_difference(X1,union_of_subsets(X1,X2))) = union_of_subsets(X1,X2)
| ~ element(X2,powerset(powerset(X1))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_50]),c_0_52]) ).
fof(c_0_55,lemma,
! [X3,X4] :
( ~ element(X4,powerset(powerset(X3)))
| X4 = empty_set
| complements_of_subsets(X3,X4) != empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t46_setfam_1])]) ).
cnf(c_0_56,negated_conjecture,
( complements_of_subsets(esk1_0,esk2_0) = empty_set
| ~ element(complements_of_subsets(esk1_0,esk2_0),powerset(powerset(esk1_0))) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,lemma,
( X2 = empty_set
| complements_of_subsets(X1,X2) != empty_set
| ~ element(X2,powerset(powerset(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_58,negated_conjecture,
complements_of_subsets(esk1_0,esk2_0) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_35]),c_0_32])]) ).
cnf(c_0_59,negated_conjecture,
esk2_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_60,lemma,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_32])]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SEU176+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 17:23:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.36/23.40 eprover: CPU time limit exceeded, terminating
% 0.36/23.40 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.36/23.41 eprover: CPU time limit exceeded, terminating
% 0.46/44.63 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.46/44.63
% 0.46/44.63 # Failure: Resource limit exceeded (time)
% 0.46/44.63 # OLD status Res
% 0.46/44.63 # Preprocessing time : 0.025 s
% 0.46/44.63 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.46/44.63 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.46/44.63 # Preprocessing time : 0.024 s
% 0.46/44.63
% 0.46/44.63 # Proof found!
% 0.46/44.63 # SZS status Theorem
% 0.46/44.63 # SZS output start CNFRefutation
% See solution above
% 0.46/44.63 # Proof object total steps : 61
% 0.46/44.63 # Proof object clause steps : 32
% 0.46/44.63 # Proof object formula steps : 29
% 0.46/44.63 # Proof object conjectures : 14
% 0.46/44.63 # Proof object clause conjectures : 11
% 0.46/44.63 # Proof object formula conjectures : 3
% 0.46/44.63 # Proof object initial clauses used : 16
% 0.46/44.63 # Proof object initial formulas used : 14
% 0.46/44.63 # Proof object generating inferences : 11
% 0.46/44.63 # Proof object simplifying inferences : 21
% 0.46/44.63 # Training examples: 0 positive, 0 negative
% 0.46/44.63 # Parsed axioms : 134
% 0.46/44.63 # Removed by relevancy pruning/SinE : 35
% 0.46/44.63 # Initial clauses : 159
% 0.46/44.63 # Removed in clause preprocessing : 2
% 0.46/44.63 # Initial clauses in saturation : 157
% 0.46/44.63 # Processed clauses : 41677
% 0.46/44.63 # ...of these trivial : 578
% 0.46/44.63 # ...subsumed : 29889
% 0.46/44.63 # ...remaining for further processing : 11210
% 0.46/44.63 # Other redundant clauses eliminated : 1145
% 0.46/44.63 # Clauses deleted for lack of memory : 463387
% 0.46/44.63 # Backward-subsumed : 498
% 0.46/44.63 # Backward-rewritten : 1887
% 0.46/44.63 # Generated clauses : 866325
% 0.46/44.63 # ...of the previous two non-trivial : 741648
% 0.46/44.63 # Contextual simplify-reflections : 14246
% 0.46/44.63 # Paramodulations : 852279
% 0.46/44.63 # Factorizations : 153
% 0.46/44.63 # Equation resolutions : 1546
% 0.46/44.63 # Current number of processed clauses : 8808
% 0.46/44.63 # Positive orientable unit clauses : 1081
% 0.46/44.63 # Positive unorientable unit clauses: 20
% 0.46/44.63 # Negative unit clauses : 708
% 0.46/44.63 # Non-unit-clauses : 6999
% 0.46/44.63 # Current number of unprocessed clauses: 132010
% 0.46/44.63 # ...number of literals in the above : 464809
% 0.46/44.63 # Current number of archived formulas : 0
% 0.46/44.63 # Current number of archived clauses : 2401
% 0.46/44.63 # Clause-clause subsumption calls (NU) : 13201639
% 0.46/44.63 # Rec. Clause-clause subsumption calls : 8523838
% 0.46/44.63 # Non-unit clause-clause subsumptions : 31527
% 0.46/44.63 # Unit Clause-clause subsumption calls : 4383318
% 0.46/44.63 # Rewrite failures with RHS unbound : 128
% 0.46/44.63 # BW rewrite match attempts : 3228
% 0.46/44.63 # BW rewrite match successes : 1033
% 0.46/44.63 # Condensation attempts : 0
% 0.46/44.63 # Condensation successes : 0
% 0.46/44.63 # Termbank termtop insertions : 11442304
% 0.46/44.63
% 0.46/44.63 # -------------------------------------------------
% 0.46/44.63 # User time : 20.239 s
% 0.46/44.63 # System time : 0.144 s
% 0.46/44.63 # Total time : 20.383 s
% 0.46/44.63 # Maximum resident set size: 151928 pages
% 0.46/46.42 eprover: CPU time limit exceeded, terminating
% 0.46/46.43 eprover: CPU time limit exceeded, terminating
% 0.46/46.43 eprover: CPU time limit exceeded, terminating
% 0.46/46.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/46.44 eprover: No such file or directory
% 0.46/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.45 eprover: No such file or directory
% 0.46/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/46.45 eprover: No such file or directory
% 0.46/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.45 eprover: No such file or directory
% 0.46/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/46.45 eprover: No such file or directory
% 0.46/46.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.45 eprover: No such file or directory
% 0.46/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/46.46 eprover: No such file or directory
% 0.46/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.46 eprover: No such file or directory
% 0.46/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.46 eprover: No such file or directory
% 0.46/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/46.46 eprover: No such file or directory
% 0.46/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.46 eprover: No such file or directory
% 0.46/46.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.46 eprover: No such file or directory
% 0.46/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/46.47 eprover: No such file or directory
% 0.46/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.47 eprover: No such file or directory
% 0.46/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.47 eprover: No such file or directory
% 0.46/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/46.47 eprover: No such file or directory
% 0.46/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.47 eprover: No such file or directory
% 0.46/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.47 eprover: No such file or directory
% 0.46/46.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/46.48 eprover: No such file or directory
% 0.46/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.48 eprover: No such file or directory
% 0.46/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.48 eprover: No such file or directory
% 0.46/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/46.48 eprover: No such file or directory
% 0.46/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.48 eprover: No such file or directory
% 0.46/46.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.48 eprover: No such file or directory
% 0.46/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.46/46.49 eprover: No such file or directory
% 0.46/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.49 eprover: No such file or directory
% 0.46/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.49 eprover: No such file or directory
% 0.46/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.49 eprover: No such file or directory
% 0.46/46.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.49 eprover: No such file or directory
% 0.46/46.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.46/46.50 eprover: No such file or directory
%------------------------------------------------------------------------------