TSTP Solution File: REL025+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : REL025+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n022.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:16 EDT 2023

% Result   : Theorem 2.07s 1.03s
% Output   : CNFRefutation 2.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   32
%            Number of leaves      :   13
% Syntax   : Number of formulae    :  124 ( 121 unt;   0 def)
%            Number of atoms       :  127 ( 126 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   3   ~;   0   |;   1   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   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   :  186 (  13 sgn;  46   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
    ! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
    file('/export/starexec/sandbox2/tmp/tmp.45SzPE5wV4/E---3.1_8868.p',converse_multiplicativity) ).

fof(converse_idempotence,axiom,
    ! [X1] : converse(converse(X1)) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.45SzPE5wV4/E---3.1_8868.p',converse_idempotence) ).

fof(composition_identity,axiom,
    ! [X1] : composition(X1,one) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.45SzPE5wV4/E---3.1_8868.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.45SzPE5wV4/E---3.1_8868.p',converse_cancellativity) ).

fof(maddux1_join_commutativity,axiom,
    ! [X1,X2] : join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox2/tmp/tmp.45SzPE5wV4/E---3.1_8868.p',maddux1_join_commutativity) ).

fof(def_zero,axiom,
    ! [X1] : zero = meet(X1,complement(X1)),
    file('/export/starexec/sandbox2/tmp/tmp.45SzPE5wV4/E---3.1_8868.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.45SzPE5wV4/E---3.1_8868.p',maddux4_definiton_of_meet) ).

fof(def_top,axiom,
    ! [X1] : top = join(X1,complement(X1)),
    file('/export/starexec/sandbox2/tmp/tmp.45SzPE5wV4/E---3.1_8868.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.45SzPE5wV4/E---3.1_8868.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.45SzPE5wV4/E---3.1_8868.p',maddux2_join_associativity) ).

fof(converse_additivity,axiom,
    ! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
    file('/export/starexec/sandbox2/tmp/tmp.45SzPE5wV4/E---3.1_8868.p',converse_additivity) ).

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.45SzPE5wV4/E---3.1_8868.p',composition_distributivity) ).

fof(goals,conjecture,
    ! [X1] :
      ( join(X1,one) = one
     => converse(X1) = X1 ),
    file('/export/starexec/sandbox2/tmp/tmp.45SzPE5wV4/E---3.1_8868.p',goals) ).

fof(c_0_13,plain,
    ! [X23,X24] : converse(composition(X23,X24)) = composition(converse(X24),converse(X23)),
    inference(variable_rename,[status(thm)],[converse_multiplicativity]) ).

fof(c_0_14,plain,
    ! [X20] : converse(converse(X20)) = X20,
    inference(variable_rename,[status(thm)],[converse_idempotence]) ).

cnf(c_0_15,plain,
    converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_16,plain,
    converse(converse(X1)) = X1,
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_17,plain,
    ! [X16] : composition(X16,one) = X16,
    inference(variable_rename,[status(thm)],[composition_identity]) ).

cnf(c_0_18,plain,
    converse(composition(converse(X1),X2)) = composition(converse(X2),X1),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    composition(X1,one) = X1,
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

fof(c_0_20,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_21,plain,
    ! [X4,X5] : join(X4,X5) = join(X5,X4),
    inference(variable_rename,[status(thm)],[maddux1_join_commutativity]) ).

cnf(c_0_22,plain,
    composition(converse(one),X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_16]) ).

fof(c_0_23,plain,
    ! [X28] : zero = meet(X28,complement(X28)),
    inference(variable_rename,[status(thm)],[def_zero]) ).

fof(c_0_24,plain,
    ! [X11,X12] : meet(X11,X12) = complement(join(complement(X11),complement(X12))),
    inference(variable_rename,[status(thm)],[maddux4_definiton_of_meet]) ).

cnf(c_0_25,plain,
    join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_26,plain,
    join(X1,X2) = join(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_27,plain,
    converse(one) = one,
    inference(spm,[status(thm)],[c_0_19,c_0_22]) ).

cnf(c_0_28,plain,
    zero = meet(X1,complement(X1)),
    inference(split_conjunct,[status(thm)],[c_0_23]) ).

cnf(c_0_29,plain,
    meet(X1,X2) = complement(join(complement(X1),complement(X2))),
    inference(split_conjunct,[status(thm)],[c_0_24]) ).

fof(c_0_30,plain,
    ! [X27] : top = join(X27,complement(X27)),
    inference(variable_rename,[status(thm)],[def_top]) ).

cnf(c_0_31,plain,
    join(complement(X1),composition(converse(X2),complement(composition(X2,X1)))) = complement(X1),
    inference(rw,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_32,plain,
    composition(one,X1) = X1,
    inference(rw,[status(thm)],[c_0_22,c_0_27]) ).

cnf(c_0_33,plain,
    zero = complement(join(complement(X1),complement(complement(X1)))),
    inference(rw,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_34,plain,
    top = join(X1,complement(X1)),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

fof(c_0_35,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_36,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_37,plain,
    join(complement(X1),complement(X1)) = complement(X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_27]),c_0_32]) ).

cnf(c_0_38,plain,
    complement(top) = zero,
    inference(rw,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_39,plain,
    X1 = join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_40,plain,
    join(X1,join(X2,X3)) = join(join(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

cnf(c_0_41,plain,
    join(zero,zero) = zero,
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,plain,
    join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2)))) = X1,
    inference(rw,[status(thm)],[c_0_39,c_0_26]) ).

cnf(c_0_43,plain,
    join(zero,join(zero,X1)) = join(zero,X1),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_44,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_42,c_0_34]),c_0_37]),c_0_38]),c_0_26]) ).

