↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SEU261+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n016.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 08:58:46 AM UTC 2026

% Result   : Theorem 0.09s 0.85s
% Output   : Proof 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :  133 (  97 unt;   0 def)
%            Number of atoms       :  345 (   0 equ)
%            Maximal formula atoms :   15 (   2 avg)
%            Number of connectives :  347 ( 135   ~; 126   |;  67   &)
%                                         (   1 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   48 (   0 sgn  18   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(d4_wellord1,axiom,
    ! [A] :
      ( relation(A)
     => ( well_ordering(A)
      <=> ( well_founded_relation(A)
          & connected(A)
          & antisymmetric(A)
          & transitive(A)
          & reflexive(A) ) ) ),
    file('theBenchmark.p',d4_wellord1) ).

fof(t53_wellord1,axiom,
    ! [A] :
      ( relation(A)
     => ! [B] :
          ( relation(B)
         => ! [C] :
              ( ( function(C)
                & relation(C) )
             => ( relation_isomorphism(A,B,C)
               => ( ( well_founded_relation(A)
                   => well_founded_relation(B) )
                  & ( antisymmetric(A)
                   => antisymmetric(B) )
                  & ( connected(A)
                   => connected(B) )
                  & ( transitive(A)
                   => transitive(B) )
                  & ( reflexive(A)
                   => reflexive(B) ) ) ) ) ) ),
    file('theBenchmark.p',t53_wellord1) ).

fof(t54_wellord1,conjecture,
    ! [A] :
      ( relation(A)
     => ! [B] :
          ( relation(B)
         => ! [C] :
              ( ( function(C)
                & relation(C) )
             => ( ( relation_isomorphism(A,B,C)
                  & well_ordering(A) )
               => well_ordering(B) ) ) ) ),
    file('theBenchmark.p',t54_wellord1) ).

fof(f_1_1,plain,
    ! [A] :
      ( ( ( well_ordering(A)
          | ~ well_founded_relation(A)
          | ~ connected(A)
          | ~ antisymmetric(A)
          | ~ transitive(A)
          | ~ reflexive(A) )
        & ( ( well_founded_relation(A)
            & connected(A)
            & antisymmetric(A)
            & transitive(A)
            & reflexive(A) )
          | ~ well_ordering(A) ) )
      | ~ relation(A) ),
    inference(fof_nnf,[status(thm)],[d4_wellord1]) ).

fof(f_1_2,plain,
    ! [U_0] :
      ( ( ( well_ordering(U_0)
          | ~ well_founded_relation(U_0)
          | ~ connected(U_0)
          | ~ antisymmetric(U_0)
          | ~ transitive(U_0)
          | ~ reflexive(U_0) )
        & ( ( well_founded_relation(U_0)
            & connected(U_0)
            & antisymmetric(U_0)
            & transitive(U_0)
            & reflexive(U_0) )
          | ~ well_ordering(U_0) ) )
      | ~ relation(U_0) ),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

cnf(f_1_3,plain,
    ( reflexive(U_0)
    | ~ well_ordering(U_0)
    | ~ relation(U_0) ),
    inference(clausify,[status(thm)],[f_1_2]) ).

cnf(f_1_4,plain,
    ( transitive(U_0)
    | ~ well_ordering(U_0)
    | ~ relation(U_0) ),
    inference(clausify,[status(thm)],[f_1_2]) ).

cnf(f_1_5,plain,
    ( antisymmetric(U_0)
    | ~ well_ordering(U_0)
    | ~ relation(U_0) ),
    inference(clausify,[status(thm)],[f_1_2]) ).

cnf(f_1_6,plain,
    ( connected(U_0)
    | ~ well_ordering(U_0)
    | ~ relation(U_0) ),
    inference(clausify,[status(thm)],[f_1_2]) ).

cnf(f_1_7,plain,
    ( well_founded_relation(U_0)
    | ~ well_ordering(U_0)
    | ~ relation(U_0) ),
    inference(clausify,[status(thm)],[f_1_2]) ).

cnf(f_1_8,plain,
    ( well_ordering(U_0)
    | ~ well_founded_relation(U_0)
    | ~ connected(U_0)
    | ~ antisymmetric(U_0)
    | ~ transitive(U_0)
    | ~ reflexive(U_0)
    | ~ relation(U_0) ),
    inference(clausify,[status(thm)],[f_1_2]) ).

fof(f_3_1,plain,
    ! [A] :
      ( ! [B] :
          ( ! [C] :
              ( ( ( well_founded_relation(B)
                  | ~ well_founded_relation(A) )
                & ( antisymmetric(B)
                  | ~ antisymmetric(A) )
                & ( connected(B)
                  | ~ connected(A) )
                & ( transitive(B)
                  | ~ transitive(A) )
                & ( reflexive(B)
                  | ~ reflexive(A) ) )
              | ~ relation_isomorphism(A,B,C)
              | ~ function(C)
              | ~ relation(C) )
          | ~ relation(B) )
      | ~ relation(A) ),
    inference(fof_nnf,[status(thm)],[t53_wellord1]) ).

fof(f_3_2,plain,
    ! [U_4] :
      ( ! [U_3] :
          ( ! [U_2] :
              ( ( ( well_founded_relation(U_3)
                  | ~ well_founded_relation(U_4) )
                & ( antisymmetric(U_3)
                  | ~ antisymmetric(U_4) )
                & ( connected(U_3)
                  | ~ connected(U_4) )
                & ( transitive(U_3)
                  | ~ transitive(U_4) )
                & ( reflexive(U_3)
                  | ~ reflexive(U_4) ) )
              | ~ relation_isomorphism(U_4,U_3,U_2)
              | ~ function(U_2)
              | ~ relation(U_2) )
          | ~ relation(U_3) )
      | ~ relation(U_4) ),
    inference(variable_rename,[status(thm)],[f_3_1]) ).

cnf(f_3_3,plain,
    ( reflexive(U_3)
    | ~ reflexive(U_4)
    | ~ relation_isomorphism(U_4,U_3,U_2)
    | ~ function(U_2)
    | ~ relation(U_2)
    | ~ relation(U_3)
    | ~ relation(U_4) ),
    inference(clausify,[status(thm)],[f_3_2]) ).

cnf(f_3_4,plain,
    ( transitive(U_3)
    | ~ transitive(U_4)
    | ~ relation_isomorphism(U_4,U_3,U_2)
    | ~ function(U_2)
    | ~ relation(U_2)
    | ~ relation(U_3)
    | ~ relation(U_4) ),
    inference(clausify,[status(thm)],[f_3_2]) ).

cnf(f_3_5,plain,
    ( connected(U_3)
    | ~ connected(U_4)
    | ~ relation_isomorphism(U_4,U_3,U_2)
    | ~ function(U_2)
    | ~ relation(U_2)
    | ~ relation(U_3)
    | ~ relation(U_4) ),
    inference(clausify,[status(thm)],[f_3_2]) ).

cnf(f_3_6,plain,
    ( antisymmetric(U_3)
    | ~ antisymmetric(U_4)
    | ~ relation_isomorphism(U_4,U_3,U_2)
    | ~ function(U_2)
    | ~ relation(U_2)
    | ~ relation(U_3)
    | ~ relation(U_4) ),
    inference(clausify,[status(thm)],[f_3_2]) ).

cnf(f_3_7,plain,
    ( well_founded_relation(U_3)
    | ~ well_founded_relation(U_4)
    | ~ relation_isomorphism(U_4,U_3,U_2)
    | ~ function(U_2)
    | ~ relation(U_2)
    | ~ relation(U_3)
    | ~ relation(U_4) ),
    inference(clausify,[status(thm)],[f_3_2]) ).

fof(f_4_1,negated_conjecture,
    ~ ! [A] :
        ( relation(A)
       => ! [B] :
            ( relation(B)
           => ! [C] :
                ( ( function(C)
                  & relation(C) )
               => ( ( relation_isomorphism(A,B,C)
                    & well_ordering(A) )
                 => well_ordering(B) ) ) ) ),
    inference(negate,[status(cth)],[t54_wellord1]) ).

fof(f_4_2,negated_conjecture,
    ? [A] :
      ( ? [B] :
          ( ? [C] :
              ( ~ well_ordering(B)
              & relation_isomorphism(A,B,C)
              & well_ordering(A)
              & function(C)
              & relation(C) )
          & relation(B) )
      & relation(A) ),
    inference(fof_nnf,[status(thm)],[f_4_1]) ).

fof(f_4_3,negated_conjecture,
    ? [U_7] :
      ( ? [U_6] :
          ( ? [U_5] :
              ( ~ well_ordering(U_6)
              & relation_isomorphism(U_7,U_6,U_5)
              & well_ordering(U_7)
              & function(U_5)
              & relation(U_5) )
          & relation(U_6) )
      & relation(U_7) ),
    inference(variable_rename,[status(thm)],[f_4_2]) ).

fof(f_4_4,negated_conjecture,
    ( ? [U_6] :
        ( ? [U_5] :
            ( ~ well_ordering(U_6)
            & relation_isomorphism(sK2,U_6,U_5)
            & well_ordering(sK2)
            & function(U_5)
            & relation(U_5) )
        & relation(U_6) )
    & relation(sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_7,sK2)],[f_4_3]) ).

fof(f_4_5,negated_conjecture,
    ( ? [U_5] :
        ( ~ well_ordering(sK3)
        & relation_isomorphism(sK2,sK3,U_5)
        & well_ordering(sK2)
        & function(U_5)
        & relation(U_5) )
    & relation(sK3)
    & relation(sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_6,sK3)],[f_4_4]) ).

fof(f_4_6,negated_conjecture,
    ( ~ well_ordering(sK3)
    & relation_isomorphism(sK2,sK3,sK4)
    & well_ordering(sK2)
    & function(sK4)
    & relation(sK4)
    & relation(sK3)
    & relation(sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_5,sK4)],[f_4_5]) ).

