TSTP Solution File: KLE139+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE139+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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.39s 0.64s
% Output : CNFRefutation 1.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 69 ( 50 unt; 0 def)
% Number of atoms : 90 ( 52 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 41 ( 20 ~; 16 |; 3 &)
% ( 1 <=>; 1 =>; 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 104 ( 2 sgn; 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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.sd1z2Dsq2h/E---3.1_2102.p',star_induction2) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.sd1z2Dsq2h/E---3.1_2102.p',multiplicative_right_identity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.sd1z2Dsq2h/E---3.1_2102.p',additive_associativity) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.sd1z2Dsq2h/E---3.1_2102.p',idempotence) ).
fof(infty_unfold1,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox2/tmp/tmp.sd1z2Dsq2h/E---3.1_2102.p',infty_unfold1) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.sd1z2Dsq2h/E---3.1_2102.p',additive_commutativity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.sd1z2Dsq2h/E---3.1_2102.p',multiplicative_left_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.sd1z2Dsq2h/E---3.1_2102.p',order) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/tmp.sd1z2Dsq2h/E---3.1_2102.p',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.sd1z2Dsq2h/E---3.1_2102.p',additive_identity) ).
fof(star_unfold2,axiom,
! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox2/tmp/tmp.sd1z2Dsq2h/E---3.1_2102.p',star_unfold2) ).
fof(goals,conjecture,
! [X4] :
( leq(strong_iteration(X4),addition(multiplication(strong_iteration(X4),X4),one))
& leq(addition(multiplication(strong_iteration(X4),X4),one),strong_iteration(X4)) ),
file('/export/starexec/sandbox2/tmp/tmp.sd1z2Dsq2h/E---3.1_2102.p',goals) ).
fof(distributivity2,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.sd1z2Dsq2h/E---3.1_2102.p',distributivity2) ).
fof(isolation,axiom,
! [X1] : strong_iteration(X1) = addition(star(X1),multiplication(strong_iteration(X1),zero)),
file('/export/starexec/sandbox2/tmp/tmp.sd1z2Dsq2h/E---3.1_2102.p',isolation) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.sd1z2Dsq2h/E---3.1_2102.p',multiplicative_associativity) ).
fof(c_0_15,plain,
! [X29,X30,X31] :
( ~ leq(addition(multiplication(X31,X29),X30),X31)
| leq(multiplication(X30,star(X29)),X31) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction2])]) ).
fof(c_0_16,plain,
! [X15] : multiplication(X15,one) = X15,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_17,plain,
! [X7,X8,X9] : addition(X9,addition(X8,X7)) = addition(addition(X9,X8),X7),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_18,plain,
! [X11] : addition(X11,X11) = X11,
inference(variable_rename,[status(thm)],[idempotence]) ).
fof(c_0_19,plain,
! [X32] : strong_iteration(X32) = addition(multiplication(X32,strong_iteration(X32)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
fof(c_0_20,plain,
! [X5,X6] : addition(X5,X6) = addition(X6,X5),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_21,plain,
( leq(multiplication(X3,star(X2)),X1)
| ~ leq(addition(multiplication(X1,X2),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( leq(multiplication(X1,star(one)),X2)
| ~ leq(addition(X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_30,plain,
! [X16] : multiplication(one,X16) = X16,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_31,plain,
( leq(multiplication(X1,star(one)),X2)
| ~ leq(addition(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_32,plain,
addition(one,strong_iteration(X1)) = strong_iteration(X1),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_34,plain,
! [X37,X38] :
( ( ~ leq(X37,X38)
| addition(X37,X38) = X38 )
& ( addition(X37,X38) != X38
| leq(X37,X38) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_35,plain,
! [X23] : multiplication(zero,X23) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_36,plain,
! [X10] : addition(X10,zero) = X10,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_37,plain,
( leq(star(one),strong_iteration(X1))
| ~ leq(strong_iteration(X1),strong_iteration(X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_38,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_41,plain,
! [X25] : addition(one,multiplication(star(X25),X25)) = star(X25),
inference(variable_rename,[status(thm)],[star_unfold2]) ).
cnf(c_0_42,plain,
leq(star(one),strong_iteration(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_24])]) ).
cnf(c_0_43,plain,
strong_iteration(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_39]),c_0_40]) ).
cnf(c_0_44,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_45,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_46,plain,
leq(star(one),one),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_28,c_0_44]) ).
cnf(c_0_48,plain,
star(one) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_26]),c_0_47]) ).
cnf(c_0_49,plain,
( leq(X1,X2)
| ~ leq(addition(X1,X2),X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_26]),c_0_48]),c_0_22]) ).
fof(c_0_50,negated_conjecture,
~ ! [X4] :
( leq(strong_iteration(X4),addition(multiplication(strong_iteration(X4),X4),one))
& leq(addition(multiplication(strong_iteration(X4),X4),one),strong_iteration(X4)) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_51,plain,
! [X20,X21,X22] : multiplication(addition(X20,X21),X22) = addition(multiplication(X20,X22),multiplication(X21,X22)),
inference(variable_rename,[status(thm)],[distributivity2]) ).
cnf(c_0_52,plain,
( leq(addition(X1,X2),X3)
| ~ leq(addition(X1,addition(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_23]) ).
cnf(c_0_53,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_28,c_0_26]) ).
fof(c_0_54,negated_conjecture,
( ~ leq(strong_iteration(esk1_0),addition(multiplication(strong_iteration(esk1_0),esk1_0),one))
| ~ leq(addition(multiplication(strong_iteration(esk1_0),esk1_0),one),strong_iteration(esk1_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])])]) ).
cnf(c_0_55,plain,
addition(one,addition(multiplication(star(X1),X1),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_23,c_0_44]) ).
cnf(c_0_56,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
fof(c_0_57,plain,
! [X36] : strong_iteration(X36) = addition(star(X36),multiplication(strong_iteration(X36),zero)),
inference(variable_rename,[status(thm)],[isolation]) ).
fof(c_0_58,plain,
! [X12,X13,X14] : multiplication(X12,multiplication(X13,X14)) = multiplication(multiplication(X12,X13),X14),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_59,plain,
( leq(addition(X1,X2),X1)
| ~ leq(addition(X2,X1),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_24]),c_0_23]),c_0_53]) ).
cnf(c_0_60,negated_conjecture,
( ~ leq(strong_iteration(esk1_0),addition(multiplication(strong_iteration(esk1_0),esk1_0),one))
| ~ leq(addition(multiplication(strong_iteration(esk1_0),esk1_0),one),strong_iteration(esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_61,plain,
addition(one,multiplication(addition(star(X1),X2),X1)) = addition(star(X1),multiplication(X2,X1)),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
strong_iteration(X1) = addition(star(X1),multiplication(strong_iteration(X1),zero)),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_63,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_58]) ).
cnf(c_0_64,plain,
( leq(addition(X1,X2),X1)
| addition(X2,X1) != X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_38]),c_0_23]),c_0_24]) ).
cnf(c_0_65,negated_conjecture,
( ~ leq(strong_iteration(esk1_0),addition(one,multiplication(strong_iteration(esk1_0),esk1_0)))
| ~ leq(addition(one,multiplication(strong_iteration(esk1_0),esk1_0)),strong_iteration(esk1_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_26]),c_0_26]) ).
cnf(c_0_66,plain,
addition(one,multiplication(strong_iteration(X1),X1)) = strong_iteration(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_39]),c_0_62]) ).
cnf(c_0_67,plain,
leq(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_64]),c_0_48]),c_0_22]),c_0_24])]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_66]),c_0_67])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : KLE139+2 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n017.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.31 % CPULimit : 2400
% 0.15/0.31 % WCLimit : 300
% 0.15/0.31 % DateTime : Tue Oct 3 04:16:56 EDT 2023
% 0.15/0.31 % CPUTime :
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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.sd1z2Dsq2h/E---3.1_2102.p
% 1.39/0.64 # Version: 3.1pre001
% 1.39/0.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.39/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.39/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.39/0.64 # Starting new_bool_3 with 300s (1) cores
% 1.39/0.64 # Starting new_bool_1 with 300s (1) cores
% 1.39/0.64 # Starting sh5l with 300s (1) cores
% 1.39/0.64 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2181 completed with status 0
% 1.39/0.64 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.39/0.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.39/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.39/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.39/0.64 # No SInE strategy applied
% 1.39/0.64 # Search class: FHHSM-FFSF21-MFFFFFNN
% 1.39/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.39/0.64 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 811s (1) cores
% 1.39/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.39/0.64 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 1.39/0.64 # Starting new_bool_3 with 136s (1) cores
% 1.39/0.64 # Starting new_bool_1 with 136s (1) cores
% 1.39/0.64 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2187 completed with status 0
% 1.39/0.64 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1.39/0.64 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.39/0.64 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.39/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.39/0.64 # No SInE strategy applied
% 1.39/0.64 # Search class: FHHSM-FFSF21-MFFFFFNN
% 1.39/0.64 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.39/0.64 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 811s (1) cores
% 1.39/0.64 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1.39/0.64 # Preprocessing time : 0.001 s
% 1.39/0.64 # Presaturation interreduction done
% 1.39/0.64
% 1.39/0.64 # Proof found!
% 1.39/0.64 # SZS status Theorem
% 1.39/0.64 # SZS output start CNFRefutation
% See solution above
% 1.39/0.64 # Parsed axioms : 19
% 1.39/0.64 # Removed by relevancy pruning/SinE : 0
% 1.39/0.64 # Initial clauses : 20
% 1.39/0.64 # Removed in clause preprocessing : 0
% 1.39/0.64 # Initial clauses in saturation : 20
% 1.39/0.64 # Processed clauses : 3587
% 1.39/0.64 # ...of these trivial : 228
% 1.39/0.64 # ...subsumed : 2831
% 1.39/0.64 # ...remaining for further processing : 528
% 1.39/0.64 # Other redundant clauses eliminated : 37
% 1.39/0.64 # Clauses deleted for lack of memory : 0
% 1.39/0.64 # Backward-subsumed : 84
% 1.39/0.64 # Backward-rewritten : 59
% 1.39/0.64 # Generated clauses : 18087
% 1.39/0.64 # ...of the previous two non-redundant : 12528
% 1.39/0.64 # ...aggressively subsumed : 0
% 1.39/0.64 # Contextual simplify-reflections : 7
% 1.39/0.64 # Paramodulations : 18050
% 1.39/0.64 # Factorizations : 0
% 1.39/0.64 # NegExts : 0
% 1.39/0.64 # Equation resolutions : 37
% 1.39/0.64 # Total rewrite steps : 20696
% 1.39/0.64 # Propositional unsat checks : 0
% 1.39/0.64 # Propositional check models : 0
% 1.39/0.64 # Propositional check unsatisfiable : 0
% 1.39/0.64 # Propositional clauses : 0
% 1.39/0.64 # Propositional clauses after purity: 0
% 1.39/0.64 # Propositional unsat core size : 0
% 1.39/0.64 # Propositional preprocessing time : 0.000
% 1.39/0.64 # Propositional encoding time : 0.000
% 1.39/0.64 # Propositional solver time : 0.000
% 1.39/0.64 # Success case prop preproc time : 0.000
% 1.39/0.64 # Success case prop encoding time : 0.000
% 1.39/0.64 # Success case prop solver time : 0.000
% 1.39/0.64 # Current number of processed clauses : 365
% 1.39/0.64 # Positive orientable unit clauses : 145
% 1.39/0.64 # Positive unorientable unit clauses: 4
% 1.39/0.64 # Negative unit clauses : 60
% 1.39/0.64 # Non-unit-clauses : 156
% 1.39/0.64 # Current number of unprocessed clauses: 8613
% 1.39/0.64 # ...number of literals in the above : 14593
% 1.39/0.64 # Current number of archived formulas : 0
% 1.39/0.64 # Current number of archived clauses : 163
% 1.39/0.64 # Clause-clause subsumption calls (NU) : 5648
% 1.39/0.64 # Rec. Clause-clause subsumption calls : 5190
% 1.39/0.64 # Non-unit clause-clause subsumptions : 755
% 1.39/0.64 # Unit Clause-clause subsumption calls : 1888
% 1.39/0.64 # Rewrite failures with RHS unbound : 0
% 1.39/0.64 # BW rewrite match attempts : 376
% 1.39/0.64 # BW rewrite match successes : 156
% 1.39/0.64 # Condensation attempts : 0
% 1.39/0.64 # Condensation successes : 0
% 1.39/0.64 # Termbank termtop insertions : 189331
% 1.39/0.64
% 1.39/0.64 # -------------------------------------------------
% 1.39/0.64 # User time : 0.188 s
% 1.39/0.64 # System time : 0.013 s
% 1.39/0.64 # Total time : 0.201 s
% 1.39/0.64 # Maximum resident set size: 1744 pages
% 1.39/0.64
% 1.39/0.64 # -------------------------------------------------
% 1.39/0.64 # User time : 0.956 s
% 1.39/0.64 # System time : 0.030 s
% 1.39/0.64 # Total time : 0.986 s
% 1.39/0.64 # Maximum resident set size: 1688 pages
% 1.39/0.64 % E---3.1 exiting
% 1.39/0.64 % E---3.1 exiting
%------------------------------------------------------------------------------