%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE092+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 : n010.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:50 PM UTC 2026
% Result : Theorem 0.47s 0.49s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of formulae : 78 ( 78 unt; 0 def)
% Number of atoms : 78 ( 77 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 : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 106 ( 2 sgn 46 !; 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(coantidomain(X4)) = coantidomain(X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(domain4,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain4) ).
fof(c_0_15,plain,
! [X33] : addition(antidomain(antidomain(X33)),antidomain(X33)) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_16,plain,
! [X25,X26] : addition(X25,X26) = addition(X26,X25),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_17,plain,
! [X31] : multiplication(X31,one) = X31,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_18,plain,
! [X15] : multiplication(antidomain(X15),X15) = zero,
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_19,plain,
! [X12] : addition(X12,zero) = X12,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_20,plain,
! [X27,X28,X29] : addition(X29,addition(X28,X27)) = addition(addition(X29,X28),X27),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_21,plain,
! [X30] : addition(X30,X30) = X30,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_22,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_29,plain,
! [X34,X35] : addition(antidomain(multiplication(X34,X35)),antidomain(multiplication(X34,antidomain(antidomain(X35))))) = antidomain(multiplication(X34,antidomain(antidomain(X35)))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_30,plain,
! [X7] : multiplication(X7,coantidomain(X7)) = zero,
inference(variable_rename,[status(thm)],[codomain1]) ).
cnf(c_0_31,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_34,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
fof(c_0_35,plain,
! [X22,X23,X24] : multiplication(addition(X22,X23),X24) = addition(multiplication(X22,X24),multiplication(X23,X24)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_36,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_29]) ).
cnf(c_0_37,plain,
multiplication(X1,coantidomain(X1)) = zero,
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_39,plain,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_31]),c_0_23]) ).
fof(c_0_40,plain,
! [X32] : multiplication(one,X32) = X32,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_41,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_42,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_43,plain,
! [X10] : addition(coantidomain(coantidomain(X10)),coantidomain(X10)) = one,
inference(variable_rename,[status(thm)],[codomain3]) ).
cnf(c_0_44,plain,
antidomain(multiplication(X1,antidomain(antidomain(coantidomain(X1))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39]) ).
cnf(c_0_45,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_47,plain,
multiplication(addition(antidomain(X1),X2),X1) = multiplication(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_25]),c_0_33]) ).
cnf(c_0_48,plain,
addition(coantidomain(coantidomain(X1)),coantidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,plain,
multiplication(X1,antidomain(antidomain(coantidomain(X1)))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_44]),c_0_45]) ).
cnf(c_0_50,plain,
multiplication(antidomain(X1),addition(X2,X1)) = multiplication(antidomain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_25]),c_0_26]) ).
cnf(c_0_51,plain,
multiplication(antidomain(antidomain(X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_31]),c_0_45]) ).
cnf(c_0_52,plain,
multiplication(X1,addition(coantidomain(X1),X2)) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_37]),c_0_33]) ).
cnf(c_0_53,plain,
addition(coantidomain(X1),coantidomain(coantidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_48,c_0_23]) ).
cnf(c_0_54,plain,
multiplication(X1,addition(antidomain(antidomain(coantidomain(X1))),X2)) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_49]),c_0_33]) ).
cnf(c_0_55,plain,
antidomain(antidomain(antidomain(X1))) = antidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_31]),c_0_24]),c_0_51]) ).
cnf(c_0_56,plain,
multiplication(addition(X1,X2),coantidomain(X2)) = multiplication(X1,coantidomain(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_37]),c_0_26]) ).
cnf(c_0_57,plain,
multiplication(X1,coantidomain(coantidomain(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_24]) ).
cnf(c_0_58,plain,
multiplication(X1,addition(X2,coantidomain(X1))) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_37]),c_0_26]) ).
cnf(c_0_59,plain,
multiplication(X1,antidomain(coantidomain(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_31]),c_0_24]),c_0_55]) ).
cnf(c_0_60,plain,
coantidomain(coantidomain(coantidomain(X1))) = coantidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_53]),c_0_45]),c_0_57]) ).
fof(c_0_61,negated_conjecture,
~ ! [X4] : domain(coantidomain(X4)) = coantidomain(X4),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_62,plain,
multiplication(coantidomain(X1),coantidomain(X1)) = coantidomain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_53]),c_0_24]) ).
cnf(c_0_63,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_45]),c_0_23]) ).
cnf(c_0_64,plain,
multiplication(coantidomain(coantidomain(X1)),antidomain(coantidomain(X1))) = coantidomain(coantidomain(X1)),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_65,plain,
addition(one,coantidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_53]),c_0_23]) ).
cnf(c_0_66,plain,
multiplication(antidomain(X1),addition(X1,X2)) = multiplication(antidomain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_25]),c_0_33]) ).
fof(c_0_67,negated_conjecture,
domain(coantidomain(esk1_0)) != coantidomain(esk1_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_61])])])]) ).
fof(c_0_68,plain,
! [X11] : domain(X11) = antidomain(antidomain(X11)),
inference(variable_rename,[status(thm)],[domain4]) ).
cnf(c_0_69,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_42,c_0_62]),c_0_23]),c_0_63]) ).
cnf(c_0_70,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_63,c_0_64]),c_0_23]),c_0_65]),c_0_45]) ).
cnf(c_0_71,plain,
multiplication(antidomain(coantidomain(X1)),coantidomain(coantidomain(X1))) = antidomain(coantidomain(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_53]),c_0_24]) ).
cnf(c_0_72,negated_conjecture,
domain(coantidomain(esk1_0)) != coantidomain(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_73,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_68]) ).
cnf(c_0_74,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_69,c_0_70]),c_0_71]),c_0_23]),c_0_39]),c_0_45]) ).
cnf(c_0_75,negated_conjecture,
antidomain(antidomain(coantidomain(esk1_0))) != coantidomain(esk1_0),
inference(rw,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,plain,
antidomain(antidomain(coantidomain(X1))) = coantidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_74]),c_0_74]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_76])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE092+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n010.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 22:42:55 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.47/0.49 % Version: 3.5.1
% 0.47/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.47/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.47/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.47/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.47/0.49 % Starting sh5l with 300s (1) cores
% 0.47/0.49 % new_bool_1 with pid 3668538 completed with status 0
% 0.47/0.49 % Result found by new_bool_1
% 0.47/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.47/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.47/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.47/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.47/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.47/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.47/0.49 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.47/0.49 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.47/0.49 % Starting SubtermCWHack with 28s (1) cores
% 0.47/0.49 % SubtermCWHack with pid 3668543 completed with status 0
% 0.47/0.49 % Result found by SubtermCWHack
% 0.47/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.47/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.47/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.47/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.47/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.47/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.47/0.49 % Search class: FUUPM-FFSF21-MFFFFFNN
% 0.47/0.49 % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.47/0.49 % Starting SubtermCWHack with 28s (1) cores
% 0.47/0.49 % Preprocessing time : 0.001 s
% 0.47/0.49
% 0.47/0.49 % Proof found!
% 0.47/0.49 % SZS status Theorem
% 0.47/0.49 % SZS output start CNFRefutation
% See solution above
% 0.47/0.49 % Parsed axioms : 21
% 0.47/0.49 % Removed by relevancy pruning/SinE : 2
% 0.47/0.49 % Initial clauses : 19
% 0.47/0.49 % Removed in clause preprocessing : 0
% 0.47/0.49 % Initial clauses in saturation : 19
% 0.47/0.49 % Processed clauses : 624
% 0.47/0.49 % ...of these trivial : 266
% 0.47/0.49 % ...subsumed : 150
% 0.47/0.49 % ...remaining for further processing : 208
% 0.47/0.49 % Other redundant clauses eliminated : 0
% 0.47/0.49 % Clauses deleted for lack of memory : 0
% 0.47/0.49 % Backward-subsumed : 0
% 0.47/0.49 % Backward-rewritten : 50
% 0.47/0.49 % Generated clauses : 13373
% 0.47/0.49 % ...of the previous two non-redundant : 5553
% 0.47/0.49 % ...aggressively subsumed : 0
% 0.47/0.49 % Contextual simplify-reflections : 0
% 0.47/0.49 % Paramodulations : 13373
% 0.47/0.49 % Factorizations : 0
% 0.47/0.49 % NegExts : 0
% 0.47/0.49 % Equation resolutions : 0
% 0.47/0.49 % Disequality decompositions : 0
% 0.47/0.49 % Total rewrite steps : 23095
% 0.47/0.49 % ...of those cached : 19456
% 0.47/0.49 % Propositional unsat checks : 0
% 0.47/0.49 % Propositional check models : 0
% 0.47/0.49 % Propositional check unsatisfiable : 0
% 0.47/0.49 % Propositional clauses : 0
% 0.47/0.49 % Propositional clauses after purity: 0
% 0.47/0.49 % Propositional unsat core size : 0
% 0.47/0.49 % Propositional preprocessing time : 0.000
% 0.47/0.49 % Propositional encoding time : 0.000
% 0.47/0.49 % Propositional solver time : 0.000
% 0.47/0.49 % Success case prop preproc time : 0.000
% 0.47/0.49 % Success case prop encoding time : 0.000
% 0.47/0.49 % Success case prop solver time : 0.000
% 0.47/0.49 % Current number of processed clauses : 158
% 0.47/0.49 % Positive orientable unit clauses : 154
% 0.47/0.49 % Positive unorientable unit clauses: 4
% 0.47/0.49 % Negative unit clauses : 0
% 0.47/0.49 % Non-unit-clauses : 0
% 0.47/0.49 % Current number of unprocessed clauses: 4869
% 0.47/0.49 % ...number of literals in the above : 4869
% 0.47/0.49 % Current number of archived formulas : 0
% 0.47/0.49 % Current number of archived clauses : 50
% 0.47/0.49 % Clause-clause subsumption calls (NU) : 0
% 0.47/0.49 % Rec. Clause-clause subsumption calls : 0
% 0.47/0.49 % Non-unit clause-clause subsumptions : 0
% 0.47/0.49 % Unit Clause-clause subsumption calls : 14
% 0.47/0.49 % Rewrite failures with RHS unbound : 0
% 0.47/0.49 % BW rewrite match attempts : 401
% 0.47/0.49 % BW rewrite match successes : 134
% 0.47/0.49 % Condensation attempts : 0
% 0.47/0.49 % Condensation successes : 0
% 0.47/0.49 % Termbank termtop insertions : 134139
% 0.47/0.49 % Search garbage collected termcells : 19
% 0.47/0.49
% 0.47/0.49 % -------------------------------------------------
% 0.47/0.49 % User time : 0.052 s
% 0.47/0.49 % System time : 0.006 s
% 0.47/0.49 % Total time : 0.059 s
% 0.47/0.49 % Maximum resident set size: 3652 pages
% 0.47/0.49
% 0.47/0.49 % -------------------------------------------------
% 0.47/0.49 % User time : 0.054 s
% 0.47/0.49 % System time : 0.011 s
% 0.47/0.49 % Total time : 0.065 s
% 0.47/0.49 % Maximum resident set size: 4608 pages
% 0.47/0.49 % E exiting
%------------------------------------------------------------------------------