TSTP Solution File: REL025-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : REL025-1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:32:16 EDT 2024
% Result : Unsatisfiable 3.27s 0.87s
% Output : CNFRefutation 3.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 14
% Syntax : Number of clauses : 112 ( 112 unt; 0 nHn; 18 RR)
% Number of literals : 112 ( 111 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 162 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
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(converse_idempotence_8,axiom,
converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/REL001-0.ax',converse_idempotence_8) ).
cnf(composition_identity_6,axiom,
composition(X1,one) = X1,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/REL001-0.ax',converse_cancellativity_11) ).
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(def_zero_13,axiom,
zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/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/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(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(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(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(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(goals_14,negated_conjecture,
join(sk1,one) = one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_14) ).
cnf(goals_15,negated_conjecture,
converse(sk1) != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals_15) ).
cnf(c_0_14,axiom,
converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
converse_multiplicativity_10 ).
cnf(c_0_15,axiom,
converse(converse(X1)) = X1,
converse_idempotence_8 ).
cnf(c_0_16,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
composition(X1,one) = X1,
composition_identity_6 ).
cnf(c_0_18,plain,
composition(converse(one),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).
cnf(c_0_19,axiom,
join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
converse_cancellativity_11 ).
cnf(c_0_20,axiom,
join(X1,X2) = join(X2,X1),
maddux1_join_commutativity_1 ).
cnf(c_0_21,plain,
converse(one) = one,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
zero = meet(X1,complement(X1)),
def_zero_13 ).
cnf(c_0_23,axiom,
meet(X1,X2) = complement(join(complement(X1),complement(X2))),
maddux4_definiton_of_meet_4 ).
cnf(c_0_24,plain,
join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
composition(one,X1) = X1,
inference(rw,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_26,plain,
zero = complement(join(complement(X1),complement(complement(X1)))),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,axiom,
top = join(X1,complement(X1)),
def_top_12 ).
cnf(c_0_28,plain,
join(complement(X1),complement(X1)) = complement(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21]),c_0_25]) ).
cnf(c_0_29,plain,
complement(top) = zero,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,axiom,
X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
maddux3_a_kind_of_de_Morgan_3 ).
cnf(c_0_31,axiom,
join(X1,join(X2,X3)) = join(join(X1,X2),X3),
maddux2_join_associativity_2 ).
cnf(c_0_32,plain,
join(zero,zero) = zero,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
inference(rw,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_34,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,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_33,c_0_27]),c_0_28]),c_0_29]),c_0_20]) ).
cnf(c_0_36,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_38,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_37]) ).
cnf(c_0_39,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_38]) ).
cnf(c_0_40,plain,
join(X1,join(complement(X1),X2)) = join(top,X2),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_41,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_20]) ).
cnf(c_0_42,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_39,c_0_20]) ).
cnf(c_0_43,plain,
join(X1,join(X2,complement(X1))) = join(top,X2),
inference(spm,[status(thm)],[c_0_40,c_0_20]) ).
cnf(c_0_44,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,axiom,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
converse_additivity_9 ).
cnf(c_0_46,plain,
join(top,complement(complement(X1))) = join(X1,top),
inference(spm,[status(thm)],[c_0_40,c_0_27]) ).
cnf(c_0_47,plain,
join(top,complement(X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_28]),c_0_27]) ).
cnf(c_0_48,plain,
join(X1,join(complement(join(X2,complement(X1))),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_31,c_0_44]) ).
cnf(c_0_49,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_45,c_0_15]) ).
cnf(c_0_50,plain,
join(X1,top) = top,
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
join(X1,complement(join(complement(X2),X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_33]),c_0_37]) ).
cnf(c_0_52,plain,
join(X1,join(X2,complement(join(X1,X2)))) = top,
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_53,plain,
join(X1,converse(complement(converse(X1)))) = converse(top),
inference(spm,[status(thm)],[c_0_49,c_0_27]) ).
cnf(c_0_54,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_20,c_0_50]) ).
cnf(c_0_55,plain,
join(X1,complement(join(X2,X1))) = join(X1,complement(X2)),
inference(spm,[status(thm)],[c_0_51,c_0_37]) ).
cnf(c_0_56,plain,
join(X1,join(X2,complement(join(X2,X1)))) = top,
inference(spm,[status(thm)],[c_0_52,c_0_20]) ).
cnf(c_0_57,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_36]) ).
cnf(c_0_58,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_44,c_0_37]) ).
cnf(c_0_59,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
join(X1,complement(join(X1,X2))) = join(X1,complement(X2)),
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_55,c_0_56]),c_0_29]),c_0_57]),c_0_31]),c_0_20]),c_0_58]) ).
cnf(c_0_61,plain,
join(X1,converse(complement(converse(X1)))) = top,
inference(rw,[status(thm)],[c_0_53,c_0_59]) ).
cnf(c_0_62,plain,
join(X1,complement(converse(complement(converse(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_29]),c_0_57]) ).
cnf(c_0_63,axiom,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
composition_distributivity_7 ).
cnf(c_0_64,plain,
join(X1,converse(complement(converse(complement(X1))))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_62]),c_0_15]),c_0_15]) ).
cnf(c_0_65,plain,
join(composition(X1,X2),join(composition(X3,X2),X4)) = join(composition(join(X1,X3),X2),X4),
inference(spm,[status(thm)],[c_0_31,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
join(sk1,one) = one,
goals_14 ).
cnf(c_0_67,plain,
join(complement(X1),converse(complement(converse(X1)))) = complement(X1),
inference(spm,[status(thm)],[c_0_64,c_0_37]) ).
cnf(c_0_68,plain,
join(composition(join(X1,X2),X3),complement(composition(X2,X3))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_27]),c_0_50]) ).
cnf(c_0_69,negated_conjecture,
join(one,sk1) = one,
inference(rw,[status(thm)],[c_0_66,c_0_20]) ).
cnf(c_0_70,plain,
converse(join(one,X1)) = join(one,converse(X1)),
inference(spm,[status(thm)],[c_0_45,c_0_21]) ).
cnf(c_0_71,plain,
complement(converse(complement(converse(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_67]),c_0_37]),c_0_20]),c_0_62]) ).
cnf(c_0_72,plain,
join(X1,join(complement(X1),X2)) = top,
inference(rw,[status(thm)],[c_0_40,c_0_54]) ).
cnf(c_0_73,plain,
join(X1,composition(X2,X1)) = composition(join(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_25]),c_0_20]) ).
cnf(c_0_74,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_31,c_0_60]),c_0_31]) ).
cnf(c_0_75,negated_conjecture,
join(X1,complement(composition(sk1,X1))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_25]) ).
cnf(c_0_76,plain,
converse(join(composition(converse(X1),X2),X3)) = join(composition(converse(X2),X1),converse(X3)),
inference(spm,[status(thm)],[c_0_45,c_0_16]) ).
cnf(c_0_77,plain,
join(composition(X1,converse(X2)),converse(composition(X2,X3))) = composition(join(X1,converse(X3)),converse(X2)),
inference(spm,[status(thm)],[c_0_63,c_0_14]) ).
cnf(c_0_78,negated_conjecture,
join(one,converse(sk1)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_69]),c_0_21]) ).
cnf(c_0_79,plain,
converse(complement(converse(X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_37,c_0_71]) ).
cnf(c_0_80,plain,
join(X1,composition(join(X2,one),complement(X1))) = top,
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_81,negated_conjecture,
join(X1,join(composition(sk1,X1),X2)) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_29]),c_0_36]),c_0_37]) ).
cnf(c_0_82,plain,
join(composition(X1,X2),composition(X1,X3)) = composition(X1,join(X2,X3)),
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_76,c_0_77]),c_0_45]),c_0_14]),c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_83,negated_conjecture,
join(X1,complement(composition(converse(sk1),X1))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_78]),c_0_25]) ).
cnf(c_0_84,plain,
converse(complement(X1)) = complement(converse(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_79]) ).
cnf(c_0_85,plain,
join(X1,composition(top,complement(X1))) = top,
inference(spm,[status(thm)],[c_0_80,c_0_54]) ).
cnf(c_0_86,negated_conjecture,
join(X1,composition(sk1,join(X1,X2))) = join(X1,composition(sk1,X2)),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_87,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_24,c_0_14]),c_0_15]) ).
cnf(c_0_88,plain,
converse(composition(top,X1)) = composition(converse(X1),top),
inference(spm,[status(thm)],[c_0_16,c_0_59]) ).
cnf(c_0_89,negated_conjecture,
join(X1,complement(composition(X1,sk1))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_83]),c_0_59]),c_0_14]),c_0_84]),c_0_15]) ).
cnf(c_0_90,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_20]),c_0_31]) ).
cnf(c_0_91,plain,
join(complement(X1),composition(top,X1)) = top,
inference(spm,[status(thm)],[c_0_85,c_0_37]) ).
cnf(c_0_92,negated_conjecture,
join(X1,composition(sk1,complement(X1))) = join(X1,composition(sk1,top)),
inference(spm,[status(thm)],[c_0_86,c_0_27]) ).
cnf(c_0_93,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_87,c_0_88]),c_0_59]),c_0_29]),c_0_36]),c_0_59]),c_0_29]) ).
cnf(c_0_94,negated_conjecture,
join(X1,join(composition(X1,sk1),X2)) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_89]),c_0_29]),c_0_36]),c_0_37]) ).
cnf(c_0_95,plain,
join(X1,join(X2,X3)) = join(X2,join(X3,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_20]) ).
cnf(c_0_96,plain,
join(complement(X1),join(X2,composition(top,X1))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_50]) ).
cnf(c_0_97,plain,
converse(composition(X1,top)) = composition(top,converse(X1)),
inference(spm,[status(thm)],[c_0_14,c_0_59]) ).
cnf(c_0_98,negated_conjecture,
composition(join(sk1,converse(sk1)),top) = composition(converse(sk1),top),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_57]),c_0_63]),c_0_20]) ).
cnf(c_0_99,plain,
converse(join(X1,converse(X2))) = join(converse(X1),X2),
inference(spm,[status(thm)],[c_0_45,c_0_15]) ).
cnf(c_0_100,negated_conjecture,
join(X1,join(X2,composition(X1,sk1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_94]),c_0_31]),c_0_42]),c_0_95]) ).
cnf(c_0_101,plain,
join(complement(X1),join(X2,X1)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_33]),c_0_31]) ).
cnf(c_0_102,plain,
join(complement(X1),composition(top,join(X2,X1))) = top,
inference(spm,[status(thm)],[c_0_96,c_0_82]) ).
cnf(c_0_103,negated_conjecture,
composition(top,join(sk1,converse(sk1))) = composition(top,sk1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_98]),c_0_97]),c_0_15]),c_0_99]),c_0_20]) ).
cnf(c_0_104,negated_conjecture,
join(X1,composition(join(X2,X1),sk1)) = join(X1,composition(X2,sk1)),
inference(spm,[status(thm)],[c_0_100,c_0_63]) ).
cnf(c_0_105,negated_conjecture,
join(one,complement(converse(sk1))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_78]),c_0_20]) ).
cnf(c_0_106,negated_conjecture,
join(composition(top,sk1),complement(converse(sk1))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_20]) ).
cnf(c_0_107,negated_conjecture,
join(sk1,complement(converse(sk1))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_20]),c_0_106]),c_0_25]),c_0_20]) ).
cnf(c_0_108,negated_conjecture,
converse(sk1) != sk1,
inference(fof_simplification,[status(thm)],[goals_15]) ).
cnf(c_0_109,negated_conjecture,
join(sk1,converse(sk1)) = sk1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_107]),c_0_29]),c_0_57]),c_0_37]) ).
cnf(c_0_110,negated_conjecture,
converse(sk1) != sk1,
c_0_108 ).
cnf(c_0_111,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_109]),c_0_20]),c_0_109]),c_0_110]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : REL025-1 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Mon May 20 08:03:08 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.46 Running first-order model finding
% 0.17/0.46 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.27/0.87 # Version: 3.1.0
% 3.27/0.87 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.27/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.27/0.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.27/0.87 # Starting new_bool_3 with 300s (1) cores
% 3.27/0.87 # Starting new_bool_1 with 300s (1) cores
% 3.27/0.87 # Starting sh5l with 300s (1) cores
% 3.27/0.87 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 6668 completed with status 0
% 3.27/0.87 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.27/0.87 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.27/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.27/0.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.27/0.87 # No SInE strategy applied
% 3.27/0.87 # Search class: FUUPM-FFSF21-MFFFFFNN
% 3.27/0.87 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.27/0.87 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 3.27/0.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.27/0.87 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 3.27/0.87 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 3.27/0.87 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 3.27/0.87 # H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with pid 6677 completed with status 0
% 3.27/0.87 # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S
% 3.27/0.87 # Preprocessing class: FSMSSMSSSSSNFFN.
% 3.27/0.87 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.27/0.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.27/0.87 # No SInE strategy applied
% 3.27/0.87 # Search class: FUUPM-FFSF21-MFFFFFNN
% 3.27/0.87 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.27/0.87 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 3.27/0.87 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.27/0.87 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 3.27/0.87 # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 3.27/0.87 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 3.27/0.87 # Preprocessing time : 0.001 s
% 3.27/0.87 # Presaturation interreduction done
% 3.27/0.87
% 3.27/0.87 # Proof found!
% 3.27/0.87 # SZS status Unsatisfiable
% 3.27/0.87 # SZS output start CNFRefutation
% See solution above
% 3.27/0.88 # Parsed axioms : 15
% 3.27/0.88 # Removed by relevancy pruning/SinE : 0
% 3.27/0.88 # Initial clauses : 15
% 3.27/0.88 # Removed in clause preprocessing : 1
% 3.27/0.88 # Initial clauses in saturation : 14
% 3.27/0.88 # Processed clauses : 2573
% 3.27/0.88 # ...of these trivial : 1560
% 3.27/0.88 # ...subsumed : 479
% 3.27/0.88 # ...remaining for further processing : 534
% 3.27/0.88 # Other redundant clauses eliminated : 0
% 3.27/0.88 # Clauses deleted for lack of memory : 0
% 3.27/0.88 # Backward-subsumed : 0
% 3.27/0.88 # Backward-rewritten : 114
% 3.27/0.88 # Generated clauses : 60359
% 3.27/0.88 # ...of the previous two non-redundant : 27601
% 3.27/0.88 # ...aggressively subsumed : 0
% 3.27/0.88 # Contextual simplify-reflections : 0
% 3.27/0.88 # Paramodulations : 60359
% 3.27/0.88 # Factorizations : 0
% 3.27/0.88 # NegExts : 0
% 3.27/0.88 # Equation resolutions : 0
% 3.27/0.88 # Disequality decompositions : 0
% 3.27/0.88 # Total rewrite steps : 116234
% 3.27/0.88 # ...of those cached : 99385
% 3.27/0.88 # Propositional unsat checks : 0
% 3.27/0.88 # Propositional check models : 0
% 3.27/0.88 # Propositional check unsatisfiable : 0
% 3.27/0.88 # Propositional clauses : 0
% 3.27/0.88 # Propositional clauses after purity: 0
% 3.27/0.88 # Propositional unsat core size : 0
% 3.27/0.88 # Propositional preprocessing time : 0.000
% 3.27/0.88 # Propositional encoding time : 0.000
% 3.27/0.88 # Propositional solver time : 0.000
% 3.27/0.88 # Success case prop preproc time : 0.000
% 3.27/0.88 # Success case prop encoding time : 0.000
% 3.27/0.88 # Success case prop solver time : 0.000
% 3.27/0.88 # Current number of processed clauses : 406
% 3.27/0.88 # Positive orientable unit clauses : 400
% 3.27/0.88 # Positive unorientable unit clauses: 5
% 3.27/0.88 # Negative unit clauses : 1
% 3.27/0.88 # Non-unit-clauses : 0
% 3.27/0.88 # Current number of unprocessed clauses: 24679
% 3.27/0.88 # ...number of literals in the above : 24679
% 3.27/0.88 # Current number of archived formulas : 0
% 3.27/0.88 # Current number of archived clauses : 129
% 3.27/0.88 # Clause-clause subsumption calls (NU) : 0
% 3.27/0.88 # Rec. Clause-clause subsumption calls : 0
% 3.27/0.88 # Non-unit clause-clause subsumptions : 0
% 3.27/0.88 # Unit Clause-clause subsumption calls : 24
% 3.27/0.88 # Rewrite failures with RHS unbound : 0
% 3.27/0.88 # BW rewrite match attempts : 1897
% 3.27/0.88 # BW rewrite match successes : 262
% 3.27/0.88 # Condensation attempts : 0
% 3.27/0.88 # Condensation successes : 0
% 3.27/0.88 # Termbank termtop insertions : 690539
% 3.27/0.88 # Search garbage collected termcells : 2
% 3.27/0.88
% 3.27/0.88 # -------------------------------------------------
% 3.27/0.88 # User time : 0.363 s
% 3.27/0.88 # System time : 0.024 s
% 3.27/0.88 # Total time : 0.387 s
% 3.27/0.88 # Maximum resident set size: 1632 pages
% 3.27/0.88
% 3.27/0.88 # -------------------------------------------------
% 3.27/0.88 # User time : 1.863 s
% 3.27/0.88 # System time : 0.097 s
% 3.27/0.88 # Total time : 1.960 s
% 3.27/0.88 # Maximum resident set size: 1704 pages
% 3.27/0.88 % E---3.1 exiting
%------------------------------------------------------------------------------