TSTP Solution File: REL043-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : REL043-2 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:31:52 EDT 2024
% Result : Unsatisfiable 2.43s 0.76s
% Output : CNFRefutation 2.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 16
% Syntax : Number of clauses : 98 ( 98 unt; 0 nHn; 27 RR)
% Number of literals : 98 ( 97 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 123 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(converse_multiplicativity_10,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_multiplicativity_10) ).
cnf(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_identity_6) ).
cnf(converse_cancellativity_11,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).
cnf(maddux1_join_commutativity_1,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux1_join_commutativity_1) ).
cnf(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',def_zero_13) ).
cnf(maddux4_definiton_of_meet_4,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux4_definiton_of_meet_4) ).
cnf(def_top_12,axiom,
top = join(X1,complement(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',def_top_12) ).
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/sandbox/benchmark/Axioms/REL001-0.ax',maddux3_a_kind_of_de_Morgan_3) ).
cnf(maddux2_join_associativity_2,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',maddux2_join_associativity_2) ).
cnf(goals_17,negated_conjecture,
join(composition(sk1,converse(sk2)),sk3) = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_17) ).
cnf(converse_additivity_9,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',converse_additivity_9) ).
cnf(composition_distributivity_7,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/REL001-1.ax',dedekind_law_14) ).
cnf(composition_associativity_5,axiom,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/REL001-0.ax',composition_associativity_5) ).
cnf(goals_18,negated_conjecture,
join(composition(complement(sk3),sk2),complement(sk1)) != complement(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_18) ).
cnf(c_0_16,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_17,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_18,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_20,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]) ).
cnf(c_0_21,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_22,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_23,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_25,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_26,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_28,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_30,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23]),c_0_27]) ).
cnf(c_0_31,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_33,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_34,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_32,c_0_22]) ).
cnf(c_0_36,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,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_35,c_0_30]),c_0_29]),c_0_31]),c_0_22]) ).
cnf(c_0_38,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_39]) ).
cnf(c_0_41,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_40]) ).
cnf(c_0_42,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_41,c_0_29]) ).
cnf(c_0_43,negated_conjecture,
join(composition(sk1,converse(sk2)),sk3) = sk3,
goals_17 ).
cnf(c_0_44,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_22,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
join(sk3,composition(sk1,converse(sk2))) = sk3,
inference(rw,[status(thm)],[c_0_43,c_0_22]) ).
cnf(c_0_46,plain,
join(X1,join(complement(X1),X2)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_44]) ).
cnf(c_0_47,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_41,c_0_22]) ).
cnf(c_0_48,negated_conjecture,
join(sk3,join(composition(sk1,converse(sk2)),X1)) = join(sk3,X1),
inference(spm,[status(thm)],[c_0_33,c_0_45]) ).
cnf(c_0_49,plain,
join(complement(X1),join(X1,X2)) = top,
inference(spm,[status(thm)],[c_0_46,c_0_39]) ).
cnf(c_0_50,negated_conjecture,
join(composition(sk1,converse(sk2)),join(sk3,X1)) = join(sk3,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_33]),c_0_47]) ).
cnf(c_0_51,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_52,negated_conjecture,
join(complement(composition(sk1,converse(sk2))),join(sk3,X1)) = top,
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_51,c_0_17]) ).
cnf(c_0_54,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_22,c_0_33]) ).
cnf(c_0_55,negated_conjecture,
complement(join(complement(composition(sk1,converse(sk2))),complement(join(sk3,X1)))) = composition(sk1,converse(sk2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_52]),c_0_31]),c_0_38]) ).
cnf(c_0_56,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_38]) ).
cnf(c_0_57,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_53,c_0_29]) ).
cnf(c_0_58,plain,
join(X1,join(X2,complement(X1))) = top,
inference(rw,[status(thm)],[c_0_49,c_0_54]) ).
cnf(c_0_59,plain,
join(converse(X1),join(converse(X2),X3)) = join(converse(join(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_33,c_0_51]) ).
cnf(c_0_60,negated_conjecture,
complement(join(complement(sk3),complement(composition(sk1,converse(sk2))))) = composition(sk1,converse(sk2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_22]) ).
cnf(c_0_61,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_57,c_0_44]) ).
cnf(c_0_62,plain,
join(complement(converse(X1)),converse(join(X1,X2))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_22]) ).
cnf(c_0_63,negated_conjecture,
join(complement(sk3),complement(composition(sk1,converse(sk2)))) = complement(composition(sk1,converse(sk2))),
inference(spm,[status(thm)],[c_0_39,c_0_60]) ).
cnf(c_0_64,plain,
join(complement(converse(X1)),composition(X2,complement(converse(composition(X1,X2))))) = complement(converse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_16]),c_0_17]) ).
cnf(c_0_65,plain,
converse(composition(top,X1)) = composition(converse(X1),top),
inference(spm,[status(thm)],[c_0_18,c_0_61]) ).
cnf(c_0_66,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_35]),c_0_22]) ).
cnf(c_0_67,plain,
converse(join(X1,converse(X2))) = join(converse(X1),X2),
inference(spm,[status(thm)],[c_0_51,c_0_17]) ).
cnf(c_0_68,negated_conjecture,
join(complement(converse(complement(sk3))),converse(complement(composition(sk1,converse(sk2))))) = top,
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_69,plain,
composition(X1,complement(composition(converse(X1),top))) = 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_64,c_0_65]),c_0_61]),c_0_31]),c_0_38]),c_0_61]),c_0_31]) ).
cnf(c_0_70,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_66,c_0_47]) ).
cnf(c_0_71,negated_conjecture,
join(complement(composition(sk1,converse(sk2))),converse(complement(converse(complement(sk3))))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_61]),c_0_22]) ).
cnf(c_0_72,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_73,plain,
composition(top,complement(composition(top,top))) = zero,
inference(spm,[status(thm)],[c_0_69,c_0_61]) ).
cnf(c_0_74,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_75,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_70,c_0_39]) ).
cnf(c_0_76,negated_conjecture,
complement(join(complement(composition(sk1,converse(sk2))),complement(converse(complement(converse(complement(sk3))))))) = composition(sk1,converse(sk2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_71]),c_0_31]),c_0_38]) ).
cnf(c_0_77,axiom,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
composition_associativity_5 ).
cnf(c_0_78,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_72,c_0_73]),c_0_38]),c_0_44]),c_0_73]) ).
cnf(c_0_79,plain,
join(converse(zero),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_38]),c_0_17]) ).
cnf(c_0_80,plain,
join(complement(join(complement(composition(X1,X2)),complement(X3))),composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3)))))) = composition(complement(join(complement(X1),complement(composition(X3,converse(X2))))),complement(join(complement(X2),complement(composition(converse(X1),X3))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]) ).
cnf(c_0_81,negated_conjecture,
join(composition(sk1,converse(sk2)),converse(complement(converse(complement(sk3))))) = converse(complement(converse(complement(sk3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_39]),c_0_39]),c_0_22]) ).
cnf(c_0_82,plain,
converse(composition(X1,converse(X2))) = composition(X2,converse(X1)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_83,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_78]) ).
cnf(c_0_84,plain,
converse(zero) = zero,
inference(spm,[status(thm)],[c_0_56,c_0_79]) ).
cnf(c_0_85,plain,
join(complement(composition(complement(join(complement(X1),complement(composition(X2,converse(X3))))),complement(join(complement(X3),complement(composition(converse(X1),X2)))))),complement(join(complement(join(complement(composition(X1,X3)),complement(X2))),complement(composition(complement(join(complement(X1),complement(composition(X2,converse(X3))))),complement(join(complement(X3),complement(composition(converse(X1),X2))))))))) = join(complement(composition(X1,X3)),complement(X2)),
inference(spm,[status(thm)],[c_0_35,c_0_80]) ).
cnf(c_0_86,negated_conjecture,
join(complement(converse(complement(sk3))),complement(composition(sk2,converse(sk1)))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_81]),c_0_82]),c_0_17]),c_0_22]) ).
cnf(c_0_87,plain,
composition(zero,X1) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_83]),c_0_84]),c_0_84]) ).
cnf(c_0_88,plain,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_29,c_0_38]) ).
cnf(c_0_89,negated_conjecture,
join(sk3,complement(composition(sk1,converse(sk2)))) = join(sk3,top),
inference(spm,[status(thm)],[c_0_48,c_0_29]) ).
cnf(c_0_90,negated_conjecture,
join(complement(sk2),complement(composition(converse(complement(sk3)),sk1))) = top,
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_85,c_0_86]),c_0_31]),c_0_17]),c_0_87]),c_0_88]),c_0_31]),c_0_17]),c_0_87]),c_0_88]),c_0_42]),c_0_31]),c_0_56]),c_0_22]) ).
cnf(c_0_91,negated_conjecture,
join(sk3,complement(composition(sk1,converse(sk2)))) = top,
inference(rw,[status(thm)],[c_0_89,c_0_42]) ).
cnf(c_0_92,negated_conjecture,
join(composition(complement(sk3),sk2),complement(sk1)) != complement(sk1),
inference(fof_simplification,[status(thm)],[goals_18]) ).
cnf(c_0_93,negated_conjecture,
join(complement(sk1),complement(composition(complement(sk3),sk2))) = top,
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_90]),c_0_39]),c_0_91]),c_0_31]),c_0_31]),c_0_83]),c_0_88]),c_0_39]),c_0_91]),c_0_31]),c_0_31]),c_0_83]),c_0_88]),c_0_42]),c_0_31]),c_0_56]),c_0_22]) ).
cnf(c_0_94,negated_conjecture,
join(composition(complement(sk3),sk2),complement(sk1)) != complement(sk1),
c_0_92 ).
cnf(c_0_95,negated_conjecture,
complement(join(complement(sk1),composition(complement(sk3),sk2))) = sk1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_93]),c_0_31]),c_0_39]),c_0_38]) ).
cnf(c_0_96,negated_conjecture,
join(complement(sk1),composition(complement(sk3),sk2)) != complement(sk1),
inference(rw,[status(thm)],[c_0_94,c_0_22]) ).
cnf(c_0_97,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_95]),c_0_96]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : REL043-2 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 08:01:53 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 2.43/0.76 # Version: 3.1.0
% 2.43/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.43/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.43/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.43/0.76 # Starting new_bool_3 with 300s (1) cores
% 2.43/0.76 # Starting new_bool_1 with 300s (1) cores
% 2.43/0.76 # Starting sh5l with 300s (1) cores
% 2.43/0.76 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3563 completed with status 0
% 2.43/0.76 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.43/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.43/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.43/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.43/0.76 # No SInE strategy applied
% 2.43/0.76 # Search class: FUUPM-FFMF21-DFFFFFNN
% 2.43/0.76 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.43/0.76 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 811s (1) cores
% 2.43/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.43/0.76 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 2.43/0.76 # Starting new_bool_3 with 136s (1) cores
% 2.43/0.76 # Starting new_bool_1 with 136s (1) cores
% 2.43/0.76 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3573 completed with status 0
% 2.43/0.76 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.43/0.76 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.43/0.76 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.43/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.43/0.76 # No SInE strategy applied
% 2.43/0.76 # Search class: FUUPM-FFMF21-DFFFFFNN
% 2.43/0.76 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.43/0.76 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 811s (1) cores
% 2.43/0.76 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.43/0.76 # Preprocessing time : 0.001 s
% 2.43/0.76 # Presaturation interreduction done
% 2.43/0.76
% 2.43/0.76 # Proof found!
% 2.43/0.76 # SZS status Unsatisfiable
% 2.43/0.76 # SZS output start CNFRefutation
% See solution above
% 2.43/0.76 # Parsed axioms : 18
% 2.43/0.76 # Removed by relevancy pruning/SinE : 0
% 2.43/0.76 # Initial clauses : 18
% 2.43/0.76 # Removed in clause preprocessing : 1
% 2.43/0.76 # Initial clauses in saturation : 17
% 2.43/0.76 # Processed clauses : 1201
% 2.43/0.76 # ...of these trivial : 699
% 2.43/0.76 # ...subsumed : 68
% 2.43/0.76 # ...remaining for further processing : 434
% 2.43/0.76 # Other redundant clauses eliminated : 0
% 2.43/0.76 # Clauses deleted for lack of memory : 0
% 2.43/0.76 # Backward-subsumed : 0
% 2.43/0.76 # Backward-rewritten : 67
% 2.43/0.76 # Generated clauses : 24669
% 2.43/0.76 # ...of the previous two non-redundant : 14383
% 2.43/0.76 # ...aggressively subsumed : 0
% 2.43/0.76 # Contextual simplify-reflections : 0
% 2.43/0.76 # Paramodulations : 24669
% 2.43/0.76 # Factorizations : 0
% 2.43/0.76 # NegExts : 0
% 2.43/0.76 # Equation resolutions : 0
% 2.43/0.76 # Disequality decompositions : 0
% 2.43/0.76 # Total rewrite steps : 59724
% 2.43/0.76 # ...of those cached : 52507
% 2.43/0.76 # Propositional unsat checks : 0
% 2.43/0.76 # Propositional check models : 0
% 2.43/0.76 # Propositional check unsatisfiable : 0
% 2.43/0.76 # Propositional clauses : 0
% 2.43/0.76 # Propositional clauses after purity: 0
% 2.43/0.76 # Propositional unsat core size : 0
% 2.43/0.76 # Propositional preprocessing time : 0.000
% 2.43/0.76 # Propositional encoding time : 0.000
% 2.43/0.76 # Propositional solver time : 0.000
% 2.43/0.76 # Success case prop preproc time : 0.000
% 2.43/0.76 # Success case prop encoding time : 0.000
% 2.43/0.76 # Success case prop solver time : 0.000
% 2.43/0.76 # Current number of processed clauses : 350
% 2.43/0.76 # Positive orientable unit clauses : 343
% 2.43/0.76 # Positive unorientable unit clauses: 6
% 2.43/0.76 # Negative unit clauses : 1
% 2.43/0.76 # Non-unit-clauses : 0
% 2.43/0.76 # Current number of unprocessed clauses: 13048
% 2.43/0.76 # ...number of literals in the above : 13048
% 2.43/0.76 # Current number of archived formulas : 0
% 2.43/0.76 # Current number of archived clauses : 85
% 2.43/0.76 # Clause-clause subsumption calls (NU) : 0
% 2.43/0.76 # Rec. Clause-clause subsumption calls : 0
% 2.43/0.76 # Non-unit clause-clause subsumptions : 0
% 2.43/0.76 # Unit Clause-clause subsumption calls : 48
% 2.43/0.76 # Rewrite failures with RHS unbound : 0
% 2.43/0.76 # BW rewrite match attempts : 2062
% 2.43/0.76 # BW rewrite match successes : 207
% 2.43/0.76 # Condensation attempts : 0
% 2.43/0.76 # Condensation successes : 0
% 2.43/0.76 # Termbank termtop insertions : 626767
% 2.43/0.76 # Search garbage collected termcells : 2
% 2.43/0.76
% 2.43/0.76 # -------------------------------------------------
% 2.43/0.76 # User time : 0.263 s
% 2.43/0.76 # System time : 0.012 s
% 2.43/0.76 # Total time : 0.275 s
% 2.43/0.76 # Maximum resident set size: 1660 pages
% 2.43/0.76
% 2.43/0.76 # -------------------------------------------------
% 2.43/0.76 # User time : 1.337 s
% 2.43/0.76 # System time : 0.048 s
% 2.43/0.76 # Total time : 1.385 s
% 2.43/0.76 # Maximum resident set size: 1708 pages
% 2.43/0.76 % E---3.1 exiting
% 2.43/0.77 % E exiting
%------------------------------------------------------------------------------