↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : REL043+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:04:08 PM UTC 2026

% Result   : Theorem 0.16s 5.88s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   30
%            Number of leaves      :   15
% Syntax   : Number of formulae    :  112 ( 109 unt;   0 def)
%            Number of atoms       :  115 ( 114 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    7 (   4   ~;   0   |;   1   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 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   :  157 (  14 sgn  62   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(converse_multiplicativity,axiom,
    ! [X1,X2] : converse(composition(X1,X2)) = composition(converse(X2),converse(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_multiplicativity) ).

fof(converse_idempotence,axiom,
    ! [X1] : converse(converse(X1)) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_idempotence) ).

fof(composition_identity,axiom,
    ! [X1] : composition(X1,one) = X1,
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_identity) ).

fof(converse_cancellativity,axiom,
    ! [X1,X2] : join(composition(converse(X1),complement(composition(X1,X2))),complement(X2)) = complement(X2),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_cancellativity) ).

fof(maddux1_join_commutativity,axiom,
    ! [X1,X2] : join(X1,X2) = join(X2,X1),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux1_join_commutativity) ).

fof(def_zero,axiom,
    ! [X1] : zero = meet(X1,complement(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',def_zero) ).

fof(maddux4_definiton_of_meet,axiom,
    ! [X1,X2] : meet(X1,X2) = complement(join(complement(X1),complement(X2))),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',maddux4_definiton_of_meet) ).

fof(def_top,axiom,
    ! [X1] : top = join(X1,complement(X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',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/sandbox/benchmark/Axioms/REL001+0.ax',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/sandbox/benchmark/Axioms/REL001+0.ax',maddux2_join_associativity) ).

fof(goals,conjecture,
    ! [X1,X2,X3] :
      ( join(composition(X1,converse(X2)),X3) = X3
     => join(composition(complement(X3),X2),complement(X1)) = complement(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(converse_additivity,axiom,
    ! [X1,X2] : converse(join(X1,X2)) = join(converse(X1),converse(X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',converse_additivity) ).

fof(composition_distributivity,axiom,
    ! [X1,X2,X3] : composition(join(X1,X2),X3) = join(composition(X1,X3),composition(X2,X3)),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',composition_distributivity) ).

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/sandbox/benchmark/Axioms/REL001+1.ax',dedekind_law) ).

fof(composition_associativity,axiom,
    ! [X1,X2,X3] : composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
    file('/export/starexec/sandbox/benchmark/Axioms/REL001+0.ax',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]) ).

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

cnf(c_0_46,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]) ).

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

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

cnf(c_0_49,plain,
    join(X1,X1) = X1,
    inference(spm,[status(thm)],[c_0_39,c_0_48]) ).

fof(c_0_50,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( join(composition(X1,converse(X2)),X3) = X3
       => join(composition(complement(X3),X2),complement(X1)) = complement(X1) ),
    inference(assume_negation,[status(cth)],[goals]) ).

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

fof(c_0_52,negated_conjecture,
    ( join(composition(complement(esk3_0),esk2_0),complement(esk1_0)) != complement(esk1_0)
    & join(composition(esk1_0,converse(esk2_0)),esk3_0) = esk3_0 ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])])])]) ).

cnf(c_0_53,plain,
    join(X1,top) = top,
    inference(spm,[status(thm)],[c_0_51,c_0_36]) ).

cnf(c_0_54,negated_conjecture,
    join(composition(esk1_0,converse(esk2_0)),esk3_0) = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_52]) ).

cnf(c_0_55,plain,
    join(top,X1) = top,
    inference(spm,[status(thm)],[c_0_28,c_0_53]) ).

cnf(c_0_56,negated_conjecture,
    join(esk3_0,composition(esk1_0,converse(esk2_0))) = esk3_0,
    inference(rw,[status(thm)],[c_0_54,c_0_28]) ).

cnf(c_0_57,plain,
    join(X1,join(complement(X1),X2)) = top,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_36]),c_0_55]) ).

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

cnf(c_0_59,negated_conjecture,
    join(esk3_0,join(composition(esk1_0,converse(esk2_0)),X1)) = join(esk3_0,X1),
    inference(spm,[status(thm)],[c_0_42,c_0_56]) ).

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

cnf(c_0_61,plain,
    join(complement(X1),join(X1,X2)) = top,
    inference(spm,[status(thm)],[c_0_57,c_0_48]) ).

cnf(c_0_62,negated_conjecture,
    join(composition(esk1_0,converse(esk2_0)),join(esk3_0,X1)) = join(esk3_0,X1),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_42]),c_0_58]) ).

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

cnf(c_0_64,negated_conjecture,
    join(complement(composition(esk1_0,converse(esk2_0))),join(esk3_0,X1)) = top,
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_65,plain,
    converse(join(converse(X1),X2)) = join(X1,converse(X2)),
    inference(spm,[status(thm)],[c_0_63,c_0_18]) ).

