TSTP Solution File: KLE140+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE140+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:04:27 EDT 2023
% Result : Theorem 1.96s 0.72s
% Output : CNFRefutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 15
% Syntax : Number of formulae : 72 ( 51 unt; 0 def)
% Number of atoms : 95 ( 47 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 41 ( 18 ~; 15 |; 2 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 5 ( 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 : 121 ( 5 sgn; 56 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',additive_commutativity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',additive_associativity) ).
fof(infty_coinduction,axiom,
! [X1,X2,X3] :
( leq(X3,addition(multiplication(X1,X3),X2))
=> leq(X3,multiplication(strong_iteration(X1),X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',infty_coinduction) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',order) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',idempotence) ).
fof(infty_unfold1,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',infty_unfold1) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',additive_identity) ).
fof(star_induction2,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X3,X1),X2),X3)
=> leq(multiplication(X2,star(X1)),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',star_induction2) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',multiplicative_right_identity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',multiplicative_left_identity) ).
fof(star_unfold2,axiom,
! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',star_unfold2) ).
fof(star_induction1,axiom,
! [X1,X2,X3] :
( leq(addition(multiplication(X1,X3),X2),X3)
=> leq(multiplication(star(X1),X2),X3) ),
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',star_induction1) ).
fof(distributivity2,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',distributivity2) ).
fof(goals,conjecture,
! [X4,X5] :
( leq(X4,X5)
=> leq(strong_iteration(X4),strong_iteration(X5)) ),
file('/export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p',goals) ).
fof(c_0_15,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_16,plain,
! [X8,X9,X10] : addition(X10,addition(X9,X8)) = addition(addition(X10,X9),X8),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_17,plain,
! [X34,X35,X36] :
( ~ leq(X36,addition(multiplication(X34,X36),X35))
| leq(X36,multiplication(strong_iteration(X34),X35)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[infty_coinduction])]) ).
fof(c_0_18,plain,
! [X38,X39] :
( ( ~ leq(X38,X39)
| addition(X38,X39) = X39 )
& ( addition(X38,X39) != X39
| leq(X38,X39) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
cnf(c_0_19,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X12] : addition(X12,X12) = X12,
inference(variable_rename,[status(thm)],[idempotence]) ).
fof(c_0_22,plain,
! [X33] : strong_iteration(X33) = addition(multiplication(X33,strong_iteration(X33)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
cnf(c_0_23,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,plain,
! [X24] : multiplication(zero,X24) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_29,plain,
! [X11] : addition(X11,zero) = X11,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_30,plain,
! [X30,X31,X32] :
( ~ leq(addition(multiplication(X32,X30),X31),X32)
| leq(multiplication(X31,star(X30)),X32) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction2])]) ).
fof(c_0_31,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_32,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| addition(X1,addition(multiplication(X2,X1),X3)) != addition(multiplication(X2,X1),X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_35,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_37,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_38,plain,
( leq(multiplication(X3,star(X2)),X1)
| ~ leq(addition(multiplication(X1,X2),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,plain,
leq(X1,multiplication(strong_iteration(X2),X1)),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_41,plain,
strong_iteration(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_42,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,plain,
( leq(multiplication(X1,star(one)),X2)
| ~ leq(addition(X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
leq(X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
fof(c_0_45,plain,
! [X26] : addition(one,multiplication(star(X26),X26)) = star(X26),
inference(variable_rename,[status(thm)],[star_unfold2]) ).
cnf(c_0_46,plain,
leq(multiplication(X1,star(one)),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_26]),c_0_44])]) ).
cnf(c_0_47,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_26]) ).
cnf(c_0_48,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
fof(c_0_49,plain,
! [X27,X28,X29] :
( ~ leq(addition(multiplication(X27,X29),X28),X29)
| leq(multiplication(star(X27),X28),X29) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction1])]) ).
cnf(c_0_50,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_51,plain,
leq(star(one),one),
inference(spm,[status(thm)],[c_0_46,c_0_42]) ).
cnf(c_0_52,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,plain,
( leq(multiplication(star(X1),X3),X2)
| ~ leq(addition(multiplication(X1,X2),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_54,plain,
star(one) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_19]),c_0_52]) ).
fof(c_0_55,plain,
! [X21,X22,X23] : multiplication(addition(X21,X22),X23) = addition(multiplication(X21,X23),multiplication(X22,X23)),
inference(variable_rename,[status(thm)],[distributivity2]) ).
cnf(c_0_56,plain,
( leq(X1,X2)
| ~ leq(addition(X2,X1),X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_42]),c_0_54]),c_0_42]) ).
cnf(c_0_57,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_58,plain,
( leq(X1,X2)
| ~ leq(addition(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_19]) ).
fof(c_0_59,negated_conjecture,
~ ! [X4,X5] :
( leq(X4,X5)
=> leq(strong_iteration(X4),strong_iteration(X5)) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_60,plain,
addition(one,addition(multiplication(X1,strong_iteration(X1)),X2)) = addition(strong_iteration(X1),X2),
inference(spm,[status(thm)],[c_0_20,c_0_34]) ).
cnf(c_0_61,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_42]),c_0_19]) ).
cnf(c_0_62,plain,
leq(X1,addition(X1,X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_47]),c_0_44])]) ).
fof(c_0_63,negated_conjecture,
( leq(esk1_0,esk2_0)
& ~ leq(strong_iteration(esk1_0),strong_iteration(esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_59])])]) ).
cnf(c_0_64,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(X3,multiplication(X2,X1))) ),
inference(spm,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_65,plain,
addition(one,multiplication(addition(X1,X2),strong_iteration(X1))) = multiplication(addition(X2,one),strong_iteration(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_57]),c_0_61]) ).
cnf(c_0_66,plain,
leq(X1,multiplication(addition(X2,one),X1)),
inference(spm,[status(thm)],[c_0_62,c_0_61]) ).
cnf(c_0_67,negated_conjecture,
leq(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_68,plain,
leq(strong_iteration(X1),strong_iteration(addition(X1,X2))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_39]),c_0_66])]) ).
cnf(c_0_69,negated_conjecture,
addition(esk1_0,esk2_0) = esk2_0,
inference(spm,[status(thm)],[c_0_50,c_0_67]) ).
cnf(c_0_70,negated_conjecture,
~ leq(strong_iteration(esk1_0),strong_iteration(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : KLE140+1 : TPTP v8.1.2. Released v4.0.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 04:51:43 EDT 2023
% 0.21/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.EYpBU1rJAs/E---3.1_9653.p
% 1.96/0.72 # Version: 3.1pre001
% 1.96/0.72 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.96/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.96/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.96/0.72 # Starting new_bool_3 with 300s (1) cores
% 1.96/0.72 # Starting new_bool_1 with 300s (1) cores
% 1.96/0.72 # Starting sh5l with 300s (1) cores
% 1.96/0.72 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9731 completed with status 0
% 1.96/0.72 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.96/0.72 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.96/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.96/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.96/0.72 # No SInE strategy applied
% 1.96/0.72 # Search class: FHUSM-FFSF21-MFFFFFNN
% 1.96/0.72 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.96/0.72 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.96/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.96/0.72 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 1.96/0.72 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.96/0.72 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 1.96/0.72 # G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with pid 9739 completed with status 0
% 1.96/0.72 # Result found by G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y
% 1.96/0.72 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.96/0.72 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.96/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.96/0.72 # No SInE strategy applied
% 1.96/0.72 # Search class: FHUSM-FFSF21-MFFFFFNN
% 1.96/0.72 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 1.96/0.72 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.96/0.72 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.96/0.72 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 1.96/0.72 # Preprocessing time : 0.001 s
% 1.96/0.72 # Presaturation interreduction done
% 1.96/0.72
% 1.96/0.72 # Proof found!
% 1.96/0.72 # SZS status Theorem
% 1.96/0.72 # SZS output start CNFRefutation
% See solution above
% 1.96/0.72 # Parsed axioms : 19
% 1.96/0.72 # Removed by relevancy pruning/SinE : 0
% 1.96/0.72 # Initial clauses : 21
% 1.96/0.72 # Removed in clause preprocessing : 0
% 1.96/0.72 # Initial clauses in saturation : 21
% 1.96/0.72 # Processed clauses : 2006
% 1.96/0.72 # ...of these trivial : 201
% 1.96/0.72 # ...subsumed : 1288
% 1.96/0.72 # ...remaining for further processing : 517
% 1.96/0.72 # Other redundant clauses eliminated : 0
% 1.96/0.72 # Clauses deleted for lack of memory : 0
% 1.96/0.72 # Backward-subsumed : 117
% 1.96/0.72 # Backward-rewritten : 25
% 1.96/0.72 # Generated clauses : 17989
% 1.96/0.72 # ...of the previous two non-redundant : 13571
% 1.96/0.72 # ...aggressively subsumed : 0
% 1.96/0.72 # Contextual simplify-reflections : 2
% 1.96/0.72 # Paramodulations : 17989
% 1.96/0.72 # Factorizations : 0
% 1.96/0.72 # NegExts : 0
% 1.96/0.72 # Equation resolutions : 0
% 1.96/0.72 # Total rewrite steps : 15255
% 1.96/0.72 # Propositional unsat checks : 0
% 1.96/0.72 # Propositional check models : 0
% 1.96/0.72 # Propositional check unsatisfiable : 0
% 1.96/0.72 # Propositional clauses : 0
% 1.96/0.72 # Propositional clauses after purity: 0
% 1.96/0.72 # Propositional unsat core size : 0
% 1.96/0.72 # Propositional preprocessing time : 0.000
% 1.96/0.72 # Propositional encoding time : 0.000
% 1.96/0.72 # Propositional solver time : 0.000
% 1.96/0.72 # Success case prop preproc time : 0.000
% 1.96/0.72 # Success case prop encoding time : 0.000
% 1.96/0.72 # Success case prop solver time : 0.000
% 1.96/0.72 # Current number of processed clauses : 354
% 1.96/0.72 # Positive orientable unit clauses : 176
% 1.96/0.72 # Positive unorientable unit clauses: 9
% 1.96/0.72 # Negative unit clauses : 13
% 1.96/0.72 # Non-unit-clauses : 156
% 1.96/0.72 # Current number of unprocessed clauses: 11351
% 1.96/0.72 # ...number of literals in the above : 21121
% 1.96/0.72 # Current number of archived formulas : 0
% 1.96/0.72 # Current number of archived clauses : 163
% 1.96/0.72 # Clause-clause subsumption calls (NU) : 4697
% 1.96/0.72 # Rec. Clause-clause subsumption calls : 4465
% 1.96/0.72 # Non-unit clause-clause subsumptions : 911
% 1.96/0.72 # Unit Clause-clause subsumption calls : 936
% 1.96/0.72 # Rewrite failures with RHS unbound : 0
% 1.96/0.72 # BW rewrite match attempts : 474
% 1.96/0.72 # BW rewrite match successes : 129
% 1.96/0.72 # Condensation attempts : 2006
% 1.96/0.72 # Condensation successes : 69
% 1.96/0.72 # Termbank termtop insertions : 174124
% 1.96/0.72
% 1.96/0.72 # -------------------------------------------------
% 1.96/0.72 # User time : 0.176 s
% 1.96/0.72 # System time : 0.010 s
% 1.96/0.72 # Total time : 0.186 s
% 1.96/0.72 # Maximum resident set size: 1748 pages
% 1.96/0.72
% 1.96/0.72 # -------------------------------------------------
% 1.96/0.72 # User time : 0.954 s
% 1.96/0.72 # System time : 0.041 s
% 1.96/0.72 # Total time : 0.995 s
% 1.96/0.72 # Maximum resident set size: 1692 pages
% 1.96/0.72 % E---3.1 exiting
% 1.96/0.72 % E---3.1 exiting
%------------------------------------------------------------------------------