TSTP Solution File: KLE147+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE147+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:29 EDT 2023
% Result : Theorem 745.51s 94.55s
% Output : CNFRefutation 745.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of formulae : 76 ( 57 unt; 0 def)
% Number of atoms : 97 ( 56 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 41 ( 20 ~; 15 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 7 ( 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 : 127 ( 5 sgn; 58 !; 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.dqhrLoX8Is/E---3.1_26099.p',star_induction2) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.dqhrLoX8Is/E---3.1_26099.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.dqhrLoX8Is/E---3.1_26099.p',additive_associativity) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.dqhrLoX8Is/E---3.1_26099.p',idempotence) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.dqhrLoX8Is/E---3.1_26099.p',additive_commutativity) ).
fof(star_unfold2,axiom,
! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox2/tmp/tmp.dqhrLoX8Is/E---3.1_26099.p',star_unfold2) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.dqhrLoX8Is/E---3.1_26099.p',multiplicative_left_identity) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/tmp/tmp.dqhrLoX8Is/E---3.1_26099.p',order) ).
fof(star_unfold1,axiom,
! [X1] : addition(one,multiplication(X1,star(X1))) = star(X1),
file('/export/starexec/sandbox2/tmp/tmp.dqhrLoX8Is/E---3.1_26099.p',star_unfold1) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/tmp/tmp.dqhrLoX8Is/E---3.1_26099.p',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.dqhrLoX8Is/E---3.1_26099.p',additive_identity) ).
fof(distributivity2,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.dqhrLoX8Is/E---3.1_26099.p',distributivity2) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.dqhrLoX8Is/E---3.1_26099.p',multiplicative_associativity) ).
fof(infty_unfold1,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox2/tmp/tmp.dqhrLoX8Is/E---3.1_26099.p',infty_unfold1) ).
fof(goals,conjecture,
! [X4,X5] :
( leq(strong_iteration(multiplication(star(X4),X5)),multiplication(star(X5),strong_iteration(multiplication(star(X4),X5))))
& leq(multiplication(star(X5),strong_iteration(multiplication(star(X4),X5))),strong_iteration(multiplication(star(X4),X5))) ),
file('/export/starexec/sandbox2/tmp/tmp.dqhrLoX8Is/E---3.1_26099.p',goals) ).
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.dqhrLoX8Is/E---3.1_26099.p',star_induction1) ).
fof(c_0_16,plain,
! [X11,X12,X13] :
( ~ leq(addition(multiplication(X13,X11),X12),X13)
| leq(multiplication(X12,star(X11)),X13) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction2])]) ).
fof(c_0_17,plain,
! [X24] : multiplication(X24,one) = X24,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_18,plain,
! [X37,X38,X39] : addition(X39,addition(X38,X37)) = addition(addition(X39,X38),X37),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_19,plain,
! [X41] : addition(X41,X41) = X41,
inference(variable_rename,[status(thm)],[idempotence]) ).
cnf(c_0_20,plain,
( leq(multiplication(X3,star(X2)),X1)
| ~ leq(addition(multiplication(X1,X2),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X35,X36] : addition(X35,X36) = addition(X36,X35),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_23,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_25,plain,
! [X34] : addition(one,multiplication(star(X34),X34)) = star(X34),
inference(variable_rename,[status(thm)],[star_unfold2]) ).
cnf(c_0_26,plain,
( leq(multiplication(X1,star(one)),X2)
| ~ leq(addition(X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[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(star(X1),X1)) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_30,plain,
! [X25] : multiplication(one,X25) = X25,
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_26,c_0_27]) ).
cnf(c_0_32,plain,
addition(one,star(X1)) = star(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,
! [X17,X18] :
( ( ~ leq(X17,X18)
| addition(X17,X18) = X18 )
& ( addition(X17,X18) != X18
| leq(X17,X18) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])]) ).
fof(c_0_35,plain,
! [X33] : addition(one,multiplication(X33,star(X33))) = star(X33),
inference(variable_rename,[status(thm)],[star_unfold1]) ).
fof(c_0_36,plain,
! [X32] : multiplication(zero,X32) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_37,plain,
! [X40] : addition(X40,zero) = X40,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_38,plain,
( leq(star(one),star(X1))
| ~ leq(star(X1),star(X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_39,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,plain,
addition(one,multiplication(X1,star(X1))) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,plain,
leq(star(one),star(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_24])]) ).
cnf(c_0_44,plain,
star(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_45,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_27,c_0_23]) ).
cnf(c_0_46,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_47,plain,
leq(star(one),one),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_45,c_0_24]) ).
cnf(c_0_49,plain,
star(one) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_27]),c_0_32]) ).
cnf(c_0_50,plain,
( leq(X1,addition(X2,X1))
| ~ leq(addition(X2,X1),addition(X2,X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_48]),c_0_49]),c_0_21]) ).
fof(c_0_51,plain,
! [X29,X30,X31] : multiplication(addition(X29,X30),X31) = addition(multiplication(X29,X31),multiplication(X30,X31)),
inference(variable_rename,[status(thm)],[distributivity2]) ).
fof(c_0_52,plain,
! [X21,X22,X23] : multiplication(X21,multiplication(X22,X23)) = multiplication(multiplication(X21,X22),X23),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_53,plain,
! [X19] : strong_iteration(X19) = addition(multiplication(X19,strong_iteration(X19)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
fof(c_0_54,negated_conjecture,
~ ! [X4,X5] :
( leq(strong_iteration(multiplication(star(X4),X5)),multiplication(star(X5),strong_iteration(multiplication(star(X4),X5))))
& leq(multiplication(star(X5),strong_iteration(multiplication(star(X4),X5))),strong_iteration(multiplication(star(X4),X5))) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_55,plain,
leq(X1,addition(X2,X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_39]),c_0_24])]) ).
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]) ).
cnf(c_0_57,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_58,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
fof(c_0_59,negated_conjecture,
( ~ leq(strong_iteration(multiplication(star(esk1_0),esk2_0)),multiplication(star(esk2_0),strong_iteration(multiplication(star(esk1_0),esk2_0))))
| ~ leq(multiplication(star(esk2_0),strong_iteration(multiplication(star(esk1_0),esk2_0))),strong_iteration(multiplication(star(esk1_0),esk2_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_54])])]) ).
cnf(c_0_60,plain,
leq(X1,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_55,c_0_27]) ).
cnf(c_0_61,plain,
addition(X1,multiplication(star(X2),multiplication(X2,X1))) = multiplication(star(X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_29]),c_0_33]),c_0_57]) ).
fof(c_0_62,plain,
! [X8,X9,X10] :
( ~ leq(addition(multiplication(X8,X10),X9),X10)
| leq(multiplication(star(X8),X9),X10) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[star_induction1])]) ).
cnf(c_0_63,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_58,c_0_27]) ).
cnf(c_0_64,negated_conjecture,
( ~ leq(strong_iteration(multiplication(star(esk1_0),esk2_0)),multiplication(star(esk2_0),strong_iteration(multiplication(star(esk1_0),esk2_0))))
| ~ leq(multiplication(star(esk2_0),strong_iteration(multiplication(star(esk1_0),esk2_0))),strong_iteration(multiplication(star(esk1_0),esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_65,plain,
leq(X1,multiplication(star(X2),X1)),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,plain,
( leq(multiplication(star(X1),X3),X2)
| ~ leq(addition(multiplication(X1,X2),X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_62]) ).
cnf(c_0_67,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_27]),c_0_23]) ).
cnf(c_0_68,plain,
addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2))))) = strong_iteration(multiplication(X1,X2)),
inference(spm,[status(thm)],[c_0_63,c_0_57]) ).
cnf(c_0_69,negated_conjecture,
~ leq(multiplication(star(esk2_0),strong_iteration(multiplication(star(esk1_0),esk2_0))),strong_iteration(multiplication(star(esk1_0),esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_65])]) ).
cnf(c_0_70,plain,
( leq(multiplication(star(X1),X2),X3)
| addition(X3,addition(multiplication(X1,X3),X2)) != X3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_39]),c_0_23]),c_0_45]) ).
cnf(c_0_71,plain,
addition(one,addition(X1,multiplication(X2,multiplication(X3,strong_iteration(multiplication(X2,X3)))))) = addition(X1,strong_iteration(multiplication(X2,X3))),
inference(spm,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_72,plain,
addition(X1,multiplication(star(X2),X1)) = multiplication(star(X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_32]),c_0_33]) ).
cnf(c_0_73,negated_conjecture,
addition(strong_iteration(multiplication(star(esk1_0),esk2_0)),multiplication(esk2_0,strong_iteration(multiplication(star(esk1_0),esk2_0)))) != strong_iteration(multiplication(star(esk1_0),esk2_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_48]),c_0_27]) ).
cnf(c_0_74,plain,
addition(strong_iteration(multiplication(star(X1),X2)),multiplication(X2,strong_iteration(multiplication(star(X1),X2)))) = strong_iteration(multiplication(star(X1),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_68]),c_0_27]) ).
cnf(c_0_75,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : KLE147+2 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n010.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:35:20 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/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.dqhrLoX8Is/E---3.1_26099.p
% 745.51/94.55 # Version: 3.1pre001
% 745.51/94.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 745.51/94.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 745.51/94.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 745.51/94.55 # Starting new_bool_3 with 300s (1) cores
% 745.51/94.55 # Starting new_bool_1 with 300s (1) cores
% 745.51/94.55 # Starting sh5l with 300s (1) cores
% 745.51/94.55 # sh5l with pid 26180 completed with status 0
% 745.51/94.55 # Result found by sh5l
% 745.51/94.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 745.51/94.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 745.51/94.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 745.51/94.55 # Starting new_bool_3 with 300s (1) cores
% 745.51/94.55 # Starting new_bool_1 with 300s (1) cores
% 745.51/94.55 # Starting sh5l with 300s (1) cores
% 745.51/94.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 745.51/94.55 # Search class: FHHSM-FFMF21-MFFFFFNN
% 745.51/94.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 745.51/94.55 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 150s (1) cores
% 745.51/94.55 # G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with pid 26181 completed with status 0
% 745.51/94.55 # Result found by G-E--_200_B02_F1_AE_CS_SP_PI_S0Y
% 745.51/94.55 # Preprocessing class: FSMSSMSSSSSNFFN.
% 745.51/94.55 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 745.51/94.55 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 745.51/94.55 # Starting new_bool_3 with 300s (1) cores
% 745.51/94.55 # Starting new_bool_1 with 300s (1) cores
% 745.51/94.55 # Starting sh5l with 300s (1) cores
% 745.51/94.55 # SinE strategy is gf500_gu_R04_F100_L20000
% 745.51/94.55 # Search class: FHHSM-FFMF21-MFFFFFNN
% 745.51/94.55 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 745.51/94.55 # Starting G-E--_200_B02_F1_AE_CS_SP_PI_S0Y with 150s (1) cores
% 745.51/94.55 # Preprocessing time : 0.001 s
% 745.51/94.55
% 745.51/94.55 # Proof found!
% 745.51/94.55 # SZS status Theorem
% 745.51/94.55 # SZS output start CNFRefutation
% See solution above
% 745.51/94.56 # Parsed axioms : 19
% 745.51/94.56 # Removed by relevancy pruning/SinE : 0
% 745.51/94.56 # Initial clauses : 20
% 745.51/94.56 # Removed in clause preprocessing : 0
% 745.51/94.56 # Initial clauses in saturation : 20
% 745.51/94.56 # Processed clauses : 78596
% 745.51/94.56 # ...of these trivial : 2146
% 745.51/94.56 # ...subsumed : 71153
% 745.51/94.56 # ...remaining for further processing : 5297
% 745.51/94.56 # Other redundant clauses eliminated : 24
% 745.51/94.56 # Clauses deleted for lack of memory : 284557
% 745.51/94.56 # Backward-subsumed : 263
% 745.51/94.56 # Backward-rewritten : 477
% 745.51/94.56 # Generated clauses : 3414348
% 745.51/94.56 # ...of the previous two non-redundant : 2835917
% 745.51/94.56 # ...aggressively subsumed : 0
% 745.51/94.56 # Contextual simplify-reflections : 9
% 745.51/94.56 # Paramodulations : 3414308
% 745.51/94.56 # Factorizations : 0
% 745.51/94.56 # NegExts : 0
% 745.51/94.56 # Equation resolutions : 40
% 745.51/94.56 # Total rewrite steps : 11203165
% 745.51/94.56 # Propositional unsat checks : 0
% 745.51/94.56 # Propositional check models : 0
% 745.51/94.56 # Propositional check unsatisfiable : 0
% 745.51/94.56 # Propositional clauses : 0
% 745.51/94.56 # Propositional clauses after purity: 0
% 745.51/94.56 # Propositional unsat core size : 0
% 745.51/94.56 # Propositional preprocessing time : 0.000
% 745.51/94.56 # Propositional encoding time : 0.000
% 745.51/94.56 # Propositional solver time : 0.000
% 745.51/94.56 # Success case prop preproc time : 0.000
% 745.51/94.56 # Success case prop encoding time : 0.000
% 745.51/94.56 # Success case prop solver time : 0.000
% 745.51/94.56 # Current number of processed clauses : 4557
% 745.51/94.56 # Positive orientable unit clauses : 884
% 745.51/94.56 # Positive unorientable unit clauses: 57
% 745.51/94.56 # Negative unit clauses : 100
% 745.51/94.56 # Non-unit-clauses : 3516
% 745.51/94.56 # Current number of unprocessed clauses: 986808
% 745.51/94.56 # ...number of literals in the above : 2331637
% 745.51/94.56 # Current number of archived formulas : 0
% 745.51/94.56 # Current number of archived clauses : 740
% 745.51/94.56 # Clause-clause subsumption calls (NU) : 1510733
% 745.51/94.56 # Rec. Clause-clause subsumption calls : 1125466
% 745.51/94.56 # Non-unit clause-clause subsumptions : 16793
% 745.51/94.56 # Unit Clause-clause subsumption calls : 22198
% 745.51/94.56 # Rewrite failures with RHS unbound : 0
% 745.51/94.56 # BW rewrite match attempts : 38553
% 745.51/94.56 # BW rewrite match successes : 1988
% 745.51/94.56 # Condensation attempts : 0
% 745.51/94.56 # Condensation successes : 0
% 745.51/94.56 # Termbank termtop insertions : 86429672
% 745.51/94.56
% 745.51/94.56 # -------------------------------------------------
% 745.51/94.56 # User time : 91.051 s
% 745.51/94.56 # System time : 1.920 s
% 745.51/94.56 # Total time : 92.971 s
% 745.51/94.56 # Maximum resident set size: 1720 pages
% 745.51/94.56
% 745.51/94.56 # -------------------------------------------------
% 745.51/94.56 # User time : 91.055 s
% 745.51/94.56 # System time : 1.922 s
% 745.51/94.56 # Total time : 92.977 s
% 745.51/94.56 # Maximum resident set size: 1692 pages
% 745.51/94.56 % E---3.1 exiting
% 745.51/94.56 % E---3.1 exiting
%------------------------------------------------------------------------------