%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL041+2 : 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 : 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 02:04:07 PM UTC 2026
% Result : Theorem 14.49s 2.67s
% Output : CNFRefutation 14.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 15
% Syntax : Number of formulae : 97 ( 94 unt; 0 def)
% Number of atoms : 100 ( 99 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 0 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 156 ( 9 sgn 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_identity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_zero) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',def_top) ).
fof(maddux3_a_kind_of_de_Morgan,axiom,
! [X1,X2] : X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux3_a_kind_of_de_Morgan) ).
fof(maddux2_join_associativity,axiom,
! [X1,X2,X3] : join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',converse_additivity) ).
fof(goals,conjecture,
! [X1] :
( join(composition(converse(X1),X1),one) = one
=> ! [X2] : meet(composition(X1,X2),composition(X1,complement(X2))) = zero ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(modular_law_1,axiom,
! [X1,X2,X3] : join(meet(composition(X1,X2),X3),meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3)) = meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+1.ax',modular_law_1) ).
fof(composition_associativity,axiom,
! [X1,X2,X3] : composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001+0.ax',composition_associativity) ).
fof(c_0_15,plain,
! [X23,X24] : converse(composition(X23,X24)) = composition(converse(X24),converse(X23)),
inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).
fof(c_0_16,plain,
! [X16] : composition(X16,one) = X16,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_17,plain,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
composition(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X20] : converse(converse(X20)) = X20,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
cnf(c_0_20,plain,
composition(converse(one),converse(X1)) = converse(X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_22,plain,
! [X25,X26] : join(composition(converse(X25),complement(composition(X25,X26))),complement(X26)) = complement(X26),
inference(variable_rename,[status(thm)],[converse_cancellativity]) ).
fof(c_0_23,plain,
! [X4,X5] : join(X4,X5) = join(X5,X4),
inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).
cnf(c_0_24,plain,
composition(converse(one),X1) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_25,plain,
! [X28] : zero = meet(X28,complement(X28)),
inference(variable_rename,[status(thm)],[def_zero]) ).
fof(c_0_26,plain,
! [X11,X12] : meet(X11,X12) = complement(join(complement(X11),complement(X12))),
inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).
cnf(c_0_27,plain,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
join(X1,X2) = join(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_30,plain,
zero = meet(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_32,plain,
! [X27] : top = join(X27,complement(X27)),
inference(variable_rename,[status(thm)],[def_top]) ).
cnf(c_0_33,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_24,c_0_29]) ).
cnf(c_0_35,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
top = join(X1,complement(X1)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_37,plain,
! [X9,X10] : X9 = join(complement(join(complement(X9),complement(X10))),complement(join(complement(X9),X10))),
inference(variable_rename,[status(thm)],[maddux3_a_kind_of_de_Morgan]) ).
fof(c_0_38,plain,
! [X6,X7,X8] : join(X6,join(X7,X8)) = join(join(X6,X7),X8),
inference(variable_rename,[status(thm)],[maddux2_join_associativity]) ).
cnf(c_0_39,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29]),c_0_34]) ).
cnf(c_0_40,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,plain,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_41,c_0_28]) ).
cnf(c_0_45,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,plain,
join(zero,complement(complement(X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_39]),c_0_36]),c_0_40]),c_0_28]) ).
cnf(c_0_47,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_39,c_0_48]) ).
cnf(c_0_50,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_42,c_0_49]) ).
cnf(c_0_51,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_44]),c_0_28]) ).
cnf(c_0_52,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_50,c_0_28]) ).
cnf(c_0_53,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_28]),c_0_42]) ).
cnf(c_0_55,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_53,c_0_48]) ).
fof(c_0_56,plain,
! [X17,X18,X19] : composition(join(X17,X18),X19) = join(composition(X17,X19),composition(X18,X19)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
fof(c_0_57,plain,
! [X21,X22] : converse(join(X21,X22)) = join(converse(X21),converse(X22)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_58,plain,
join(complement(X1),complement(join(complement(X1),complement(X2)))) = join(complement(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_44]),c_0_48]),c_0_54]),c_0_28]),c_0_55]) ).
fof(c_0_59,negated_conjecture,
~ ! [X1] :
( join(composition(converse(X1),X1),one) = one
=> ! [X2] : meet(composition(X1,X2),composition(X1,complement(X2))) = zero ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_60,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_56]) ).
cnf(c_0_61,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_50,c_0_36]) ).
cnf(c_0_62,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_57]) ).
fof(c_0_63,plain,
! [X32,X33,X34] : join(meet(composition(X32,X33),X34),meet(composition(X32,meet(X33,composition(converse(X32),X34))),X34)) = meet(composition(X32,meet(X33,composition(converse(X32),X34))),X34),
inference(variable_rename,[status(thm)],[modular_law_1]) ).
cnf(c_0_64,plain,
join(X1,complement(join(X1,complement(X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_58,c_0_48]) ).
fof(c_0_65,negated_conjecture,
( meet(composition(esk1_0,esk2_0),composition(esk1_0,complement(esk2_0))) != zero
& join(composition(converse(esk1_0),esk1_0),one) = one ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_59])])])]) ).
cnf(c_0_66,plain,
join(composition(X1,X2),composition(top,X2)) = composition(top,X2),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_67,plain,
join(converse(X1),converse(top)) = converse(top),
inference(spm,[status(thm)],[c_0_62,c_0_61]) ).
cnf(c_0_68,plain,
join(meet(composition(X1,X2),X3),meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3)) = meet(composition(X1,meet(X2,composition(converse(X1),X3))),X3),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_69,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_64]),c_0_50]) ).
cnf(c_0_70,negated_conjecture,
join(composition(converse(esk1_0),esk1_0),one) = one,
inference(split_conjunct,[status(thm)],[c_0_65]) ).
fof(c_0_71,plain,
! [X13,X14,X15] : composition(X13,composition(X14,X15)) = composition(composition(X13,X14),X15),
inference(variable_rename,[status(thm)],[composition_associativity]) ).
cnf(c_0_72,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_28,c_0_61]) ).
cnf(c_0_73,plain,
join(X1,composition(top,X1)) = composition(top,X1),
inference(spm,[status(thm)],[c_0_66,c_0_34]) ).
cnf(c_0_74,plain,
join(X1,converse(top)) = converse(top),
inference(spm,[status(thm)],[c_0_67,c_0_21]) ).
cnf(c_0_75,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3)))) = complement(join(complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))),complement(X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_31]),c_0_31]),c_0_31]),c_0_31]),c_0_31]) ).
cnf(c_0_76,plain,
join(X1,complement(join(X2,X1))) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_69,c_0_28]) ).
cnf(c_0_77,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_42]) ).
cnf(c_0_78,negated_conjecture,
join(one,composition(converse(esk1_0),esk1_0)) = one,
inference(rw,[status(thm)],[c_0_70,c_0_28]) ).
cnf(c_0_79,plain,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_71]) ).
cnf(c_0_80,plain,
composition(top,top) = top,
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_81,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_72,c_0_74]) ).
cnf(c_0_82,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3))))))))) = complement(join(complement(X3),complement(composition(X1,complement(join(complement(X2),complement(composition(converse(X1),X3)))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_28]),c_0_28]) ).
cnf(c_0_83,plain,
join(X1,join(complement(join(X2,X1)),X3)) = join(X1,join(complement(X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_76]),c_0_42]) ).
cnf(c_0_84,plain,
join(X1,complement(join(X2,join(X3,X1)))) = join(X1,complement(join(X2,X3))),
inference(spm,[status(thm)],[c_0_69,c_0_77]) ).
cnf(c_0_85,plain,
join(X1,join(complement(join(X1,X2)),X3)) = join(X1,join(complement(X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_69]),c_0_42]) ).
cnf(c_0_86,negated_conjecture,
join(X1,composition(converse(esk1_0),composition(esk1_0,X1))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_78]),c_0_79]),c_0_34]),c_0_34]) ).
cnf(c_0_87,plain,
composition(top,zero) = 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_33,c_0_80]),c_0_40]),c_0_81]),c_0_40]),c_0_47]),c_0_40]) ).
cnf(c_0_88,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_47]) ).
cnf(c_0_89,negated_conjecture,
meet(composition(esk1_0,esk2_0),composition(esk1_0,complement(esk2_0))) != zero,
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_90,plain,
join(complement(X1),join(complement(composition(X2,X3)),complement(composition(X2,complement(join(complement(X3),complement(composition(converse(X2),X1)))))))) = join(complement(composition(X2,X3)),complement(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(spm,[status(thm)],[c_0_44,c_0_82]),c_0_48]),c_0_48]),c_0_54]),c_0_83]),c_0_48]),c_0_42]),c_0_84]),c_0_28]),c_0_85]) ).
cnf(c_0_91,negated_conjecture,
join(X1,complement(composition(converse(esk1_0),composition(esk1_0,X1)))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_86]),c_0_36]) ).
cnf(c_0_92,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_87]),c_0_88]) ).
cnf(c_0_93,plain,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_36,c_0_47]) ).
cnf(c_0_94,negated_conjecture,
complement(join(complement(composition(esk1_0,esk2_0)),complement(composition(esk1_0,complement(esk2_0))))) != zero,
inference(rw,[status(thm)],[c_0_89,c_0_31]) ).
cnf(c_0_95,negated_conjecture,
join(complement(composition(esk1_0,X1)),complement(composition(esk1_0,complement(X1)))) = top,
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_90,c_0_91]),c_0_40]),c_0_92]),c_0_93]),c_0_61]),c_0_61]) ).
cnf(c_0_96,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_95]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : REL041+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n016.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 04:12:22 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 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
% 14.49/2.67 % Version: 3.5.1
% 14.49/2.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 14.49/2.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.49/2.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.49/2.67 % Starting new_bool_3 with 300s (1) cores
% 14.49/2.67 % Starting new_bool_1 with 300s (1) cores
% 14.49/2.67 % Starting sh5l with 300s (1) cores
% 14.49/2.67 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1522977 completed with status 0
% 14.49/2.67 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 14.49/2.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 14.49/2.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.49/2.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.49/2.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 14.49/2.67 % No SInE strategy applied
% 14.49/2.67 % Search class: FUUPM-FFMF21-DFFFFFNN
% 14.49/2.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 14.49/2.67 % Starting SubtermCWHack with 136s (1) cores
% 14.49/2.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 14.49/2.67 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 14.49/2.67 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 14.49/2.67 % Starting new_bool_3 with 136s (1) cores
% 14.49/2.67 % H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with pid 1522983 completed with status 0
% 14.49/2.67 % Result found by H----_047_B31_F1_PI_AE_R4_CS_SP_S2S
% 14.49/2.67 % Preprocessing class: FSMSSMSSSSSNFFN.
% 14.49/2.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 14.49/2.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 14.49/2.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 14.49/2.67 % No SInE strategy applied
% 14.49/2.67 % Search class: FUUPM-FFMF21-DFFFFFNN
% 14.49/2.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 14.49/2.67 % Starting SubtermCWHack with 136s (1) cores
% 14.49/2.67 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 14.49/2.67 % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 14.49/2.67 % Preprocessing time : 0.002 s
% 14.49/2.67
% 14.49/2.67 % Proof found!
% 14.49/2.67 % SZS status Theorem
% 14.49/2.67 % SZS output start CNFRefutation
% See solution above
% 14.49/2.67 % Parsed axioms : 17
% 14.49/2.67 % Removed by relevancy pruning/SinE : 0
% 14.49/2.67 % Initial clauses : 18
% 14.49/2.67 % Removed in clause preprocessing : 1
% 14.49/2.67 % Initial clauses in saturation : 17
% 14.49/2.67 % Processed clauses : 3331
% 14.49/2.67 % ...of these trivial : 2199
% 14.49/2.67 % ...subsumed : 588
% 14.49/2.67 % ...remaining for further processing : 544
% 14.49/2.67 % Other redundant clauses eliminated : 0
% 14.49/2.67 % Clauses deleted for lack of memory : 0
% 14.49/2.67 % Backward-subsumed : 0
% 14.49/2.67 % Backward-rewritten : 102
% 14.49/2.67 % Generated clauses : 79967
% 14.49/2.67 % ...of the previous two non-redundant : 40689
% 14.49/2.67 % ...aggressively subsumed : 0
% 14.49/2.67 % Contextual simplify-reflections : 0
% 14.49/2.67 % Paramodulations : 79967
% 14.49/2.67 % Factorizations : 0
% 14.49/2.67 % NegExts : 0
% 14.49/2.67 % Equation resolutions : 0
% 14.49/2.67 % Disequality decompositions : 0
% 14.49/2.67 % Total rewrite steps : 293308
% 14.49/2.67 % ...of those cached : 264302
% 14.49/2.67 % Propositional unsat checks : 0
% 14.49/2.67 % Propositional check models : 0
% 14.49/2.67 % Propositional check unsatisfiable : 0
% 14.49/2.67 % Propositional clauses : 0
% 14.49/2.67 % Propositional clauses after purity: 0
% 14.49/2.67 % Propositional unsat core size : 0
% 14.49/2.67 % Propositional preprocessing time : 0.000
% 14.49/2.67 % Propositional encoding time : 0.000
% 14.49/2.67 % Propositional solver time : 0.000
% 14.49/2.67 % Success case prop preproc time : 0.000
% 14.49/2.67 % Success case prop encoding time : 0.000
% 14.49/2.67 % Success case prop solver time : 0.000
% 14.49/2.67 % Current number of processed clauses : 442
% 14.49/2.67 % Positive orientable unit clauses : 438
% 14.49/2.67 % Positive unorientable unit clauses: 4
% 14.49/2.67 % Negative unit clauses : 0
% 14.49/2.67 % Non-unit-clauses : 0
% 14.49/2.67 % Current number of unprocessed clauses: 36731
% 14.49/2.67 % ...number of literals in the above : 36731
% 14.49/2.67 % Current number of archived formulas : 0
% 14.49/2.67 % Current number of archived clauses : 103
% 14.49/2.67 % Clause-clause subsumption calls (NU) : 0
% 14.49/2.67 % Rec. Clause-clause subsumption calls : 0
% 14.49/2.67 % Non-unit clause-clause subsumptions : 0
% 14.49/2.67 % Unit Clause-clause subsumption calls : 35
% 14.49/2.67 % Rewrite failures with RHS unbound : 305
% 14.49/2.67 % BW rewrite match attempts : 3171
% 14.49/2.67 % BW rewrite match successes : 474
% 14.49/2.67 % Condensation attempts : 0
% 14.49/2.67 % Condensation successes : 0
% 14.49/2.67 % Termbank termtop insertions : 1871561
% 14.49/2.67 % Search garbage collected termcells : 31
% 14.49/2.67
% 14.49/2.67 % -------------------------------------------------
% 14.49/2.67 % User time : 1.966 s
% 14.49/2.67 % System time : 0.084 s
% 14.49/2.67 % Total time : 2.050 s
% 14.49/2.67 % Maximum resident set size: 3652 pages
% 14.49/2.67
% 14.49/2.67 % -------------------------------------------------
% 14.49/2.67 % User time : 9.737 s
% 14.49/2.67 % System time : 0.416 s
% 14.49/2.67 % Total time : 10.153 s
% 14.49/2.67 % Maximum resident set size: 4608 pages
% 14.49/2.67 % E exiting
%------------------------------------------------------------------------------