cnf(c_0_66,plain,
    join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
    inference(spm,[status(thm)],[c_0_28,c_0_42]) ).

cnf(c_0_67,negated_conjecture,
    complement(join(complement(composition(esk1_0,converse(esk2_0))),complement(join(esk3_0,X1)))) = composition(esk1_0,converse(esk2_0)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_64]),c_0_40]),c_0_47]) ).

cnf(c_0_68,plain,
    join(X1,zero) = X1,
    inference(spm,[status(thm)],[c_0_28,c_0_47]) ).

cnf(c_0_69,plain,
    join(X1,converse(complement(converse(X1)))) = converse(top),
    inference(spm,[status(thm)],[c_0_65,c_0_36]) ).

cnf(c_0_70,plain,
    join(X1,join(X2,complement(X1))) = top,
    inference(rw,[status(thm)],[c_0_61,c_0_66]) ).

cnf(c_0_71,plain,
    join(converse(X1),join(converse(X2),X3)) = join(converse(join(X1,X2)),X3),
    inference(spm,[status(thm)],[c_0_42,c_0_63]) ).

cnf(c_0_72,negated_conjecture,
    complement(join(complement(esk3_0),complement(composition(esk1_0,converse(esk2_0))))) = composition(esk1_0,converse(esk2_0)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_28]) ).

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

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

cnf(c_0_75,negated_conjecture,
    join(complement(esk3_0),complement(composition(esk1_0,converse(esk2_0)))) = complement(composition(esk1_0,converse(esk2_0))),
    inference(spm,[status(thm)],[c_0_48,c_0_72]) ).

cnf(c_0_76,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_77,plain,
    converse(composition(top,X1)) = composition(converse(X1),top),
    inference(spm,[status(thm)],[c_0_20,c_0_73]) ).

cnf(c_0_78,plain,
    join(X1,complement(join(complement(X1),X2))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_44]),c_0_28]) ).

cnf(c_0_79,plain,
    converse(join(X1,converse(X2))) = join(converse(X1),X2),
    inference(spm,[status(thm)],[c_0_63,c_0_18]) ).

cnf(c_0_80,negated_conjecture,
    join(complement(converse(complement(esk3_0))),converse(complement(composition(esk1_0,converse(esk2_0))))) = top,
    inference(spm,[status(thm)],[c_0_74,c_0_75]) ).

fof(c_0_81,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_82,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_76,c_0_77]),c_0_73]),c_0_40]),c_0_47]),c_0_73]),c_0_40]) ).

fof(c_0_83,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_84,plain,
    join(X1,complement(join(X2,complement(X1)))) = X1,
    inference(spm,[status(thm)],[c_0_78,c_0_58]) ).

cnf(c_0_85,negated_conjecture,
    join(complement(composition(esk1_0,converse(esk2_0))),converse(complement(converse(complement(esk3_0))))) = top,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_73]),c_0_28]) ).

fof(c_0_86,plain,
    ! [X13,X14,X15] : composition(X13,composition(X14,X15)) = composition(composition(X13,X14),X15),
    inference(variable_rename,[status(thm)],[composition_associativity]) ).

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

cnf(c_0_88,plain,
    composition(top,complement(composition(top,top))) = zero,
    inference(spm,[status(thm)],[c_0_82,c_0_73]) ).

cnf(c_0_89,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_83]) ).

cnf(c_0_90,plain,
    join(complement(X1),complement(join(X2,X1))) = complement(X1),
    inference(spm,[status(thm)],[c_0_84,c_0_48]) ).

cnf(c_0_91,negated_conjecture,
    complement(join(complement(composition(esk1_0,converse(esk2_0))),complement(converse(complement(converse(complement(esk3_0))))))) = composition(esk1_0,converse(esk2_0)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_85]),c_0_40]),c_0_47]) ).

cnf(c_0_92,plain,
    composition(X1,composition(X2,X3)) = composition(composition(X1,X2),X3),
    inference(split_conjunct,[status(thm)],[c_0_86]) ).

cnf(c_0_93,plain,
    composition(X1,complement(composition(top,top))) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_47]),c_0_55]),c_0_88]) ).

cnf(c_0_94,plain,
    join(converse(zero),X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_47]),c_0_18]) ).

cnf(c_0_95,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_89,c_0_31]),c_0_31]),c_0_31]),c_0_31]),c_0_31]) ).

cnf(c_0_96,negated_conjecture,
    join(composition(esk1_0,converse(esk2_0)),converse(complement(converse(complement(esk3_0))))) = converse(complement(converse(complement(esk3_0)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_48]),c_0_48]),c_0_28]) ).

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