fof(f_4_7,negated_conjecture,
    ( ~ well_ordering(sK3)
    & relation_isomorphism(sK2,sK3,sK4)
    & well_ordering(sK2)
    & function(sK4)
    & relation(sK4)
    & relation(sK3)
    & relation(sK2) ),
    inference(definitional_conversion,[status(esa)],[f_4_6]) ).

cnf(f_4_8,negated_conjecture,
    relation(sK2),
    inference(clausify,[status(thm)],[f_4_7]) ).

cnf(f_4_9,negated_conjecture,
    relation(sK3),
    inference(clausify,[status(thm)],[f_4_7]) ).

cnf(f_4_10,negated_conjecture,
    relation(sK4),
    inference(clausify,[status(thm)],[f_4_7]) ).

cnf(f_4_11,negated_conjecture,
    function(sK4),
    inference(clausify,[status(thm)],[f_4_7]) ).

cnf(f_4_12,negated_conjecture,
    well_ordering(sK2),
    inference(clausify,[status(thm)],[f_4_7]) ).

cnf(f_4_13,negated_conjecture,
    relation_isomorphism(sK2,sK3,sK4),
    inference(clausify,[status(thm)],[f_4_7]) ).

cnf(f_4_14,negated_conjecture,
    ~ well_ordering(sK3),
    inference(clausify,[status(thm)],[f_4_7]) ).

