%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE091+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:58:49 PM UTC 2026
% Result : Theorem 0.09s 0.47s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of formulae : 80 ( 80 unt; 0 def)
% Number of atoms : 80 ( 79 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-2 aty)
% Number of variables : 108 ( 2 sgn 48 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(domain3,axiom,
! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain3) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(domain1,axiom,
! [X4] : multiplication(antidomain(X4),X4) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain1) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
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(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(domain2,axiom,
! [X4,X5] : addition(antidomain(multiplication(X4,X5)),antidomain(multiplication(X4,antidomain(antidomain(X5))))) = antidomain(multiplication(X4,antidomain(antidomain(X5)))),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain2) ).
fof(codomain1,axiom,
! [X4] : multiplication(X4,coantidomain(X4)) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain1) ).
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(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
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(codomain3,axiom,
! [X4] : addition(coantidomain(coantidomain(X4)),coantidomain(X4)) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain3) ).
fof(goals,conjecture,
! [X4] : domain(codomain(X4)) = codomain(X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(codomain4,axiom,
! [X4] : codomain(X4) = coantidomain(coantidomain(X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain4) ).
fof(domain4,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain4) ).
fof(c_0_16,plain,
! [X16] : addition(antidomain(antidomain(X16)),antidomain(X16)) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_17,plain,
! [X29,X30] : addition(X29,X30) = addition(X30,X29),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_18,plain,
! [X35] : multiplication(X35,one) = X35,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_19,plain,
! [X13] : multiplication(antidomain(X13),X13) = zero,
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_20,plain,
! [X17] : addition(X17,zero) = X17,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_21,plain,
! [X31,X32,X33] : addition(X33,addition(X32,X31)) = addition(addition(X33,X32),X31),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_22,plain,
! [X34] : addition(X34,X34) = X34,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_23,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
addition(X1,zero) = 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]) ).
fof(c_0_30,plain,
! [X14,X15] : addition(antidomain(multiplication(X14,X15)),antidomain(multiplication(X14,antidomain(antidomain(X15))))) = antidomain(multiplication(X14,antidomain(antidomain(X15)))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_31,plain,
! [X9] : multiplication(X9,coantidomain(X9)) = zero,
inference(variable_rename,[status(thm)],[codomain1]) ).
cnf(c_0_32,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_35,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_36,plain,
! [X26,X27,X28] : multiplication(addition(X26,X27),X28) = addition(multiplication(X26,X28),multiplication(X27,X28)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_37,plain,
addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2))))) = antidomain(multiplication(X1,antidomain(antidomain(X2)))),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
multiplication(X1,coantidomain(X1)) = zero,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_40,plain,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_24]) ).
fof(c_0_41,plain,
! [X36] : multiplication(one,X36) = X36,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_42,plain,
! [X23,X24,X25] : multiplication(X23,addition(X24,X25)) = addition(multiplication(X23,X24),multiplication(X23,X25)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_43,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
fof(c_0_44,plain,
! [X12] : addition(coantidomain(coantidomain(X12)),coantidomain(X12)) = one,
inference(variable_rename,[status(thm)],[codomain3]) ).
cnf(c_0_45,plain,
antidomain(multiplication(X1,antidomain(antidomain(coantidomain(X1))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40]) ).
cnf(c_0_46,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_48,plain,
multiplication(addition(antidomain(X1),X2),X1) = multiplication(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_26]),c_0_34]) ).
cnf(c_0_49,plain,
addition(coantidomain(coantidomain(X1)),coantidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,plain,
multiplication(X1,antidomain(antidomain(coantidomain(X1)))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_45]),c_0_46]) ).
cnf(c_0_51,plain,
multiplication(antidomain(X1),addition(X2,X1)) = multiplication(antidomain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_26]),c_0_27]) ).
cnf(c_0_52,plain,
multiplication(antidomain(antidomain(X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_32]),c_0_46]) ).
cnf(c_0_53,plain,
multiplication(X1,addition(coantidomain(X1),X2)) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_38]),c_0_34]) ).
cnf(c_0_54,plain,
addition(coantidomain(X1),coantidomain(coantidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_49,c_0_24]) ).
cnf(c_0_55,plain,
multiplication(X1,addition(antidomain(antidomain(coantidomain(X1))),X2)) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_50]),c_0_34]) ).
cnf(c_0_56,plain,
antidomain(antidomain(antidomain(X1))) = antidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_32]),c_0_25]),c_0_52]) ).
cnf(c_0_57,plain,
multiplication(addition(X1,X2),coantidomain(X2)) = multiplication(X1,coantidomain(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_38]),c_0_27]) ).
cnf(c_0_58,plain,
multiplication(X1,coantidomain(coantidomain(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_25]) ).
fof(c_0_59,negated_conjecture,
~ ! [X4] : domain(codomain(X4)) = codomain(X4),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_60,plain,
multiplication(X1,addition(X2,coantidomain(X1))) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_38]),c_0_27]) ).
cnf(c_0_61,plain,
multiplication(X1,antidomain(coantidomain(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_32]),c_0_25]),c_0_56]) ).
cnf(c_0_62,plain,
coantidomain(coantidomain(coantidomain(X1))) = coantidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_54]),c_0_46]),c_0_58]) ).
fof(c_0_63,negated_conjecture,
domain(codomain(esk1_0)) != codomain(esk1_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_59])])])]) ).
fof(c_0_64,plain,
! [X7] : codomain(X7) = coantidomain(coantidomain(X7)),
inference(variable_rename,[status(thm)],[codomain4]) ).
fof(c_0_65,plain,
! [X8] : domain(X8) = antidomain(antidomain(X8)),
inference(variable_rename,[status(thm)],[domain4]) ).
cnf(c_0_66,plain,
multiplication(coantidomain(X1),coantidomain(X1)) = coantidomain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_54]),c_0_25]) ).
cnf(c_0_67,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_46]),c_0_24]) ).
cnf(c_0_68,plain,
multiplication(coantidomain(coantidomain(X1)),antidomain(coantidomain(X1))) = coantidomain(coantidomain(X1)),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_69,plain,
addition(one,coantidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_54]),c_0_24]) ).
cnf(c_0_70,plain,
multiplication(antidomain(X1),addition(X1,X2)) = multiplication(antidomain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_26]),c_0_34]) ).
cnf(c_0_71,negated_conjecture,
domain(codomain(esk1_0)) != codomain(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_72,plain,
codomain(X1) = coantidomain(coantidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_73,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_74,plain,
multiplication(addition(X1,coantidomain(X2)),coantidomain(X2)) = multiplication(addition(X1,one),coantidomain(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_66]),c_0_24]),c_0_67]) ).
cnf(c_0_75,plain,
addition(antidomain(coantidomain(X1)),coantidomain(coantidomain(X1))) = antidomain(coantidomain(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_24]),c_0_69]),c_0_46]) ).
cnf(c_0_76,plain,
multiplication(antidomain(coantidomain(X1)),coantidomain(coantidomain(X1))) = antidomain(coantidomain(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_54]),c_0_25]) ).
cnf(c_0_77,negated_conjecture,
antidomain(antidomain(coantidomain(coantidomain(esk1_0)))) != coantidomain(coantidomain(esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_72]),c_0_73]),c_0_72]) ).
cnf(c_0_78,plain,
coantidomain(coantidomain(X1)) = antidomain(coantidomain(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]),c_0_24]),c_0_40]),c_0_46]) ).
cnf(c_0_79,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78]),c_0_56]),c_0_78])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : KLE091+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Sun Sep 20 22:42:37 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.35 Running first-order theorem proving
% 0.04/0.35 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.09/0.47 % Version: 3.5.1
% 0.09/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.47 % Starting sh5l with 300s (1) cores
% 0.09/0.47 % new_bool_3 with pid 1018993 completed with status 0
% 0.09/0.47 % Result found by new_bool_3
% 0.09/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.47 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.09/0.47 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.47 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.47 % SubtermCWHack with pid 1018999 completed with status 0
% 0.09/0.47 % Result found by SubtermCWHack
% 0.09/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.47 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.09/0.47 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.47 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.47 % Preprocessing time : 0.001 s
% 0.09/0.47
% 0.09/0.47 % Proof found!
% 0.09/0.47 % SZS status Theorem
% 0.09/0.47 % SZS output start CNFRefutation
% See solution above
% 0.09/0.47 % Parsed axioms : 21
% 0.09/0.47 % Removed by relevancy pruning/SinE : 1
% 0.09/0.47 % Initial clauses : 20
% 0.09/0.47 % Removed in clause preprocessing : 0
% 0.09/0.47 % Initial clauses in saturation : 20
% 0.09/0.47 % Processed clauses : 625
% 0.09/0.47 % ...of these trivial : 267
% 0.09/0.47 % ...subsumed : 150
% 0.09/0.47 % ...remaining for further processing : 208
% 0.09/0.47 % Other redundant clauses eliminated : 0
% 0.09/0.47 % Clauses deleted for lack of memory : 0
% 0.09/0.47 % Backward-subsumed : 0
% 0.09/0.47 % Backward-rewritten : 47
% 0.09/0.47 % Generated clauses : 13308
% 0.09/0.47 % ...of the previous two non-redundant : 5516
% 0.09/0.47 % ...aggressively subsumed : 0
% 0.09/0.47 % Contextual simplify-reflections : 0
% 0.09/0.47 % Paramodulations : 13308
% 0.09/0.47 % Factorizations : 0
% 0.09/0.47 % NegExts : 0
% 0.09/0.47 % Equation resolutions : 0
% 0.09/0.47 % Disequality decompositions : 0
% 0.09/0.47 % Total rewrite steps : 23044
% 0.09/0.47 % ...of those cached : 19412
% 0.09/0.47 % Propositional unsat checks : 0
% 0.09/0.47 % Propositional check models : 0
% 0.09/0.47 % Propositional check unsatisfiable : 0
% 0.09/0.47 % Propositional clauses : 0
% 0.09/0.47 % Propositional clauses after purity: 0
% 0.09/0.47 % Propositional unsat core size : 0
% 0.09/0.47 % Propositional preprocessing time : 0.000
% 0.09/0.47 % Propositional encoding time : 0.000
% 0.09/0.47 % Propositional solver time : 0.000
% 0.09/0.47 % Success case prop preproc time : 0.000
% 0.09/0.47 % Success case prop encoding time : 0.000
% 0.09/0.47 % Success case prop solver time : 0.000
% 0.09/0.47 % Current number of processed clauses : 161
% 0.09/0.47 % Positive orientable unit clauses : 157
% 0.09/0.47 % Positive unorientable unit clauses: 4
% 0.09/0.47 % Negative unit clauses : 0
% 0.09/0.47 % Non-unit-clauses : 0
% 0.09/0.47 % Current number of unprocessed clauses: 4821
% 0.09/0.47 % ...number of literals in the above : 4821
% 0.09/0.47 % Current number of archived formulas : 0
% 0.09/0.47 % Current number of archived clauses : 47
% 0.09/0.47 % Clause-clause subsumption calls (NU) : 0
% 0.09/0.47 % Rec. Clause-clause subsumption calls : 0
% 0.09/0.47 % Non-unit clause-clause subsumptions : 0
% 0.09/0.47 % Unit Clause-clause subsumption calls : 14
% 0.09/0.47 % Rewrite failures with RHS unbound : 0
% 0.09/0.47 % BW rewrite match attempts : 396
% 0.09/0.47 % BW rewrite match successes : 130
% 0.09/0.47 % Condensation attempts : 0
% 0.09/0.47 % Condensation successes : 0
% 0.09/0.47 % Termbank termtop insertions : 133767
% 0.09/0.47 % Search garbage collected termcells : 16
% 0.09/0.47
% 0.09/0.47 % -------------------------------------------------
% 0.09/0.47 % User time : 0.091 s
% 0.09/0.47 % System time : 0.009 s
% 0.09/0.47 % Total time : 0.100 s
% 0.09/0.47 % Maximum resident set size: 3652 pages
% 0.09/0.47
% 0.09/0.47 % -------------------------------------------------
% 0.09/0.47 % User time : 0.092 s
% 0.09/0.47 % System time : 0.014 s
% 0.09/0.47 % Total time : 0.106 s
% 0.09/0.47 % Maximum resident set size: 4608 pages
% 0.09/0.47 % E exiting
%------------------------------------------------------------------------------