TSTP Solution File: KLE144+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE144+1 : 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:05:16 EDT 2023
% Result : Theorem 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 15
% Syntax : Number of formulae : 83 ( 71 unt; 0 def)
% Number of atoms : 97 ( 62 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 27 ( 13 ~; 10 |; 1 &)
% ( 1 <=>; 2 =>; 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 : 118 ( 24 sgn; 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(infty_unfold1,axiom,
! [X1] : strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
file('/export/starexec/sandbox/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',infty_unfold1) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',additive_commutativity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',multiplicative_left_identity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',additive_associativity) ).
fof(idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',idempotence) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',order) ).
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/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',infty_coinduction) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',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/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',star_induction2) ).
fof(star_unfold1,axiom,
! [X1] : addition(one,multiplication(X1,star(X1))) = star(X1),
file('/export/starexec/sandbox/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',star_unfold1) ).
fof(star_unfold2,axiom,
! [X1] : addition(one,multiplication(star(X1),X1)) = star(X1),
file('/export/starexec/sandbox/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',star_unfold2) ).
fof(distributivity2,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',distributivity2) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',left_annihilation) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',additive_identity) ).
fof(goals,conjecture,
! [X4] : strong_iteration(star(X4)) = strong_iteration(one),
file('/export/starexec/sandbox/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p',goals) ).
fof(c_0_15,plain,
! [X32] : strong_iteration(X32) = addition(multiplication(X32,strong_iteration(X32)),one),
inference(variable_rename,[status(thm)],[infty_unfold1]) ).
fof(c_0_16,plain,
! [X5,X6] : addition(X5,X6) = addition(X6,X5),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_17,plain,
strong_iteration(X1) = addition(multiplication(X1,strong_iteration(X1)),one),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X16] : multiplication(one,X16) = X16,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_20,plain,
! [X7,X8,X9] : addition(X9,addition(X8,X7)) = addition(addition(X9,X8),X7),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
cnf(c_0_21,plain,
addition(one,multiplication(X1,strong_iteration(X1))) = strong_iteration(X1),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_23,plain,
! [X11] : addition(X11,X11) = X11,
inference(variable_rename,[status(thm)],[idempotence]) ).
fof(c_0_24,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])]) ).
cnf(c_0_25,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,plain,
addition(one,strong_iteration(one)) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
addition(one,addition(strong_iteration(one),X1)) = addition(strong_iteration(one),X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_30,plain,
! [X33,X34,X35] :
( ~ leq(X35,addition(multiplication(X33,X35),X34))
| leq(X35,multiplication(strong_iteration(X33),X34)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[infty_coinduction])]) ).
cnf(c_0_31,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_32,plain,
leq(one,addition(strong_iteration(one),X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(multiplication(X2,X1),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_34,plain,
leq(X1,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_31]) ).
fof(c_0_35,plain,
! [X15] : multiplication(X15,one) = X15,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_36,plain,
leq(one,addition(X1,strong_iteration(one))),
inference(spm,[status(thm)],[c_0_32,c_0_18]) ).
cnf(c_0_37,plain,
leq(X1,multiplication(strong_iteration(one),X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_22]),c_0_34])]) ).
cnf(c_0_38,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_39,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])]) ).
cnf(c_0_40,plain,
( addition(X1,X2) = X2
| ~ leq(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_41,plain,
leq(one,multiplication(strong_iteration(X1),strong_iteration(one))),
inference(spm,[status(thm)],[c_0_33,c_0_36]) ).
cnf(c_0_42,plain,
leq(X1,addition(X2,X1)),
inference(spm,[status(thm)],[c_0_34,c_0_18]) ).
cnf(c_0_43,plain,
leq(X1,strong_iteration(one)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( leq(multiplication(X3,star(X2)),X1)
| ~ leq(addition(multiplication(X1,X2),X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,plain,
( leq(X1,multiplication(strong_iteration(X2),X3))
| ~ leq(X1,addition(X3,multiplication(X2,X1))) ),
inference(spm,[status(thm)],[c_0_33,c_0_18]) ).
cnf(c_0_46,plain,
addition(one,multiplication(strong_iteration(X1),strong_iteration(one))) = multiplication(strong_iteration(X1),strong_iteration(one)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
leq(X1,multiplication(strong_iteration(X2),X1)),
inference(spm,[status(thm)],[c_0_33,c_0_42]) ).
cnf(c_0_48,plain,
addition(X1,strong_iteration(one)) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_40,c_0_43]) ).
cnf(c_0_49,plain,
( leq(multiplication(X1,star(one)),X2)
| ~ leq(addition(X2,X1),X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_38]) ).
cnf(c_0_50,plain,
leq(X1,X1),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
fof(c_0_51,plain,
! [X24] : addition(one,multiplication(X24,star(X24))) = star(X24),
inference(variable_rename,[status(thm)],[star_unfold1]) ).
cnf(c_0_52,plain,
leq(strong_iteration(one),strong_iteration(strong_iteration(X1))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_38]),c_0_47])]) ).
cnf(c_0_53,plain,
addition(strong_iteration(one),X1) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_18,c_0_48]) ).
fof(c_0_54,plain,
! [X25] : addition(one,multiplication(star(X25),X25)) = star(X25),
inference(variable_rename,[status(thm)],[star_unfold2]) ).
cnf(c_0_55,plain,
leq(multiplication(X1,star(one)),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_27]),c_0_50])]) ).
cnf(c_0_56,plain,
addition(one,multiplication(X1,star(X1))) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
fof(c_0_57,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_58,plain,
strong_iteration(strong_iteration(X1)) = strong_iteration(one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_52]),c_0_53]) ).
fof(c_0_59,plain,
! [X23] : multiplication(zero,X23) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
fof(c_0_60,plain,
! [X10] : addition(X10,zero) = X10,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_61,plain,
addition(one,multiplication(star(X1),X1)) = star(X1),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_62,plain,
leq(star(one),one),
inference(spm,[status(thm)],[c_0_55,c_0_22]) ).
cnf(c_0_63,plain,
addition(one,star(one)) = star(one),
inference(spm,[status(thm)],[c_0_56,c_0_22]) ).
cnf(c_0_64,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
cnf(c_0_65,plain,
multiplication(strong_iteration(X1),strong_iteration(one)) = strong_iteration(one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_58]),c_0_46]) ).
cnf(c_0_66,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_67,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_68,plain,
addition(one,addition(multiplication(star(X1),X1),X2)) = addition(star(X1),X2),
inference(spm,[status(thm)],[c_0_25,c_0_61]) ).
cnf(c_0_69,plain,
star(one) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_62]),c_0_18]),c_0_63]) ).
cnf(c_0_70,plain,
multiplication(addition(strong_iteration(X1),X2),strong_iteration(one)) = strong_iteration(one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_53]) ).
cnf(c_0_71,plain,
strong_iteration(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_66]),c_0_67]) ).
cnf(c_0_72,plain,
addition(one,addition(one,X1)) = addition(one,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_38]) ).
cnf(c_0_73,plain,
multiplication(addition(one,X1),strong_iteration(one)) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_74,plain,
addition(one,star(X1)) = star(X1),
inference(spm,[status(thm)],[c_0_72,c_0_61]) ).
cnf(c_0_75,plain,
multiplication(star(X1),strong_iteration(one)) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
fof(c_0_76,negated_conjecture,
~ ! [X4] : strong_iteration(star(X4)) = strong_iteration(one),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_77,plain,
leq(strong_iteration(one),multiplication(strong_iteration(star(X1)),X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_75]),c_0_53]),c_0_50])]) ).
fof(c_0_78,negated_conjecture,
strong_iteration(star(esk1_0)) != strong_iteration(one),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_76])])]) ).
cnf(c_0_79,plain,
multiplication(strong_iteration(star(X1)),X2) = strong_iteration(one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_77]),c_0_53]) ).
cnf(c_0_80,negated_conjecture,
strong_iteration(star(esk1_0)) != strong_iteration(one),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_81,plain,
strong_iteration(star(X1)) = strong_iteration(one),
inference(spm,[status(thm)],[c_0_38,c_0_79]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_81])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : KLE144+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n010.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 04:45:20 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order model finding
% 0.15/0.41 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.2KuJTDDYhU/E---3.1_4160.p
% 0.15/0.46 # Version: 3.1pre001
% 0.15/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.46 # Starting sh5l with 300s (1) cores
% 0.15/0.46 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4237 completed with status 0
% 0.15/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.46 # No SInE strategy applied
% 0.15/0.46 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.15/0.46 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.46 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.15/0.46 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 0.15/0.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 4246 completed with status 0
% 0.15/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.15/0.46 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.46 # No SInE strategy applied
% 0.15/0.46 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.15/0.46 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.46 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.46 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.15/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.15/0.46 # Preprocessing time : 0.001 s
% 0.15/0.46 # Presaturation interreduction done
% 0.15/0.46
% 0.15/0.46 # Proof found!
% 0.15/0.46 # SZS status Theorem
% 0.15/0.46 # SZS output start CNFRefutation
% See solution above
% 0.15/0.46 # Parsed axioms : 19
% 0.15/0.46 # Removed by relevancy pruning/SinE : 0
% 0.15/0.46 # Initial clauses : 20
% 0.15/0.46 # Removed in clause preprocessing : 0
% 0.15/0.46 # Initial clauses in saturation : 20
% 0.15/0.46 # Processed clauses : 613
% 0.15/0.46 # ...of these trivial : 54
% 0.15/0.46 # ...subsumed : 332
% 0.15/0.46 # ...remaining for further processing : 227
% 0.15/0.46 # Other redundant clauses eliminated : 38
% 0.15/0.46 # Clauses deleted for lack of memory : 0
% 0.15/0.46 # Backward-subsumed : 7
% 0.15/0.46 # Backward-rewritten : 62
% 0.15/0.46 # Generated clauses : 3554
% 0.15/0.46 # ...of the previous two non-redundant : 2188
% 0.15/0.46 # ...aggressively subsumed : 0
% 0.15/0.46 # Contextual simplify-reflections : 0
% 0.15/0.46 # Paramodulations : 3516
% 0.15/0.46 # Factorizations : 0
% 0.15/0.46 # NegExts : 0
% 0.15/0.46 # Equation resolutions : 38
% 0.15/0.46 # Total rewrite steps : 3910
% 0.15/0.46 # Propositional unsat checks : 0
% 0.15/0.46 # Propositional check models : 0
% 0.15/0.46 # Propositional check unsatisfiable : 0
% 0.15/0.46 # Propositional clauses : 0
% 0.15/0.46 # Propositional clauses after purity: 0
% 0.15/0.46 # Propositional unsat core size : 0
% 0.15/0.46 # Propositional preprocessing time : 0.000
% 0.15/0.46 # Propositional encoding time : 0.000
% 0.15/0.46 # Propositional solver time : 0.000
% 0.15/0.46 # Success case prop preproc time : 0.000
% 0.15/0.46 # Success case prop encoding time : 0.000
% 0.15/0.46 # Success case prop solver time : 0.000
% 0.15/0.46 # Current number of processed clauses : 138
% 0.15/0.46 # Positive orientable unit clauses : 70
% 0.15/0.46 # Positive unorientable unit clauses: 3
% 0.15/0.46 # Negative unit clauses : 0
% 0.15/0.46 # Non-unit-clauses : 65
% 0.15/0.46 # Current number of unprocessed clauses: 1539
% 0.15/0.46 # ...number of literals in the above : 2466
% 0.15/0.46 # Current number of archived formulas : 0
% 0.15/0.46 # Current number of archived clauses : 89
% 0.15/0.46 # Clause-clause subsumption calls (NU) : 1726
% 0.15/0.46 # Rec. Clause-clause subsumption calls : 1726
% 0.15/0.46 # Non-unit clause-clause subsumptions : 316
% 0.15/0.46 # Unit Clause-clause subsumption calls : 227
% 0.15/0.46 # Rewrite failures with RHS unbound : 0
% 0.15/0.46 # BW rewrite match attempts : 162
% 0.15/0.46 # BW rewrite match successes : 93
% 0.15/0.46 # Condensation attempts : 0
% 0.15/0.46 # Condensation successes : 0
% 0.15/0.46 # Termbank termtop insertions : 40299
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.039 s
% 0.15/0.46 # System time : 0.005 s
% 0.15/0.46 # Total time : 0.043 s
% 0.15/0.46 # Maximum resident set size: 1764 pages
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.196 s
% 0.15/0.46 # System time : 0.019 s
% 0.15/0.46 # Total time : 0.215 s
% 0.15/0.46 # Maximum resident set size: 1684 pages
% 0.15/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------