TSTP Solution File: KLE143+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : KLE143+2 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n015.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:12 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 18
% Syntax : Number of formulae : 89 ( 60 unt; 0 def)
% Number of atoms : 120 ( 60 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 59 ( 28 ~; 24 |; 3 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 142 ( 5 sgn 66 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(infty_coinduction,axiom,
! [X1,X2,X3] :
( leq(X3,addition(multiplication(X1,X3),X2))
=> leq(X3,multiplication(strong_iteration(X1),X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',infty_coinduction) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_right_identity) ).
fof(star_induction2,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X3,X1),X2),X3)
=> leq(multiplication(X2,star(X1)),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_induction2) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_left_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_commutativity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_associativity) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',idempotence) ).
fof(infty_unfold1,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',infty_unfold1) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',order) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',additive_identity) ).
fof(star_unfold1,axiom,
! [X1] : addition(one,multiplication(X1,star(X1))) = star(X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_unfold1) ).
fof(star_induction1,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X3),X2),X3)
=> leq(multiplication(star(X1),X2),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_induction1) ).
fof(distributivity2,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',distributivity2) ).
fof(star_unfold2,axiom,
! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',star_unfold2) ).
fof(goals,conjecture,
! [X4] :
( leq(multiplication(strong_iteration(X4),strong_iteration(X4)),strong_iteration(X4))
& leq(strong_iteration(X4),multiplication(strong_iteration(X4),strong_iteration(X4))) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',goals) ).
fof(isolation,axiom,
! [X1] : strong_iteration(X1) = addition(star(X1),multiplication(strong_iteration(X1),zero)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',isolation) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE004+0.ax',multiplicative_associativity) ).
fof(c_0_18,plain,
! [X4,X5,X6] :
( ~ leq(X6,addition(multiplication(X4,X6),X5))
| leq(X6,multiplication(strong_iteration(X4),X5)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[infty_coinduction])]) ).
fof(c_0_19,plain,
! [X2] : multiplication(X2,one) = X2,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_20,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_21,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_22,plain,
! [X4,X5,X6] :
( ~ leq(addition(multiplication(X6,X4),X5),X6)
| leq(multiplication(X5,star(X4)),X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction2])]) ).
fof(c_0_23,plain,
! [X2] : multiplication(one,X2) = X2,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_24,plain,
( leq(one,multiplication(strong_iteration(X1),X2))
| ~ leq(one,addition(X1,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_25,plain,
! [X3,X4] : addition(X3,X4) = addition(X4,X3),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_26,plain,
! [X4,X5,X6] : addition(X6,addition(X5,X4)) = addition(addition(X6,X5),X4),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_27,plain,
! [X2] : addition(X2,X2) = X2,
inference(variable_rename,[status(thm)],[idempotence]) ).
fof(c_0_28,plain,
! [X2] : strong_iteration(X2) = addition(multiplication(X2,strong_iteration(X2)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
fof(c_0_29,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])])])]) ).
cnf(c_0_30,plain,
( leq(multiplication(X1,star(X2)),X3)
| ~ leq(addition(multiplication(X3,X2),X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
( leq(one,strong_iteration(X1))
| ~ leq(one,addition(X1,one)) ),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_33,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
fof(c_0_37,plain,
! [X2] : multiplication(zero,X2) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_38,plain,
! [X2] : addition(X2,zero) = X2,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_39,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,plain,
( leq(multiplication(X1,star(X2)),one)
| ~ leq(addition(X2,X1),one) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
fof(c_0_41,plain,
! [X2] : addition(one,multiplication(X2,star(X2))) = star(X2),
inference(variable_rename,[status(thm)],[star_unfold1]) ).
cnf(c_0_42,plain,
( leq(one,strong_iteration(X1))
| ~ leq(one,addition(one,X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_43,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_44,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_45,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_46,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_47,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_48,plain,
! [X4,X5,X6] :
( ~ leq(addition(multiplication(X4,X6),X5),X6)
| leq(multiplication(star(X4),X5),X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction1])]) ).
cnf(c_0_49,plain,
( addition(one,multiplication(X1,star(X2))) = one
| ~ leq(addition(X2,X1),one) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_33]) ).
cnf(c_0_50,plain,
addition(one,multiplication(X1,star(X1))) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_51,plain,
leq(one,strong_iteration(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).
cnf(c_0_52,plain,
strong_iteration(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_53,plain,
( leq(multiplication(star(X1),X2),X3)
| ~ leq(addition(multiplication(X1,X3),X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_54,plain,
( star(X1) = one
| ~ leq(X1,one) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_35]),c_0_50]) ).
cnf(c_0_55,plain,
leq(one,one),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_56,plain,
( leq(multiplication(star(one),X1),X2)
| ~ leq(addition(X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_53,c_0_31]) ).
cnf(c_0_57,plain,
star(one) = one,
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
fof(c_0_58,plain,
! [X4,X5,X6] : multiplication(addition(X4,X5),X6) = addition(multiplication(X4,X6),multiplication(X5,X6)),
inference(variable_rename,[status(thm)],[distributivity2]) ).
cnf(c_0_59,plain,
( leq(X1,X2)
| ~ leq(addition(X2,X1),X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_31]) ).
cnf(c_0_60,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_61,plain,
addition(one,strong_iteration(X1)) = strong_iteration(X1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_62,plain,
( leq(X1,X2)
| ~ leq(addition(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_59,c_0_33]) ).
cnf(c_0_63,plain,
addition(X1,multiplication(strong_iteration(X2),X1)) = multiplication(strong_iteration(X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_31]) ).
cnf(c_0_64,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_44,c_0_33]) ).
cnf(c_0_65,plain,
( leq(X1,multiplication(strong_iteration(X2),X1))
| ~ leq(multiplication(strong_iteration(X2),X1),multiplication(strong_iteration(X2),X1)) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
fof(c_0_66,plain,
! [X2] : addition(one,multiplication(star(X2),X2)) = star(X2),
inference(variable_rename,[status(thm)],[star_unfold2]) ).
cnf(c_0_67,plain,
( leq(multiplication(star(X1),X2),X3)
| ~ leq(addition(X2,multiplication(X1,X3)),X3) ),
inference(spm,[status(thm)],[c_0_53,c_0_33]) ).
cnf(c_0_68,plain,
addition(strong_iteration(X1),multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_45]),c_0_33]) ).
cnf(c_0_69,plain,
leq(X1,multiplication(strong_iteration(X2),X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_43]),c_0_35])]) ).
cnf(c_0_70,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
fof(c_0_71,negated_conjecture,
~ ! [X4] :
( leq(multiplication(strong_iteration(X4),strong_iteration(X4)),strong_iteration(X4))
& leq(strong_iteration(X4),multiplication(strong_iteration(X4),strong_iteration(X4))) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_72,plain,
! [X2] : strong_iteration(X2) = addition(star(X2),multiplication(strong_iteration(X2),zero)),
inference(variable_rename,[status(thm)],[isolation]) ).
fof(c_0_73,plain,
! [X4,X5,X6] : multiplication(X4,multiplication(X5,X6)) = multiplication(multiplication(X4,X5),X6),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_74,plain,
( leq(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1))
| ~ leq(strong_iteration(X1),strong_iteration(X1)) ),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_75,plain,
leq(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_52]),c_0_31]) ).
cnf(c_0_76,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_44,c_0_70]) ).
fof(c_0_77,negated_conjecture,
( ~ leq(multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)),strong_iteration(esk1_0))
| ~ leq(strong_iteration(esk2_0),multiplication(strong_iteration(esk2_0),strong_iteration(esk2_0))) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_71])])])]) ).
cnf(c_0_78,plain,
strong_iteration(X1) = addition(star(X1),multiplication(strong_iteration(X1),zero)),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_79,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_80,plain,
leq(multiplication(star(X1),strong_iteration(X1)),strong_iteration(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]) ).
cnf(c_0_81,plain,
addition(X1,multiplication(star(X2),X1)) = multiplication(star(X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_76]),c_0_31]) ).
cnf(c_0_82,negated_conjecture,
( ~ leq(strong_iteration(esk2_0),multiplication(strong_iteration(esk2_0),strong_iteration(esk2_0)))
| ~ leq(multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)),strong_iteration(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_83,plain,
addition(multiplication(strong_iteration(X1),zero),multiplication(star(X1),X2)) = multiplication(strong_iteration(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_78]),c_0_79]),c_0_46]),c_0_33]) ).
cnf(c_0_84,plain,
multiplication(star(X1),strong_iteration(X1)) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_80]),c_0_33]),c_0_81]) ).
cnf(c_0_85,plain,
addition(strong_iteration(X1),multiplication(strong_iteration(X1),zero)) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_78]),c_0_33]) ).
cnf(c_0_86,negated_conjecture,
~ leq(multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)),strong_iteration(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_69])]) ).
cnf(c_0_87,plain,
multiplication(strong_iteration(X1),strong_iteration(X1)) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_33]),c_0_85]) ).
cnf(c_0_88,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87]),c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE143+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n015.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 Jun 16 07:17:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.23/1.42 # Preprocessing time : 0.014 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 89
% 0.23/1.42 # Proof object clause steps : 52
% 0.23/1.42 # Proof object formula steps : 37
% 0.23/1.42 # Proof object conjectures : 6
% 0.23/1.42 # Proof object clause conjectures : 3
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 19
% 0.23/1.42 # Proof object initial formulas used : 18
% 0.23/1.42 # Proof object generating inferences : 28
% 0.23/1.42 # Proof object simplifying inferences : 29
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 19
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 20
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 20
% 0.23/1.42 # Processed clauses : 2421
% 0.23/1.42 # ...of these trivial : 256
% 0.23/1.42 # ...subsumed : 1455
% 0.23/1.42 # ...remaining for further processing : 710
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 14
% 0.23/1.42 # Backward-rewritten : 227
% 0.23/1.42 # Generated clauses : 52831
% 0.23/1.42 # ...of the previous two non-trivial : 38587
% 0.23/1.42 # Contextual simplify-reflections : 35
% 0.23/1.42 # Paramodulations : 52831
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 469
% 0.23/1.42 # Positive orientable unit clauses : 166
% 0.23/1.42 # Positive unorientable unit clauses: 14
% 0.23/1.42 # Negative unit clauses : 9
% 0.23/1.42 # Non-unit-clauses : 280
% 0.23/1.42 # Current number of unprocessed clauses: 22922
% 0.23/1.42 # ...number of literals in the above : 40655
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 241
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 9480
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 9415
% 0.23/1.42 # Non-unit clause-clause subsumptions : 530
% 0.23/1.42 # Unit Clause-clause subsumption calls : 1319
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 2342
% 0.23/1.42 # BW rewrite match successes : 409
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 1135147
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.617 s
% 0.23/1.42 # System time : 0.026 s
% 0.23/1.42 # Total time : 0.643 s
% 0.23/1.42 # Maximum resident set size: 42940 pages
% 0.23/23.42 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.23/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------