%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE170+1.004 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n026.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 : Sun Jul 17 01:56:23 EDT 2022
% Result : Theorem 0.25s 6.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 90 ( 72 unt; 0 def)
% Number of atoms : 110 ( 58 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 40 ( 20 ~; 17 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 147 ( 6 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',additive_idempotence) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',additive_commutativity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',order) ).
fof(star_unfold_left,axiom,
! [X1] : leq(addition(one,multiplication(star(X1),X1)),star(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_unfold_left) ).
fof(star_induction_right,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X2),X3),X1)
=> leq(multiplication(X3,star(X2)),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_induction_right) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',multiplicative_right_identity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',multiplicative_left_identity) ).
fof(star_unfold_right,axiom,
! [X1] : leq(addition(one,multiplication(X1,star(X1))),star(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',star_unfold_right) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',left_distributivity) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',multiplicative_associativity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE002+0.ax',right_distributivity) ).
fof(a,conjecture,
leq(multiplication(a,multiplication(a,multiplication(a,a))),star(a)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',a) ).
fof(c_0_13,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_14,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_15,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_18,plain,
! [X3,X4,X3,X4] :
( ( ~ leq(X3,X4)
| addition(X3,X4) = X4 )
& ( addition(X3,X4) != X4
| leq(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])])]) ).
fof(c_0_19,plain,
! [X2] : leq(addition(one,multiplication(star(X2),X2)),star(X2)),
inference(variable_rename,[status(thm)],[star_unfold_left]) ).
fof(c_0_20,plain,
! [X4,X5,X6] :
( ~ leq(addition(multiplication(X4,X5),X6),X4)
| leq(multiplication(X6,star(X5)),X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction_right])]) ).
fof(c_0_21,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_22,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
leq(addition(one,multiplication(star(X1),X1)),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_27,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_28,plain,
! [X2] : leq(addition(one,multiplication(X2,star(X2))),star(X2)),
inference(variable_rename,[status(thm)],[star_unfold_right]) ).
cnf(c_0_29,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_31,plain,
addition(one,addition(star(X1),multiplication(star(X1),X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]),c_0_23]) ).
cnf(c_0_32,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(X1,multiplication(X3,X2)),X3) ),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_33,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
leq(addition(one,multiplication(X1,star(X1))),star(X1)),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( leq(multiplication(X1,star(one)),X2)
| ~ leq(addition(X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_29]) ).
cnf(c_0_36,plain,
addition(star(X1),multiplication(star(X1),X1)) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_15]),c_0_23]),c_0_22]) ).
cnf(c_0_37,plain,
leq(star(X1),star(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_25]),c_0_33]) ).
fof(c_0_38,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_39,plain,
addition(one,addition(star(X1),multiplication(X1,star(X1)))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_34]),c_0_15]),c_0_23]) ).
cnf(c_0_40,plain,
( leq(multiplication(X1,star(one)),X1)
| ~ leq(X1,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_16]) ).
cnf(c_0_41,plain,
leq(multiplication(star(X1),star(X1)),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_36]),c_0_37])]) ).
cnf(c_0_42,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_22,c_0_39]) ).
cnf(c_0_44,plain,
( leq(star(one),one)
| ~ leq(one,one) ),
inference(spm,[status(thm)],[c_0_40,c_0_33]) ).
fof(c_0_45,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_46,plain,
addition(star(X1),multiplication(star(X1),star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_41]),c_0_23]) ).
cnf(c_0_47,plain,
addition(star(X1),multiplication(X1,star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_39]),c_0_15]),c_0_23]),c_0_22]) ).
cnf(c_0_48,plain,
addition(X1,multiplication(star(X2),X1)) = multiplication(star(X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_33]) ).
cnf(c_0_49,plain,
( star(one) = one
| ~ leq(one,one) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_44]),c_0_23]),c_0_43]) ).
cnf(c_0_50,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_51,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_23]),c_0_15]) ).
cnf(c_0_52,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
fof(c_0_53,plain,
! [X4,X5,X6] : multiplication(X4,addition(X5,X6)) = addition(multiplication(X4,X5),multiplication(X4,X6)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_54,plain,
leq(multiplication(star(X1),star(star(X1))),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_46]),c_0_37])]) ).
cnf(c_0_55,plain,
multiplication(star(X1),star(star(X1))) = star(star(X1)),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,plain,
( leq(multiplication(X1,star(one)),X2)
| ~ leq(addition(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_23]) ).
cnf(c_0_57,plain,
star(one) = one,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_16])]) ).
cnf(c_0_58,plain,
addition(star(X1),addition(X2,multiplication(star(X1),X1))) = addition(X2,star(X1)),
inference(spm,[status(thm)],[c_0_51,c_0_36]) ).
cnf(c_0_59,plain,
addition(star(X1),addition(multiplication(star(X1),X1),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_60,plain,
addition(multiplication(star(X1),X2),multiplication(star(X1),multiplication(X1,X2))) = multiplication(star(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_52]) ).
cnf(c_0_61,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_62,plain,
leq(star(star(X1)),star(X1)),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_63,plain,
( leq(X1,X2)
| ~ leq(addition(X1,X2),X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_29]) ).
cnf(c_0_64,plain,
addition(X1,star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_48]),c_0_36]) ).
cnf(c_0_65,plain,
( leq(multiplication(X1,multiplication(X2,star(X2))),X1)
| ~ leq(multiplication(X1,X2),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_16]),c_0_52]) ).
cnf(c_0_66,plain,
addition(star(X1),multiplication(star(X1),multiplication(X1,X1))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_36]) ).
cnf(c_0_67,plain,
addition(X1,multiplication(X1,star(X2))) = multiplication(X1,star(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_43]),c_0_29]) ).
cnf(c_0_68,plain,
addition(star(X1),star(star(X1))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_62]),c_0_23]) ).
cnf(c_0_69,plain,
( leq(X1,addition(X1,X2))
| ~ leq(addition(X1,X2),addition(X1,X2)) ),
inference(spm,[status(thm)],[c_0_63,c_0_22]) ).
cnf(c_0_70,plain,
addition(X1,addition(star(X1),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_15,c_0_64]) ).
cnf(c_0_71,plain,
( addition(X1,multiplication(X1,multiplication(X2,star(X2)))) = X1
| ~ leq(multiplication(X1,X2),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_65]),c_0_23]) ).
cnf(c_0_72,plain,
leq(multiplication(star(X1),star(multiplication(X1,X1))),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_66]),c_0_37])]) ).
cnf(c_0_73,plain,
star(star(X1)) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_55]),c_0_68]) ).
cnf(c_0_74,plain,
multiplication(star(X1),star(X1)) = star(X1),
inference(rw,[status(thm)],[c_0_46,c_0_48]) ).
cnf(c_0_75,plain,
leq(X1,addition(X1,X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_50]),c_0_15]),c_0_30]),c_0_22])]) ).
cnf(c_0_76,plain,
addition(X1,addition(X2,addition(X3,X1))) = addition(X2,addition(X3,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_15]) ).
cnf(c_0_77,plain,
addition(X1,multiplication(star(X2),star(X1))) = multiplication(star(X2),star(X1)),
inference(spm,[status(thm)],[c_0_70,c_0_48]) ).
cnf(c_0_78,plain,
multiplication(star(X1),star(multiplication(X1,X1))) = star(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]),c_0_74]),c_0_67]) ).
cnf(c_0_79,plain,
( leq(multiplication(X1,star(X1)),star(X2))
| ~ leq(multiplication(star(X2),X1),star(X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_48]) ).
fof(c_0_80,negated_conjecture,
~ leq(multiplication(a,multiplication(a,multiplication(a,a))),star(a)),
inference(assume_negation,[status(cth)],[a]) ).
cnf(c_0_81,plain,
leq(X1,addition(X2,addition(X3,X1))),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_82,plain,
addition(star(X1),multiplication(X1,X1)) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_23]) ).
cnf(c_0_83,plain,
leq(star(multiplication(X1,X1)),star(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_72]),c_0_73]),c_0_74]) ).
fof(c_0_84,negated_conjecture,
~ leq(multiplication(a,multiplication(a,multiplication(a,a))),star(a)),
inference(fof_simplification,[status(thm)],[c_0_80]) ).
cnf(c_0_85,plain,
leq(multiplication(X1,X1),addition(X2,star(X1))),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_86,plain,
addition(star(X1),star(multiplication(X1,X1))) = star(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_83]),c_0_23]) ).
cnf(c_0_87,negated_conjecture,
~ leq(multiplication(a,multiplication(a,multiplication(a,a))),star(a)),
inference(split_conjunct,[status(thm)],[c_0_84]) ).
cnf(c_0_88,plain,
leq(multiplication(X1,multiplication(X1,multiplication(X1,X1))),star(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_52]) ).
cnf(c_0_89,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_87,c_0_88])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE170+1.004 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n026.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 : Thu Jun 16 14:22:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.25/6.43 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.25/6.43 # Preprocessing time : 0.014 s
% 0.25/6.43
% 0.25/6.43 # Proof found!
% 0.25/6.43 # SZS status Theorem
% 0.25/6.43 # SZS output start CNFRefutation
% See solution above
% 0.25/6.43 # Proof object total steps : 90
% 0.25/6.43 # Proof object clause steps : 63
% 0.25/6.43 # Proof object formula steps : 27
% 0.25/6.43 # Proof object conjectures : 5
% 0.25/6.43 # Proof object clause conjectures : 2
% 0.25/6.43 # Proof object formula conjectures : 3
% 0.25/6.43 # Proof object initial clauses used : 14
% 0.25/6.43 # Proof object initial formulas used : 13
% 0.25/6.43 # Proof object generating inferences : 45
% 0.25/6.43 # Proof object simplifying inferences : 50
% 0.25/6.43 # Training examples: 0 positive, 0 negative
% 0.25/6.43 # Parsed axioms : 17
% 0.25/6.43 # Removed by relevancy pruning/SinE : 0
% 0.25/6.43 # Initial clauses : 18
% 0.25/6.43 # Removed in clause preprocessing : 0
% 0.25/6.43 # Initial clauses in saturation : 18
% 0.25/6.43 # Processed clauses : 15991
% 0.25/6.43 # ...of these trivial : 1886
% 0.25/6.43 # ...subsumed : 11971
% 0.25/6.43 # ...remaining for further processing : 2134
% 0.25/6.43 # Other redundant clauses eliminated : 15
% 0.25/6.43 # Clauses deleted for lack of memory : 202719
% 0.25/6.43 # Backward-subsumed : 70
% 0.25/6.43 # Backward-rewritten : 180
% 0.25/6.43 # Generated clauses : 468412
% 0.25/6.43 # ...of the previous two non-trivial : 369237
% 0.25/6.43 # Contextual simplify-reflections : 894
% 0.25/6.43 # Paramodulations : 468319
% 0.25/6.43 # Factorizations : 0
% 0.25/6.43 # Equation resolutions : 37
% 0.25/6.43 # Current number of processed clauses : 1859
% 0.25/6.43 # Positive orientable unit clauses : 624
% 0.25/6.43 # Positive unorientable unit clauses: 11
% 0.25/6.43 # Negative unit clauses : 36
% 0.25/6.43 # Non-unit-clauses : 1188
% 0.25/6.43 # Current number of unprocessed clauses: 124627
% 0.25/6.43 # ...number of literals in the above : 255850
% 0.25/6.43 # Current number of archived formulas : 0
% 0.25/6.43 # Current number of archived clauses : 250
% 0.25/6.43 # Clause-clause subsumption calls (NU) : 197621
% 0.25/6.43 # Rec. Clause-clause subsumption calls : 197545
% 0.25/6.43 # Non-unit clause-clause subsumptions : 5916
% 0.25/6.43 # Unit Clause-clause subsumption calls : 39228
% 0.25/6.43 # Rewrite failures with RHS unbound : 0
% 0.25/6.43 # BW rewrite match attempts : 9277
% 0.25/6.43 # BW rewrite match successes : 376
% 0.25/6.43 # Condensation attempts : 0
% 0.25/6.43 # Condensation successes : 0
% 0.25/6.43 # Termbank termtop insertions : 8397630
% 0.25/6.43
% 0.25/6.43 # -------------------------------------------------
% 0.25/6.43 # User time : 5.885 s
% 0.25/6.43 # System time : 0.114 s
% 0.25/6.43 # Total time : 5.999 s
% 0.25/6.43 # Maximum resident set size: 146880 pages
% 0.25/23.40 eprover: CPU time limit exceeded, terminating
% 0.25/23.41 eprover: CPU time limit exceeded, terminating
% 0.25/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.42 eprover: No such file or directory
% 0.25/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.42 eprover: No such file or directory
% 0.25/23.42 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.42 eprover: No such file or directory
% 0.25/23.42 eprover: CPU time limit exceeded, terminating
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.25/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------