cnf(c_0_45,plain,
    join(zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_46,plain,
    complement(complement(X1)) = X1,
    inference(rw,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_47,plain,
    join(X1,X1) = X1,
    inference(spm,[status(thm)],[c_0_37,c_0_46]) ).

cnf(c_0_48,plain,
    join(X1,join(X1,X2)) = join(X1,X2),
    inference(spm,[status(thm)],[c_0_40,c_0_47]) ).

cnf(c_0_49,plain,
    join(X1,join(complement(X1),X2)) = join(top,X2),
    inference(spm,[status(thm)],[c_0_40,c_0_34]) ).

cnf(c_0_50,plain,
    join(X1,complement(join(complement(X1),X2))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_42]),c_0_26]) ).

cnf(c_0_51,plain,
    join(X1,join(X2,X1)) = join(X2,X1),
    inference(spm,[status(thm)],[c_0_48,c_0_26]) ).

fof(c_0_52,plain,
    ! [X21,X22] : converse(join(X21,X22)) = join(converse(X21),converse(X22)),
    inference(variable_rename,[status(thm)],[converse_additivity]) ).

cnf(c_0_53,plain,
    join(X1,join(X2,complement(X1))) = join(top,X2),
    inference(spm,[status(thm)],[c_0_49,c_0_26]) ).

cnf(c_0_54,plain,
    join(X1,complement(join(X2,complement(X1)))) = X1,
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_55,plain,
    converse(join(X1,X2)) = join(converse(X1),converse(X2)),
    inference(split_conjunct,[status(thm)],[c_0_52]) ).

cnf(c_0_56,plain,
    join(top,complement(complement(X1))) = join(X1,top),
    inference(spm,[status(thm)],[c_0_49,c_0_34]) ).

cnf(c_0_57,plain,
    join(top,complement(X1)) = top,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_37]),c_0_34]) ).

cnf(c_0_58,plain,
    join(X1,join(complement(join(X2,complement(X1))),X3)) = join(X1,X3),
    inference(spm,[status(thm)],[c_0_40,c_0_54]) ).

cnf(c_0_59,plain,
    converse(join(converse(X1),X2)) = join(X1,converse(X2)),
    inference(spm,[status(thm)],[c_0_55,c_0_16]) ).

cnf(c_0_60,plain,
    join(X1,top) = top,
    inference(rw,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_61,plain,
    join(X1,complement(join(complement(X2),X1))) = join(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_42]),c_0_46]) ).

cnf(c_0_62,plain,
    join(X1,join(X2,complement(join(X1,X2)))) = top,
    inference(spm,[status(thm)],[c_0_34,c_0_40]) ).