cnf(t1,plain,
    ~ well_ordering(sK3),
    inference(start,[status(thm),parent(0:0)],[f_4_14]) ).

cnf(t2,plain,
    ( ~ reflexive(sK3)
    | ~ transitive(sK3)
    | ~ antisymmetric(sK3)
    | ~ connected(sK3)
    | ~ well_founded_relation(sK3)
    | ~ relation(sK3)
    | well_ordering(sK3) ),
    inference(extension,[status(thm),parent(t1:1)],[f_1_8]) ).

cnf(t3,plain,
    $false,
    inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).

cnf(t4,plain,
    relation(sK3),
    inference(extension,[status(thm),parent(t2:2)],[f_4_9]) ).

cnf(t5,plain,
    $false,
    inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).

cnf(l2,lemma,
    relation(sK3),
    inference(lemma,[status(cth),parent(t2:2),below(t1:1)],[t2:2]) ).

cnf(t6,plain,
    ( ~ relation(sK3)
    | ~ relation(sK4)
    | ~ function(sK4)
    | ~ relation_isomorphism(sK2,sK3,sK4)
    | ~ well_founded_relation(sK2)
    | ~ relation(sK2)
    | well_founded_relation(sK3) ),
    inference(extension,[status(thm),parent(t2:3)],[f_3_7]) ).

