TSTP Solution File: REL042+2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : REL042+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:14:32 EDT 2023
% Result : Theorem 2.52s 0.79s
% Output : CNFRefutation 2.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 15
% Syntax : Number of formulae : 111 ( 108 unt; 0 def)
% Number of atoms : 114 ( 113 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 : 9 ( 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 : 150 ( 12 sgn; 61 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
file('/export/starexec/sandbox2/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',converse_multiplicativity) ).
fof(converse_idempotence,axiom,
! [X1] : converse(converse(X1)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',converse_idempotence) ).
fof(composition_identity,axiom,
! [X1] : composition(X1,one) = X1,
file('/export/starexec/sandbox2/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',composition_identity) ).
fof(converse_cancellativity,axiom,
! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
file('/export/starexec/sandbox2/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',converse_cancellativity) ).
fof(maddux1_join_commutativity,axiom,
! [X1,X2] : join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',maddux1_join_commutativity) ).
fof(def_zero,axiom,
! [X1] : zero = meet(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',def_zero) ).
fof(maddux4_definiton_of_meet,axiom,
! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
file('/export/starexec/sandbox2/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',maddux4_definiton_of_meet) ).
fof(def_top,axiom,
! [X1] : top = join(X1,complement(X1)),
file('/export/starexec/sandbox2/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',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/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',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/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',maddux2_join_associativity) ).
fof(goals,conjecture,
! [X1] :
( ! [X2] : meet(composition(X1,X2),composition(X1,complement(X2))) = zero
=> join(composition(converse(X1),X1),one) = one ),
file('/export/starexec/sandbox2/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',goals) ).
fof(converse_additivity,axiom,
! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
file('/export/starexec/sandbox2/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',converse_additivity) ).
fof(dedekind_law,axiom,
! [X1,X2,X3] : 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/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',dedekind_law) ).
fof(composition_distributivity,axiom,
! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',composition_distributivity) ).
fof(composition_associativity,axiom,
! [X1,X2,X3] : composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p',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,
! [X20] : converse(converse(X20)) = X20,
inference(variable_rename,[status(thm)],[converse_idempotence]) ).
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,
converse(converse(X1)) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_19,plain,
! [X16] : composition(X16,one) = X16,
inference(variable_rename,[status(thm)],[composition_identity]) ).
cnf(c_0_20,plain,
converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
composition(X1,one) = 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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_18]) ).
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_21,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]) ).
fof(c_0_45,negated_conjecture,
~ ! [X1] :
( ! [X2] : meet(composition(X1,X2),composition(X1,complement(X2))) = zero
=> join(composition(converse(X1),X1),one) = one ),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_46,plain,
join(zero,join(zero,X1)) = join(zero,X1),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,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]) ).
fof(c_0_48,negated_conjecture,
! [X39] :
( meet(composition(esk1_0,X39),composition(esk1_0,complement(X39))) = zero
& join(composition(converse(esk1_0),esk1_0),one) != one ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])])]) ).
cnf(c_0_49,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
meet(composition(esk1_0,X1),composition(esk1_0,complement(X1))) = zero,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_51,plain,
complement(complement(X1)) = X1,
inference(rw,[status(thm)],[c_0_47,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
complement(join(complement(composition(esk1_0,X1)),complement(composition(esk1_0,complement(X1))))) = zero,
inference(rw,[status(thm)],[c_0_50,c_0_31]) ).
cnf(c_0_53,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_39,c_0_51]) ).
fof(c_0_54,plain,
! [X21,X22] : converse(join(X21,X22)) = join(converse(X21),converse(X22)),
inference(variable_rename,[status(thm)],[converse_additivity]) ).
cnf(c_0_55,negated_conjecture,
complement(join(complement(esk1_0),complement(composition(esk1_0,complement(one))))) = zero,
inference(spm,[status(thm)],[c_0_52,c_0_21]) ).
cnf(c_0_56,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_42,c_0_53]) ).
cnf(c_0_57,plain,
converse(join(X1,X2)) = join(converse(X1),converse(X2)),
inference(split_conjunct,[status(thm)],[c_0_54]) ).
cnf(c_0_58,negated_conjecture,
join(zero,complement(join(complement(esk1_0),composition(esk1_0,complement(one))))) = esk1_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_55]),c_0_28]) ).
cnf(c_0_59,plain,
join(X1,top) = top,
inference(spm,[status(thm)],[c_0_56,c_0_36]) ).
cnf(c_0_60,plain,
converse(join(converse(X1),X2)) = join(X1,converse(X2)),
inference(spm,[status(thm)],[c_0_57,c_0_18]) ).
cnf(c_0_61,negated_conjecture,
complement(join(complement(esk1_0),composition(esk1_0,complement(one)))) = esk1_0,
inference(rw,[status(thm)],[c_0_58,c_0_49]) ).
cnf(c_0_62,plain,
join(top,X1) = top,
inference(spm,[status(thm)],[c_0_28,c_0_59]) ).
cnf(c_0_63,plain,
join(X1,converse(top)) = converse(top),
inference(spm,[status(thm)],[c_0_60,c_0_59]) ).
cnf(c_0_64,negated_conjecture,
join(complement(esk1_0),composition(esk1_0,complement(one))) = complement(esk1_0),
inference(spm,[status(thm)],[c_0_51,c_0_61]) ).
cnf(c_0_65,plain,
converse(top) = top,
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
join(complement(esk1_0),join(composition(esk1_0,complement(one)),X1)) = join(complement(esk1_0),X1),
inference(spm,[status(thm)],[c_0_42,c_0_64]) ).
cnf(c_0_67,plain,
join(X1,converse(complement(converse(X1)))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_36]),c_0_65]) ).
cnf(c_0_68,plain,
join(complement(one),composition(converse(X1),complement(X1))) = complement(one),
inference(spm,[status(thm)],[c_0_33,c_0_21]) ).
cnf(c_0_69,negated_conjecture,
join(complement(esk1_0),converse(complement(converse(composition(esk1_0,complement(one)))))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_59]) ).
cnf(c_0_70,plain,
join(complement(one),composition(converse(complement(X1)),X1)) = complement(one),
inference(spm,[status(thm)],[c_0_68,c_0_51]) ).
cnf(c_0_71,plain,
join(X1,join(complement(X1),X2)) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_62]) ).
cnf(c_0_72,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_56,c_0_28]) ).
cnf(c_0_73,plain,
join(X1,complement(join(complement(X1),X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_44]),c_0_28]) ).
cnf(c_0_74,negated_conjecture,
complement(join(complement(esk1_0),complement(converse(complement(converse(composition(esk1_0,complement(one)))))))) = esk1_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_69]),c_0_40]),c_0_49]) ).
cnf(c_0_75,plain,
converse(join(X1,converse(X2))) = join(converse(X1),X2),
inference(spm,[status(thm)],[c_0_57,c_0_18]) ).
cnf(c_0_76,plain,
join(complement(one),converse(complement(one))) = complement(one),
inference(spm,[status(thm)],[c_0_70,c_0_21]) ).
fof(c_0_77,plain,
! [X29,X30,X31] : join(meet(composition(X29,X30),X31),composition(meet(X29,composition(X31,converse(X30))),meet(X30,composition(converse(X29),X31)))) = composition(meet(X29,composition(X31,converse(X30))),meet(X30,composition(converse(X29),X31))),
inference(variable_rename,[status(thm)],[dedekind_law]) ).
cnf(c_0_78,plain,
join(X1,join(X2,complement(X1))) = top,
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_79,plain,
join(converse(X1),join(converse(X2),X3)) = join(converse(join(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_42,c_0_57]) ).
cnf(c_0_80,plain,
join(X1,complement(join(X2,complement(X1)))) = X1,
inference(spm,[status(thm)],[c_0_73,c_0_72]) ).
cnf(c_0_81,negated_conjecture,
join(complement(esk1_0),complement(converse(complement(converse(composition(esk1_0,complement(one))))))) = complement(esk1_0),
inference(spm,[status(thm)],[c_0_51,c_0_74]) ).
cnf(c_0_82,plain,
converse(complement(one)) = complement(one),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_28]),c_0_76]) ).
cnf(c_0_83,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_33,c_0_17]),c_0_18]) ).
cnf(c_0_84,plain,
converse(composition(top,X1)) = composition(converse(X1),top),
inference(spm,[status(thm)],[c_0_20,c_0_65]) ).
cnf(c_0_85,plain,
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))),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_86,plain,
join(complement(converse(X1)),converse(join(X1,X2))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_28]) ).
cnf(c_0_87,negated_conjecture,
join(esk1_0,converse(complement(converse(composition(esk1_0,complement(one)))))) = converse(complement(converse(composition(esk1_0,complement(one))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_51]),c_0_28]) ).
cnf(c_0_88,plain,
converse(composition(X1,complement(one))) = composition(complement(one),converse(X1)),
inference(spm,[status(thm)],[c_0_17,c_0_82]) ).
fof(c_0_89,plain,
! [X17,X18,X19] : composition(join(X17,X18),X19) = join(composition(X17,X19),composition(X18,X19)),
inference(variable_rename,[status(thm)],[composition_distributivity]) ).
cnf(c_0_90,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_83,c_0_84]),c_0_65]),c_0_40]),c_0_49]),c_0_65]),c_0_40]) ).
cnf(c_0_91,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_85,c_0_31]),c_0_31]),c_0_31]),c_0_31]),c_0_31]) ).
cnf(c_0_92,negated_conjecture,
join(complement(converse(esk1_0)),complement(composition(complement(one),converse(esk1_0)))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_18]),c_0_88]) ).
cnf(c_0_93,negated_conjecture,
join(complement(esk1_0),complement(composition(esk1_0,complement(one)))) = top,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_55]),c_0_36]) ).
fof(c_0_94,plain,
! [X13,X14,X15] : composition(X13,composition(X14,X15)) = composition(composition(X13,X14),X15),
inference(variable_rename,[status(thm)],[composition_associativity]) ).
cnf(c_0_95,plain,
composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_89]) ).
cnf(c_0_96,plain,
composition(top,complement(composition(top,top))) = zero,
inference(spm,[status(thm)],[c_0_90,c_0_65]) ).
cnf(c_0_97,plain,
join(complement(X1),complement(join(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_80,c_0_51]) ).
cnf(c_0_98,negated_conjecture,
join(composition(zero,zero),complement(join(one,complement(composition(converse(esk1_0),esk1_0))))) = composition(zero,zero),
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_91,c_0_92]),c_0_51]),c_0_40]),c_0_18]),c_0_93]),c_0_40]),c_0_40]),c_0_18]),c_0_93]),c_0_40]),c_0_28]),c_0_28]) ).
cnf(c_0_99,plain,
composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_94]) ).
cnf(c_0_100,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_95,c_0_96]),c_0_49]),c_0_62]),c_0_96]) ).
cnf(c_0_101,negated_conjecture,
join(one,join(complement(composition(zero,zero)),complement(composition(converse(esk1_0),esk1_0)))) = join(one,complement(composition(converse(esk1_0),esk1_0))),
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_51]),c_0_42]),c_0_51]),c_0_28]) ).
cnf(c_0_102,plain,
composition(X1,zero) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_100]) ).
cnf(c_0_103,plain,
complement(zero) = top,
inference(spm,[status(thm)],[c_0_36,c_0_49]) ).
cnf(c_0_104,plain,
join(complement(join(X1,complement(X2))),complement(join(complement(X2),complement(X1)))) = X2,
inference(spm,[status(thm)],[c_0_44,c_0_28]) ).
cnf(c_0_105,negated_conjecture,
join(one,complement(composition(converse(esk1_0),esk1_0))) = top,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103]),c_0_62]),c_0_59]) ).
cnf(c_0_106,negated_conjecture,
join(composition(converse(esk1_0),esk1_0),one) != one,
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_107,plain,
join(complement(X1),complement(join(X1,X2))) = complement(X1),
inference(spm,[status(thm)],[c_0_73,c_0_51]) ).
cnf(c_0_108,negated_conjecture,
complement(join(complement(one),complement(composition(converse(esk1_0),esk1_0)))) = composition(converse(esk1_0),esk1_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_40]),c_0_49]),c_0_28]) ).
cnf(c_0_109,negated_conjecture,
join(one,composition(converse(esk1_0),esk1_0)) != one,
inference(rw,[status(thm)],[c_0_106,c_0_28]) ).
cnf(c_0_110,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_51]),c_0_51]),c_0_109]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : REL042+2 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n009.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 : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 15:09:29 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running first-order model finding
% 0.20/0.48 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/tmp/tmp.S6q1Eis2rk/E---3.1_22070.p
% 2.52/0.79 # Version: 3.1pre001
% 2.52/0.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.52/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.52/0.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.52/0.79 # Starting new_bool_3 with 300s (1) cores
% 2.52/0.79 # Starting new_bool_1 with 300s (1) cores
% 2.52/0.79 # Starting sh5l with 300s (1) cores
% 2.52/0.79 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22147 completed with status 0
% 2.52/0.79 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.52/0.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.52/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.52/0.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.52/0.79 # No SInE strategy applied
% 2.52/0.79 # Search class: FUUPM-FFMF21-DFFFFFNN
% 2.52/0.79 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.52/0.79 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 811s (1) cores
% 2.52/0.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.52/0.79 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 2.52/0.79 # Starting new_bool_3 with 136s (1) cores
% 2.52/0.79 # Starting new_bool_1 with 136s (1) cores
% 2.52/0.79 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22152 completed with status 0
% 2.52/0.79 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.52/0.79 # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.52/0.79 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.52/0.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.52/0.79 # No SInE strategy applied
% 2.52/0.79 # Search class: FUUPM-FFMF21-DFFFFFNN
% 2.52/0.79 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.52/0.79 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 811s (1) cores
% 2.52/0.79 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.52/0.79 # Preprocessing time : 0.001 s
% 2.52/0.79 # Presaturation interreduction done
% 2.52/0.79
% 2.52/0.79 # Proof found!
% 2.52/0.79 # SZS status Theorem
% 2.52/0.79 # SZS output start CNFRefutation
% See solution above
% 2.52/0.79 # Parsed axioms : 17
% 2.52/0.79 # Removed by relevancy pruning/SinE : 0
% 2.52/0.79 # Initial clauses : 18
% 2.52/0.79 # Removed in clause preprocessing : 1
% 2.52/0.79 # Initial clauses in saturation : 17
% 2.52/0.79 # Processed clauses : 1245
% 2.52/0.79 # ...of these trivial : 729
% 2.52/0.79 # ...subsumed : 40
% 2.52/0.79 # ...remaining for further processing : 476
% 2.52/0.79 # Other redundant clauses eliminated : 0
% 2.52/0.79 # Clauses deleted for lack of memory : 0
% 2.52/0.79 # Backward-subsumed : 0
% 2.52/0.79 # Backward-rewritten : 102
% 2.52/0.79 # Generated clauses : 25998
% 2.52/0.79 # ...of the previous two non-redundant : 14445
% 2.52/0.79 # ...aggressively subsumed : 0
% 2.52/0.79 # Contextual simplify-reflections : 0
% 2.52/0.79 # Paramodulations : 25998
% 2.52/0.79 # Factorizations : 0
% 2.52/0.79 # NegExts : 0
% 2.52/0.79 # Equation resolutions : 0
% 2.52/0.79 # Total rewrite steps : 69189
% 2.52/0.79 # Propositional unsat checks : 0
% 2.52/0.79 # Propositional check models : 0
% 2.52/0.79 # Propositional check unsatisfiable : 0
% 2.52/0.79 # Propositional clauses : 0
% 2.52/0.79 # Propositional clauses after purity: 0
% 2.52/0.79 # Propositional unsat core size : 0
% 2.52/0.79 # Propositional preprocessing time : 0.000
% 2.52/0.79 # Propositional encoding time : 0.000
% 2.52/0.79 # Propositional solver time : 0.000
% 2.52/0.79 # Success case prop preproc time : 0.000
% 2.52/0.79 # Success case prop encoding time : 0.000
% 2.52/0.79 # Success case prop solver time : 0.000
% 2.52/0.79 # Current number of processed clauses : 357
% 2.52/0.79 # Positive orientable unit clauses : 351
% 2.52/0.79 # Positive unorientable unit clauses: 5
% 2.52/0.79 # Negative unit clauses : 1
% 2.52/0.79 # Non-unit-clauses : 0
% 2.52/0.79 # Current number of unprocessed clauses: 12828
% 2.52/0.79 # ...number of literals in the above : 12828
% 2.52/0.79 # Current number of archived formulas : 0
% 2.52/0.79 # Current number of archived clauses : 120
% 2.52/0.79 # Clause-clause subsumption calls (NU) : 0
% 2.52/0.79 # Rec. Clause-clause subsumption calls : 0
% 2.52/0.79 # Non-unit clause-clause subsumptions : 0
% 2.52/0.79 # Unit Clause-clause subsumption calls : 30
% 2.52/0.79 # Rewrite failures with RHS unbound : 0
% 2.52/0.79 # BW rewrite match attempts : 2027
% 2.52/0.79 # BW rewrite match successes : 145
% 2.52/0.79 # Condensation attempts : 0
% 2.52/0.79 # Condensation successes : 0
% 2.52/0.79 # Termbank termtop insertions : 636685
% 2.52/0.79
% 2.52/0.79 # -------------------------------------------------
% 2.52/0.79 # User time : 0.279 s
% 2.52/0.79 # System time : 0.016 s
% 2.52/0.79 # Total time : 0.295 s
% 2.52/0.79 # Maximum resident set size: 1772 pages
% 2.52/0.79
% 2.52/0.79 # -------------------------------------------------
% 2.52/0.79 # User time : 1.420 s
% 2.52/0.79 # System time : 0.053 s
% 2.52/0.79 # Total time : 1.473 s
% 2.52/0.79 # Maximum resident set size: 1688 pages
% 2.52/0.79 % E---3.1 exiting
%------------------------------------------------------------------------------