cnf(c_0_63,plain,
    join(X1,converse(complement(converse(X1)))) = converse(top),
    inference(spm,[status(thm)],[c_0_59,c_0_34]) ).

cnf(c_0_64,plain,
    join(top,X1) = top,
    inference(spm,[status(thm)],[c_0_26,c_0_60]) ).

cnf(c_0_65,plain,
    join(X1,complement(join(X2,X1))) = join(X1,complement(X2)),
    inference(spm,[status(thm)],[c_0_61,c_0_46]) ).

cnf(c_0_66,plain,
    join(X1,join(X2,complement(join(X2,X1)))) = top,
    inference(spm,[status(thm)],[c_0_62,c_0_26]) ).

cnf(c_0_67,plain,
    join(X1,zero) = X1,
    inference(spm,[status(thm)],[c_0_26,c_0_45]) ).

cnf(c_0_68,plain,
    join(complement(X1),complement(join(X2,X1))) = complement(X1),
    inference(spm,[status(thm)],[c_0_54,c_0_46]) ).

cnf(c_0_69,plain,
    converse(top) = top,
    inference(spm,[status(thm)],[c_0_63,c_0_64]) ).

cnf(c_0_70,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_65,c_0_66]),c_0_38]),c_0_67]),c_0_40]),c_0_26]),c_0_68]) ).

cnf(c_0_71,plain,
    join(X1,converse(complement(converse(X1)))) = top,
    inference(rw,[status(thm)],[c_0_63,c_0_69]) ).

fof(c_0_72,plain,
    ! [X17,X18,X19] : composition(join(X17,X18),X19) = join(composition(X17,X19),composition(X18,X19)),
    inference(variable_rename,[status(thm)],[composition_distributivity]) ).

fof(c_0_73,negated_conjecture,
    ~ ! [X1] :
        ( join(X1,one) = one
       => converse(X1) = X1 ),
    inference(assume_negation,[status(cth)],[goals]) ).

cnf(c_0_74,plain,
    join(X1,complement(converse(complement(converse(X1))))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_38]),c_0_67]) ).

cnf(c_0_75,plain,
    composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
    inference(split_conjunct,[status(thm)],[c_0_72]) ).

fof(c_0_76,negated_conjecture,
    ( join(esk1_0,one) = one
    & converse(esk1_0) != esk1_0 ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_73])])]) ).

cnf(c_0_77,plain,
    join(X1,converse(complement(converse(complement(X1))))) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_74]),c_0_16]),c_0_16]) ).

cnf(c_0_78,plain,
    join(composition(X1,X2),join(composition(X3,X2),X4)) = join(composition(join(X1,X3),X2),X4),
    inference(spm,[status(thm)],[c_0_40,c_0_75]) ).

cnf(c_0_79,negated_conjecture,
    join(esk1_0,one) = one,
    inference(split_conjunct,[status(thm)],[c_0_76]) ).

cnf(c_0_80,plain,
    join(complement(X1),converse(complement(converse(X1)))) = complement(X1),
    inference(spm,[status(thm)],[c_0_77,c_0_46]) ).

cnf(c_0_81,plain,
    join(composition(join(X1,X2),X3),complement(composition(X2,X3))) = top,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_34]),c_0_60]) ).

cnf(c_0_82,negated_conjecture,
    join(one,esk1_0) = one,
    inference(rw,[status(thm)],[c_0_79,c_0_26]) ).

cnf(c_0_83,plain,
    converse(join(one,X1)) = join(one,converse(X1)),
    inference(spm,[status(thm)],[c_0_55,c_0_27]) ).

cnf(c_0_84,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_68,c_0_80]),c_0_46]),c_0_26]),c_0_74]) ).

cnf(c_0_85,plain,
    join(X1,join(complement(X1),X2)) = top,
    inference(rw,[status(thm)],[c_0_49,c_0_64]) ).

cnf(c_0_86,plain,
    join(X1,composition(X2,X1)) = composition(join(X2,one),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_32]),c_0_26]) ).

cnf(c_0_87,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_40,c_0_70]),c_0_40]) ).

