TSTP Solution File: KLE010+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n018.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:36 EDT 2023
% Result : Theorem 2.06s 0.78s
% Output : CNFRefutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% 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_3,axiom,
! [X4,X5] :
( test(X4)
=> ( c(X4) = X5
<=> complement(X4,X5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.i58VXRK214/E---3.1_28351.p',test_3) ).
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/tmp/tmp.i58VXRK214/E---3.1_28351.p',test_2) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.i58VXRK214/E---3.1_28351.p',left_distributivity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/tmp/tmp.i58VXRK214/E---3.1_28351.p',additive_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.i58VXRK214/E---3.1_28351.p',additive_commutativity) ).
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/sandbox2/tmp/tmp.i58VXRK214/E---3.1_28351.p',goals) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.i58VXRK214/E---3.1_28351.p',multiplicative_left_identity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.i58VXRK214/E---3.1_28351.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.i58VXRK214/E---3.1_28351.p',additive_idempotence) ).
fof(test_1,axiom,
! [X4] :
( test(X4)
<=> ? [X5] : complement(X5,X4) ),
file('/export/starexec/sandbox2/tmp/tmp.i58VXRK214/E---3.1_28351.p',test_1) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.i58VXRK214/E---3.1_28351.p',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.i58VXRK214/E---3.1_28351.p',multiplicative_right_identity) ).
fof(c_0_12,plain,
! [X30,X31] :
( ( c(X30) != X31
| complement(X30,X31)
| ~ test(X30) )
& ( ~ complement(X30,X31)
| c(X30) = X31
| ~ test(X30) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_3])])]) ).
fof(c_0_13,plain,
! [X21,X22] :
( ( multiplication(X21,X22) = zero
| ~ complement(X22,X21) )
& ( multiplication(X22,X21) = zero
| ~ complement(X22,X21) )
& ( addition(X21,X22) = one
| ~ complement(X22,X21) )
& ( multiplication(X21,X22) != zero
| multiplication(X22,X21) != zero
| addition(X21,X22) != one
| complement(X22,X21) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[test_2])])]) ).
cnf(c_0_14,plain,
( complement(X1,X2)
| c(X1) != X2
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X18,X19,X20] : multiplication(addition(X18,X19),X20) = addition(multiplication(X18,X20),multiplication(X19,X20)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_16,plain,
( multiplication(X1,X2) = zero
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
( complement(X1,c(X1))
| ~ test(X1) ),
inference(er,[status(thm)],[c_0_14]) ).
fof(c_0_18,plain,
! [X13] : addition(X13,zero) = X13,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_19,plain,
! [X8,X9] : addition(X8,X9) = addition(X9,X8),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_20,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_21,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
( multiplication(c(X1),X1) = zero
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
( addition(X1,X2) = one
| ~ complement(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_25,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_26,plain,
! [X27] : multiplication(one,X27) = X27,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_27,plain,
! [X10,X11,X12] : addition(X12,addition(X11,X10)) = addition(addition(X12,X11),X10),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_28,plain,
! [X14] : addition(X14,X14) = X14,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_29,plain,
! [X33,X35,X36] :
( ( ~ test(X33)
| complement(esk3_1(X33),X33) )
& ( ~ complement(X36,X35)
| test(X35) ) ),
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_30,negated_conjecture,
( test(esk2_0)
& test(esk1_0)
& one != addition(addition(addition(addition(multiplication(esk2_0,esk1_0),multiplication(c(esk2_0),esk1_0)),multiplication(esk1_0,esk2_0)),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
cnf(c_0_31,plain,
( multiplication(addition(X1,c(X2)),X2) = multiplication(X1,X2)
| ~ test(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_32,plain,
( addition(X1,c(X1)) = one
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_17]),c_0_25]) ).
cnf(c_0_33,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_34,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_36,plain,
( complement(esk3_1(X1),X1)
| ~ test(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,negated_conjecture,
one != addition(addition(addition(addition(multiplication(esk2_0,esk1_0),multiplication(c(esk2_0),esk1_0)),multiplication(esk1_0,esk2_0)),multiplication(c(esk1_0),esk2_0)),multiplication(c(esk1_0),c(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
fof(c_0_38,plain,
! [X15,X16,X17] : multiplication(X15,addition(X16,X17)) = addition(multiplication(X15,X16),multiplication(X15,X17)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_39,plain,
( multiplication(X1,X1) = X1
| ~ test(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_40,negated_conjecture,
test(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_41,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
( addition(X1,esk3_1(X1)) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
addition(multiplication(c(esk1_0),c(esk2_0)),addition(multiplication(c(esk1_0),esk2_0),addition(multiplication(esk1_0,esk2_0),addition(multiplication(esk2_0,esk1_0),multiplication(c(esk2_0),esk1_0))))) != one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_25]),c_0_25]),c_0_25]) ).
cnf(c_0_44,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X3,X1)),
inference(spm,[status(thm)],[c_0_34,c_0_25]) ).
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,
! [X26] : multiplication(X26,one) = X26,
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_34,c_0_32]) ).
cnf(c_0_48,negated_conjecture,
multiplication(esk2_0,esk2_0) = esk2_0,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
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_21,c_0_33]),c_0_25]) ).
cnf(c_0_50,plain,
( addition(X1,one) = one
| ~ test(X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
test(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_52,negated_conjecture,
addition(multiplication(esk1_0,esk2_0),addition(multiplication(addition(esk2_0,c(esk2_0)),esk1_0),multiplication(c(esk1_0),addition(esk2_0,c(esk2_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_21]),c_0_34]),c_0_44]),c_0_34]),c_0_45]),c_0_25]) ).
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_34,c_0_25]),c_0_34]) ).
cnf(c_0_55,plain,
( addition(X1,one) = one
| ~ test(addition(X1,X2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_47]) ).
cnf(c_0_56,negated_conjecture,
multiplication(addition(X1,one),esk2_0) = multiplication(addition(X1,esk2_0),esk2_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_48]),c_0_25]),c_0_49]) ).
cnf(c_0_57,negated_conjecture,
addition(esk1_0,one) = one,
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
addition(esk1_0,addition(multiplication(esk1_0,esk2_0),c(esk1_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_32]),c_0_33]),c_0_53]),c_0_40])]),c_0_44]),c_0_25]) ).
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_32]) ).
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_21]),c_0_25]) ).
cnf(c_0_61,negated_conjecture,
multiplication(addition(esk1_0,esk2_0),esk2_0) = esk2_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_33]) ).
cnf(c_0_62,negated_conjecture,
addition(one,multiplication(esk1_0,esk2_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_25]) ).
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_40])]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : KLE010+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n018.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Oct 3 04:59:54 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.51 Running first-order model finding
% 0.22/0.51 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.i58VXRK214/E---3.1_28351.p
% 2.06/0.78 # Version: 3.1pre001
% 2.06/0.78 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.06/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.06/0.78 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.06/0.78 # Starting new_bool_3 with 300s (1) cores
% 2.06/0.78 # Starting new_bool_1 with 300s (1) cores
% 2.06/0.78 # Starting sh5l with 300s (1) cores
% 2.06/0.78 # sh5l with pid 28431 completed with status 0
% 2.06/0.78 # Result found by sh5l
% 2.06/0.78 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.06/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.06/0.78 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.06/0.78 # Starting new_bool_3 with 300s (1) cores
% 2.06/0.78 # Starting new_bool_1 with 300s (1) cores
% 2.06/0.78 # Starting sh5l with 300s (1) cores
% 2.06/0.78 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.06/0.78 # Search class: FGUSM-FFSF21-DFFFFFNN
% 2.06/0.78 # partial match(1): FGUSM-FFSF21-SFFFFFNN
% 2.06/0.78 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.06/0.78 # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 2.06/0.78 # G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 28432 completed with status 0
% 2.06/0.78 # Result found by G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.06/0.78 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.06/0.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.06/0.78 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.06/0.78 # Starting new_bool_3 with 300s (1) cores
% 2.06/0.78 # Starting new_bool_1 with 300s (1) cores
% 2.06/0.78 # Starting sh5l with 300s (1) cores
% 2.06/0.78 # SinE strategy is gf500_gu_R04_F100_L20000
% 2.06/0.78 # Search class: FGUSM-FFSF21-DFFFFFNN
% 2.06/0.78 # partial match(1): FGUSM-FFSF21-SFFFFFNN
% 2.06/0.78 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.06/0.78 # Starting G-E--_208_C18--C_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 2.06/0.78 # Preprocessing time : 0.001 s
% 2.06/0.78 # Presaturation interreduction done
% 2.06/0.78
% 2.06/0.78 # Proof found!
% 2.06/0.78 # SZS status Theorem
% 2.06/0.78 # SZS output start CNFRefutation
% See solution above
% 2.06/0.78 # Parsed axioms : 17
% 2.06/0.78 # Removed by relevancy pruning/SinE : 1
% 2.06/0.78 # Initial clauses : 23
% 2.06/0.78 # Removed in clause preprocessing : 0
% 2.06/0.78 # Initial clauses in saturation : 23
% 2.06/0.78 # Processed clauses : 2558
% 2.06/0.78 # ...of these trivial : 232
% 2.06/0.78 # ...subsumed : 1809
% 2.06/0.78 # ...remaining for further processing : 517
% 2.06/0.78 # Other redundant clauses eliminated : 120
% 2.06/0.78 # Clauses deleted for lack of memory : 0
% 2.06/0.78 # Backward-subsumed : 57
% 2.06/0.78 # Backward-rewritten : 73
% 2.06/0.78 # Generated clauses : 21122
% 2.06/0.78 # ...of the previous two non-redundant : 15019
% 2.06/0.78 # ...aggressively subsumed : 0
% 2.06/0.78 # Contextual simplify-reflections : 40
% 2.06/0.78 # Paramodulations : 21002
% 2.06/0.78 # Factorizations : 0
% 2.06/0.78 # NegExts : 0
% 2.06/0.78 # Equation resolutions : 120
% 2.06/0.78 # Total rewrite steps : 29376
% 2.06/0.78 # Propositional unsat checks : 0
% 2.06/0.78 # Propositional check models : 0
% 2.06/0.78 # Propositional check unsatisfiable : 0
% 2.06/0.78 # Propositional clauses : 0
% 2.06/0.78 # Propositional clauses after purity: 0
% 2.06/0.78 # Propositional unsat core size : 0
% 2.06/0.78 # Propositional preprocessing time : 0.000
% 2.06/0.78 # Propositional encoding time : 0.000
% 2.06/0.78 # Propositional solver time : 0.000
% 2.06/0.78 # Success case prop preproc time : 0.000
% 2.06/0.78 # Success case prop encoding time : 0.000
% 2.06/0.78 # Success case prop solver time : 0.000
% 2.06/0.78 # Current number of processed clauses : 363
% 2.06/0.78 # Positive orientable unit clauses : 152
% 2.06/0.78 # Positive unorientable unit clauses: 4
% 2.06/0.78 # Negative unit clauses : 9
% 2.06/0.78 # Non-unit-clauses : 198
% 2.06/0.78 # Current number of unprocessed clauses: 12021
% 2.06/0.78 # ...number of literals in the above : 28206
% 2.06/0.78 # Current number of archived formulas : 0
% 2.06/0.78 # Current number of archived clauses : 153
% 2.06/0.78 # Clause-clause subsumption calls (NU) : 12895
% 2.06/0.78 # Rec. Clause-clause subsumption calls : 11797
% 2.06/0.78 # Non-unit clause-clause subsumptions : 1573
% 2.06/0.78 # Unit Clause-clause subsumption calls : 1887
% 2.06/0.78 # Rewrite failures with RHS unbound : 0
% 2.06/0.78 # BW rewrite match attempts : 285
% 2.06/0.78 # BW rewrite match successes : 174
% 2.06/0.78 # Condensation attempts : 0
% 2.06/0.78 # Condensation successes : 0
% 2.06/0.78 # Termbank termtop insertions : 280889
% 2.06/0.78
% 2.06/0.78 # -------------------------------------------------
% 2.06/0.78 # User time : 0.245 s
% 2.06/0.78 # System time : 0.008 s
% 2.06/0.78 # Total time : 0.253 s
% 2.06/0.78 # Maximum resident set size: 1724 pages
% 2.06/0.78
% 2.06/0.78 # -------------------------------------------------
% 2.06/0.78 # User time : 0.245 s
% 2.06/0.78 # System time : 0.011 s
% 2.06/0.78 # Total time : 0.256 s
% 2.06/0.78 # Maximum resident set size: 1692 pages
% 2.06/0.78 % E---3.1 exiting
%------------------------------------------------------------------------------