%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE079+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:48 PM UTC 2026
% Result : Theorem 0.13s 10.80s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of formulae : 80 ( 77 unt; 0 def)
% Number of atoms : 86 ( 85 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 9 ( 3 ~; 0 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 114 ( 5 sgn 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).
fof(domain3,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain3) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).
fof(goals,conjecture,
! [X4] :
( ! [X5] :
( multiplication(domain(X5),antidomain(X5)) = zero
& addition(domain(X5),antidomain(X5)) = one )
=> multiplication(antidomain(X4),domain(X4)) = zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(additive_associativity,axiom,
! [X3,X2,X1] : addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).
fof(domain5,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain5) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(domain4,axiom,
domain(zero) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain4) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
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]) ).
fof(c_0_16,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_17,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_18,plain,
! [X31] : addition(domain(X31),one) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_19,plain,
! [X18,X19,X20] : multiplication(X18,addition(X19,X20)) = addition(multiplication(X18,X19),multiplication(X18,X20)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_20,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_21,plain,
! [X28] : addition(X28,multiplication(domain(X28),X28)) = multiplication(domain(X28),X28),
inference(variable_rename,[status(thm)],[domain1]) ).
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(one,X1) = X1,
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,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_26,plain,
! [X29,X30] : domain(multiplication(X29,X30)) = domain(multiplication(X29,domain(X30))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_27,negated_conjecture,
~ ! [X4] :
( ! [X5] :
( multiplication(domain(X5),antidomain(X5)) = zero
& addition(domain(X5),antidomain(X5)) = one )
=> multiplication(antidomain(X4),domain(X4)) = zero ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_28,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_30,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_32,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_25,c_0_24]) ).
fof(c_0_33,plain,
! [X8,X9,X10] : addition(X10,addition(X9,X8)) = addition(addition(X10,X9),X8),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_34,plain,
! [X32,X33] : domain(addition(X32,X33)) = addition(domain(X32),domain(X33)),
inference(variable_rename,[status(thm)],[domain5]) ).
cnf(c_0_35,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_36,negated_conjecture,
! [X35] :
( multiplication(antidomain(esk1_0),domain(esk1_0)) != zero
& multiplication(domain(X35),antidomain(X35)) = zero
& addition(domain(X35),antidomain(X35)) = one ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])])]) ).
fof(c_0_37,plain,
! [X11] : addition(X11,zero) = X11,
inference(variable_rename,[status(thm)],[additive_identity]) ).
cnf(c_0_38,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_24]) ).
cnf(c_0_39,plain,
multiplication(domain(X1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_24]),c_0_32]),c_0_23]) ).
cnf(c_0_40,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_41,plain,
! [X12] : addition(X12,X12) = X12,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_42,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_43,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_23]),c_0_23]) ).
cnf(c_0_44,negated_conjecture,
addition(domain(X1),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_46,plain,
multiplication(domain(X1),addition(X1,one)) = addition(X1,domain(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_24]) ).
cnf(c_0_47,plain,
addition(one,addition(domain(X1),X2)) = addition(one,X2),
inference(spm,[status(thm)],[c_0_40,c_0_32]) ).
cnf(c_0_48,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
domain(addition(domain(X1),X2)) = domain(addition(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_42]) ).
cnf(c_0_50,plain,
addition(X1,multiplication(domain(X1),X2)) = multiplication(domain(X1),addition(X1,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_39]) ).
cnf(c_0_51,negated_conjecture,
multiplication(domain(X1),antidomain(X1)) = zero,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_52,negated_conjecture,
addition(domain(multiplication(X1,X2)),antidomain(multiplication(X1,domain(X2)))) = one,
inference(spm,[status(thm)],[c_0_44,c_0_35]) ).
cnf(c_0_53,plain,
domain(zero) = zero,
inference(split_conjunct,[status(thm)],[domain4]) ).
cnf(c_0_54,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_24]) ).
fof(c_0_55,plain,
! [X25] : multiplication(zero,X25) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_56,plain,
multiplication(domain(X1),addition(one,X1)) = addition(X1,domain(X1)),
inference(spm,[status(thm)],[c_0_46,c_0_24]) ).
cnf(c_0_57,negated_conjecture,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_44]),c_0_48]) ).
cnf(c_0_58,negated_conjecture,
domain(addition(X1,antidomain(X1))) = domain(one),
inference(spm,[status(thm)],[c_0_49,c_0_44]) ).
cnf(c_0_59,plain,
domain(one) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_29]),c_0_32]) ).
cnf(c_0_60,negated_conjecture,
multiplication(domain(X1),addition(X1,antidomain(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_45]) ).
cnf(c_0_61,negated_conjecture,
antidomain(multiplication(domain(X1),domain(antidomain(X1)))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_51]),c_0_53]),c_0_54]) ).
cnf(c_0_62,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_63,negated_conjecture,
multiplication(addition(X1,domain(X2)),antidomain(X2)) = multiplication(X1,antidomain(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_51]),c_0_45]) ).
cnf(c_0_64,negated_conjecture,
addition(antidomain(X1),domain(antidomain(X1))) = domain(antidomain(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_29]) ).
cnf(c_0_65,negated_conjecture,
domain(addition(X1,antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_66,negated_conjecture,
multiplication(domain(X1),domain(antidomain(X1))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_35]),c_0_51]),c_0_53]),c_0_62]) ).
cnf(c_0_67,negated_conjecture,
multiplication(antidomain(X1),antidomain(antidomain(X1))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_51]) ).
cnf(c_0_68,negated_conjecture,
domain(multiplication(X1,addition(X2,antidomain(X2)))) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_65]),c_0_29]) ).
cnf(c_0_69,negated_conjecture,
multiplication(domain(X1),addition(antidomain(X1),X2)) = multiplication(domain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_51]),c_0_54]) ).
cnf(c_0_70,negated_conjecture,
multiplication(domain(addition(X1,X2)),antidomain(X2)) = multiplication(domain(X1),antidomain(X2)),
inference(spm,[status(thm)],[c_0_63,c_0_42]) ).
cnf(c_0_71,negated_conjecture,
multiplication(domain(X1),addition(X1,domain(antidomain(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_66]),c_0_45]) ).
cnf(c_0_72,negated_conjecture,
antidomain(multiplication(antidomain(X1),domain(antidomain(antidomain(X1))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_67]),c_0_53]),c_0_54]) ).
cnf(c_0_73,negated_conjecture,
domain(multiplication(domain(X1),antidomain(antidomain(X1)))) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_43]) ).
cnf(c_0_74,negated_conjecture,
multiplication(domain(X1),antidomain(antidomain(X1))) = antidomain(antidomain(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_44]),c_0_59]),c_0_23]),c_0_43]) ).
cnf(c_0_75,negated_conjecture,
multiplication(antidomain(X1),domain(antidomain(antidomain(X1)))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_35]),c_0_67]),c_0_53]),c_0_59]),c_0_62]) ).
cnf(c_0_76,negated_conjecture,
domain(antidomain(antidomain(X1))) = domain(X1),
inference(rw,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,negated_conjecture,
multiplication(antidomain(esk1_0),domain(esk1_0)) != zero,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_78,negated_conjecture,
multiplication(antidomain(X1),domain(X1)) = zero,
inference(rw,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_79,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : KLE079+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/10.53 % Computer : n016.cluster.edu
% 0.09/10.53 % Model : x86_64 x86_64
% 0.09/10.53 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.53 % Memory : 8046.5625MB
% 0.09/10.53 % OS : Linux 6.8.0-71-generic
% 0.09/10.53 % CPULimit : 300
% 0.09/10.53 % WCLimit : 300
% 0.09/10.53 % DateTime : Sun Sep 20 22:47:19 UTC 2026
% 0.09/10.53 % CPUTime :
% 0.09/10.53 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/10.58 Running first-order theorem proving
% 0.09/10.58 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/benchmark/theBenchmark.p
% 0.13/10.80 % Version: 3.5.1
% 0.13/10.80 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/10.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/10.80 % Starting new_bool_3 with 300s (1) cores
% 0.13/10.80 % Starting new_bool_1 with 300s (1) cores
% 0.13/10.80 % Starting sh5l with 300s (1) cores
% 0.13/10.80 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 959321 completed with status 0
% 0.13/10.80 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/10.80 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/10.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/10.80 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/10.80 % No SInE strategy applied
% 0.13/10.80 % Search class: FHUSM-FFSF21-MFFFFFNN
% 0.13/10.80 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/10.80 % Starting SubtermCWHack with 136s (1) cores
% 0.13/10.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/10.80 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.13/10.80 % Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.13/10.80 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.13/10.80 % G-E--_300_C18_F1_SE_CS_SP_S0Y with pid 959327 completed with status 0
% 0.13/10.80 % Result found by G-E--_300_C18_F1_SE_CS_SP_S0Y
% 0.13/10.80 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/10.80 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/10.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/10.80 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/10.80 % No SInE strategy applied
% 0.13/10.80 % Search class: FHUSM-FFSF21-MFFFFFNN
% 0.13/10.80 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/10.80 % Starting SubtermCWHack with 136s (1) cores
% 0.13/10.80 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/10.80 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.13/10.80 % Preprocessing time : 0.001 s
% 0.13/10.80
% 0.13/10.80 % Proof found!
% 0.13/10.80 % SZS status Theorem
% 0.13/10.80 % SZS output start CNFRefutation
% See solution above
% 0.13/10.80 % Parsed axioms : 18
% 0.13/10.80 % Removed by relevancy pruning/SinE : 0
% 0.13/10.80 % Initial clauses : 21
% 0.13/10.80 % Removed in clause preprocessing : 0
% 0.13/10.80 % Initial clauses in saturation : 21
% 0.13/10.80 % Processed clauses : 1007
% 0.13/10.80 % ...of these trivial : 565
% 0.13/10.80 % ...subsumed : 166
% 0.13/10.80 % ...remaining for further processing : 276
% 0.13/10.80 % Other redundant clauses eliminated : 0
% 0.13/10.80 % Clauses deleted for lack of memory : 0
% 0.13/10.80 % Backward-subsumed : 0
% 0.13/10.80 % Backward-rewritten : 66
% 0.13/10.80 % Generated clauses : 26228
% 0.13/10.80 % ...of the previous two non-redundant : 10455
% 0.13/10.80 % ...aggressively subsumed : 0
% 0.13/10.80 % Contextual simplify-reflections : 0
% 0.13/10.80 % Paramodulations : 26228
% 0.13/10.80 % Factorizations : 0
% 0.13/10.80 % NegExts : 0
% 0.13/10.80 % Equation resolutions : 0
% 0.13/10.80 % Disequality decompositions : 0
% 0.13/10.80 % Total rewrite steps : 52330
% 0.13/10.80 % ...of those cached : 46364
% 0.13/10.80 % Propositional unsat checks : 0
% 0.13/10.80 % Propositional check models : 0
% 0.13/10.80 % Propositional check unsatisfiable : 0
% 0.13/10.80 % Propositional clauses : 0
% 0.13/10.80 % Propositional clauses after purity: 0
% 0.13/10.80 % Propositional unsat core size : 0
% 0.13/10.80 % Propositional preprocessing time : 0.000
% 0.13/10.80 % Propositional encoding time : 0.000
% 0.13/10.80 % Propositional solver time : 0.000
% 0.13/10.80 % Success case prop preproc time : 0.000
% 0.13/10.80 % Success case prop encoding time : 0.000
% 0.13/10.80 % Success case prop solver time : 0.000
% 0.13/10.80 % Current number of processed clauses : 210
% 0.13/10.80 % Positive orientable unit clauses : 204
% 0.13/10.80 % Positive unorientable unit clauses: 4
% 0.13/10.80 % Negative unit clauses : 0
% 0.13/10.80 % Non-unit-clauses : 2
% 0.13/10.80 % Current number of unprocessed clauses: 9306
% 0.13/10.80 % ...number of literals in the above : 9306
% 0.13/10.80 % Current number of archived formulas : 0
% 0.13/10.80 % Current number of archived clauses : 66
% 0.13/10.80 % Clause-clause subsumption calls (NU) : 0
% 0.13/10.80 % Rec. Clause-clause subsumption calls : 0
% 0.13/10.80 % Non-unit clause-clause subsumptions : 0
% 0.13/10.80 % Unit Clause-clause subsumption calls : 21
% 0.13/10.80 % Rewrite failures with RHS unbound : 0
% 0.13/10.80 % BW rewrite match attempts : 946
% 0.13/10.80 % BW rewrite match successes : 239
% 0.13/10.80 % Condensation attempts : 0
% 0.13/10.80 % Condensation successes : 0
% 0.13/10.80 % Termbank termtop insertions : 260876
% 0.13/10.80 % Search garbage collected termcells : 59
% 0.13/10.80
% 0.13/10.80 % -------------------------------------------------
% 0.13/10.80 % User time : 0.191 s
% 0.13/10.80 % System time : 0.009 s
% 0.13/10.80 % Total time : 0.200 s
% 0.13/10.80 % Maximum resident set size: 3648 pages
% 0.13/10.80
% 0.13/10.80 % -------------------------------------------------
% 0.13/10.80 % User time : 0.952 s
% 0.13/10.80 % System time : 0.065 s
% 0.13/10.80 % Total time : 1.016 s
% 0.13/10.80 % Maximum resident set size: 4608 pages
% 0.13/10.80 % E exiting
%------------------------------------------------------------------------------