cnf(c_0_88,negated_conjecture,
    join(X1,complement(composition(esk1_0,X1))) = top,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_32]) ).

cnf(c_0_89,plain,
    converse(join(composition(converse(X1),X2),X3)) = join(composition(converse(X2),X1),converse(X3)),
    inference(spm,[status(thm)],[c_0_55,c_0_18]) ).

cnf(c_0_90,plain,
    join(composition(X1,converse(X2)),converse(composition(X2,X3))) = composition(join(X1,converse(X3)),converse(X2)),
    inference(spm,[status(thm)],[c_0_75,c_0_15]) ).

cnf(c_0_91,negated_conjecture,
    join(one,converse(esk1_0)) = one,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_82]),c_0_27]) ).

cnf(c_0_92,plain,
    converse(complement(converse(X1))) = complement(X1),
    inference(spm,[status(thm)],[c_0_46,c_0_84]) ).

cnf(c_0_93,plain,
    join(X1,composition(join(X2,one),complement(X1))) = top,
    inference(spm,[status(thm)],[c_0_85,c_0_86]) ).

cnf(c_0_94,negated_conjecture,
    join(X1,join(composition(esk1_0,X1),X2)) = join(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_38]),c_0_45]),c_0_46]) ).

cnf(c_0_95,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_89,c_0_90]),c_0_55]),c_0_15]),c_0_16]),c_0_16]),c_0_16]) ).

cnf(c_0_96,negated_conjecture,
    join(X1,complement(composition(converse(esk1_0),X1))) = top,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_91]),c_0_32]) ).

cnf(c_0_97,plain,
    converse(complement(X1)) = complement(converse(X1)),
    inference(spm,[status(thm)],[c_0_16,c_0_92]) ).

cnf(c_0_98,plain,
    join(X1,composition(top,complement(X1))) = top,
    inference(spm,[status(thm)],[c_0_93,c_0_64]) ).

cnf(c_0_99,negated_conjecture,
    join(X1,composition(esk1_0,join(X1,X2))) = join(X1,composition(esk1_0,X2)),
    inference(spm,[status(thm)],[c_0_94,c_0_95]) ).

cnf(c_0_100,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_31,c_0_15]),c_0_16]) ).

cnf(c_0_101,plain,
    converse(composition(top,X1)) = composition(converse(X1),top),
    inference(spm,[status(thm)],[c_0_18,c_0_69]) ).

cnf(c_0_102,negated_conjecture,
    join(X1,complement(composition(X1,esk1_0))) = top,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_96]),c_0_69]),c_0_15]),c_0_97]),c_0_16]) ).

cnf(c_0_103,plain,
    join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_26]),c_0_40]) ).

cnf(c_0_104,plain,
    join(complement(X1),composition(top,X1)) = top,
    inference(spm,[status(thm)],[c_0_98,c_0_46]) ).

cnf(c_0_105,negated_conjecture,
    join(X1,composition(esk1_0,complement(X1))) = join(X1,composition(esk1_0,top)),
    inference(spm,[status(thm)],[c_0_99,c_0_34]) ).

cnf(c_0_106,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_100,c_0_101]),c_0_69]),c_0_38]),c_0_45]),c_0_69]),c_0_38]) ).

cnf(c_0_107,negated_conjecture,
    join(X1,join(composition(X1,esk1_0),X2)) = join(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_102]),c_0_38]),c_0_45]),c_0_46]) ).

cnf(c_0_108,plain,
    join(X1,join(X2,X3)) = join(X2,join(X3,X1)),
    inference(spm,[status(thm)],[c_0_40,c_0_26]) ).

cnf(c_0_109,plain,
    join(complement(X1),join(X2,composition(top,X1))) = top,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_60]) ).

cnf(c_0_110,plain,
    converse(composition(X1,top)) = composition(top,converse(X1)),
    inference(spm,[status(thm)],[c_0_15,c_0_69]) ).

cnf(c_0_111,negated_conjecture,
    composition(join(esk1_0,converse(esk1_0)),top) = composition(converse(esk1_0),top),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_67]),c_0_75]),c_0_26]) ).

cnf(c_0_112,plain,
    converse(join(X1,converse(X2))) = join(converse(X1),X2),
    inference(spm,[status(thm)],[c_0_55,c_0_16]) ).

