↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : SET711+4 : TPTP v9.0.0. Bugfixed v2.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n017.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Jul 25 03:32:33 PM UTC 2025

% Result   : Theorem 171.07s 21.90s
% Output   : CNFRefutation 171.07s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   38 (   9 unt;   0 def)
%            Number of atoms       :  106 (   6 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   99 (  31   ~;  42   |;  14   &)
%                                         (   5 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-4 aty)
%            Number of variables   :   71 (   0 sgn  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thII03a,plain,
    ! [F,G,H,A,B] :
      ( ( maps(F,A,B)
        & one_to_one(F,A,B)
        & inverse_predicate(G,F,A,B)
        & inverse_predicate(H,F,A,B) )
     => equal_maps(G,H,B,A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thII03a) ).

fof(thII03a_negated,plain,
    ~ ! [F,G,H,A,B] :
        ( ( maps(F,A,B)
          & one_to_one(F,A,B)
          & inverse_predicate(G,F,A,B)
          & inverse_predicate(H,F,A,B) )
       => equal_maps(G,H,B,A) ),
    inference(negate_conjecture,[status(cth)],[thII03a]) ).

cnf(140,plain,
    ~ equal_maps(sK52,sK53,sK55,sK54),
    inference(cnf,[status(esa)],[thII03a_negated]) ).

cnf(l0,plain,
    ~ equal_maps(sK52,sK53,sK55,sK54),
    inference(instantiation,[status(thm)],[140]) ).

fof(equal_maps,plain,
    ! [F,G,A,B] :
      ( equal_maps(F,G,A,B)
    <=> ! [X,Y1,Y2] :
          ( ( member(X,A)
            & member(Y1,B)
            & member(Y2,B) )
         => ( ( apply(F,X,Y1)
              & apply(G,X,Y2) )
           => Y1 = Y2 ) ) ),
    file('Axioms/SET006+1.ax',equal_maps) ).

cnf(62,plain,
    ( sK20(X0,X1,X2,X3) != sK21(X0,X1,X2,X3)
    | equal_maps(X0,X1,X2,X3) ),
    inference(cnf,[status(esa)],[equal_maps]) ).

cnf(l1,plain,
    ( sK20(sK52,sK53,sK55,sK54) != sK21(sK52,sK53,sK55,sK54)
    | equal_maps(sK52,sK53,sK55,sK54) ),
    inference(instantiation,[status(thm)],[62]) ).

fof(injective,plain,
    ! [F,A,B] :
      ( injective(F,A,B)
    <=> ! [X1,X2,Y] :
          ( ( member(X1,A)
            & member(X2,A)
            & member(Y,B) )
         => ( ( apply(F,X1,Y)
              & apply(F,X2,Y) )
           => X1 = X2 ) ) ),
    file('Axioms/SET006+1.ax',injective) ).

cnf(66,plain,
    ( ~ member(X0,X1)
    | ~ member(X2,X1)
    | ~ member(X3,X4)
    | ~ apply(X5,X0,X3)
    | ~ apply(X5,X2,X3)
    | ~ injective(X5,X1,X4)
    | X0 = X2 ),
    inference(cnf,[status(esa)],[injective]) ).

cnf(l187,plain,
    ( ~ member(sK20(sK52,sK53,sK55,sK54),sK54)
    | ~ member(sK21(sK52,sK53,sK55,sK54),sK54)
    | ~ member(sK19(sK52,sK53,sK55,sK54),sK55)
    | ~ apply(sK51,sK20(sK52,sK53,sK55,sK54),sK19(sK52,sK53,sK55,sK54))
    | ~ apply(sK51,sK21(sK52,sK53,sK55,sK54),sK19(sK52,sK53,sK55,sK54))
    | ~ injective(sK51,sK54,sK55)
    | sK20(sK52,sK53,sK55,sK54) = sK21(sK52,sK53,sK55,sK54) ),
    inference(instantiation,[status(thm)],[66]) ).

fof(inverse_predicate,plain,
    ! [G,F,A,B] :
      ( inverse_predicate(G,F,A,B)
    <=> ! [X,Y] :
          ( ( member(X,A)
            & member(Y,B) )
         => ( apply(F,X,Y)
          <=> apply(G,Y,X) ) ) ),
    file('Axioms/SET006+1.ax',inverse_predicate) ).

cnf(81,plain,
    ( ~ member(X0,X1)
    | ~ member(X2,X3)
    | ~ inverse_predicate(X4,X5,X1,X3)
    | ~ apply(X4,X2,X0)
    | apply(X5,X0,X2) ),
    inference(cnf,[status(esa)],[inverse_predicate]) ).

cnf(l193,plain,
    ( ~ member(sK20(sK52,sK53,sK55,sK54),sK54)
    | ~ member(sK19(sK52,sK53,sK55,sK54),sK55)
    | ~ inverse_predicate(sK52,sK51,sK54,sK55)
    | ~ apply(sK52,sK19(sK52,sK53,sK55,sK54),sK20(sK52,sK53,sK55,sK54))
    | apply(sK51,sK20(sK52,sK53,sK55,sK54),sK19(sK52,sK53,sK55,sK54)) ),
    inference(instantiation,[status(thm)],[81]) ).

cnf(58,plain,
    ( member(sK20(X0,X1,X2,X3),X3)
    | equal_maps(X0,X1,X2,X3) ),
    inference(cnf,[status(esa)],[equal_maps]) ).

cnf(l225,plain,
    ( member(sK20(sK52,sK53,sK55,sK54),sK54)
    | equal_maps(sK52,sK53,sK55,sK54) ),
    inference(instantiation,[status(thm)],[58]) ).

cnf(57,plain,
    ( member(sK19(X0,X1,X2,X3),X2)
    | equal_maps(X0,X1,X2,X3) ),
    inference(cnf,[status(esa)],[equal_maps]) ).

cnf(l221,plain,
    ( member(sK19(sK52,sK53,sK55,sK54),sK55)
    | equal_maps(sK52,sK53,sK55,sK54) ),
    inference(instantiation,[status(thm)],[57]) ).

cnf(l226,plain,
    ( member(sK19(sK52,sK53,sK55,sK54),sK55)
    | equal_maps(sK52,sK53,sK55,sK54) ),
    inference(instantiation,[status(thm)],[57]) ).

cnf(138,plain,
    inverse_predicate(sK52,sK51,sK54,sK55),
    inference(cnf,[status(esa)],[thII03a_negated]) ).

cnf(l223,plain,
    inverse_predicate(sK52,sK51,sK54,sK55),
    inference(instantiation,[status(thm)],[138]) ).

cnf(60,plain,
    ( equal_maps(X0,X1,X2,X3)
    | apply(X0,sK19(X0,X1,X2,X3),sK20(X0,X1,X2,X3)) ),
    inference(cnf,[status(esa)],[equal_maps]) ).

cnf(l199,plain,
    ( equal_maps(sK52,sK53,sK55,sK54)
    | apply(sK52,sK19(sK52,sK53,sK55,sK54),sK20(sK52,sK53,sK55,sK54)) ),
    inference(instantiation,[status(thm)],[60]) ).

cnf(l244,plain,
    ( ~ member(sK21(sK52,sK53,sK55,sK54),sK54)
    | ~ member(sK19(sK52,sK53,sK55,sK54),sK55)
    | ~ inverse_predicate(sK53,sK51,sK54,sK55)
    | ~ apply(sK53,sK19(sK52,sK53,sK55,sK54),sK21(sK52,sK53,sK55,sK54))
    | apply(sK51,sK21(sK52,sK53,sK55,sK54),sK19(sK52,sK53,sK55,sK54)) ),
    inference(instantiation,[status(thm)],[81]) ).

cnf(61,plain,
    ( equal_maps(X0,X1,X2,X3)
    | apply(X1,sK19(X0,X1,X2,X3),sK21(X0,X1,X2,X3)) ),
    inference(cnf,[status(esa)],[equal_maps]) ).

cnf(l252,plain,
    ( equal_maps(sK52,sK53,sK55,sK54)
    | apply(sK53,sK19(sK52,sK53,sK55,sK54),sK21(sK52,sK53,sK55,sK54)) ),
    inference(instantiation,[status(thm)],[61]) ).

fof(one_to_one,plain,
    ! [F,A,B] :
      ( one_to_one(F,A,B)
    <=> ( injective(F,A,B)
        & surjective(F,A,B) ) ),
    file('Axioms/SET006+1.ax',one_to_one) ).

cnf(77,plain,
    ( ~ one_to_one(X0,X1,X2)
    | injective(X0,X1,X2) ),
    inference(cnf,[status(esa)],[one_to_one]) ).

cnf(l250,plain,
    ( ~ one_to_one(sK51,sK54,sK55)
    | injective(sK51,sK54,sK55) ),
    inference(instantiation,[status(thm)],[77]) ).

cnf(59,plain,
    ( member(sK21(X0,X1,X2,X3),X3)
    | equal_maps(X0,X1,X2,X3) ),
    inference(cnf,[status(esa)],[equal_maps]) ).

cnf(l245,plain,
    ( member(sK21(sK52,sK53,sK55,sK54),sK54)
    | equal_maps(sK52,sK53,sK55,sK54) ),
    inference(instantiation,[status(thm)],[59]) ).

cnf(139,plain,
    inverse_predicate(sK53,sK51,sK54,sK55),
    inference(cnf,[status(esa)],[thII03a_negated]) ).

cnf(l251,plain,
    inverse_predicate(sK53,sK51,sK54,sK55),
    inference(instantiation,[status(thm)],[139]) ).

cnf(l249,plain,
    ( member(sK19(sK52,sK53,sK55,sK54),sK55)
    | equal_maps(sK52,sK53,sK55,sK54) ),
    inference(instantiation,[status(thm)],[57]) ).

cnf(137,plain,
    one_to_one(sK51,sK54,sK55),
    inference(cnf,[status(esa)],[thII03a_negated]) ).

cnf(l259,plain,
    one_to_one(sK51,sK54,sK55),
    inference(instantiation,[status(thm)],[137]) ).

cnf(l189,plain,
    ( member(sK21(sK52,sK53,sK55,sK54),sK54)
    | equal_maps(sK52,sK53,sK55,sK54) ),
    inference(instantiation,[status(thm)],[59]) ).

cnf(l188,plain,
    ( member(sK20(sK52,sK53,sK55,sK54),sK54)
    | equal_maps(sK52,sK53,sK55,sK54) ),
    inference(instantiation,[status(thm)],[58]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l187,l193,l225,l221,l226,l223,l199,l244,l252,l250,l245,l251,l249,l259,l189,l188]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET711+4 : TPTP v9.0.0. Bugfixed v2.2.1.
% 0.06/0.12  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.33  % Computer : n017.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Mon Jul 21 22:23:49 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 0.12/0.34  % launching worker at depth: 1
% 0.12/0.34  % launching worker at depth: 2
% 0.12/0.34  % launching worker at depth: 3
% 0.12/0.34  % launching worker at depth: 4
% 0.12/0.34  % launching worker at depth: 5
% 0.12/0.34  % launching worker at depth: 6
% 0.12/0.34  % launching worker at depth: 7
% 0.12/0.34  % launching worker at depth: 8
% 0.12/0.34  % launching worker at depth: 9
% 0.12/0.37  % launching worker at depth: 10
% 3.83/0.82  % launching worker at depth: 11
% 171.07/21.90  % SZS status Theorem for theBenchmark
% 171.07/21.90  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------