%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : REL010-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 : 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 02:03:52 PM UTC 2026
% Result : Unsatisfiable 1.66s 0.70s
% Output : CNFRefutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 15
% Syntax : Number of clauses : 100 ( 100 unt; 0 nHn; 22 RR)
% Number of literals : 100 ( 99 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 128 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_top_12) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(maddux2_join_associativity_2,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).
cnf(maddux3_a_kind_of_de_Morgan_3,axiom,
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_3) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
cnf(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_distributivity_7) ).
cnf(dedekind_law_14,axiom,
join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3)))) = composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-1.ax',dedekind_law_14) ).
cnf(goals_17,negated_conjecture,
meet(composition(sk1,sk2),sk3) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_17) ).
cnf(composition_associativity_5,axiom,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',composition_associativity_5) ).
cnf(goals_18,negated_conjecture,
meet(sk2,composition(converse(sk1),sk3)) != zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_18) ).
cnf(c_0_15,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_16,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_17,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_18,plain,
complement(top) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_20,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_21,plain,
join(zero,top) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_18]),c_0_19]) ).
cnf(c_0_22,plain,
join(zero,join(top,X1)) = join(top,X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_24,plain,
meet(top,zero) = zero,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_19]),c_0_15]) ).
cnf(c_0_26,plain,
join(zero,join(X1,top)) = join(X1,top),
inference(spm,[status(thm)],[c_0_22,c_0_19]) ).
cnf(c_0_27,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_28,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_29,plain,
join(meet(X1,X2),complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_30,plain,
meet(zero,top) = zero,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
join(top,complement(zero)) = join(top,top),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19]) ).
cnf(c_0_32,plain,
join(X1,join(zero,complement(X1))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_16]),c_0_18]),c_0_19]) ).
cnf(c_0_33,plain,
join(zero,complement(join(top,top))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_19]),c_0_31]) ).
cnf(c_0_34,plain,
join(top,top) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_20]),c_0_19]),c_0_21]) ).
cnf(c_0_35,plain,
join(zero,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_18]) ).
cnf(c_0_36,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_20,c_0_35]) ).
cnf(c_0_37,plain,
join(zero,meet(X1,complement(complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_16]),c_0_18]),c_0_19]) ).
cnf(c_0_38,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_39,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_40,plain,
complement(join(zero,complement(X1))) = meet(top,X1),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_41,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
meet(meet(top,X1),join(zero,complement(X1))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_40]),c_0_25]) ).
cnf(c_0_44,plain,
complement(complement(X1)) = meet(top,X1),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
join(top,join(top,X1)) = join(top,X1),
inference(spm,[status(thm)],[c_0_20,c_0_34]) ).
cnf(c_0_46,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_42,c_0_16]) ).
cnf(c_0_47,plain,
join(zero,meet(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_17]),c_0_15]) ).
cnf(c_0_48,plain,
meet(meet(top,X1),complement(X1)) = zero,
inference(rw,[status(thm)],[c_0_43,c_0_41]) ).
cnf(c_0_49,plain,
meet(X1,meet(top,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_41]),c_0_44]) ).
cnf(c_0_50,plain,
converse(join(X1,converse(X2))) = join(converse(X1),X2),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_51,plain,
join(top,converse(top)) = converse(top),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,plain,
join(complement(X1),join(complement(X2),meet(X1,X2))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_20]) ).
cnf(c_0_53,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[c_0_47,c_0_41]) ).
cnf(c_0_54,plain,
meet(top,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_48]),c_0_15]),c_0_41]),c_0_25]),c_0_49]) ).
cnf(c_0_55,plain,
complement(join(complement(X1),meet(X2,X3))) = meet(X1,join(complement(X2),complement(X3))),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_56,plain,
converse(top) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_39]),c_0_19]),c_0_51]) ).
cnf(c_0_57,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_19]),c_0_16]),c_0_19]) ).
cnf(c_0_58,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_44,c_0_54]) ).
cnf(c_0_59,plain,
complement(join(meet(X1,X2),complement(X3))) = meet(join(complement(X1),complement(X2)),X3),
inference(spm,[status(thm)],[c_0_15,c_0_15]) ).
cnf(c_0_60,plain,
complement(join(complement(X1),X2)) = meet(X1,complement(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_54]),c_0_18]),c_0_41]) ).
cnf(c_0_61,plain,
join(X1,converse(complement(converse(X1)))) = top,
inference(rw,[status(thm)],[c_0_46,c_0_56]) ).
cnf(c_0_62,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,plain,
complement(join(X1,complement(X2))) = meet(complement(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_54]),c_0_18]),c_0_41]) ).
cnf(c_0_64,plain,
join(meet(X1,X2),meet(X1,complement(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_19]) ).
cnf(c_0_65,plain,
meet(X1,complement(converse(complement(converse(complement(X1)))))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_18]) ).
cnf(c_0_66,plain,
join(X1,join(complement(X1),X2)) = top,
inference(rw,[status(thm)],[c_0_27,c_0_62]) ).
cnf(c_0_67,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_41]) ).
cnf(c_0_68,plain,
complement(meet(complement(X1),X2)) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_58,c_0_63]) ).
cnf(c_0_69,plain,
meet(X1,converse(complement(converse(complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_58]),c_0_41]) ).
cnf(c_0_70,plain,
meet(X1,join(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_66]),c_0_44]),c_0_54]),c_0_18]),c_0_67]) ).
cnf(c_0_71,plain,
join(X1,complement(converse(complement(converse(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_44]),c_0_54]),c_0_44]),c_0_54]) ).
cnf(c_0_72,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_70,c_0_19]) ).
cnf(c_0_73,plain,
join(X1,converse(complement(converse(complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_71]),c_0_39]),c_0_39]) ).
cnf(c_0_74,plain,
converse(complement(converse(complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_25]),c_0_69]) ).
cnf(c_0_75,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_76,plain,
complement(converse(complement(X1))) = converse(X1),
inference(spm,[status(thm)],[c_0_39,c_0_74]) ).
cnf(c_0_77,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_75,c_0_19]) ).
cnf(c_0_78,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_79,plain,
complement(converse(X1)) = converse(complement(X1)),
inference(spm,[status(thm)],[c_0_58,c_0_76]) ).
cnf(c_0_80,plain,
join(converse(zero),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_41]),c_0_39]) ).
cnf(c_0_81,plain,
join(converse(complement(X1)),composition(X2,converse(complement(composition(X1,X2))))) = converse(complement(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_39]),c_0_79]),c_0_79]),c_0_79]) ).
cnf(c_0_82,plain,
converse(zero) = zero,
inference(spm,[status(thm)],[c_0_67,c_0_80]) ).
cnf(c_0_83,plain,
complement(join(zero,zero)) = meet(top,top),
inference(spm,[status(thm)],[c_0_40,c_0_18]) ).
cnf(c_0_84,plain,
composition(X1,converse(complement(composition(top,X1)))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_18]),c_0_82]),c_0_41]),c_0_82]) ).
cnf(c_0_85,plain,
complement(zero) = meet(top,top),
inference(rw,[status(thm)],[c_0_83,c_0_35]) ).
cnf(c_0_86,plain,
converse(composition(X1,top)) = composition(top,converse(X1)),
inference(spm,[status(thm)],[c_0_78,c_0_56]) ).
cnf(c_0_87,plain,
composition(converse(complement(composition(top,top))),top) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_84]),c_0_85]),c_0_53]),c_0_56]) ).
cnf(c_0_88,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_89,plain,
composition(top,complement(composition(top,top))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_82]),c_0_39]) ).
cnf(c_0_90,axiom,
join(meet(composition(X1,X2),X3),composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3)))) = composition(meet(X1,composition(X3,converse(X2))),meet(X2,composition(converse(X1),X3))),
dedekind_law_14 ).
cnf(c_0_91,negated_conjecture,
meet(composition(sk1,sk2),sk3) = zero,
goals_17 ).
cnf(c_0_92,axiom,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
composition_associativity_5 ).
cnf(c_0_93,plain,
composition(X1,complement(composition(top,top))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_41]),c_0_62]),c_0_89]) ).
cnf(c_0_94,negated_conjecture,
meet(sk2,composition(converse(sk1),sk3)) != zero,
inference(fof_simplification,[status(thm)],[goals_18]) ).
cnf(c_0_95,plain,
join(meet(composition(converse(X1),X2),X3),composition(meet(converse(X1),composition(X3,converse(X2))),meet(X2,composition(X1,X3)))) = composition(meet(converse(X1),composition(X3,converse(X2))),meet(X2,composition(X1,X3))),
inference(spm,[status(thm)],[c_0_90,c_0_39]) ).
cnf(c_0_96,negated_conjecture,
meet(sk3,composition(sk1,sk2)) = zero,
inference(rw,[status(thm)],[c_0_91,c_0_25]) ).
cnf(c_0_97,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_93]) ).
cnf(c_0_98,negated_conjecture,
meet(sk2,composition(converse(sk1),sk3)) != zero,
c_0_94 ).
cnf(c_0_99,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97]),c_0_67]),c_0_97]),c_0_25]),c_0_98]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : REL010-2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n011.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 03:58:40 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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
% 1.66/0.70 % Version: 3.5.1
% 1.66/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.66/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.66/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.66/0.70 % Starting new_bool_3 with 300s (1) cores
% 1.66/0.70 % Starting new_bool_1 with 300s (1) cores
% 1.66/0.70 % Starting sh5l with 300s (1) cores
% 1.66/0.70 % sh5l with pid 926605 completed with status 0
% 1.66/0.70 % Result found by sh5l
% 1.66/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.66/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.66/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.66/0.70 % Starting new_bool_3 with 300s (1) cores
% 1.66/0.70 % Starting new_bool_1 with 300s (1) cores
% 1.66/0.70 % Starting sh5l with 300s (1) cores
% 1.66/0.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.66/0.70 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.66/0.70 % Search class: FUUPM-FFMF21-DFFFFFNN
% 1.66/0.70 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.66/0.70 % Starting SubtermCWHack with 28s (1) cores
% 1.66/0.70 % SubtermCWHack with pid 926610 completed with status 0
% 1.66/0.70 % Result found by SubtermCWHack
% 1.66/0.70 % Preprocessing class: FSMSSMSSSSSNFFN.
% 1.66/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.66/0.70 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.66/0.70 % Starting new_bool_3 with 300s (1) cores
% 1.66/0.70 % Starting new_bool_1 with 300s (1) cores
% 1.66/0.70 % Starting sh5l with 300s (1) cores
% 1.66/0.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.66/0.70 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.66/0.70 % Search class: FUUPM-FFMF21-DFFFFFNN
% 1.66/0.70 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.66/0.70 % Starting SubtermCWHack with 28s (1) cores
% 1.66/0.70 % Preprocessing time : 0.002 s
% 1.66/0.70
% 1.66/0.70 % Proof found!
% 1.66/0.70 % SZS status Unsatisfiable
% 1.66/0.70 % SZS output start CNFRefutation
% See solution above
% 1.66/0.70 % Parsed axioms : 18
% 1.66/0.70 % Removed by relevancy pruning/SinE : 1
% 1.66/0.70 % Initial clauses : 17
% 1.66/0.70 % Removed in clause preprocessing : 0
% 1.66/0.70 % Initial clauses in saturation : 17
% 1.66/0.70 % Processed clauses : 859
% 1.66/0.70 % ...of these trivial : 498
% 1.66/0.70 % ...subsumed : 60
% 1.66/0.70 % ...remaining for further processing : 300
% 1.66/0.70 % Other redundant clauses eliminated : 0
% 1.66/0.70 % Clauses deleted for lack of memory : 0
% 1.66/0.70 % Backward-subsumed : 0
% 1.66/0.70 % Backward-rewritten : 107
% 1.66/0.70 % Generated clauses : 14688
% 1.66/0.70 % ...of the previous two non-redundant : 6702
% 1.66/0.70 % ...aggressively subsumed : 0
% 1.66/0.70 % Contextual simplify-reflections : 0
% 1.66/0.70 % Paramodulations : 14688
% 1.66/0.70 % Factorizations : 0
% 1.66/0.70 % NegExts : 0
% 1.66/0.70 % Equation resolutions : 0
% 1.66/0.70 % Disequality decompositions : 0
% 1.66/0.70 % Total rewrite steps : 26150
% 1.66/0.70 % ...of those cached : 21629
% 1.66/0.70 % Propositional unsat checks : 0
% 1.66/0.70 % Propositional check models : 0
% 1.66/0.70 % Propositional check unsatisfiable : 0
% 1.66/0.70 % Propositional clauses : 0
% 1.66/0.70 % Propositional clauses after purity: 0
% 1.66/0.70 % Propositional unsat core size : 0
% 1.66/0.70 % Propositional preprocessing time : 0.000
% 1.66/0.70 % Propositional encoding time : 0.000
% 1.66/0.70 % Propositional solver time : 0.000
% 1.66/0.70 % Success case prop preproc time : 0.000
% 1.66/0.70 % Success case prop encoding time : 0.000
% 1.66/0.70 % Success case prop solver time : 0.000
% 1.66/0.70 % Current number of processed clauses : 193
% 1.66/0.70 % Positive orientable unit clauses : 188
% 1.66/0.70 % Positive unorientable unit clauses: 4
% 1.66/0.70 % Negative unit clauses : 1
% 1.66/0.70 % Non-unit-clauses : 0
% 1.66/0.70 % Current number of unprocessed clauses: 5607
% 1.66/0.70 % ...number of literals in the above : 5607
% 1.66/0.70 % Current number of archived formulas : 0
% 1.66/0.70 % Current number of archived clauses : 107
% 1.66/0.70 % Clause-clause subsumption calls (NU) : 0
% 1.66/0.70 % Rec. Clause-clause subsumption calls : 0
% 1.66/0.70 % Non-unit clause-clause subsumptions : 0
% 1.66/0.70 % Unit Clause-clause subsumption calls : 4
% 1.66/0.70 % Rewrite failures with RHS unbound : 0
% 1.66/0.70 % BW rewrite match attempts : 422
% 1.66/0.70 % BW rewrite match successes : 120
% 1.66/0.70 % Condensation attempts : 0
% 1.66/0.70 % Condensation successes : 0
% 1.66/0.70 % Termbank termtop insertions : 145162
% 1.66/0.70 % Search garbage collected termcells : 5
% 1.66/0.70
% 1.66/0.70 % -------------------------------------------------
% 1.66/0.70 % User time : 0.200 s
% 1.66/0.70 % System time : 0.013 s
% 1.66/0.70 % Total time : 0.214 s
% 1.66/0.70 % Maximum resident set size: 3648 pages
% 1.66/0.70
% 1.66/0.70 % -------------------------------------------------
% 1.66/0.70 % User time : 0.204 s
% 1.66/0.70 % System time : 0.019 s
% 1.66/0.70 % Total time : 0.223 s
% 1.66/0.70 % Maximum resident set size: 4608 pages
% 1.66/0.70 % E exiting
%------------------------------------------------------------------------------