cnf(c_0_113,negated_conjecture,
    join(X1,join(X2,composition(X1,esk1_0))) = join(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_107]),c_0_40]),c_0_51]),c_0_108]) ).

cnf(c_0_114,plain,
    join(complement(X1),join(X2,X1)) = top,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_42]),c_0_40]) ).

cnf(c_0_115,plain,
    join(complement(X1),composition(top,join(X2,X1))) = top,
    inference(spm,[status(thm)],[c_0_109,c_0_95]) ).

cnf(c_0_116,negated_conjecture,
    composition(top,join(esk1_0,converse(esk1_0))) = composition(top,esk1_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_110]),c_0_16]),c_0_112]),c_0_26]) ).

cnf(c_0_117,negated_conjecture,
    join(X1,composition(join(X2,X1),esk1_0)) = join(X1,composition(X2,esk1_0)),
    inference(spm,[status(thm)],[c_0_113,c_0_75]) ).

cnf(c_0_118,negated_conjecture,
    join(one,complement(converse(esk1_0))) = top,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_91]),c_0_26]) ).

cnf(c_0_119,negated_conjecture,
    join(composition(top,esk1_0),complement(converse(esk1_0))) = top,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_26]) ).

cnf(c_0_120,negated_conjecture,
    join(esk1_0,complement(converse(esk1_0))) = top,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_26]),c_0_119]),c_0_32]),c_0_26]) ).

cnf(c_0_121,negated_conjecture,
    join(esk1_0,converse(esk1_0)) = esk1_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_120]),c_0_38]),c_0_67]),c_0_46]) ).

cnf(c_0_122,negated_conjecture,
    converse(esk1_0) != esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_76]) ).

