TSTP Solution File: KLE010+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE010+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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:03:49 EDT 2023
% Result : Theorem 2.00s 0.77s
% Output : CNFRefutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 64 ( 40 unt; 0 def)
% Number of atoms : 109 ( 65 equ)
% Maximal formula atoms : 10 ( 1 avg)
% Number of connectives : 80 ( 35 ~; 28 |; 11 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 97 ( 2 sgn; 46 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(test_2,axiom,
! [X4,X5] :
( complement(X5,X4)
<=> ( multiplication(X4,X5) = zero
& multiplication(X5,X4) = zero
& addition(X4,X5) = one ) ),
file('/export/starexec/sandbox/tmp/tmp.BlvZtzFuTq/E---3.1_4935.p',test_2) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox/tmp/tmp.BlvZtzFuTq/E---3.1_4935.p',test_1) ).
fof(test_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox/tmp/tmp.BlvZtzFuTq/E---3.1_4935.p',test_3) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.BlvZtzFuTq/E---3.1_4935.p',left_distributivity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.BlvZtzFuTq/E---3.1_4935.p',additive_identity) ).
fof(goals,conjecture,
! [X4,X5] :
( ( test(X5)
& test(X4) )
=> one = addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))) ),
file('/export/starexec/sandbox/tmp/tmp.BlvZtzFuTq/E---3.1_4935.p',goals) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.BlvZtzFuTq/E---3.1_4935.p',additive_commutativity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.BlvZtzFuTq/E---3.1_4935.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.BlvZtzFuTq/E---3.1_4935.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.BlvZtzFuTq/E---3.1_4935.p',additive_idempotence) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.BlvZtzFuTq/E---3.1_4935.p',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.BlvZtzFuTq/E---3.1_4935.p',multiplicative_right_identity) ).
fof(c_0_12,plain,
! [X32,X33] :
( ( multiplication(X32,X33) = zero
| ~ complement(X33,X32) )
& ( multiplication(X33,X32) = zero
| ~ complement(X33,X32) )
& ( addition(X32,X33) = one
| ~ complement(X33,X32) )
& ( multiplication(X32,X33) != zero
| multiplication(X33,X32) != zero
| addition(X32,X33) != one
| complement(X33,X32) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
fof(c_0_13,plain,
! [X28,X30,X31] :
( ( ~ test(X28)
| complement(esk1_1(X28),X28) )
& ( ~ complement(X31,X30)
| test(X30) ) ),
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_14,plain,
! [X34,X35] :
( ( c(X34) != X35
| complement(X34,X35)
| ~ test(X34) )
& ( ~ complement(X34,X35)
| c(X34) = X35
| ~ test(X34) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
fof(c_0_15,plain,
! [X21,X22,X23] : multiplication(addition(X21,X22),X23) = addition(multiplication(X21,X23),multiplication(X22,X23)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_16,plain,
( multiplication(X1,X2) = zero
| ~ complement(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( complement(esk1_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X11] : addition(X11,zero) = X11,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_19,negated_conjecture,
~ ! [X4,X5] :
( ( test(X5)
& test(X4) )
=> one = addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))) ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_20,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
cnf(c_0_22,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( multiplication(esk1_1(X1),X1) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_26,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_27,plain,
! [X8,X9,X10] : addition(X10,addition(X9,X8)) = addition(addition(X10,X9),X8),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_28,plain,
! [X12] : addition(X12,X12) = X12,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_29,negated_conjecture,
( test(esk3_0)
& test(esk2_0)
& one != addition(addition(addition(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),multiplication(esk2_0,esk3_0)),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
cnf(c_0_30,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
( multiplication(addition(X1,esk1_1(X2)),X2) = multiplication(X1,X2)
| ~ test(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_33,plain,
( addition(X1,esk1_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
cnf(c_0_34,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_37,negated_conjecture,
one != addition(addition(addition(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),multiplication(esk2_0,esk3_0)),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_38,plain,
! [X18,X19,X20] : multiplication(X18,addition(X19,X20)) = addition(multiplication(X18,X19),multiplication(X18,X20)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_39,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_30]),c_0_31]) ).
cnf(c_0_40,plain,
( multiplication(X1,X1) = X1
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_41,negated_conjecture,
test(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_42,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
addition(multiplication(c(esk2_0),c(esk3_0)),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(esk2_0,esk3_0),addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0))))) != one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_31]),c_0_31]),c_0_31]) ).
cnf(c_0_44,plain,
addition(X1,addition(X2,X3)) = addition(X3,addition(X1,X2)),
inference(spm,[status(thm)],[c_0_31,c_0_35]) ).
cnf(c_0_45,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_46,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_47,plain,
( addition(X1,addition(X2,c(addition(X1,X2)))) = one
| ~ test(addition(X1,X2)) ),
inference(spm,[status(thm)],[c_0_35,c_0_39]) ).
cnf(c_0_48,negated_conjecture,
multiplication(esk3_0,esk3_0) = esk3_0,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_34]),c_0_31]) ).
cnf(c_0_50,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_33]) ).
cnf(c_0_51,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_52,negated_conjecture,
addition(multiplication(esk2_0,esk3_0),addition(multiplication(addition(esk3_0,c(esk3_0)),esk2_0),multiplication(c(esk2_0),addition(esk3_0,c(esk3_0))))) != one,
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_43,c_0_44]),c_0_22]),c_0_35]),c_0_44]),c_0_35]),c_0_45]),c_0_31]) ).
cnf(c_0_53,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_54,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_31]),c_0_35]) ).
cnf(c_0_55,plain,
( addition(X1,one) = one
| ~ test(addition(X1,X2)) ),
inference(spm,[status(thm)],[c_0_42,c_0_47]) ).
cnf(c_0_56,negated_conjecture,
multiplication(addition(X1,one),esk3_0) = multiplication(addition(X1,esk3_0),esk3_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_48]),c_0_31]),c_0_49]) ).
cnf(c_0_57,negated_conjecture,
addition(esk2_0,one) = one,
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
addition(esk2_0,addition(multiplication(esk2_0,esk3_0),c(esk2_0))) != one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_39]),c_0_34]),c_0_53]),c_0_41])]),c_0_44]),c_0_31]) ).
cnf(c_0_59,plain,
( addition(X1,addition(X2,c(X1))) = addition(X2,one)
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_54,c_0_39]) ).
cnf(c_0_60,plain,
( addition(one,multiplication(X1,X2)) = one
| ~ test(multiplication(addition(X1,X3),X2)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_22]),c_0_31]) ).
cnf(c_0_61,negated_conjecture,
multiplication(addition(esk2_0,esk3_0),esk3_0) = esk3_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_34]) ).
cnf(c_0_62,negated_conjecture,
addition(one,multiplication(esk2_0,esk3_0)) != one,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_51])]),c_0_31]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_41])]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : KLE010+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Tue Oct 3 04:53:48 EDT 2023
% 0.14/0.37 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.BlvZtzFuTq/E---3.1_4935.p
% 2.00/0.77 # Version: 3.1pre001
% 2.00/0.77 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.00/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.00/0.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.00/0.77 # Starting new_bool_3 with 300s (1) cores
% 2.00/0.77 # Starting new_bool_1 with 300s (1) cores
% 2.00/0.77 # Starting sh5l with 300s (1) cores
% 2.00/0.77 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5013 completed with status 0
% 2.00/0.77 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.00/0.77 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.00/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.00/0.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.00/0.77 # No SInE strategy applied
% 2.00/0.77 # Search class: FGUSM-FFMF21-DFFFFFNN
% 2.00/0.77 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.00/0.77 # Starting SAT001_MinMin_p005000_rr_RG with 675s (1) cores
% 2.00/0.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.00/0.77 # Starting new_bool_3 with 169s (1) cores
% 2.00/0.77 # Starting new_bool_1 with 169s (1) cores
% 2.00/0.77 # Starting sh5l with 169s (1) cores
% 2.00/0.77 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 5018 completed with status 0
% 2.00/0.77 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.00/0.77 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.00/0.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.00/0.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.00/0.77 # No SInE strategy applied
% 2.00/0.77 # Search class: FGUSM-FFMF21-DFFFFFNN
% 2.00/0.77 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.00/0.77 # Starting SAT001_MinMin_p005000_rr_RG with 675s (1) cores
% 2.00/0.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.00/0.77 # Preprocessing time : 0.001 s
% 2.00/0.77 # Presaturation interreduction done
% 2.00/0.77
% 2.00/0.77 # Proof found!
% 2.00/0.77 # SZS status Theorem
% 2.00/0.77 # SZS output start CNFRefutation
% See solution above
% 2.00/0.77 # Parsed axioms : 17
% 2.00/0.77 # Removed by relevancy pruning/SinE : 0
% 2.00/0.77 # Initial clauses : 25
% 2.00/0.77 # Removed in clause preprocessing : 0
% 2.00/0.77 # Initial clauses in saturation : 25
% 2.00/0.77 # Processed clauses : 3064
% 2.00/0.77 # ...of these trivial : 228
% 2.00/0.77 # ...subsumed : 2256
% 2.00/0.77 # ...remaining for further processing : 580
% 2.00/0.77 # Other redundant clauses eliminated : 280
% 2.00/0.77 # Clauses deleted for lack of memory : 0
% 2.00/0.77 # Backward-subsumed : 64
% 2.00/0.77 # Backward-rewritten : 144
% 2.00/0.77 # Generated clauses : 24746
% 2.00/0.77 # ...of the previous two non-redundant : 16707
% 2.00/0.77 # ...aggressively subsumed : 0
% 2.00/0.77 # Contextual simplify-reflections : 28
% 2.00/0.77 # Paramodulations : 24466
% 2.00/0.77 # Factorizations : 0
% 2.00/0.77 # NegExts : 0
% 2.00/0.77 # Equation resolutions : 280
% 2.00/0.77 # Total rewrite steps : 37160
% 2.00/0.77 # Propositional unsat checks : 0
% 2.00/0.77 # Propositional check models : 0
% 2.00/0.77 # Propositional check unsatisfiable : 0
% 2.00/0.77 # Propositional clauses : 0
% 2.00/0.77 # Propositional clauses after purity: 0
% 2.00/0.77 # Propositional unsat core size : 0
% 2.00/0.77 # Propositional preprocessing time : 0.000
% 2.00/0.77 # Propositional encoding time : 0.000
% 2.00/0.77 # Propositional solver time : 0.000
% 2.00/0.77 # Success case prop preproc time : 0.000
% 2.00/0.77 # Success case prop encoding time : 0.000
% 2.00/0.77 # Success case prop solver time : 0.000
% 2.00/0.77 # Current number of processed clauses : 346
% 2.00/0.77 # Positive orientable unit clauses : 146
% 2.00/0.77 # Positive unorientable unit clauses: 4
% 2.00/0.77 # Negative unit clauses : 8
% 2.00/0.77 # Non-unit-clauses : 188
% 2.00/0.77 # Current number of unprocessed clauses: 13146
% 2.00/0.77 # ...number of literals in the above : 30249
% 2.00/0.77 # Current number of archived formulas : 0
% 2.00/0.77 # Current number of archived clauses : 233
% 2.00/0.77 # Clause-clause subsumption calls (NU) : 19816
% 2.00/0.77 # Rec. Clause-clause subsumption calls : 18771
% 2.00/0.77 # Non-unit clause-clause subsumptions : 1983
% 2.00/0.77 # Unit Clause-clause subsumption calls : 2702
% 2.00/0.77 # Rewrite failures with RHS unbound : 0
% 2.00/0.77 # BW rewrite match attempts : 255
% 2.00/0.77 # BW rewrite match successes : 167
% 2.00/0.77 # Condensation attempts : 0
% 2.00/0.77 # Condensation successes : 0
% 2.00/0.77 # Termbank termtop insertions : 330839
% 2.00/0.77
% 2.00/0.77 # -------------------------------------------------
% 2.00/0.77 # User time : 0.243 s
% 2.00/0.77 # System time : 0.006 s
% 2.00/0.77 # Total time : 0.248 s
% 2.00/0.77 # Maximum resident set size: 1744 pages
% 2.00/0.77
% 2.00/0.77 # -------------------------------------------------
% 2.00/0.77 # User time : 1.154 s
% 2.00/0.77 # System time : 0.021 s
% 2.00/0.77 # Total time : 1.175 s
% 2.00/0.77 # Maximum resident set size: 1692 pages
% 2.00/0.77 % E---3.1 exiting
% 2.00/0.77 % E---3.1 exiting
%------------------------------------------------------------------------------