cnf(t7,plain,
    $false,
    inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).

cnf(t8,plain,
    relation(sK2),
    inference(extension,[status(thm),parent(t6:2)],[f_4_8]) ).

cnf(t9,plain,
    $false,
    inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).

cnf(l4,lemma,
    relation(sK2),
    inference(lemma,[status(cth),parent(t6:2),below(t2:3)],[t6:2]) ).

cnf(t10,plain,
    ( ~ well_ordering(sK2)
    | ~ relation(sK2)
    | well_founded_relation(sK2) ),
    inference(extension,[status(thm),parent(t6:3)],[f_1_7]) ).

cnf(t11,plain,
    $false,
    inference(connection,[status(thm),parent(t10:1)],[t10:1,t6:3]) ).

cnf(t12,plain,
    relation(sK2),
    inference(lemma_extension,[status(thm),parent(t10:2)],[l4:1]) ).

cnf(t13,plain,
    $false,
    inference(connection,[status(thm),parent(t12:1)],[t12:1,t10:2]) ).

cnf(t14,plain,
    well_ordering(sK2),
    inference(extension,[status(thm),parent(t10:3)],[f_4_12]) ).

cnf(t15,plain,
    $false,
    inference(connection,[status(thm),parent(t14:1)],[t14:1,t10:3]) ).

cnf(t16,plain,
    relation_isomorphism(sK2,sK3,sK4),
    inference(extension,[status(thm),parent(t6:4)],[f_4_13]) ).

cnf(t17,plain,
    $false,
    inference(connection,[status(thm),parent(t16:1)],[t16:1,t6:4]) ).

cnf(t18,plain,
    function(sK4),
    inference(extension,[status(thm),parent(t6:5)],[f_4_11]) ).

cnf(t19,plain,
    $false,
    inference(connection,[status(thm),parent(t18:1)],[t18:1,t6:5]) ).

cnf(t20,plain,
    relation(sK4),
    inference(extension,[status(thm),parent(t6:6)],[f_4_10]) ).

cnf(t21,plain,
    $false,
    inference(connection,[status(thm),parent(t20:1)],[t20:1,t6:6]) ).

cnf(t22,plain,
    relation(sK3),
    inference(lemma_extension,[status(thm),parent(t6:7)],[l2:1]) ).

cnf(t23,plain,
    $false,
    inference(connection,[status(thm),parent(t22:1)],[t22:1,t6:7]) ).

cnf(t24,plain,
    ( ~ relation(sK3)
    | ~ relation(sK4)
    | ~ function(sK4)
    | ~ relation_isomorphism(sK2,sK3,sK4)
    | ~ connected(sK2)
    | ~ relation(sK2)
    | connected(sK3) ),
    inference(extension,[status(thm),parent(t2:4)],[f_3_5]) ).

cnf(t25,plain,
    $false,
    inference(connection,[status(thm),parent(t24:1)],[t24:1,t2:4]) ).

cnf(t26,plain,
    relation(sK2),
    inference(extension,[status(thm),parent(t24:2)],[f_4_8]) ).