cnf(c_0_123,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_121]),c_0_26]),c_0_121]),c_0_122]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14  % Problem    : REL025+1 : TPTP v8.1.2. Released v4.0.0.
% 0.14/0.15  % Command    : run_E %s %d THM
% 0.16/0.37  % Computer : n022.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 2400
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Mon Oct  2 15:16:39 EDT 2023
% 0.16/0.37  % CPUTime    : 
% 0.22/0.52  Running first-order model finding
% 0.22/0.52  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.45SzPE5wV4/E---3.1_8868.p
% 2.07/1.03  # Version: 3.1pre001
% 2.07/1.03  # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.07/1.03  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.07/1.03  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.07/1.03  # Starting new_bool_3 with 300s (1) cores
% 2.07/1.03  # Starting new_bool_1 with 300s (1) cores
% 2.07/1.03  # Starting sh5l with 300s (1) cores
% 2.07/1.03  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 8945 completed with status 0
% 2.07/1.03  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.07/1.03  # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.07/1.03  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.07/1.03  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.07/1.03  # No SInE strategy applied
% 2.07/1.03  # Search class: FUUPM-FFSF21-MFFFFFNN
% 2.07/1.03  # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.07/1.03  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 2.07/1.03  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.07/1.03  # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 136s (1) cores
% 2.07/1.03  # Starting U----_043_B31_F1_PI_AE_CS_SP_S2S with 136s (1) cores
% 2.07/1.03  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 2.07/1.03  # H----_047_C09_12_F1_AE_ND_CS_SP_S2S with pid 8946 completed with status 0
% 2.07/1.03  # Result found by H----_047_C09_12_F1_AE_ND_CS_SP_S2S
% 2.07/1.03  # Preprocessing class: FSMSSMSSSSSNFFN.
% 2.07/1.03  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.07/1.03  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.07/1.03  # No SInE strategy applied
% 2.07/1.03  # Search class: FUUPM-FFSF21-MFFFFFNN
% 2.07/1.03  # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.07/1.03  # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 675s (1) cores
% 2.07/1.03  # Preprocessing time       : 0.001 s
% 2.07/1.03  # Presaturation interreduction done
% 2.07/1.03  
% 2.07/1.03  # Proof found!
% 2.07/1.03  # SZS status Theorem
% 2.07/1.03  # SZS output start CNFRefutation
% See solution above
% 2.07/1.03  # Parsed axioms                        : 14
% 2.07/1.03  # Removed by relevancy pruning/SinE    : 0
% 2.07/1.03  # Initial clauses                      : 15
% 2.07/1.03  # Removed in clause preprocessing      : 1
% 2.07/1.03  # Initial clauses in saturation        : 14
% 2.07/1.03  # Processed clauses                    : 2573
% 2.07/1.03  # ...of these trivial                  : 1560
% 2.07/1.03  # ...subsumed                          : 479
% 2.07/1.03  # ...remaining for further processing  : 534
% 2.07/1.03  # Other redundant clauses eliminated   : 0
% 2.07/1.03  # Clauses deleted for lack of memory   : 0
% 2.07/1.03  # Backward-subsumed                    : 0
% 2.07/1.03  # Backward-rewritten                   : 114
% 2.07/1.03  # Generated clauses                    : 60359
% 2.07/1.03  # ...of the previous two non-redundant : 27601
% 2.07/1.03  # ...aggressively subsumed             : 0
% 2.07/1.03  # Contextual simplify-reflections      : 0
% 2.07/1.03  # Paramodulations                      : 60359
% 2.07/1.03  # Factorizations                       : 0
% 2.07/1.03  # NegExts                              : 0
% 2.07/1.03  # Equation resolutions                 : 0
% 2.07/1.03  # Total rewrite steps                  : 116234
% 2.07/1.03  # Propositional unsat checks           : 0
% 2.07/1.03  #    Propositional check models        : 0
% 2.07/1.03  #    Propositional check unsatisfiable : 0
% 2.07/1.03  #    Propositional clauses             : 0
% 2.07/1.03  #    Propositional clauses after purity: 0
% 2.07/1.03  #    Propositional unsat core size     : 0
% 2.07/1.03  #    Propositional preprocessing time  : 0.000
% 2.07/1.03  #    Propositional encoding time       : 0.000
% 2.07/1.03  #    Propositional solver time         : 0.000
% 2.07/1.03  #    Success case prop preproc time    : 0.000
% 2.07/1.03  #    Success case prop encoding time   : 0.000
% 2.07/1.03  #    Success case prop solver time     : 0.000
% 2.07/1.03  # Current number of processed clauses  : 406
% 2.07/1.03  #    Positive orientable unit clauses  : 400
% 2.07/1.03  #    Positive unorientable unit clauses: 5
% 2.07/1.03  #    Negative unit clauses             : 1
% 2.07/1.03  #    Non-unit-clauses                  : 0
% 2.07/1.03  # Current number of unprocessed clauses: 24679
% 2.07/1.03  # ...number of literals in the above   : 24679
% 2.07/1.03  # Current number of archived formulas  : 0
% 2.07/1.03  # Current number of archived clauses   : 129
% 2.07/1.03  # Clause-clause subsumption calls (NU) : 0
% 2.07/1.03  # Rec. Clause-clause subsumption calls : 0
% 2.07/1.03  # Non-unit clause-clause subsumptions  : 0
% 2.07/1.03  # Unit Clause-clause subsumption calls : 24
% 2.07/1.03  # Rewrite failures with RHS unbound    : 0
% 2.07/1.03  # BW rewrite match attempts            : 1897
% 2.07/1.03  # BW rewrite match successes           : 262
% 2.07/1.03  # Condensation attempts                : 0
% 2.07/1.03  # Condensation successes               : 0
% 2.07/1.03  # Termbank termtop insertions          : 690895
% 2.07/1.03  
% 2.07/1.03  # -------------------------------------------------
% 2.07/1.03  # User time                : 0.325 s
% 2.07/1.03  # System time              : 0.027 s
% 2.07/1.03  # Total time               : 0.352 s
% 2.07/1.03  # Maximum resident set size: 1696 pages
% 2.07/1.03  
% 2.07/1.03  # -------------------------------------------------
% 2.07/1.03  # User time                : 1.801 s
% 2.07/1.03  # System time              : 0.098 s
% 2.07/1.03  # Total time               : 1.899 s
% 2.07/1.03  # Maximum resident set size: 1676 pages
% 2.07/1.03  % E---3.1 exiting
%------------------------------------------------------------------------------