cnf(c_0_98,plain,
    composition(X1,zero) = zero,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_93]) ).

cnf(c_0_99,plain,
    converse(zero) = zero,
    inference(spm,[status(thm)],[c_0_68,c_0_94]) ).

cnf(c_0_100,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_44,c_0_95]) ).

cnf(c_0_101,negated_conjecture,
    join(complement(converse(complement(esk3_0))),complement(composition(esk2_0,converse(esk1_0)))) = top,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_96]),c_0_97]),c_0_18]),c_0_28]) ).

cnf(c_0_102,plain,
    composition(zero,X1) = zero,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_98]),c_0_99]),c_0_99]) ).

cnf(c_0_103,plain,
    complement(zero) = top,
    inference(spm,[status(thm)],[c_0_36,c_0_47]) ).

cnf(c_0_104,negated_conjecture,
    join(esk3_0,complement(composition(esk1_0,converse(esk2_0)))) = join(esk3_0,top),
    inference(spm,[status(thm)],[c_0_59,c_0_36]) ).

cnf(c_0_105,negated_conjecture,
    join(complement(esk2_0),complement(composition(converse(complement(esk3_0)),esk1_0))) = 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_100,c_0_101]),c_0_40]),c_0_18]),c_0_102]),c_0_103]),c_0_40]),c_0_18]),c_0_102]),c_0_103]),c_0_53]),c_0_40]),c_0_68]),c_0_28]) ).

cnf(c_0_106,negated_conjecture,
    join(esk3_0,complement(composition(esk1_0,converse(esk2_0)))) = top,
    inference(rw,[status(thm)],[c_0_104,c_0_53]) ).

cnf(c_0_107,negated_conjecture,
    join(complement(esk1_0),complement(composition(complement(esk3_0),esk2_0))) = 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_100,c_0_105]),c_0_48]),c_0_106]),c_0_40]),c_0_40]),c_0_98]),c_0_103]),c_0_48]),c_0_106]),c_0_40]),c_0_40]),c_0_98]),c_0_103]),c_0_53]),c_0_40]),c_0_68]),c_0_28]) ).

cnf(c_0_108,negated_conjecture,
    join(composition(complement(esk3_0),esk2_0),complement(esk1_0)) != complement(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_52]) ).

cnf(c_0_109,negated_conjecture,
    complement(join(complement(esk1_0),composition(complement(esk3_0),esk2_0))) = esk1_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_107]),c_0_40]),c_0_48]),c_0_47]) ).

cnf(c_0_110,negated_conjecture,
    join(complement(esk1_0),composition(complement(esk3_0),esk2_0)) != complement(esk1_0),
    inference(rw,[status(thm)],[c_0_108,c_0_28]) ).