cnf(t27,plain,
    $false,
    inference(connection,[status(thm),parent(t26:1)],[t26:1,t24:2]) ).

cnf(l11,lemma,
    relation(sK2),
    inference(lemma,[status(cth),parent(t24:2),below(t2:4)],[t24:2]) ).

cnf(t28,plain,
    ( ~ well_ordering(sK2)
    | ~ relation(sK2)
    | connected(sK2) ),
    inference(extension,[status(thm),parent(t24:3)],[f_1_6]) ).

cnf(t29,plain,
    $false,
    inference(connection,[status(thm),parent(t28:1)],[t28:1,t24:3]) ).

cnf(t30,plain,
    relation(sK2),
    inference(lemma_extension,[status(thm),parent(t28:2)],[l11:1]) ).

cnf(t31,plain,
    $false,
    inference(connection,[status(thm),parent(t30:1)],[t30:1,t28:2]) ).

cnf(t32,plain,
    well_ordering(sK2),
    inference(extension,[status(thm),parent(t28:3)],[f_4_12]) ).

cnf(t33,plain,
    $false,
    inference(connection,[status(thm),parent(t32:1)],[t32:1,t28:3]) ).

cnf(t34,plain,
    relation_isomorphism(sK2,sK3,sK4),
    inference(extension,[status(thm),parent(t24:4)],[f_4_13]) ).

cnf(t35,plain,
    $false,
    inference(connection,[status(thm),parent(t34:1)],[t34:1,t24:4]) ).

cnf(t36,plain,
    function(sK4),
    inference(extension,[status(thm),parent(t24:5)],[f_4_11]) ).

cnf(t37,plain,
    $false,
    inference(connection,[status(thm),parent(t36:1)],[t36:1,t24:5]) ).

cnf(t38,plain,
    relation(sK4),
    inference(extension,[status(thm),parent(t24:6)],[f_4_10]) ).

cnf(t39,plain,
    $false,
    inference(connection,[status(thm),parent(t38:1)],[t38:1,t24:6]) ).

cnf(t40,plain,
    relation(sK3),
    inference(lemma_extension,[status(thm),parent(t24:7)],[l2:1]) ).

cnf(t41,plain,
    $false,
    inference(connection,[status(thm),parent(t40:1)],[t40:1,t24:7]) ).

cnf(t42,plain,
    ( ~ relation(sK3)
    | ~ relation(sK4)
    | ~ function(sK4)
    | ~ relation_isomorphism(sK2,sK3,sK4)
    | ~ antisymmetric(sK2)
    | ~ relation(sK2)
    | antisymmetric(sK3) ),
    inference(extension,[status(thm),parent(t2:5)],[f_3_6]) ).

cnf(t43,plain,
    $false,
    inference(connection,[status(thm),parent(t42:1)],[t42:1,t2:5]) ).

cnf(t44,plain,
    relation(sK2),
    inference(extension,[status(thm),parent(t42:2)],[f_4_8]) ).

cnf(t45,plain,
    $false,
    inference(connection,[status(thm),parent(t44:1)],[t44:1,t42:2]) ).

cnf(l18,lemma,
    relation(sK2),
    inference(lemma,[status(cth),parent(t42:2),below(t2:5)],[t42:2]) ).

cnf(t46,plain,
    ( ~ well_ordering(sK2)
    | ~ relation(sK2)
    | antisymmetric(sK2) ),
    inference(extension,[status(thm),parent(t42:3)],[f_1_5]) ).

cnf(t47,plain,
    $false,
    inference(connection,[status(thm),parent(t46:1)],[t46:1,t42:3]) ).

cnf(t48,plain,
    relation(sK2),
    inference(lemma_extension,[status(thm),parent(t46:2)],[l18:1]) ).

cnf(t49,plain,
    $false,
    inference(connection,[status(thm),parent(t48:1)],[t48:1,t46:2]) ).

