TSTP Solution File: KLE020+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KLE020+2 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : 300s
% DateTime : Mon May 20 23:10:41 EDT 2024
% Result : Theorem 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 62 ( 38 unt; 0 def)
% Number of atoms : 109 ( 59 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 82 ( 35 ~; 26 |; 16 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 88 ( 0 sgn 48 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goals,conjecture,
! [X4,X5,X6] :
( ( test(X4)
& test(X5)
& test(X6) )
=> ( leq(addition(X4,multiplication(X5,X6)),multiplication(addition(X4,X5),addition(X4,X6)))
& leq(multiplication(addition(X4,X5),addition(X4,X6)),addition(X4,multiplication(X5,X6))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_2) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+1.ax',test_1) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(order,axiom,
! [X1,X2] :
( leq(X1,X2)
<=> addition(X1,X2) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',order) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(c_0_12,negated_conjecture,
~ ! [X4,X5,X6] :
( ( test(X4)
& test(X5)
& test(X6) )
=> ( leq(addition(X4,multiplication(X5,X6)),multiplication(addition(X4,X5),addition(X4,X6)))
& leq(multiplication(addition(X4,X5),addition(X4,X6)),addition(X4,multiplication(X5,X6))) ) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_13,negated_conjecture,
( test(esk2_0)
& test(esk3_0)
& test(esk4_0)
& ( ~ leq(addition(esk2_0,multiplication(esk3_0,esk4_0)),multiplication(addition(esk2_0,esk3_0),addition(esk2_0,esk4_0)))
| ~ leq(multiplication(addition(esk2_0,esk3_0),addition(esk2_0,esk4_0)),addition(esk2_0,multiplication(esk3_0,esk4_0))) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).
fof(c_0_14,plain,
! [X19,X20,X21] : multiplication(X19,addition(X20,X21)) = addition(multiplication(X19,X20),multiplication(X19,X21)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_15,negated_conjecture,
( ~ leq(addition(esk2_0,multiplication(esk3_0,esk4_0)),multiplication(addition(esk2_0,esk3_0),addition(esk2_0,esk4_0)))
| ~ leq(multiplication(addition(esk2_0,esk3_0),addition(esk2_0,esk4_0)),addition(esk2_0,multiplication(esk3_0,esk4_0))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_17,plain,
! [X22,X23,X24] : multiplication(addition(X22,X23),X24) = addition(multiplication(X22,X24),multiplication(X23,X24)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_18,plain,
! [X9,X10,X11] : addition(X11,addition(X10,X9)) = addition(addition(X11,X10),X9),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_19,plain,
! [X33,X34] :
( ( multiplication(X33,X34) = zero
| ~ complement(X34,X33) )
& ( multiplication(X34,X33) = zero
| ~ complement(X34,X33) )
& ( addition(X33,X34) = one
| ~ complement(X34,X33) )
& ( multiplication(X33,X34) != zero
| multiplication(X34,X33) != zero
| addition(X33,X34) != one
| complement(X34,X33) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])])]) ).
fof(c_0_20,plain,
! [X29,X31,X32] :
( ( ~ test(X29)
| complement(esk1_1(X29),X29) )
& ( ~ complement(X32,X31)
| test(X31) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[test_1])])])])])]) ).
fof(c_0_21,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_22,negated_conjecture,
( ~ leq(addition(esk2_0,multiplication(esk3_0,esk4_0)),addition(multiplication(addition(esk2_0,esk3_0),esk2_0),multiplication(addition(esk2_0,esk3_0),esk4_0)))
| ~ leq(addition(multiplication(addition(esk2_0,esk3_0),esk2_0),multiplication(addition(esk2_0,esk3_0),esk4_0)),addition(esk2_0,multiplication(esk3_0,esk4_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).
cnf(c_0_23,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X27,X28] :
( ( ~ leq(X27,X28)
| addition(X27,X28) = X28 )
& ( addition(X27,X28) != X28
| leq(X27,X28) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[order])])]) ).
cnf(c_0_26,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_28,plain,
! [X18] : multiplication(one,X18) = X18,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
cnf(c_0_29,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
( ~ leq(addition(esk2_0,multiplication(esk3_0,esk4_0)),addition(multiplication(esk2_0,esk2_0),addition(multiplication(esk3_0,esk2_0),addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk4_0)))))
| ~ leq(addition(multiplication(esk2_0,esk2_0),addition(multiplication(esk3_0,esk2_0),addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk4_0)))),addition(esk2_0,multiplication(esk3_0,esk4_0))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_23]),c_0_24]),c_0_23]),c_0_24]) ).
cnf(c_0_31,plain,
( leq(X1,X2)
| addition(X1,X2) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_32,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_33,plain,
( addition(X1,esk1_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_36,plain,
! [X12] : addition(X12,zero) = X12,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_37,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_38,negated_conjecture,
( addition(multiplication(esk2_0,esk2_0),addition(multiplication(esk3_0,esk2_0),addition(multiplication(esk2_0,esk4_0),addition(multiplication(esk3_0,esk4_0),addition(esk2_0,multiplication(esk3_0,esk4_0)))))) != addition(esk2_0,multiplication(esk3_0,esk4_0))
| ~ leq(addition(esk2_0,multiplication(esk3_0,esk4_0)),addition(multiplication(esk2_0,esk2_0),addition(multiplication(esk3_0,esk2_0),addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk4_0))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_39,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_40,plain,
( addition(multiplication(X1,X2),multiplication(esk1_1(X1),X2)) = X2
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_33]),c_0_34]) ).
cnf(c_0_41,plain,
( multiplication(esk1_1(X1),X1) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_27]) ).
cnf(c_0_42,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_33]) ).
cnf(c_0_44,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_45,negated_conjecture,
test(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_46,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_47,negated_conjecture,
( addition(esk2_0,addition(multiplication(esk3_0,esk4_0),addition(multiplication(esk2_0,esk2_0),addition(multiplication(esk3_0,esk2_0),addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk4_0)))))) != addition(multiplication(esk2_0,esk2_0),addition(multiplication(esk3_0,esk2_0),addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk4_0))))
| addition(multiplication(esk2_0,esk2_0),addition(multiplication(esk3_0,esk2_0),addition(multiplication(esk2_0,esk4_0),addition(multiplication(esk3_0,esk4_0),addition(esk2_0,multiplication(esk3_0,esk4_0)))))) != addition(esk2_0,multiplication(esk3_0,esk4_0)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_31]),c_0_24]) ).
cnf(c_0_48,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_39]),c_0_24]) ).
cnf(c_0_49,plain,
( multiplication(X1,X1) = X1
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_50,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_51,negated_conjecture,
addition(esk3_0,one) = one,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,negated_conjecture,
addition(esk4_0,one) = one,
inference(spm,[status(thm)],[c_0_43,c_0_45]) ).
cnf(c_0_53,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_54,negated_conjecture,
( addition(esk2_0,addition(multiplication(esk2_0,esk2_0),addition(multiplication(esk3_0,esk2_0),addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk4_0))))) != addition(multiplication(esk2_0,esk2_0),addition(multiplication(esk3_0,esk2_0),addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk4_0))))
| addition(esk2_0,addition(multiplication(esk2_0,esk2_0),addition(multiplication(esk3_0,esk2_0),addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk4_0))))) != addition(esk2_0,multiplication(esk3_0,esk4_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_48]),c_0_48]),c_0_29]),c_0_48]),c_0_29]),c_0_48]),c_0_48]),c_0_48]) ).
cnf(c_0_55,negated_conjecture,
multiplication(esk2_0,esk2_0) = esk2_0,
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
addition(X1,multiplication(esk3_0,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_51]),c_0_34]),c_0_34]),c_0_39]) ).
cnf(c_0_57,negated_conjecture,
addition(X1,multiplication(X1,esk4_0)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_52]),c_0_53]),c_0_53]),c_0_39]) ).
cnf(c_0_58,negated_conjecture,
addition(esk2_0,addition(multiplication(esk3_0,esk2_0),addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk4_0)))) != addition(esk2_0,multiplication(esk3_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55]),c_0_37]),c_0_55]),c_0_55]),c_0_37])]) ).
cnf(c_0_59,negated_conjecture,
addition(X1,addition(multiplication(esk3_0,X1),X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
addition(X1,addition(multiplication(X1,esk4_0),X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE020+2 : TPTP v8.2.0. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n007.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 09:52:23 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.19/0.47 Running first-order theorem proving
% 0.19/0.47 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/benchmark/theBenchmark.p
% 0.19/0.57 # Version: 3.1.0
% 0.19/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.57 # Starting sh5l with 300s (1) cores
% 0.19/0.57 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 12948 completed with status 0
% 0.19/0.57 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.57 # No SInE strategy applied
% 0.19/0.57 # Search class: FGHSM-FFMS21-SFFFFFNN
% 0.19/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.57 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.19/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.57 # Starting new_bool_3 with 136s (1) cores
% 0.19/0.57 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.57 # Starting sh5l with 136s (1) cores
% 0.19/0.57 # G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 12952 completed with status 0
% 0.19/0.57 # Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 0.19/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.57 # No SInE strategy applied
% 0.19/0.57 # Search class: FGHSM-FFMS21-SFFFFFNN
% 0.19/0.57 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.57 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 811s (1) cores
% 0.19/0.57 # Preprocessing time : 0.001 s
% 0.19/0.57 # Presaturation interreduction done
% 0.19/0.57
% 0.19/0.57 # Proof found!
% 0.19/0.57 # SZS status Theorem
% 0.19/0.57 # SZS output start CNFRefutation
% See solution above
% 0.19/0.57 # Parsed axioms : 17
% 0.19/0.57 # Removed by relevancy pruning/SinE : 0
% 0.19/0.57 # Initial clauses : 26
% 0.19/0.57 # Removed in clause preprocessing : 0
% 0.19/0.57 # Initial clauses in saturation : 26
% 0.19/0.57 # Processed clauses : 1161
% 0.19/0.57 # ...of these trivial : 92
% 0.19/0.57 # ...subsumed : 631
% 0.19/0.57 # ...remaining for further processing : 438
% 0.19/0.57 # Other redundant clauses eliminated : 212
% 0.19/0.57 # Clauses deleted for lack of memory : 0
% 0.19/0.57 # Backward-subsumed : 78
% 0.19/0.57 # Backward-rewritten : 79
% 0.19/0.57 # Generated clauses : 9436
% 0.19/0.57 # ...of the previous two non-redundant : 5761
% 0.19/0.57 # ...aggressively subsumed : 0
% 0.19/0.57 # Contextual simplify-reflections : 18
% 0.19/0.57 # Paramodulations : 9224
% 0.19/0.57 # Factorizations : 0
% 0.19/0.57 # NegExts : 0
% 0.19/0.57 # Equation resolutions : 212
% 0.19/0.57 # Disequality decompositions : 0
% 0.19/0.57 # Total rewrite steps : 15391
% 0.19/0.57 # ...of those cached : 12516
% 0.19/0.57 # Propositional unsat checks : 0
% 0.19/0.57 # Propositional check models : 0
% 0.19/0.57 # Propositional check unsatisfiable : 0
% 0.19/0.57 # Propositional clauses : 0
% 0.19/0.57 # Propositional clauses after purity: 0
% 0.19/0.57 # Propositional unsat core size : 0
% 0.19/0.57 # Propositional preprocessing time : 0.000
% 0.19/0.57 # Propositional encoding time : 0.000
% 0.19/0.57 # Propositional solver time : 0.000
% 0.19/0.57 # Success case prop preproc time : 0.000
% 0.19/0.57 # Success case prop encoding time : 0.000
% 0.19/0.57 # Success case prop solver time : 0.000
% 0.19/0.57 # Current number of processed clauses : 254
% 0.19/0.57 # Positive orientable unit clauses : 116
% 0.19/0.57 # Positive unorientable unit clauses: 4
% 0.19/0.57 # Negative unit clauses : 3
% 0.19/0.57 # Non-unit-clauses : 131
% 0.19/0.57 # Current number of unprocessed clauses: 4444
% 0.19/0.57 # ...number of literals in the above : 9295
% 0.19/0.57 # Current number of archived formulas : 0
% 0.19/0.57 # Current number of archived clauses : 183
% 0.19/0.57 # Clause-clause subsumption calls (NU) : 4655
% 0.19/0.57 # Rec. Clause-clause subsumption calls : 3649
% 0.19/0.57 # Non-unit clause-clause subsumptions : 600
% 0.19/0.57 # Unit Clause-clause subsumption calls : 1531
% 0.19/0.57 # Rewrite failures with RHS unbound : 0
% 0.19/0.57 # BW rewrite match attempts : 361
% 0.19/0.57 # BW rewrite match successes : 176
% 0.19/0.57 # Condensation attempts : 0
% 0.19/0.57 # Condensation successes : 0
% 0.19/0.57 # Termbank termtop insertions : 113610
% 0.19/0.57 # Search garbage collected termcells : 201
% 0.19/0.57
% 0.19/0.57 # -------------------------------------------------
% 0.19/0.57 # User time : 0.094 s
% 0.19/0.57 # System time : 0.003 s
% 0.19/0.57 # Total time : 0.097 s
% 0.19/0.57 # Maximum resident set size: 1760 pages
% 0.19/0.57
% 0.19/0.57 # -------------------------------------------------
% 0.19/0.57 # User time : 0.459 s
% 0.19/0.57 # System time : 0.012 s
% 0.19/0.57 # Total time : 0.471 s
% 0.19/0.57 # Maximum resident set size: 1708 pages
% 0.19/0.57 % E---3.1 exiting
% 0.19/0.57 % E exiting
%------------------------------------------------------------------------------