TSTP Solution File: SEU391+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU391+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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:37 EDT 2022
% Result : Theorem 0.49s 32.67s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 50 ( 13 unt; 0 def)
% Number of atoms : 200 ( 15 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 237 ( 87 ~; 111 |; 26 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 72 ( 0 sgn 31 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_subset) ).
fof(t4_waybel_7,lemma,
! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_waybel_7) ).
fof(dt_k2_yellow19,axiom,
! [X1,X2] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1)
& ~ empty_carrier(X2)
& net_str(X2,X1) )
=> element(filter_of_net_str(X1,X2),powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k2_yellow19) ).
fof(t11_yellow19,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( in(X3,filter_of_net_str(X1,X2))
<=> ( is_eventually_in(X1,X2,X3)
& element(X3,powerset(the_carrier(X1))) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t11_yellow19) ).
fof(fraenkel_a_2_1_yellow19,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X2)
& one_sorted_str(X2)
& ~ empty_carrier(X3)
& net_str(X3,X2) )
=> ( in(X1,a_2_1_yellow19(X2,X3))
<=> ? [X4] :
( element(X4,powerset(the_carrier(X2)))
& X1 = X4
& is_eventually_in(X2,X3,X4) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fraenkel_a_2_1_yellow19) ).
fof(d3_yellow19,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> filter_of_net_str(X1,X2) = a_2_1_yellow19(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_yellow19) ).
fof(d3_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_pre_topc) ).
fof(c_0_7,plain,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ element(X5,powerset(X6))
| element(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
fof(c_0_8,lemma,
! [X2] : the_carrier(boole_POSet(X2)) = powerset(X2),
inference(variable_rename,[status(thm)],[t4_waybel_7]) ).
fof(c_0_9,plain,
! [X3,X4] :
( empty_carrier(X3)
| ~ one_sorted_str(X3)
| empty_carrier(X4)
| ~ net_str(X4,X3)
| element(filter_of_net_str(X3,X4),powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X3))))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k2_yellow19])])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( in(X3,filter_of_net_str(X1,X2))
<=> ( is_eventually_in(X1,X2,X3)
& element(X3,powerset(the_carrier(X1))) ) ) ) ),
inference(assume_negation,[status(cth)],[t11_yellow19]) ).
fof(c_0_11,plain,
! [X5,X6,X7,X9] :
( ( element(esk22_3(X5,X6,X7),powerset(the_carrier(X6)))
| ~ in(X5,a_2_1_yellow19(X6,X7))
| empty_carrier(X6)
| ~ one_sorted_str(X6)
| empty_carrier(X7)
| ~ net_str(X7,X6) )
& ( X5 = esk22_3(X5,X6,X7)
| ~ in(X5,a_2_1_yellow19(X6,X7))
| empty_carrier(X6)
| ~ one_sorted_str(X6)
| empty_carrier(X7)
| ~ net_str(X7,X6) )
& ( is_eventually_in(X6,X7,esk22_3(X5,X6,X7))
| ~ in(X5,a_2_1_yellow19(X6,X7))
| empty_carrier(X6)
| ~ one_sorted_str(X6)
| empty_carrier(X7)
| ~ net_str(X7,X6) )
& ( ~ element(X9,powerset(the_carrier(X6)))
| X5 != X9
| ~ is_eventually_in(X6,X7,X9)
| in(X5,a_2_1_yellow19(X6,X7))
| empty_carrier(X6)
| ~ one_sorted_str(X6)
| empty_carrier(X7)
| ~ net_str(X7,X6) ) ),
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)],[fraenkel_a_2_1_yellow19])])])])])])])]) ).
cnf(c_0_12,plain,
( element(X1,X2)
| ~ element(X3,powerset(X2))
| ~ in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,lemma,
the_carrier(boole_POSet(X1)) = powerset(X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( element(filter_of_net_str(X1,X2),powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
| empty_carrier(X2)
| empty_carrier(X1)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,negated_conjecture,
( ~ empty_carrier(esk1_0)
& one_sorted_str(esk1_0)
& ~ empty_carrier(esk2_0)
& net_str(esk2_0,esk1_0)
& ( ~ in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| ~ is_eventually_in(esk1_0,esk2_0,esk3_0)
| ~ element(esk3_0,powerset(the_carrier(esk1_0))) )
& ( is_eventually_in(esk1_0,esk2_0,esk3_0)
| in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) )
& ( element(esk3_0,powerset(the_carrier(esk1_0)))
| in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_10])])])])])])]) ).
cnf(c_0_16,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(X3,a_2_1_yellow19(X2,X1))
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2)
| ~ is_eventually_in(X2,X1,X4)
| X3 != X4
| ~ element(X4,powerset(the_carrier(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,the_carrier(boole_POSet(X2))) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( empty_carrier(X2)
| empty_carrier(X1)
| element(filter_of_net_str(X1,X2),the_carrier(boole_POSet(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
inference(rw,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| element(esk3_0,powerset(the_carrier(esk1_0))) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( empty_carrier(X2)
| empty_carrier(X1)
| in(X3,a_2_1_yellow19(X2,X1))
| X3 != X4
| ~ one_sorted_str(X2)
| ~ net_str(X1,X2)
| ~ is_eventually_in(X2,X1,X4)
| ~ element(X4,the_carrier(boole_POSet(the_carrier(X2)))) ),
inference(rw,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_21,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(X3,the_carrier(boole_POSet(cast_as_carrier_subset(X2))))
| ~ in(X3,filter_of_net_str(X2,X1))
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| is_eventually_in(esk1_0,esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,negated_conjecture,
net_str(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
~ empty_carrier(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,negated_conjecture,
( in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| element(esk3_0,the_carrier(boole_POSet(the_carrier(esk1_0)))) ),
inference(rw,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_28,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(X3,a_2_1_yellow19(X1,X2))
| ~ is_eventually_in(X1,X2,X3)
| ~ element(X3,the_carrier(boole_POSet(the_carrier(X1))))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_29,negated_conjecture,
( is_eventually_in(esk1_0,esk2_0,esk3_0)
| element(esk3_0,the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))) ),
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_21,c_0_22]),c_0_23]),c_0_24])]),c_0_25]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
( element(esk3_0,the_carrier(boole_POSet(the_carrier(esk1_0))))
| element(esk3_0,the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))) ),
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_21,c_0_27]),c_0_23]),c_0_24])]),c_0_25]),c_0_26]) ).
fof(c_0_31,plain,
! [X3,X4] :
( empty_carrier(X3)
| ~ one_sorted_str(X3)
| empty_carrier(X4)
| ~ net_str(X4,X3)
| filter_of_net_str(X3,X4) = a_2_1_yellow19(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)],[d3_yellow19])])])])])]) ).
cnf(c_0_32,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X2,X1,esk22_3(X3,X2,X1))
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2)
| ~ in(X3,a_2_1_yellow19(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_33,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| X3 = esk22_3(X3,X2,X1)
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2)
| ~ in(X3,a_2_1_yellow19(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_34,negated_conjecture,
( ~ element(esk3_0,powerset(the_carrier(esk1_0)))
| ~ is_eventually_in(esk1_0,esk2_0,esk3_0)
| ~ in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,negated_conjecture,
( element(esk3_0,the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0))))
| in(esk3_0,a_2_1_yellow19(esk1_0,esk2_0)) ),
inference(csr,[status(thm)],[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_28,c_0_29]),c_0_23]),c_0_24])]),c_0_26]),c_0_25]),c_0_30]) ).
cnf(c_0_36,plain,
( filter_of_net_str(X1,X2) = a_2_1_yellow19(X1,X2)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
( is_eventually_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ in(X3,a_2_1_yellow19(X1,X2))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
( ~ is_eventually_in(esk1_0,esk2_0,esk3_0)
| ~ in(esk3_0,filter_of_net_str(esk1_0,esk2_0))
| ~ element(esk3_0,the_carrier(boole_POSet(the_carrier(esk1_0)))) ),
inference(rw,[status(thm)],[c_0_34,c_0_13]) ).
cnf(c_0_39,negated_conjecture,
( element(esk3_0,the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0))))
| in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) ),
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_35,c_0_36]),c_0_23]),c_0_24])]),c_0_26]),c_0_25]) ).
fof(c_0_40,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_41,plain,
( is_eventually_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ in(X3,filter_of_net_str(X1,X2))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
element(esk3_0,the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_30]),c_0_29]) ).
cnf(c_0_43,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
is_eventually_in(esk1_0,esk2_0,esk3_0),
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_41,c_0_22]),c_0_23]),c_0_24])]),c_0_25]),c_0_26]) ).
cnf(c_0_45,negated_conjecture,
element(esk3_0,the_carrier(boole_POSet(the_carrier(esk1_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_24])]) ).
cnf(c_0_46,negated_conjecture,
in(esk3_0,a_2_1_yellow19(esk1_0,esk2_0)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_44]),c_0_45]),c_0_23]),c_0_24])]),c_0_26]),c_0_25]) ).
cnf(c_0_47,negated_conjecture,
( ~ is_eventually_in(esk1_0,esk2_0,esk3_0)
| ~ in(esk3_0,filter_of_net_str(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
in(esk3_0,filter_of_net_str(esk1_0,esk2_0)),
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_46,c_0_36]),c_0_23]),c_0_24])]),c_0_26]),c_0_25]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_44])]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU391+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n018.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 : Mon Jun 20 04:12:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/23.49 eprover: CPU time limit exceeded, terminating
% 0.44/23.49 eprover: CPU time limit exceeded, terminating
% 0.44/23.49 eprover: CPU time limit exceeded, terminating
% 0.44/23.50 eprover: CPU time limit exceeded, terminating
% 0.49/32.67 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.49/32.67
% 0.49/32.67 # Failure: Resource limit exceeded (time)
% 0.49/32.67 # OLD status Res
% 0.49/32.67 # Preprocessing time : 0.195 s
% 0.49/32.67 # Running protocol protocol_eprover_773c90a94152ea2e8c9d3df9c4b1eb6152c40c03 for 23 seconds:
% 0.49/32.67 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,,100,1.0)
% 0.49/32.67 # Preprocessing time : 0.031 s
% 0.49/32.67
% 0.49/32.67 # Proof found!
% 0.49/32.67 # SZS status Theorem
% 0.49/32.67 # SZS output start CNFRefutation
% See solution above
% 0.49/32.67 # Proof object total steps : 50
% 0.49/32.67 # Proof object clause steps : 35
% 0.49/32.67 # Proof object formula steps : 15
% 0.49/32.67 # Proof object conjectures : 23
% 0.49/32.67 # Proof object clause conjectures : 20
% 0.49/32.67 # Proof object formula conjectures : 3
% 0.49/32.67 # Proof object initial clauses used : 15
% 0.49/32.67 # Proof object initial formulas used : 7
% 0.49/32.67 # Proof object generating inferences : 12
% 0.49/32.67 # Proof object simplifying inferences : 53
% 0.49/32.67 # Training examples: 0 positive, 0 negative
% 0.49/32.67 # Parsed axioms : 901
% 0.49/32.67 # Removed by relevancy pruning/SinE : 800
% 0.49/32.67 # Initial clauses : 285
% 0.49/32.67 # Removed in clause preprocessing : 18
% 0.49/32.67 # Initial clauses in saturation : 267
% 0.49/32.67 # Processed clauses : 15064
% 0.49/32.67 # ...of these trivial : 19
% 0.49/32.67 # ...subsumed : 11528
% 0.49/32.67 # ...remaining for further processing : 3516
% 0.49/32.67 # Other redundant clauses eliminated : 13
% 0.49/32.67 # Clauses deleted for lack of memory : 138230
% 0.49/32.67 # Backward-subsumed : 176
% 0.49/32.67 # Backward-rewritten : 168
% 0.49/32.67 # Generated clauses : 255318
% 0.49/32.67 # ...of the previous two non-trivial : 251760
% 0.49/32.67 # Contextual simplify-reflections : 13480
% 0.49/32.67 # Paramodulations : 254568
% 0.49/32.67 # Factorizations : 28
% 0.49/32.67 # Equation resolutions : 16
% 0.49/32.67 # Current number of processed clauses : 3161
% 0.49/32.67 # Positive orientable unit clauses : 173
% 0.49/32.67 # Positive unorientable unit clauses: 0
% 0.49/32.67 # Negative unit clauses : 96
% 0.49/32.67 # Non-unit-clauses : 2892
% 0.49/32.67 # Current number of unprocessed clauses: 89694
% 0.49/32.67 # ...number of literals in the above : 548189
% 0.49/32.67 # Current number of archived formulas : 0
% 0.49/32.67 # Current number of archived clauses : 345
% 0.49/32.67 # Clause-clause subsumption calls (NU) : 6298756
% 0.49/32.67 # Rec. Clause-clause subsumption calls : 2022958
% 0.49/32.67 # Non-unit clause-clause subsumptions : 22237
% 0.49/32.67 # Unit Clause-clause subsumption calls : 138291
% 0.49/32.67 # Rewrite failures with RHS unbound : 0
% 0.49/32.67 # BW rewrite match attempts : 141
% 0.49/32.67 # BW rewrite match successes : 108
% 0.49/32.67 # Condensation attempts : 0
% 0.49/32.67 # Condensation successes : 0
% 0.49/32.67 # Termbank termtop insertions : 6708034
% 0.49/32.67
% 0.49/32.67 # -------------------------------------------------
% 0.49/32.67 # User time : 8.820 s
% 0.49/32.67 # System time : 0.118 s
% 0.49/32.67 # Total time : 8.938 s
% 0.49/32.67 # Maximum resident set size: 133136 pages
% 0.49/46.51 eprover: CPU time limit exceeded, terminating
% 0.49/46.51 eprover: CPU time limit exceeded, terminating
% 0.49/46.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/46.53 eprover: No such file or directory
% 0.49/46.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.53 eprover: No such file or directory
% 0.49/46.53 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/46.53 eprover: No such file or directory
% 0.49/46.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.54 eprover: No such file or directory
% 0.49/46.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/46.54 eprover: No such file or directory
% 0.49/46.54 eprover: CPU time limit exceeded, terminating
% 0.49/46.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.54 eprover: No such file or directory
% 0.49/46.54 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/46.54 eprover: No such file or directory
% 0.49/46.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.55 eprover: No such file or directory
% 0.49/46.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/46.55 eprover: No such file or directory
% 0.49/46.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.55 eprover: No such file or directory
% 0.49/46.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.55 eprover: No such file or directory
% 0.49/46.55 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/46.55 eprover: No such file or directory
% 0.49/46.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.56 eprover: No such file or directory
% 0.49/46.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.56 eprover: No such file or directory
% 0.49/46.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/46.56 eprover: No such file or directory
% 0.49/46.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.56 eprover: No such file or directory
% 0.49/46.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.56 eprover: No such file or directory
% 0.49/46.56 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/46.56 eprover: No such file or directory
% 0.49/46.57 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.57 eprover: No such file or directory
% 0.49/46.57 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.57 eprover: No such file or directory
% 0.49/46.57 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.57 eprover: No such file or directory
% 0.49/46.57 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/46.57 eprover: No such file or directory
% 0.49/46.57 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.57 eprover: No such file or directory
% 0.49/46.57 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.57 eprover: No such file or directory
% 0.49/46.58 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.49/46.58 eprover: No such file or directory
% 0.49/46.58 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.58 eprover: No such file or directory
% 0.49/46.59 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.59 eprover: No such file or directory
% 0.49/46.59 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.59 eprover: No such file or directory
% 0.49/46.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.60 eprover: No such file or directory
% 0.49/46.60 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.49/46.60 eprover: No such file or directory
%------------------------------------------------------------------------------