TSTP Solution File: KLE082+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : KLE082+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:06 EDT 2023
% Result : Theorem 0.15s 0.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 74 ( 71 unt; 0 def)
% Number of atoms : 80 ( 79 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 9 ( 3 ~; 0 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 116 ( 11 sgn; 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox/tmp/tmp.4eQH25qAtS/E---3.1_16315.p',domain2) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.4eQH25qAtS/E---3.1_16315.p',multiplicative_left_identity) ).
fof(goals,conjecture,
! [X4,X5] :
( ! [X6] :
( addition(domain(X6),antidomain(X6)) = one
& multiplication(domain(X6),antidomain(X6)) = zero )
=> addition(antidomain(multiplication(X4,X5)),antidomain(multiplication(X4,domain(X5)))) = antidomain(multiplication(X4,domain(X5))) ),
file('/export/starexec/sandbox/tmp/tmp.4eQH25qAtS/E---3.1_16315.p',goals) ).
fof(domain5,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/export/starexec/sandbox/tmp/tmp.4eQH25qAtS/E---3.1_16315.p',domain5) ).
fof(domain3,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/export/starexec/sandbox/tmp/tmp.4eQH25qAtS/E---3.1_16315.p',domain3) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.4eQH25qAtS/E---3.1_16315.p',additive_commutativity) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.4eQH25qAtS/E---3.1_16315.p',additive_associativity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.4eQH25qAtS/E---3.1_16315.p',additive_idempotence) ).
fof(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox/tmp/tmp.4eQH25qAtS/E---3.1_16315.p',domain1) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.4eQH25qAtS/E---3.1_16315.p',multiplicative_right_identity) ).
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.4eQH25qAtS/E---3.1_16315.p',left_distributivity) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.4eQH25qAtS/E---3.1_16315.p',additive_identity) ).
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.4eQH25qAtS/E---3.1_16315.p',right_distributivity) ).
fof(c_0_13,plain,
! [X20,X21] : domain(multiplication(X20,X21)) = domain(multiplication(X20,domain(X21))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_14,plain,
! [X35] : multiplication(one,X35) = X35,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_15,negated_conjecture,
~ ! [X4,X5] :
( ! [X6] :
( addition(domain(X6),antidomain(X6)) = one
& multiplication(domain(X6),antidomain(X6)) = zero )
=> addition(antidomain(multiplication(X4,X5)),antidomain(multiplication(X4,domain(X5)))) = antidomain(multiplication(X4,domain(X5))) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_16,plain,
! [X23,X24] : domain(addition(X23,X24)) = addition(domain(X23),domain(X24)),
inference(variable_rename,[status(thm)],[domain5]) ).
cnf(c_0_17,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X22] : addition(domain(X22),one) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_20,plain,
! [X25,X26] : addition(X25,X26) = addition(X26,X25),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_21,plain,
! [X27,X28,X29] : addition(X29,addition(X28,X27)) = addition(addition(X29,X28),X27),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_22,plain,
! [X30] : addition(X30,X30) = X30,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_23,negated_conjecture,
! [X9] :
( addition(domain(X9),antidomain(X9)) = one
& multiplication(domain(X9),antidomain(X9)) = zero
& addition(antidomain(multiplication(esk1_0,esk2_0)),antidomain(multiplication(esk1_0,domain(esk2_0)))) != antidomain(multiplication(esk1_0,domain(esk2_0))) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
cnf(c_0_24,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_26,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,negated_conjecture,
addition(domain(X1),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
domain(addition(X1,domain(X2))) = domain(addition(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_24]) ).
cnf(c_0_32,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_34,plain,
! [X19] : addition(X19,multiplication(domain(X19),X19)) = multiplication(domain(X19),X19),
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_35,plain,
! [X34] : multiplication(X34,one) = X34,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_36,negated_conjecture,
addition(antidomain(X1),domain(X1)) = one,
inference(rw,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_37,plain,
domain(addition(one,X1)) = domain(one),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
addition(X1,addition(X2,X1)) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_33,c_0_27]) ).
cnf(c_0_39,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_40,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_41,plain,
! [X16,X17,X18] : multiplication(addition(X16,X17),X18) = addition(multiplication(X16,X18),multiplication(X17,X18)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_42,plain,
! [X31] : addition(X31,zero) = X31,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_43,negated_conjecture,
addition(antidomain(X1),addition(domain(X1),X2)) = addition(one,X2),
inference(spm,[status(thm)],[c_0_28,c_0_36]) ).
fof(c_0_44,plain,
! [X13,X14,X15] : multiplication(X13,addition(X14,X15)) = addition(multiplication(X13,X14),multiplication(X13,X15)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_45,plain,
domain(addition(X1,one)) = domain(one),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,plain,
domain(one) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_32]) ).
cnf(c_0_47,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_49,negated_conjecture,
addition(antidomain(X1),domain(addition(X1,X2))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_24]),c_0_32]) ).
cnf(c_0_50,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_51,plain,
domain(addition(X1,one)) = one,
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_18]),c_0_27]) ).
cnf(c_0_53,negated_conjecture,
multiplication(domain(X1),antidomain(X1)) = zero,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_54,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_48,c_0_27]) ).
cnf(c_0_55,negated_conjecture,
addition(antidomain(X1),domain(addition(X2,X1))) = one,
inference(spm,[status(thm)],[c_0_49,c_0_38]) ).
cnf(c_0_56,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_40]),c_0_27]) ).
cnf(c_0_57,plain,
domain(multiplication(X1,addition(X2,one))) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_51]),c_0_40]) ).
cnf(c_0_58,plain,
multiplication(domain(X1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_52]),c_0_27]),c_0_32]),c_0_18]) ).
cnf(c_0_59,negated_conjecture,
multiplication(addition(domain(X1),X2),antidomain(X1)) = multiplication(X2,antidomain(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_53]),c_0_54]) ).
cnf(c_0_60,negated_conjecture,
addition(domain(X1),antidomain(multiplication(X1,X2))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]),c_0_27]) ).
cnf(c_0_61,plain,
addition(X1,multiplication(domain(X1),X2)) = multiplication(domain(X1),addition(X1,X2)),
inference(spm,[status(thm)],[c_0_50,c_0_58]) ).
cnf(c_0_62,negated_conjecture,
multiplication(domain(X1),antidomain(domain(X1))) = zero,
inference(spm,[status(thm)],[c_0_53,c_0_25]) ).
cnf(c_0_63,negated_conjecture,
addition(domain(X1),antidomain(domain(X1))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_25]),c_0_27]) ).
cnf(c_0_64,negated_conjecture,
multiplication(antidomain(multiplication(X1,X2)),antidomain(X1)) = antidomain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_18]) ).
cnf(c_0_65,negated_conjecture,
multiplication(domain(X1),addition(X1,antidomain(domain(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_48]) ).
cnf(c_0_66,negated_conjecture,
multiplication(antidomain(domain(X1)),antidomain(X1)) = antidomain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_63]),c_0_18]) ).
cnf(c_0_67,negated_conjecture,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_36]),c_0_27]) ).
cnf(c_0_68,negated_conjecture,
multiplication(antidomain(X1),antidomain(domain(X1))) = antidomain(domain(X1)),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
addition(antidomain(X1),antidomain(domain(X1))) = antidomain(domain(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_66]),c_0_27]),c_0_67]),c_0_40]),c_0_27]) ).
cnf(c_0_70,negated_conjecture,
antidomain(domain(X1)) = antidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_68]),c_0_69]),c_0_27]),c_0_67]),c_0_40]) ).
cnf(c_0_71,negated_conjecture,
addition(antidomain(multiplication(esk1_0,esk2_0)),antidomain(multiplication(esk1_0,domain(esk2_0)))) != antidomain(multiplication(esk1_0,domain(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_72,negated_conjecture,
antidomain(multiplication(X1,domain(X2))) = antidomain(multiplication(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_17]),c_0_70]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72]),c_0_29]),c_0_72])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : KLE082+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n023.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 05:10:52 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 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 --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.4eQH25qAtS/E---3.1_16315.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 # new_bool_1 with pid 16395 completed with status 0
% 0.15/0.46 # Result found by new_bool_1
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.46 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.15/0.46 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (1) cores
% 0.15/0.46 # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 16401 completed with status 0
% 0.15/0.46 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 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 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.46 # Search class: FUUPM-FFSF21-MFFFFFNN
% 0.15/0.46 # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.46 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 135s (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 : 18
% 0.15/0.46 # Removed by relevancy pruning/SinE : 1
% 0.15/0.46 # Initial clauses : 19
% 0.15/0.46 # Removed in clause preprocessing : 0
% 0.15/0.46 # Initial clauses in saturation : 19
% 0.15/0.46 # Processed clauses : 462
% 0.15/0.46 # ...of these trivial : 191
% 0.15/0.46 # ...subsumed : 113
% 0.15/0.46 # ...remaining for further processing : 158
% 0.15/0.46 # Other redundant clauses eliminated : 0
% 0.15/0.46 # Clauses deleted for lack of memory : 0
% 0.15/0.46 # Backward-subsumed : 0
% 0.15/0.46 # Backward-rewritten : 15
% 0.15/0.46 # Generated clauses : 6610
% 0.15/0.46 # ...of the previous two non-redundant : 2959
% 0.15/0.46 # ...aggressively subsumed : 0
% 0.15/0.46 # Contextual simplify-reflections : 0
% 0.15/0.46 # Paramodulations : 6610
% 0.15/0.46 # Factorizations : 0
% 0.15/0.46 # NegExts : 0
% 0.15/0.46 # Equation resolutions : 0
% 0.15/0.46 # Total rewrite steps : 11357
% 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 : 124
% 0.15/0.46 # Positive orientable unit clauses : 121
% 0.15/0.46 # Positive unorientable unit clauses: 3
% 0.15/0.46 # Negative unit clauses : 0
% 0.15/0.46 # Non-unit-clauses : 0
% 0.15/0.46 # Current number of unprocessed clauses: 2521
% 0.15/0.46 # ...number of literals in the above : 2521
% 0.15/0.46 # Current number of archived formulas : 0
% 0.15/0.46 # Current number of archived clauses : 34
% 0.15/0.46 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.46 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.46 # Non-unit clause-clause subsumptions : 0
% 0.15/0.46 # Unit Clause-clause subsumption calls : 5
% 0.15/0.46 # Rewrite failures with RHS unbound : 0
% 0.15/0.46 # BW rewrite match attempts : 206
% 0.15/0.46 # BW rewrite match successes : 67
% 0.15/0.46 # Condensation attempts : 0
% 0.15/0.46 # Condensation successes : 0
% 0.15/0.46 # Termbank termtop insertions : 60847
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.043 s
% 0.15/0.46 # System time : 0.004 s
% 0.15/0.46 # Total time : 0.047 s
% 0.15/0.46 # Maximum resident set size: 1736 pages
% 0.15/0.46
% 0.15/0.46 # -------------------------------------------------
% 0.15/0.46 # User time : 0.046 s
% 0.15/0.46 # System time : 0.004 s
% 0.15/0.46 # Total time : 0.050 s
% 0.15/0.46 # Maximum resident set size: 1684 pages
% 0.15/0.46 % E---3.1 exiting
% 0.15/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------