cnf(t50,plain,
    well_ordering(sK2),
    inference(extension,[status(thm),parent(t46:3)],[f_4_12]) ).

cnf(t51,plain,
    $false,
    inference(connection,[status(thm),parent(t50:1)],[t50:1,t46:3]) ).

cnf(t52,plain,
    relation_isomorphism(sK2,sK3,sK4),
    inference(extension,[status(thm),parent(t42:4)],[f_4_13]) ).

cnf(t53,plain,
    $false,
    inference(connection,[status(thm),parent(t52:1)],[t52:1,t42:4]) ).

cnf(t54,plain,
    function(sK4),
    inference(extension,[status(thm),parent(t42:5)],[f_4_11]) ).

cnf(t55,plain,
    $false,
    inference(connection,[status(thm),parent(t54:1)],[t54:1,t42:5]) ).

cnf(t56,plain,
    relation(sK4),
    inference(extension,[status(thm),parent(t42:6)],[f_4_10]) ).

cnf(t57,plain,
    $false,
    inference(connection,[status(thm),parent(t56:1)],[t56:1,t42:6]) ).

cnf(t58,plain,
    relation(sK3),
    inference(lemma_extension,[status(thm),parent(t42:7)],[l2:1]) ).

cnf(t59,plain,
    $false,
    inference(connection,[status(thm),parent(t58:1)],[t58:1,t42:7]) ).

cnf(t60,plain,
    ( ~ relation(sK3)
    | ~ relation(sK4)
    | ~ function(sK4)
    | ~ relation_isomorphism(sK2,sK3,sK4)
    | ~ transitive(sK2)
    | ~ relation(sK2)
    | transitive(sK3) ),
    inference(extension,[status(thm),parent(t2:6)],[f_3_4]) ).

cnf(t61,plain,
    $false,
    inference(connection,[status(thm),parent(t60:1)],[t60:1,t2:6]) ).

cnf(t62,plain,
    relation(sK2),
    inference(extension,[status(thm),parent(t60:2)],[f_4_8]) ).

cnf(t63,plain,
    $false,
    inference(connection,[status(thm),parent(t62:1)],[t62:1,t60:2]) ).

cnf(l25,lemma,
    relation(sK2),
    inference(lemma,[status(cth),parent(t60:2),below(t2:6)],[t60:2]) ).

cnf(t64,plain,
    ( ~ well_ordering(sK2)
    | ~ relation(sK2)
    | transitive(sK2) ),
    inference(extension,[status(thm),parent(t60:3)],[f_1_4]) ).

cnf(t65,plain,
    $false,
    inference(connection,[status(thm),parent(t64:1)],[t64:1,t60:3]) ).

cnf(t66,plain,
    relation(sK2),
    inference(lemma_extension,[status(thm),parent(t64:2)],[l25:1]) ).

cnf(t67,plain,
    $false,
    inference(connection,[status(thm),parent(t66:1)],[t66:1,t64:2]) ).

cnf(t68,plain,
    well_ordering(sK2),
    inference(extension,[status(thm),parent(t64:3)],[f_4_12]) ).

cnf(t69,plain,
    $false,
    inference(connection,[status(thm),parent(t68:1)],[t68:1,t64:3]) ).

cnf(t70,plain,
    relation_isomorphism(sK2,sK3,sK4),
    inference(extension,[status(thm),parent(t60:4)],[f_4_13]) ).

cnf(t71,plain,
    $false,
    inference(connection,[status(thm),parent(t70:1)],[t70:1,t60:4]) ).

cnf(t72,plain,
    function(sK4),
    inference(extension,[status(thm),parent(t60:5)],[f_4_11]) ).

cnf(t73,plain,
    $false,
    inference(connection,[status(thm),parent(t72:1)],[t72:1,t60:5]) ).

cnf(t74,plain,
    relation(sK4),
    inference(extension,[status(thm),parent(t60:6)],[f_4_10]) ).

cnf(t75,plain,
    $false,
    inference(connection,[status(thm),parent(t74:1)],[t74:1,t60:6]) ).

