%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE071+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 : n011.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:47 PM UTC 2026
% Result : Theorem 28.79s 4.78s
% Output : CNFRefutation 28.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 77 ( 77 unt; 0 def)
% Number of atoms : 77 ( 76 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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; 4 con; 0-2 aty)
% Number of variables : 146 ( 11 sgn 52 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(domain3,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.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(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain1) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',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/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(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain2) ).
fof(domain5,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain5) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
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(goals,conjecture,
! [X4,X5,X6] : addition(domain(X4),multiplication(domain(X5),domain(X6))) = multiplication(addition(domain(X4),domain(X5)),addition(domain(X4),domain(X6))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(additive_idempotence,axiom,
! [X1] : addition(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).
fof(c_0_13,plain,
! [X32] : addition(domain(X32),one) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_14,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_15,plain,
! [X29] : addition(X29,multiplication(domain(X29),X29)) = multiplication(domain(X29),X29),
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_16,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_17,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X22,X23,X24] : multiplication(addition(X22,X23),X24) = addition(multiplication(X22,X24),multiplication(X23,X24)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
fof(c_0_20,plain,
! [X18] : multiplication(one,X18) = X18,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_21,plain,
! [X19,X20,X21] : multiplication(X19,addition(X20,X21)) = addition(multiplication(X19,X20),multiplication(X19,X21)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_22,plain,
! [X30,X31] : domain(multiplication(X30,X31)) = domain(multiplication(X30,domain(X31))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_23,plain,
! [X33,X34] : domain(addition(X33,X34)) = addition(domain(X33),domain(X34)),
inference(variable_rename,[status(thm)],[domain5]) ).
cnf(c_0_24,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_32,plain,
domain(one) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_33,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_18]) ).
cnf(c_0_34,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(one,X2)),
inference(spm,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_35,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_28]),c_0_28]) ).
cnf(c_0_36,plain,
domain(addition(X1,one)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_18]),c_0_26]) ).
cnf(c_0_37,plain,
multiplication(domain(X1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_33]),c_0_18]),c_0_26]),c_0_28]) ).
cnf(c_0_38,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(one,X2),X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_39,plain,
addition(X1,multiplication(X1,domain(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_26]),c_0_25]) ).
cnf(c_0_40,plain,
domain(addition(domain(X1),X2)) = domain(addition(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_35]),c_0_31]) ).
cnf(c_0_41,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_18]) ).
cnf(c_0_42,plain,
domain(multiplication(X1,addition(X2,one))) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_36]),c_0_25]) ).
cnf(c_0_43,plain,
multiplication(domain(X1),addition(X2,X1)) = addition(X1,multiplication(domain(X1),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_37]),c_0_18]) ).
fof(c_0_44,plain,
! [X14,X15,X16] : multiplication(X14,multiplication(X15,X16)) = multiplication(multiplication(X14,X15),X16),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_45,plain,
addition(X1,multiplication(domain(X2),X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_28]),c_0_28]) ).
cnf(c_0_46,plain,
domain(addition(X1,multiplication(domain(X1),X2))) = domain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_35]) ).
cnf(c_0_47,plain,
multiplication(domain(X1),domain(addition(X2,X1))) = domain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_31]),c_0_35]),c_0_35]),c_0_39]) ).
cnf(c_0_48,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
fof(c_0_49,plain,
! [X9,X10,X11] : addition(X11,addition(X10,X9)) = addition(addition(X11,X10),X9),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_50,negated_conjecture,
~ ! [X4,X5,X6] : addition(domain(X4),multiplication(domain(X5),domain(X6))) = multiplication(addition(domain(X4),domain(X5)),addition(domain(X4),domain(X6))),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_51,plain,
multiplication(domain(multiplication(domain(X1),X2)),X2) = multiplication(domain(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_45]),c_0_27]),c_0_31]),c_0_46]) ).
cnf(c_0_52,plain,
multiplication(domain(multiplication(domain(X1),X2)),domain(X2)) = domain(multiplication(domain(X1),X2)),
inference(spm,[status(thm)],[c_0_47,c_0_45]) ).
cnf(c_0_53,plain,
multiplication(addition(X1,multiplication(X1,X2)),X3) = multiplication(X1,multiplication(addition(X2,one),X3)),
inference(spm,[status(thm)],[c_0_48,c_0_41]) ).
cnf(c_0_54,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
fof(c_0_55,negated_conjecture,
addition(domain(esk1_0),multiplication(domain(esk2_0),domain(esk3_0))) != multiplication(addition(domain(esk1_0),domain(esk2_0)),addition(domain(esk1_0),domain(esk3_0))),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])])])]) ).
cnf(c_0_56,plain,
domain(multiplication(domain(X1),X2)) = multiplication(domain(X1),domain(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_30]),c_0_52]) ).
cnf(c_0_57,plain,
multiplication(domain(X1),multiplication(addition(X1,one),X2)) = multiplication(addition(X1,domain(X1)),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_37]),c_0_18]) ).
cnf(c_0_58,plain,
multiplication(addition(domain(X1),X2),X1) = addition(X1,multiplication(X2,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_37]) ).
fof(c_0_59,plain,
! [X13] : addition(X13,X13) = X13,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
cnf(c_0_60,plain,
addition(X1,addition(multiplication(X1,domain(X2)),X3)) = addition(X1,X3),
inference(spm,[status(thm)],[c_0_54,c_0_39]) ).
cnf(c_0_61,negated_conjecture,
addition(domain(esk1_0),multiplication(domain(esk2_0),domain(esk3_0))) != multiplication(addition(domain(esk1_0),domain(esk2_0)),addition(domain(esk1_0),domain(esk3_0))),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_62,plain,
multiplication(domain(X1),domain(multiplication(addition(X1,one),X2))) = domain(multiplication(addition(X1,domain(X1)),X2)),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_63,plain,
multiplication(domain(addition(X1,X2)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_31]),c_0_45]) ).
cnf(c_0_64,plain,
addition(X1,addition(X2,X3)) = addition(X2,addition(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_18]),c_0_54]) ).
cnf(c_0_65,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_59]) ).
cnf(c_0_66,plain,
addition(X1,multiplication(addition(X1,X2),domain(X3))) = addition(X1,multiplication(X2,domain(X3))),
inference(spm,[status(thm)],[c_0_60,c_0_27]) ).
cnf(c_0_67,plain,
addition(domain(X1),multiplication(domain(X2),domain(X3))) = domain(addition(X1,multiplication(domain(X2),X3))),
inference(spm,[status(thm)],[c_0_31,c_0_56]) ).
cnf(c_0_68,negated_conjecture,
addition(domain(esk1_0),multiplication(domain(esk2_0),domain(esk3_0))) != multiplication(domain(addition(esk1_0,esk2_0)),domain(addition(esk1_0,esk3_0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_31]),c_0_31]) ).
cnf(c_0_69,plain,
multiplication(domain(X1),domain(addition(X2,multiplication(X1,X2)))) = domain(multiplication(addition(X1,domain(X1)),X2)),
inference(spm,[status(thm)],[c_0_62,c_0_33]) ).
cnf(c_0_70,plain,
multiplication(domain(addition(X1,X2)),addition(X1,X3)) = addition(X1,multiplication(domain(addition(X1,X2)),X3)),
inference(spm,[status(thm)],[c_0_29,c_0_63]) ).
cnf(c_0_71,plain,
addition(X1,addition(X2,multiplication(domain(X3),X1))) = addition(X2,X1),
inference(spm,[status(thm)],[c_0_64,c_0_45]) ).
cnf(c_0_72,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_54,c_0_65]) ).
cnf(c_0_73,plain,
domain(addition(X1,multiplication(domain(addition(X1,X2)),X3))) = domain(addition(X1,multiplication(domain(X2),X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_31]),c_0_67]),c_0_67]) ).
cnf(c_0_74,negated_conjecture,
multiplication(domain(addition(esk1_0,esk2_0)),domain(addition(esk1_0,esk3_0))) != domain(addition(esk1_0,multiplication(domain(esk2_0),esk3_0))),
inference(rw,[status(thm)],[c_0_68,c_0_67]) ).
cnf(c_0_75,plain,
multiplication(domain(addition(X1,X2)),domain(addition(X1,X3))) = domain(addition(X1,multiplication(domain(X2),X3))),
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)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_35]),c_0_54]),c_0_71]),c_0_72]),c_0_35]),c_0_65]),c_0_70]),c_0_73]) ).
cnf(c_0_76,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_75])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE071+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.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 22:42:10 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.45 Running first-order theorem proving
% 0.14/0.45 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
% 28.79/4.78 % Version: 3.5.1
% 28.79/4.78 % Preprocessing class: FSMSSMSSSSSNFFN.
% 28.79/4.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 28.79/4.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 28.79/4.78 % Starting new_bool_3 with 300s (1) cores
% 28.79/4.78 % Starting new_bool_1 with 300s (1) cores
% 28.79/4.78 % Starting sh5l with 300s (1) cores
% 28.79/4.78 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 348101 completed with status 0
% 28.79/4.78 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 28.79/4.78 % Preprocessing class: FSMSSMSSSSSNFFN.
% 28.79/4.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 28.79/4.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 28.79/4.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 28.79/4.78 % No SInE strategy applied
% 28.79/4.78 % Search class: FHUSM-FFSF21-MFFFFFNN
% 28.79/4.78 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 28.79/4.78 % Starting SubtermCWHack with 136s (1) cores
% 28.79/4.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 28.79/4.78 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 28.79/4.78 % Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 28.79/4.78 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 28.79/4.78 % G-E--_300_C18_F1_SE_CS_SP_S0Y with pid 348107 completed with status 0
% 28.79/4.78 % Result found by G-E--_300_C18_F1_SE_CS_SP_S0Y
% 28.79/4.78 % Preprocessing class: FSMSSMSSSSSNFFN.
% 28.79/4.78 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 28.79/4.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 28.79/4.78 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 28.79/4.78 % No SInE strategy applied
% 28.79/4.78 % Search class: FHUSM-FFSF21-MFFFFFNN
% 28.79/4.78 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 28.79/4.78 % Starting SubtermCWHack with 136s (1) cores
% 28.79/4.78 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 28.79/4.78 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 28.79/4.78 % Preprocessing time : 0.002 s
% 28.79/4.78
% 28.79/4.78 % Proof found!
% 28.79/4.78 % SZS status Theorem
% 28.79/4.78 % SZS output start CNFRefutation
% See solution above
% 28.79/4.78 % Parsed axioms : 18
% 28.79/4.78 % Removed by relevancy pruning/SinE : 0
% 28.79/4.78 % Initial clauses : 19
% 28.79/4.78 % Removed in clause preprocessing : 0
% 28.79/4.78 % Initial clauses in saturation : 19
% 28.79/4.78 % Processed clauses : 7319
% 28.79/4.78 % ...of these trivial : 3644
% 28.79/4.78 % ...subsumed : 3077
% 28.79/4.78 % ...remaining for further processing : 598
% 28.79/4.78 % Other redundant clauses eliminated : 0
% 28.79/4.78 % Clauses deleted for lack of memory : 0
% 28.79/4.78 % Backward-subsumed : 0
% 28.79/4.78 % Backward-rewritten : 97
% 28.79/4.78 % Generated clauses : 207756
% 28.79/4.78 % ...of the previous two non-redundant : 109628
% 28.79/4.78 % ...aggressively subsumed : 0
% 28.79/4.78 % Contextual simplify-reflections : 0
% 28.79/4.78 % Paramodulations : 207756
% 28.79/4.78 % Factorizations : 0
% 28.79/4.78 % NegExts : 0
% 28.79/4.78 % Equation resolutions : 0
% 28.79/4.78 % Disequality decompositions : 0
% 28.79/4.78 % Total rewrite steps : 479403
% 28.79/4.78 % ...of those cached : 400700
% 28.79/4.78 % Propositional unsat checks : 0
% 28.79/4.78 % Propositional check models : 0
% 28.79/4.78 % Propositional check unsatisfiable : 0
% 28.79/4.78 % Propositional clauses : 0
% 28.79/4.78 % Propositional clauses after purity: 0
% 28.79/4.78 % Propositional unsat core size : 0
% 28.79/4.78 % Propositional preprocessing time : 0.000
% 28.79/4.78 % Propositional encoding time : 0.000
% 28.79/4.78 % Propositional solver time : 0.000
% 28.79/4.78 % Success case prop preproc time : 0.000
% 28.79/4.78 % Success case prop encoding time : 0.000
% 28.79/4.78 % Success case prop solver time : 0.000
% 28.79/4.78 % Current number of processed clauses : 501
% 28.79/4.78 % Positive orientable unit clauses : 469
% 28.79/4.78 % Positive unorientable unit clauses: 30
% 28.79/4.78 % Negative unit clauses : 0
% 28.79/4.78 % Non-unit-clauses : 2
% 28.79/4.78 % Current number of unprocessed clauses: 101362
% 28.79/4.78 % ...number of literals in the above : 101362
% 28.79/4.78 % Current number of archived formulas : 0
% 28.79/4.78 % Current number of archived clauses : 97
% 28.79/4.78 % Clause-clause subsumption calls (NU) : 0
% 28.79/4.78 % Rec. Clause-clause subsumption calls : 0
% 28.79/4.78 % Non-unit clause-clause subsumptions : 0
% 28.79/4.78 % Unit Clause-clause subsumption calls : 989
% 28.79/4.78 % Rewrite failures with RHS unbound : 0
% 28.79/4.78 % BW rewrite match attempts : 6589
% 28.79/4.78 % BW rewrite match successes : 414
% 28.79/4.78 % Condensation attempts : 0
% 28.79/4.78 % Condensation successes : 0
% 28.79/4.78 % Termbank termtop insertions : 3318025
% 28.79/4.78 % Search garbage collected termcells : 45
% 28.79/4.78
% 28.79/4.78 % -------------------------------------------------
% 28.79/4.78 % User time : 3.948 s
% 28.79/4.78 % System time : 0.178 s
% 28.79/4.78 % Total time : 4.126 s
% 28.79/4.78 % Maximum resident set size: 3648 pages
% 28.79/4.78
% 28.79/4.78 % -------------------------------------------------
% 28.79/4.78 % User time : 19.494 s
% 28.79/4.78 % System time : 0.877 s
% 28.79/4.78 % Total time : 20.371 s
% 28.79/4.78 % Maximum resident set size: 4608 pages
% 28.79/4.78 % E exiting
%------------------------------------------------------------------------------