%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KLE120+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:53 PM UTC 2026
% Result : Theorem 2.86s 1.14s
% Output : CNFRefutation 2.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of formulae : 94 ( 94 unt; 0 def)
% Number of atoms : 94 ( 93 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 132 ( 5 sgn 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(codomain3,axiom,
! [X4] : addition(coantidomain(coantidomain(X4)),coantidomain(X4)) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain3) ).
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_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
fof(codomain1,axiom,
! [X4] : multiplication(X4,coantidomain(X4)) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain1) ).
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(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(domain1,axiom,
! [X4] : multiplication(antidomain(X4),X4) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain1) ).
fof(left_annihilation,axiom,
! [X1] : multiplication(zero,X1) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).
fof(codomain2,axiom,
! [X4,X5] : addition(coantidomain(multiplication(X4,X5)),coantidomain(multiplication(coantidomain(coantidomain(X4)),X5))) = coantidomain(multiplication(coantidomain(coantidomain(X4)),X5)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',codomain2) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_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(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(domain3,axiom,
! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain3) ).
fof(goals,conjecture,
! [X4] : addition(backward_diamond(one,domain(X4)),domain(X4)) = domain(X4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(backward_diamond,axiom,
! [X4,X5] : backward_diamond(X4,X5) = codomain(multiplication(codomain(X5),X4)),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+6.ax',backward_diamond) ).
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_19,plain,
! [X36] : addition(coantidomain(coantidomain(X36)),coantidomain(X36)) = one,
inference(variable_rename,[status(thm)],[codomain3]) ).
fof(c_0_20,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_21,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_22,plain,
! [X33] : multiplication(X33,coantidomain(X33)) = zero,
inference(variable_rename,[status(thm)],[codomain1]) ).
fof(c_0_23,plain,
! [X11] : addition(X11,zero) = X11,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_24,plain,
! [X8,X9,X10] : addition(X10,addition(X9,X8)) = addition(addition(X10,X9),X8),
inference(variable_rename,[status(thm)],[additive_associativity]) ).
fof(c_0_25,plain,
! [X12] : addition(X12,X12) = X12,
inference(variable_rename,[status(thm)],[additive_idempotence]) ).
fof(c_0_26,plain,
! [X13,X14,X15] : multiplication(X13,multiplication(X14,X15)) = multiplication(multiplication(X13,X14),X15),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
fof(c_0_27,plain,
! [X28] : multiplication(antidomain(X28),X28) = zero,
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_28,plain,
! [X25] : multiplication(zero,X25) = zero,
inference(variable_rename,[status(thm)],[left_annihilation]) ).
cnf(c_0_29,plain,
addition(coantidomain(coantidomain(X1)),coantidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
multiplication(X1,coantidomain(X1)) = zero,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,plain,
addition(X1,addition(X2,X3)) = addition(addition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
addition(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_36,plain,
! [X34,X35] : addition(coantidomain(multiplication(X34,X35)),coantidomain(multiplication(coantidomain(coantidomain(X34)),X35))) = coantidomain(multiplication(coantidomain(coantidomain(X34)),X35)),
inference(variable_rename,[status(thm)],[codomain2]) ).
cnf(c_0_37,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,plain,
multiplication(zero,X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_40,plain,
addition(coantidomain(X1),coantidomain(coantidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_41,plain,
coantidomain(one) = zero,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_42,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_43,plain,
addition(X1,addition(X1,X2)) = addition(X1,X2),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_44,plain,
addition(coantidomain(multiplication(X1,X2)),coantidomain(multiplication(coantidomain(coantidomain(X1)),X2))) = coantidomain(multiplication(coantidomain(coantidomain(X1)),X2)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,plain,
multiplication(antidomain(X1),multiplication(X1,X2)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_46,plain,
coantidomain(zero) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_47,plain,
addition(one,coantidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_40]),c_0_30]) ).
fof(c_0_48,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_49,plain,
! [X18,X19,X20] : multiplication(X18,addition(X19,X20)) = addition(multiplication(X18,X19),multiplication(X18,X20)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
cnf(c_0_50,plain,
coantidomain(multiplication(coantidomain(coantidomain(antidomain(X1))),multiplication(X1,X2))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47]) ).
cnf(c_0_51,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
fof(c_0_52,plain,
! [X21,X22,X23] : multiplication(addition(X21,X22),X23) = addition(multiplication(X21,X23),multiplication(X22,X23)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_53,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
fof(c_0_54,plain,
! [X31] : addition(antidomain(antidomain(X31)),antidomain(X31)) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
cnf(c_0_55,plain,
coantidomain(multiplication(coantidomain(coantidomain(antidomain(X1))),X1)) = one,
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_57,plain,
multiplication(X1,addition(coantidomain(X1),X2)) = multiplication(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_32]),c_0_42]) ).
cnf(c_0_58,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_59,plain,
multiplication(coantidomain(coantidomain(antidomain(X1))),X1) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_55]),c_0_51]) ).
cnf(c_0_60,plain,
multiplication(addition(X1,X2),coantidomain(X2)) = multiplication(X1,coantidomain(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_32]),c_0_33]) ).
cnf(c_0_61,plain,
multiplication(X1,coantidomain(coantidomain(X1))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_40]),c_0_51]) ).
cnf(c_0_62,plain,
multiplication(addition(antidomain(X1),X2),X1) = multiplication(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_38]),c_0_42]) ).
cnf(c_0_63,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_58,c_0_30]) ).
fof(c_0_64,negated_conjecture,
~ ! [X4] : addition(backward_diamond(one,domain(X4)),domain(X4)) = domain(X4),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_65,plain,
! [X43,X44] : backward_diamond(X43,X44) = codomain(multiplication(codomain(X44),X43)),
inference(variable_rename,[status(thm)],[backward_diamond]) ).
fof(c_0_66,plain,
! [X37] : codomain(X37) = coantidomain(coantidomain(X37)),
inference(variable_rename,[status(thm)],[codomain4]) ).
cnf(c_0_67,plain,
multiplication(addition(coantidomain(coantidomain(antidomain(X1))),X2),X1) = multiplication(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_59]),c_0_42]) ).
cnf(c_0_68,plain,
coantidomain(coantidomain(coantidomain(X1))) = coantidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_40]),c_0_31]),c_0_61]) ).
cnf(c_0_69,plain,
multiplication(antidomain(X1),addition(X2,X1)) = multiplication(antidomain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_38]),c_0_33]) ).
cnf(c_0_70,plain,
multiplication(antidomain(antidomain(X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_31]) ).
fof(c_0_71,negated_conjecture,
addition(backward_diamond(one,domain(esk1_0)),domain(esk1_0)) != domain(esk1_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_64])])])]) ).
fof(c_0_72,plain,
! [X32] : domain(X32) = antidomain(antidomain(X32)),
inference(variable_rename,[status(thm)],[domain4]) ).
cnf(c_0_73,plain,
backward_diamond(X1,X2) = codomain(multiplication(codomain(X2),X1)),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_74,plain,
codomain(X1) = coantidomain(coantidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_75,plain,
multiplication(coantidomain(antidomain(X1)),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_40]),c_0_31]),c_0_68]) ).
cnf(c_0_76,plain,
antidomain(antidomain(antidomain(X1))) = antidomain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_63]),c_0_51]),c_0_70]) ).
cnf(c_0_77,negated_conjecture,
addition(backward_diamond(one,domain(esk1_0)),domain(esk1_0)) != domain(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_78,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_79,plain,
backward_diamond(X1,X2) = coantidomain(coantidomain(multiplication(coantidomain(coantidomain(X2)),X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_74]),c_0_74]) ).
cnf(c_0_80,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_51]),c_0_30]) ).
cnf(c_0_81,plain,
multiplication(coantidomain(antidomain(X1)),antidomain(antidomain(X1))) = antidomain(antidomain(X1)),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_82,plain,
addition(one,antidomain(X1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_63]),c_0_30]) ).
cnf(c_0_83,negated_conjecture,
addition(coantidomain(coantidomain(multiplication(coantidomain(coantidomain(antidomain(antidomain(esk1_0)))),one))),antidomain(antidomain(esk1_0))) != antidomain(antidomain(esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78]),c_0_78]),c_0_78]),c_0_79]) ).
cnf(c_0_84,plain,
addition(antidomain(X1),addition(antidomain(antidomain(X1)),X2)) = addition(one,X2),
inference(spm,[status(thm)],[c_0_34,c_0_63]) ).
cnf(c_0_85,plain,
addition(antidomain(antidomain(X1)),coantidomain(antidomain(X1))) = coantidomain(antidomain(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_30]),c_0_82]),c_0_51]),c_0_30]) ).
cnf(c_0_86,plain,
multiplication(addition(X1,X2),coantidomain(X1)) = multiplication(X2,coantidomain(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_32]),c_0_42]) ).
cnf(c_0_87,negated_conjecture,
addition(antidomain(antidomain(esk1_0)),coantidomain(coantidomain(coantidomain(coantidomain(antidomain(antidomain(esk1_0))))))) != antidomain(antidomain(esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_30]),c_0_51]) ).
cnf(c_0_88,plain,
multiplication(antidomain(X1),addition(X1,X2)) = multiplication(antidomain(X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_38]),c_0_42]) ).
cnf(c_0_89,plain,
addition(antidomain(X1),coantidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_47]) ).
cnf(c_0_90,plain,
multiplication(antidomain(antidomain(X1)),coantidomain(antidomain(X1))) = coantidomain(antidomain(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_63]),c_0_31]) ).
cnf(c_0_91,negated_conjecture,
addition(antidomain(antidomain(esk1_0)),coantidomain(coantidomain(antidomain(antidomain(esk1_0))))) != antidomain(antidomain(esk1_0)),
inference(rw,[status(thm)],[c_0_87,c_0_68]) ).
cnf(c_0_92,plain,
coantidomain(antidomain(X1)) = antidomain(antidomain(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_51]),c_0_90]) ).
cnf(c_0_93,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_76]),c_0_92]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : KLE120+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.47 % Computer : n010.cluster.edu
% 0.19/0.47 % Model : x86_64 x86_64
% 0.19/0.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.47 % Memory : 8046.5625MB
% 0.19/0.47 % OS : Linux 6.8.0-71-generic
% 0.19/0.47 % CPULimit : 300
% 0.19/0.47 % WCLimit : 300
% 0.19/0.47 % DateTime : Sun Sep 20 22:45:18 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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
% 2.86/1.14 % Version: 3.5.1
% 2.86/1.14 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.86/1.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.86/1.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.86/1.14 % Starting new_bool_3 with 300s (1) cores
% 2.86/1.14 % Starting new_bool_1 with 300s (1) cores
% 2.86/1.14 % Starting sh5l with 300s (1) cores
% 2.86/1.14 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3672306 completed with status 0
% 2.86/1.14 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.86/1.14 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.86/1.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.86/1.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.86/1.14 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.86/1.14 % No SInE strategy applied
% 2.86/1.14 % Search class: FHUSM-FFSF21-DFFFFFNN
% 2.86/1.14 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.86/1.14 % Starting SubtermCWHack with 136s (1) cores
% 2.86/1.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.86/1.14 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 271s (1) cores
% 2.86/1.14 % Starting new_bool_3 with 271s (1) cores
% 2.86/1.14 % Starting U----_206d_02_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.86/1.14 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 3672314 completed with status 0
% 2.86/1.14 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 2.86/1.14 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.86/1.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.86/1.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.86/1.14 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.86/1.14 % No SInE strategy applied
% 2.86/1.14 % Search class: FHUSM-FFSF21-DFFFFFNN
% 2.86/1.14 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.86/1.14 % Starting SubtermCWHack with 136s (1) cores
% 2.86/1.14 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.86/1.14 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 271s (1) cores
% 2.86/1.14 % Preprocessing time : 0.005 s
% 2.86/1.14
% 2.86/1.14 % Proof found!
% 2.86/1.14 % SZS status Theorem
% 2.86/1.14 % SZS output start CNFRefutation
% See solution above
% 2.86/1.14 % Parsed axioms : 27
% 2.86/1.14 % Removed by relevancy pruning/SinE : 0
% 2.86/1.14 % Initial clauses : 28
% 2.86/1.14 % Removed in clause preprocessing : 8
% 2.86/1.14 % Initial clauses in saturation : 20
% 2.86/1.14 % Processed clauses : 920
% 2.86/1.14 % ...of these trivial : 385
% 2.86/1.14 % ...subsumed : 265
% 2.86/1.14 % ...remaining for further processing : 270
% 2.86/1.14 % Other redundant clauses eliminated : 0
% 2.86/1.14 % Clauses deleted for lack of memory : 0
% 2.86/1.14 % Backward-subsumed : 0
% 2.86/1.14 % Backward-rewritten : 79
% 2.86/1.14 % Generated clauses : 20586
% 2.86/1.14 % ...of the previous two non-redundant : 10933
% 2.86/1.14 % ...aggressively subsumed : 0
% 2.86/1.14 % Contextual simplify-reflections : 0
% 2.86/1.14 % Paramodulations : 20586
% 2.86/1.14 % Factorizations : 0
% 2.86/1.14 % NegExts : 0
% 2.86/1.14 % Equation resolutions : 0
% 2.86/1.14 % Disequality decompositions : 0
% 2.86/1.14 % Total rewrite steps : 45328
% 2.86/1.14 % ...of those cached : 38977
% 2.86/1.14 % Propositional unsat checks : 0
% 2.86/1.14 % Propositional check models : 0
% 2.86/1.14 % Propositional check unsatisfiable : 0
% 2.86/1.14 % Propositional clauses : 0
% 2.86/1.14 % Propositional clauses after purity: 0
% 2.86/1.14 % Propositional unsat core size : 0
% 2.86/1.14 % Propositional preprocessing time : 0.000
% 2.86/1.14 % Propositional encoding time : 0.000
% 2.86/1.14 % Propositional solver time : 0.000
% 2.86/1.14 % Success case prop preproc time : 0.000
% 2.86/1.14 % Success case prop encoding time : 0.000
% 2.86/1.14 % Success case prop solver time : 0.000
% 2.86/1.14 % Current number of processed clauses : 191
% 2.86/1.14 % Positive orientable unit clauses : 181
% 2.86/1.14 % Positive unorientable unit clauses: 7
% 2.86/1.14 % Negative unit clauses : 1
% 2.86/1.14 % Non-unit-clauses : 2
% 2.86/1.14 % Current number of unprocessed clauses: 9674
% 2.86/1.14 % ...number of literals in the above : 9674
% 2.86/1.14 % Current number of archived formulas : 0
% 2.86/1.14 % Current number of archived clauses : 87
% 2.86/1.14 % Clause-clause subsumption calls (NU) : 0
% 2.86/1.14 % Rec. Clause-clause subsumption calls : 0
% 2.86/1.14 % Non-unit clause-clause subsumptions : 0
% 2.86/1.14 % Unit Clause-clause subsumption calls : 12
% 2.86/1.14 % Rewrite failures with RHS unbound : 0
% 2.86/1.14 % BW rewrite match attempts : 858
% 2.86/1.14 % BW rewrite match successes : 116
% 2.86/1.14 % Condensation attempts : 0
% 2.86/1.14 % Condensation successes : 0
% 2.86/1.14 % Termbank termtop insertions : 268984
% 2.86/1.14 % Search garbage collected termcells : 32
% 2.86/1.14
% 2.86/1.14 % -------------------------------------------------
% 2.86/1.14 % User time : 0.420 s
% 2.86/1.14 % System time : 0.021 s
% 2.86/1.14 % Total time : 0.441 s
% 2.86/1.14 % Maximum resident set size: 3660 pages
% 2.86/1.14
% 2.86/1.14 % -------------------------------------------------
% 2.86/1.14 % User time : 1.946 s
% 2.86/1.14 % System time : 0.113 s
% 2.86/1.14 % Total time : 2.059 s
% 2.86/1.14 % Maximum resident set size: 4608 pages
% 2.86/1.14 % E exiting
%------------------------------------------------------------------------------