cnf(t76,plain,
    relation(sK3),
    inference(lemma_extension,[status(thm),parent(t60:7)],[l2:1]) ).

cnf(t77,plain,
    $false,
    inference(connection,[status(thm),parent(t76:1)],[t76:1,t60:7]) ).

cnf(t78,plain,
    ( ~ relation(sK3)
    | ~ relation(sK4)
    | ~ function(sK4)
    | ~ relation_isomorphism(sK2,sK3,sK4)
    | ~ reflexive(sK2)
    | ~ relation(sK2)
    | reflexive(sK3) ),
    inference(extension,[status(thm),parent(t2:7)],[f_3_3]) ).

cnf(t79,plain,
    $false,
    inference(connection,[status(thm),parent(t78:1)],[t78:1,t2:7]) ).

cnf(t80,plain,
    relation(sK2),
    inference(extension,[status(thm),parent(t78:2)],[f_4_8]) ).

cnf(t81,plain,
    $false,
    inference(connection,[status(thm),parent(t80:1)],[t80:1,t78:2]) ).

cnf(l32,lemma,
    relation(sK2),
    inference(lemma,[status(cth),parent(t78:2),below(t2:7)],[t78:2]) ).

cnf(t82,plain,
    ( ~ well_ordering(sK2)
    | ~ relation(sK2)
    | reflexive(sK2) ),
    inference(extension,[status(thm),parent(t78:3)],[f_1_3]) ).

cnf(t83,plain,
    $false,
    inference(connection,[status(thm),parent(t82:1)],[t82:1,t78:3]) ).

cnf(t84,plain,
    relation(sK2),
    inference(lemma_extension,[status(thm),parent(t82:2)],[l32:1]) ).

cnf(t85,plain,
    $false,
    inference(connection,[status(thm),parent(t84:1)],[t84:1,t82:2]) ).

cnf(t86,plain,
    well_ordering(sK2),
    inference(extension,[status(thm),parent(t82:3)],[f_4_12]) ).

cnf(t87,plain,
    $false,
    inference(connection,[status(thm),parent(t86:1)],[t86:1,t82:3]) ).

cnf(t88,plain,
    relation_isomorphism(sK2,sK3,sK4),
    inference(extension,[status(thm),parent(t78:4)],[f_4_13]) ).

cnf(t89,plain,
    $false,
    inference(connection,[status(thm),parent(t88:1)],[t88:1,t78:4]) ).

cnf(t90,plain,
    function(sK4),
    inference(extension,[status(thm),parent(t78:5)],[f_4_11]) ).

cnf(t91,plain,
    $false,
    inference(connection,[status(thm),parent(t90:1)],[t90:1,t78:5]) ).

cnf(t92,plain,
    relation(sK4),
    inference(extension,[status(thm),parent(t78:6)],[f_4_10]) ).

cnf(t93,plain,
    $false,
    inference(connection,[status(thm),parent(t92:1)],[t92:1,t78:6]) ).

cnf(t94,plain,
    relation(sK3),
    inference(lemma_extension,[status(thm),parent(t78:7)],[l2:1]) ).

cnf(t95,plain,
    $false,
    inference(connection,[status(thm),parent(t94:1)],[t94:1,t78:7]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU261+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03  This is a FOF_THM_RFO_NEQ problem
% 0.00/0.04  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.80  % Computer : n016.cluster.edu
% 0.09/0.80  % Model    : x86_64 x86_64
% 0.09/0.80  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.80  % Memory   : 8046.5625MB
% 0.09/0.80  % OS       : Linux 6.8.0-71-generic
% 0.09/0.80  % CPULimit : 300
% 0.09/0.80  % WCLimit  : 300
% 0.09/0.80  % DateTime : Sat Sep 19 23:46:53 UTC 2026
% 0.09/0.80  % CPUTime  : 
% 0.09/0.85  % SZS status Theorem for theBenchmark
% 0.09/0.85  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------