cnf(c_0_111,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_109]),c_0_110]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : REL043+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/5.38  % Computer : n017.cluster.edu
% 0.12/5.38  % Model    : x86_64 x86_64
% 0.12/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/5.38  % Memory   : 8046.5625MB
% 0.12/5.38  % OS       : Linux 6.8.0-71-generic
% 0.12/5.39  % CPULimit : 300
% 0.12/5.39  % WCLimit  : 300
% 0.12/5.39  % DateTime : Mon Sep 21 04:03:32 UTC 2026
% 0.12/5.39  % CPUTime  : 
% 0.12/5.39  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.46  Running first-order theorem proving
% 0.16/5.46  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
% 0.16/5.88  % Version: 3.5.1
% 0.16/5.88  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.88  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.88  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.88  % Starting new_bool_3 with 300s (1) cores
% 0.16/5.88  % Starting new_bool_1 with 300s (1) cores
% 0.16/5.88  % Starting sh5l with 300s (1) cores
% 0.16/5.88  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1387206 completed with status 0
% 0.16/5.88  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/5.88  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.88  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.88  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.88  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.88  % No SInE strategy applied
% 0.16/5.88  % Search class: FUUPM-FFMF21-DFFFFFNN
% 0.16/5.88  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.88  % Starting SubtermCWHack with 136s (1) cores
% 0.16/5.88  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/5.88  % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.16/5.88  % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 0.16/5.88  % Starting new_bool_3 with 136s (1) cores
% 0.16/5.88  % new_bool_3 with pid 1387214 completed with status 0
% 0.16/5.88  % Result found by new_bool_3
% 0.16/5.88  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/5.88  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.88  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/5.88  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/5.88  % No SInE strategy applied
% 0.16/5.88  % Search class: FUUPM-FFMF21-DFFFFFNN
% 0.16/5.88  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/5.88  % Starting SubtermCWHack with 136s (1) cores
% 0.16/5.88  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/5.88  % Starting H----_047_B31_F1_PI_AE_R4_CS_SP_S2S with 136s (1) cores
% 0.16/5.88  % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S2S with 136s (1) cores
% 0.16/5.88  % Starting new_bool_3 with 136s (1) cores
% 0.16/5.88  % Preprocessing time       : 0.001 s
% 0.16/5.88  % Presaturation interreduction done
% 0.16/5.88  
% 0.16/5.88  % Proof found!
% 0.16/5.88  % SZS status Theorem
% 0.16/5.88  % SZS output start CNFRefutation
% See solution above
% 0.16/5.88  % Parsed axioms                        : 17
% 0.16/5.88  % Removed by relevancy pruning/SinE    : 0
% 0.16/5.88  % Initial clauses                      : 18
% 0.16/5.88  % Removed in clause preprocessing      : 1
% 0.16/5.88  % Initial clauses in saturation        : 17
% 0.16/5.88  % Processed clauses                    : 1201
% 0.16/5.88  % ...of these trivial                  : 699
% 0.16/5.88  % ...subsumed                          : 68
% 0.16/5.88  % ...remaining for further processing  : 434
% 0.16/5.88  % Other redundant clauses eliminated   : 0
% 0.16/5.88  % Clauses deleted for lack of memory   : 0
% 0.16/5.88  % Backward-subsumed                    : 0
% 0.16/5.88  % Backward-rewritten                   : 67
% 0.16/5.88  % Generated clauses                    : 24669
% 0.16/5.88  % ...of the previous two non-redundant : 14383
% 0.16/5.88  % ...aggressively subsumed             : 0
% 0.16/5.88  % Contextual simplify-reflections      : 0
% 0.16/5.88  % Paramodulations                      : 24669
% 0.16/5.88  % Factorizations                       : 0
% 0.16/5.88  % NegExts                              : 0
% 0.16/5.88  % Equation resolutions                 : 0
% 0.16/5.88  % Disequality decompositions           : 0
% 0.16/5.88  % Total rewrite steps                  : 59724
% 0.16/5.88  % ...of those cached                   : 52507
% 0.16/5.88  % Propositional unsat checks           : 0
% 0.16/5.88  %    Propositional check models        : 0
% 0.16/5.88  %    Propositional check unsatisfiable : 0
% 0.16/5.88  %    Propositional clauses             : 0
% 0.16/5.88  %    Propositional clauses after purity: 0
% 0.16/5.88  %    Propositional unsat core size     : 0
% 0.16/5.88  %    Propositional preprocessing time  : 0.000
% 0.16/5.88  %    Propositional encoding time       : 0.000
% 0.16/5.88  %    Propositional solver time         : 0.000
% 0.16/5.88  %    Success case prop preproc time    : 0.000
% 0.16/5.88  %    Success case prop encoding time   : 0.000
% 0.16/5.88  %    Success case prop solver time     : 0.000
% 0.16/5.88  % Current number of processed clauses  : 350
% 0.16/5.88  %    Positive orientable unit clauses  : 343
% 0.16/5.88  %    Positive unorientable unit clauses: 6
% 0.16/5.88  %    Negative unit clauses             : 1
% 0.16/5.88  %    Non-unit-clauses                  : 0
% 0.16/5.88  % Current number of unprocessed clauses: 13048
% 0.16/5.88  % ...number of literals in the above   : 13048
% 0.16/5.88  % Current number of archived formulas  : 0
% 0.16/5.88  % Current number of archived clauses   : 85
% 0.16/5.88  % Clause-clause subsumption calls (NU) : 0
% 0.16/5.88  % Rec. Clause-clause subsumption calls : 0
% 0.16/5.88  % Non-unit clause-clause subsumptions  : 0
% 0.16/5.88  % Unit Clause-clause subsumption calls : 49
% 0.16/5.88  % Rewrite failures with RHS unbound    : 0
% 0.16/5.88  % BW rewrite match attempts            : 2072
% 0.16/5.88  % BW rewrite match successes           : 217
% 0.16/5.88  % Condensation attempts                : 0
% 0.16/5.88  % Condensation successes               : 0
% 0.16/5.88  % Termbank termtop insertions          : 627396
% 0.16/5.88  % Search garbage collected termcells   : 35
% 0.16/5.88  
% 0.16/5.88  % -------------------------------------------------
% 0.16/5.88  % User time                : 0.333 s
% 0.16/5.88  % System time              : 0.031 s
% 0.16/5.88  % Total time               : 0.364 s
% 0.16/5.88  % Maximum resident set size: 3652 pages
% 0.16/5.88  
% 0.16/5.88  % -------------------------------------------------
% 0.16/5.88  % User time                : 1.546 s
% 0.16/5.88  % System time              : 0.116 s
% 0.16/5.88  % Total time               : 1.662 s
% 0.16/5.88  % Maximum resident set size: 4608 pages
% 0.16/5.88  % E exiting
%------------------------------------------------------------------------------