%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM925+6 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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 : Mon Jul 18 09:37:49 EDT 2022
% Result : Theorem 0.29s 1.48s
% Output : CNFRefutation 0.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 54 ( 38 unt; 0 def)
% Number of atoms : 84 ( 46 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 58 ( 28 ~; 18 |; 6 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 7 con; 0-4 aty)
% Number of variables : 40 ( 4 sgn 25 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_37_one__is__num__one,axiom,
one_one(int) = number_number_of(int,hAPP(int,int,bit1,pls)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_37_one__is__num__one) ).
fof(fact_73_Pls__def,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_73_Pls__def) ).
fof(fact_119_number__of__is__id,axiom,
! [X20] : number_number_of(int,X20) = X20,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_119_number__of__is__id) ).
fof(fact_190_zero__less__imp__eq__int,axiom,
! [X20] :
( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),X20))
=> ? [X43] :
( hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),X43))
& X20 = hAPP(nat,int,semiring_1_of_nat(int),X43) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_190_zero__less__imp__eq__int) ).
fof(fact_0_n1pos,axiom,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n)))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_0_n1pos) ).
fof(fact_39_Numeral1__eq1__nat,axiom,
one_one(nat) = number_number_of(nat,hAPP(int,int,bit1,pls)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_39_Numeral1__eq1__nat) ).
fof(fact_139_gr__implies__not0,axiom,
! [X14,X15] :
( hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),X14),X15))
=> X15 != zero_zero(nat) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_139_gr__implies__not0) ).
fof(fact_329_power2__ge__self,axiom,
! [X10] : hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X10),hAPP(nat,int,power_power(int,X10),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_329_power2__ge__self) ).
fof(fact_78_Bit0__def,axiom,
! [X20] : hAPP(int,int,bit0,X20) = hAPP(int,int,plus_plus(int,X20),X20),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_78_Bit0__def) ).
fof(fact_29_nat__1__add__1,axiom,
hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)) = number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_29_nat__1__add__1) ).
fof(conj_0,conjecture,
hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))) != zero_zero(int),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',conj_0) ).
fof(fact_254_zless__le,axiom,
! [X29,X24] :
( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X29),X24))
<=> ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X29),X24))
& X29 != X24 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_254_zless__le) ).
fof(fact_27_int__eq__0__conv,axiom,
! [X17] :
( hAPP(nat,int,semiring_1_of_nat(int),X17) = zero_zero(int)
<=> X17 = zero_zero(nat) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_27_int__eq__0__conv) ).
fof(fact_251_zle__antisym,axiom,
! [X16,X8] :
( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X16),X8))
=> ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X8),X16))
=> X16 = X8 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',fact_251_zle__antisym) ).
cnf(c_0_14,plain,
one_one(int) = number_number_of(int,hAPP(int,int,bit1,pls)),
inference(split_conjunct,[status(thm)],[fact_37_one__is__num__one]) ).
cnf(c_0_15,plain,
pls = zero_zero(int),
inference(split_conjunct,[status(thm)],[fact_73_Pls__def]) ).
fof(c_0_16,plain,
! [X21] : number_number_of(int,X21) = X21,
inference(variable_rename,[status(thm)],[fact_119_number__of__is__id]) ).
fof(c_0_17,plain,
! [X44] :
( ( hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),esk6_1(X44)))
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),X44)) )
& ( X44 = hAPP(nat,int,semiring_1_of_nat(int),esk6_1(X44))
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),X44)) ) ),
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)],[fact_190_zero__less__imp__eq__int])])])])])]) ).
cnf(c_0_18,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n)))),
inference(split_conjunct,[status(thm)],[fact_0_n1pos]) ).
cnf(c_0_19,plain,
one_one(int) = number_number_of(int,hAPP(int,int,bit1,zero_zero(int))),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
number_number_of(int,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
one_one(nat) = number_number_of(nat,hAPP(int,int,bit1,pls)),
inference(split_conjunct,[status(thm)],[fact_39_Numeral1__eq1__nat]) ).
fof(c_0_22,plain,
! [X16,X17] :
( ~ hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),X16),X17))
| X17 != zero_zero(nat) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_139_gr__implies__not0])]) ).
cnf(c_0_23,plain,
( hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),esk6_1(X1)))
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,zero_zero(int))),hAPP(nat,int,semiring_1_of_nat(int),n)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
fof(c_0_25,plain,
! [X11] : hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X11),hAPP(nat,int,power_power(int,X11),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))))),
inference(variable_rename,[status(thm)],[fact_329_power2__ge__self]) ).
fof(c_0_26,plain,
! [X21] : hAPP(int,int,bit0,X21) = hAPP(int,int,plus_plus(int,X21),X21),
inference(variable_rename,[status(thm)],[fact_78_Bit0__def]) ).
cnf(c_0_27,plain,
hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)) = number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))),
inference(split_conjunct,[status(thm)],[fact_29_nat__1__add__1]) ).
cnf(c_0_28,plain,
one_one(nat) = number_number_of(nat,hAPP(int,int,bit1,zero_zero(int))),
inference(rw,[status(thm)],[c_0_21,c_0_15]) ).
fof(c_0_29,negated_conjecture,
~ ( hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))) != zero_zero(int) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
fof(c_0_30,plain,
! [X30,X31,X30,X31] :
( ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X30),X31))
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X30),X31)) )
& ( X30 != X31
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X30),X31)) )
& ( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X30),X31))
| X30 = X31
| hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X30),X31)) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_254_zless__le])])])])]) ).
fof(c_0_31,plain,
! [X18,X18] :
( ( hAPP(nat,int,semiring_1_of_nat(int),X18) != zero_zero(int)
| X18 = zero_zero(nat) )
& ( X18 != zero_zero(nat)
| hAPP(nat,int,semiring_1_of_nat(int),X18) = zero_zero(int) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_27_int__eq__0__conv])])])]) ).
cnf(c_0_32,plain,
( X1 = hAPP(nat,int,semiring_1_of_nat(int),esk6_1(X1))
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_33,plain,
( X1 != zero_zero(nat)
| ~ hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),X2),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),esk6_1(hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,zero_zero(int))),hAPP(nat,int,semiring_1_of_nat(int),n))))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_35,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X1),hAPP(nat,int,power_power(int,X1),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))))),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,plain,
hAPP(int,int,bit0,X1) = hAPP(int,int,plus_plus(int,X1),X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,plain,
number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,zero_zero(int)))) = hAPP(nat,nat,plus_plus(nat,number_number_of(nat,hAPP(int,int,bit1,zero_zero(int)))),number_number_of(nat,hAPP(int,int,bit1,zero_zero(int)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_28]),c_0_15]) ).
fof(c_0_38,negated_conjecture,
hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))) = zero_zero(int),
inference(fof_simplification,[status(thm)],[c_0_29]) ).
fof(c_0_39,plain,
! [X17,X18] :
( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X17),X18))
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X18),X17))
| X17 = X18 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_251_zle__antisym])]) ).
cnf(c_0_40,plain,
( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X1),X2))
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X1),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,plain,
( X1 = zero_zero(nat)
| hAPP(nat,int,semiring_1_of_nat(int),X1) != zero_zero(int) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,plain,
hAPP(nat,int,semiring_1_of_nat(int),esk6_1(hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,zero_zero(int))),hAPP(nat,int,semiring_1_of_nat(int),n)))) = hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,zero_zero(int))),hAPP(nat,int,semiring_1_of_nat(int),n)),
inference(spm,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_43,plain,
esk6_1(hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,zero_zero(int))),hAPP(nat,int,semiring_1_of_nat(int),n))) != zero_zero(nat),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_44,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X1),hAPP(nat,int,power_power(int,X1),number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,zero_zero(int))),hAPP(int,int,bit1,zero_zero(int))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_15]),c_0_36]) ).
cnf(c_0_45,plain,
number_number_of(nat,hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,zero_zero(int))),hAPP(int,int,bit1,zero_zero(int)))) = hAPP(nat,nat,plus_plus(nat,number_number_of(nat,hAPP(int,int,bit1,zero_zero(int)))),number_number_of(nat,hAPP(int,int,bit1,zero_zero(int)))),
inference(rw,[status(thm)],[c_0_37,c_0_36]) ).
cnf(c_0_46,negated_conjecture,
hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))) = zero_zero(int),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_47,plain,
( X1 = X2
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X2),X1))
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X1),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_48,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),zero_zero(int)),hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,zero_zero(int))),hAPP(nat,int,semiring_1_of_nat(int),n)))),
inference(spm,[status(thm)],[c_0_40,c_0_24]) ).
cnf(c_0_49,plain,
hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,zero_zero(int))),hAPP(nat,int,semiring_1_of_nat(int),n)) != zero_zero(int),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_50,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X1),hAPP(nat,int,power_power(int,X1),hAPP(nat,nat,plus_plus(nat,number_number_of(nat,hAPP(int,int,bit1,zero_zero(int)))),number_number_of(nat,hAPP(int,int,bit1,zero_zero(int))))))),
inference(rw,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,zero_zero(int))),hAPP(nat,int,semiring_1_of_nat(int),n))),hAPP(nat,nat,plus_plus(nat,number_number_of(nat,hAPP(int,int,bit1,zero_zero(int)))),number_number_of(nat,hAPP(int,int,bit1,zero_zero(int))))) = zero_zero(int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_19]),c_0_20]),c_0_15]),c_0_37]) ).
cnf(c_0_52,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),hAPP(int,int,plus_plus(int,hAPP(int,int,bit1,zero_zero(int))),hAPP(nat,int,semiring_1_of_nat(int),n))),zero_zero(int))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM925+6 : TPTP v8.1.0. Released v5.3.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n025.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 : Thu Jul 7 09:35:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.29/1.48 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.29/1.48 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.29/1.48 # Preprocessing time : 0.056 s
% 0.29/1.48
% 0.29/1.48 # Proof found!
% 0.29/1.48 # SZS status Theorem
% 0.29/1.48 # SZS output start CNFRefutation
% See solution above
% 0.29/1.48 # Proof object total steps : 54
% 0.29/1.48 # Proof object clause steps : 30
% 0.29/1.48 # Proof object formula steps : 24
% 0.29/1.48 # Proof object conjectures : 6
% 0.29/1.48 # Proof object clause conjectures : 3
% 0.29/1.48 # Proof object formula conjectures : 3
% 0.29/1.48 # Proof object initial clauses used : 15
% 0.29/1.48 # Proof object initial formulas used : 14
% 0.29/1.48 # Proof object generating inferences : 7
% 0.29/1.48 # Proof object simplifying inferences : 18
% 0.29/1.48 # Training examples: 0 positive, 0 negative
% 0.29/1.48 # Parsed axioms : 660
% 0.29/1.48 # Removed by relevancy pruning/SinE : 428
% 0.29/1.48 # Initial clauses : 379
% 0.29/1.48 # Removed in clause preprocessing : 38
% 0.29/1.48 # Initial clauses in saturation : 341
% 0.29/1.48 # Processed clauses : 872
% 0.29/1.48 # ...of these trivial : 64
% 0.29/1.48 # ...subsumed : 330
% 0.29/1.48 # ...remaining for further processing : 477
% 0.29/1.48 # Other redundant clauses eliminated : 18
% 0.29/1.48 # Clauses deleted for lack of memory : 0
% 0.29/1.48 # Backward-subsumed : 3
% 0.29/1.48 # Backward-rewritten : 26
% 0.29/1.48 # Generated clauses : 4828
% 0.29/1.48 # ...of the previous two non-trivial : 3920
% 0.29/1.48 # Contextual simplify-reflections : 2
% 0.29/1.48 # Paramodulations : 4781
% 0.29/1.48 # Factorizations : 10
% 0.29/1.48 # Equation resolutions : 37
% 0.29/1.48 # Current number of processed clauses : 436
% 0.29/1.48 # Positive orientable unit clauses : 163
% 0.29/1.48 # Positive unorientable unit clauses: 13
% 0.29/1.48 # Negative unit clauses : 51
% 0.29/1.48 # Non-unit-clauses : 209
% 0.29/1.48 # Current number of unprocessed clauses: 3151
% 0.29/1.48 # ...number of literals in the above : 5017
% 0.29/1.48 # Current number of archived formulas : 0
% 0.29/1.48 # Current number of archived clauses : 29
% 0.29/1.48 # Clause-clause subsumption calls (NU) : 4381
% 0.29/1.48 # Rec. Clause-clause subsumption calls : 4090
% 0.29/1.48 # Non-unit clause-clause subsumptions : 129
% 0.29/1.48 # Unit Clause-clause subsumption calls : 1311
% 0.29/1.48 # Rewrite failures with RHS unbound : 0
% 0.29/1.48 # BW rewrite match attempts : 9325
% 0.29/1.48 # BW rewrite match successes : 108
% 0.29/1.48 # Condensation attempts : 0
% 0.29/1.48 # Condensation successes : 0
% 0.29/1.48 # Termbank termtop insertions : 491495
% 0.29/1.48
% 0.29/1.48 # -------------------------------------------------
% 0.29/1.48 # User time : 0.242 s
% 0.29/1.48 # System time : 0.007 s
% 0.29/1.48 # Total time : 0.249 s
% 0.29/1.48 # Maximum resident set size: 10372 pages
% 0.29/23.48 eprover: CPU time limit exceeded, terminating
% 0.29/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.49 eprover: No such file or directory
% 0.29/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.50 eprover: No such file or directory
% 0.29/23.50 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.50 eprover: No such file or directory
% 0.29/23.51 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.51 eprover: No such file or directory
% 0.29/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.52 eprover: No such file or directory
% 0.29/23.52 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.52 eprover: No such file or directory
% 0.29/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.53 eprover: No such file or directory
% 0.29/23.53 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.53 eprover: No such file or directory
% 0.29/23.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.54 eprover: No such file or directory
% 0.29/23.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.54 eprover: No such file or directory
% 0.29/23.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.29/23.55 eprover: No such file or directory
%------------------------------------------------------------------------------