%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE131+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 : n008.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:54 PM UTC 2026
% Result : Theorem 0.17s 0.58s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 64 ( 60 unt; 0 def)
% Number of atoms : 68 ( 67 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 4 ~; 0 |; 1 &)
% ( 0 <=>; 1 =>; 2 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 16 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-2 aty)
% Number of variables : 89 ( 1 sgn 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(forward_diamond,axiom,
! [X4,X5] : forward_diamond(X4,X5) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+6.ax',forward_diamond) ).
fof(domain4,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain4) ).
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(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(goals,conjecture,
! [X4] :
( divergence(X4) = zero
<= ! [X5] : addition(domain(X5),forward_diamond(star(X4),domain_difference(domain(X5),forward_diamond(X4,domain(X5))))) = forward_diamond(star(X4),domain_difference(domain(X5),forward_diamond(X4,domain(X5)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
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(divergence1,axiom,
! [X4] : forward_diamond(X4,divergence(X4)) = divergence(X4),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+7.ax',divergence1) ).
fof(domain_difference,axiom,
! [X4,X5] : domain_difference(X4,X5) = multiplication(domain(X4),antidomain(X5)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+6.ax',domain_difference) ).
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(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
fof(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',right_annihilation) ).
fof(c_0_14,plain,
! [X42,X43] : forward_diamond(X42,X43) = domain(multiplication(X42,domain(X43))),
inference(variable_rename,[status(thm)],[forward_diamond]) ).
fof(c_0_15,plain,
! [X33] : domain(X33) = antidomain(antidomain(X33)),
inference(variable_rename,[status(thm)],[domain4]) ).
fof(c_0_16,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_17,plain,
! [X29] : multiplication(antidomain(X29),X29) = zero,
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_18,plain,
! [X12] : addition(X12,zero) = X12,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_19,negated_conjecture,
~ ! [X4] :
( divergence(X4) = zero
<= ! [X5] : addition(domain(X5),forward_diamond(star(X4),domain_difference(domain(X5),forward_diamond(X4,domain(X5))))) = forward_diamond(star(X4),domain_difference(domain(X5),forward_diamond(X4,domain(X5)))) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_20,plain,
! [X32] : addition(antidomain(antidomain(X32)),antidomain(X32)) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_21,plain,
! [X7,X8] : addition(X7,X8) = addition(X8,X7),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_22,plain,
! [X50] : forward_diamond(X50,divergence(X50)) = divergence(X50),
inference(variable_rename,[status(thm)],[divergence1]) ).
cnf(c_0_23,plain,
forward_diamond(X1,X2) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_28,negated_conjecture,
~ ! [X4] :
( ! [X5] : addition(domain(X5),forward_diamond(star(X4),domain_difference(domain(X5),forward_diamond(X4,domain(X5))))) = forward_diamond(star(X4),domain_difference(domain(X5),forward_diamond(X4,domain(X5))))
=> divergence(X4) = zero ),
inference(fof_simplification,[status(thm)],[c_0_19]) ).
fof(c_0_29,plain,
! [X40,X41] : domain_difference(X40,X41) = multiplication(domain(X40),antidomain(X41)),
inference(variable_rename,[status(thm)],[domain_difference]) ).
fof(c_0_30,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_31,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
forward_diamond(X1,divergence(X1)) = divergence(X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
forward_diamond(X1,X2) = antidomain(antidomain(multiplication(X1,antidomain(antidomain(X2))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).
cnf(c_0_35,plain,
multiplication(addition(X1,antidomain(X2)),X2) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
fof(c_0_36,plain,
! [X18] : multiplication(one,X18) = X18,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_37,negated_conjecture,
! [X55] :
( divergence(esk1_0) != zero
& addition(domain(X55),forward_diamond(star(esk1_0),domain_difference(domain(X55),forward_diamond(esk1_0,domain(X55))))) = forward_diamond(star(esk1_0),domain_difference(domain(X55),forward_diamond(esk1_0,domain(X55)))) ),
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_28])])])])]) ).
cnf(c_0_38,plain,
domain_difference(X1,X2) = multiplication(domain(X1),antidomain(X2)),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,plain,
antidomain(antidomain(multiplication(X1,antidomain(antidomain(divergence(X1)))))) = divergence(X1),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_42,plain,
! [X17] : multiplication(X17,one) = X17,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_43,plain,
multiplication(addition(antidomain(X1),X2),X1) = multiplication(X2,X1),
inference(spm,[status(thm)],[c_0_35,c_0_32]) ).
cnf(c_0_44,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,negated_conjecture,
addition(domain(X1),forward_diamond(star(esk1_0),domain_difference(domain(X1),forward_diamond(esk1_0,domain(X1))))) = forward_diamond(star(esk1_0),domain_difference(domain(X1),forward_diamond(esk1_0,domain(X1)))),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_46,plain,
domain_difference(X1,X2) = multiplication(antidomain(antidomain(X1)),antidomain(X2)),
inference(rw,[status(thm)],[c_0_38,c_0_24]) ).
cnf(c_0_47,plain,
multiplication(antidomain(X1),addition(X2,X1)) = multiplication(antidomain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_26]),c_0_27]) ).
cnf(c_0_48,plain,
addition(divergence(X1),antidomain(divergence(X1))) = one,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_49,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_50,plain,
multiplication(antidomain(antidomain(X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_40]),c_0_44]) ).
cnf(c_0_51,negated_conjecture,
addition(antidomain(antidomain(X1)),antidomain(antidomain(multiplication(star(esk1_0),antidomain(antidomain(multiplication(antidomain(antidomain(antidomain(antidomain(X1)))),antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1))))))))))))))) = antidomain(antidomain(multiplication(star(esk1_0),antidomain(antidomain(multiplication(antidomain(antidomain(antidomain(antidomain(X1)))),antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1)))))))))))))),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_24]),c_0_34]),c_0_34]),c_0_34]),c_0_34]),c_0_46]),c_0_46]) ).
cnf(c_0_52,plain,
antidomain(antidomain(divergence(X1))) = divergence(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_50]) ).
cnf(c_0_53,plain,
antidomain(antidomain(antidomain(X1))) = antidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_40]),c_0_49]),c_0_50]) ).
cnf(c_0_54,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_26,c_0_49]) ).
cnf(c_0_55,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_32]) ).
fof(c_0_56,plain,
! [X25] : multiplication(X25,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
cnf(c_0_57,negated_conjecture,
addition(divergence(X1),antidomain(antidomain(multiplication(star(esk1_0),antidomain(antidomain(multiplication(divergence(X1),antidomain(multiplication(esk1_0,divergence(X1)))))))))) = antidomain(antidomain(multiplication(star(esk1_0),antidomain(antidomain(multiplication(divergence(X1),antidomain(multiplication(esk1_0,divergence(X1))))))))),
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_51,c_0_41]),c_0_52]),c_0_52]),c_0_53]),c_0_52]),c_0_52]),c_0_53]) ).
cnf(c_0_58,plain,
antidomain(multiplication(X1,divergence(X1))) = antidomain(divergence(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_41]),c_0_52]) ).
cnf(c_0_59,plain,
multiplication(divergence(X1),antidomain(divergence(X1))) = zero,
inference(spm,[status(thm)],[c_0_26,c_0_52]) ).
cnf(c_0_60,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_54]),c_0_55]) ).
cnf(c_0_61,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_62,negated_conjecture,
divergence(esk1_0) != zero,
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(sr,[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(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_57,c_0_58]),c_0_59]),c_0_60]),c_0_54]),c_0_61]),c_0_60]),c_0_54]),c_0_27]),c_0_59]),c_0_60]),c_0_54]),c_0_61]),c_0_60]),c_0_54]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KLE131+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.38 % Computer : n008.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 20 22:45:56 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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.17/0.58 % Version: 3.5.1
% 0.17/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.58 % Starting sh5l with 300s (1) cores
% 0.17/0.58 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3761386 completed with status 0
% 0.17/0.58 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.58 % No SInE strategy applied
% 0.17/0.58 % Search class: FHUSM-FFMF21-DFFFFFNN
% 0.17/0.58 % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.17/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.58 % Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_S0Y with 212s (1) cores
% 0.17/0.58 % Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 0.17/0.58 % Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.17/0.58 % G-E--_100_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 3761394 completed with status 0
% 0.17/0.58 % Result found by G-E--_100_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 0.17/0.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.58 % No SInE strategy applied
% 0.17/0.58 % Search class: FHUSM-FFMF21-DFFFFFNN
% 0.17/0.58 % partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.17/0.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.58 % Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_S0Y with 212s (1) cores
% 0.17/0.58 % Preprocessing time : 0.002 s
% 0.17/0.58
% 0.17/0.58 % Proof found!
% 0.17/0.58 % SZS status Theorem
% 0.17/0.58 % SZS output start CNFRefutation
% See solution above
% 0.17/0.58 % Parsed axioms : 29
% 0.17/0.58 % Removed by relevancy pruning/SinE : 0
% 0.17/0.58 % Initial clauses : 31
% 0.17/0.58 % Removed in clause preprocessing : 8
% 0.17/0.58 % Initial clauses in saturation : 23
% 0.17/0.58 % Processed clauses : 660
% 0.17/0.58 % ...of these trivial : 274
% 0.17/0.58 % ...subsumed : 172
% 0.17/0.58 % ...remaining for further processing : 214
% 0.17/0.58 % Other redundant clauses eliminated : 0
% 0.17/0.58 % Clauses deleted for lack of memory : 0
% 0.17/0.58 % Backward-subsumed : 0
% 0.17/0.58 % Backward-rewritten : 11
% 0.17/0.58 % Generated clauses : 13105
% 0.17/0.58 % ...of the previous two non-redundant : 5580
% 0.17/0.58 % ...aggressively subsumed : 0
% 0.17/0.58 % Contextual simplify-reflections : 0
% 0.17/0.58 % Paramodulations : 13105
% 0.17/0.58 % Factorizations : 0
% 0.17/0.58 % NegExts : 0
% 0.17/0.58 % Equation resolutions : 0
% 0.17/0.58 % Disequality decompositions : 0
% 0.17/0.58 % Total rewrite steps : 27314
% 0.17/0.58 % ...of those cached : 23332
% 0.17/0.58 % Propositional unsat checks : 0
% 0.17/0.58 % Propositional check models : 0
% 0.17/0.58 % Propositional check unsatisfiable : 0
% 0.17/0.58 % Propositional clauses : 0
% 0.17/0.58 % Propositional clauses after purity: 0
% 0.17/0.58 % Propositional unsat core size : 0
% 0.17/0.58 % Propositional preprocessing time : 0.000
% 0.17/0.58 % Propositional encoding time : 0.000
% 0.17/0.58 % Propositional solver time : 0.000
% 0.17/0.58 % Success case prop preproc time : 0.000
% 0.17/0.58 % Success case prop encoding time : 0.000
% 0.17/0.58 % Success case prop solver time : 0.000
% 0.17/0.58 % Current number of processed clauses : 203
% 0.17/0.58 % Positive orientable unit clauses : 195
% 0.17/0.58 % Positive unorientable unit clauses: 4
% 0.17/0.58 % Negative unit clauses : 1
% 0.17/0.58 % Non-unit-clauses : 3
% 0.17/0.58 % Current number of unprocessed clauses: 4887
% 0.17/0.58 % ...number of literals in the above : 5050
% 0.17/0.58 % Current number of archived formulas : 0
% 0.17/0.58 % Current number of archived clauses : 19
% 0.17/0.58 % Clause-clause subsumption calls (NU) : 0
% 0.17/0.58 % Rec. Clause-clause subsumption calls : 0
% 0.17/0.58 % Non-unit clause-clause subsumptions : 0
% 0.17/0.58 % Unit Clause-clause subsumption calls : 30
% 0.17/0.58 % Rewrite failures with RHS unbound : 0
% 0.17/0.58 % BW rewrite match attempts : 337
% 0.17/0.58 % BW rewrite match successes : 79
% 0.17/0.58 % Condensation attempts : 0
% 0.17/0.58 % Condensation successes : 0
% 0.17/0.58 % Termbank termtop insertions : 168709
% 0.17/0.58 % Search garbage collected termcells : 69
% 0.17/0.58
% 0.17/0.58 % -------------------------------------------------
% 0.17/0.58 % User time : 0.115 s
% 0.17/0.58 % System time : 0.013 s
% 0.17/0.58 % Total time : 0.128 s
% 0.17/0.58 % Maximum resident set size: 3664 pages
% 0.17/0.58
% 0.17/0.58 % -------------------------------------------------
% 0.17/0.58 % User time : 0.538 s
% 0.17/0.58 % System time : 0.045 s
% 0.17/0.58 % Total time : 0.583 s
% 0.17/0.58 % Maximum resident set size: 4608 pages
% 0.17/0.58 % E exiting
%------------------------------------------------------------------------------