↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : SET788+1 : TPTP v9.0.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n024.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:40 PM UTC 2025

% Result   : Theorem 2.31s 0.70s
% Output   : CNFRefutation 2.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   33 (   1 unt;   0 def)
%            Number of atoms       :   87 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   98 (  44   ~;  46   |;   0   &)
%                                         (   6 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,plain,
    ( ! [X,Y] :
        ( equalish(X,Y)
      <=> ! [Z] :
            ( a_member_of(Z,X)
          <=> a_member_of(Z,Y) ) )
   => ! [X,Y] :
        ( equalish(X,Y)
      <=> equalish(Y,X) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(prove_this_negated,plain,
    ~ ( ! [X,Y] :
          ( equalish(X,Y)
        <=> ! [Z] :
              ( a_member_of(Z,X)
            <=> a_member_of(Z,Y) ) )
     => ! [X,Y] :
          ( equalish(X,Y)
        <=> equalish(Y,X) ) ),
    inference(negate_conjecture,[status(cth)],[prove_this]) ).

cnf(4,plain,
    ( equalish(sK2,sK3)
    | equalish(sK3,sK2) ),
    inference(cnf,[status(esa)],[prove_this_negated]) ).

cnf(l0,plain,
    ( equalish(sK2,sK3)
    | equalish(sK3,sK2) ),
    inference(instantiation,[status(thm)],[4]) ).

cnf(0,plain,
    ( ~ equalish(X0,X1)
    | ~ a_member_of(X2,X0)
    | a_member_of(X2,X1) ),
    inference(cnf,[status(esa)],[prove_this_negated]) ).

cnf(l2,plain,
    ( ~ equalish(sK2,sK3)
    | ~ a_member_of(sK1(sK3,sK2),sK2)
    | a_member_of(sK1(sK3,sK2),sK3) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(7,plain,
    ( a_member_of(sK1(X0,X1),X1)
    | ~ sP0(X1,X0) ),
    inference(cnf,[status(esa)],[prove_this_negated]) ).

cnf(l80,plain,
    ( a_member_of(sK1(sK3,sK2),sK2)
    | ~ sP0(sK2,sK3) ),
    inference(instantiation,[status(thm)],[7]) ).

cnf(l16,plain,
    ( ~ equalish(sK3,sK2)
    | ~ a_member_of(sK1(sK3,sK2),sK3)
    | a_member_of(sK1(sK3,sK2),sK2) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(3,plain,
    ( ~ a_member_of(sK1(X0,X1),X1)
    | equalish(X0,X1)
    | sP0(X1,X0) ),
    inference(cnf,[status(esa)],[prove_this_negated]) ).

cnf(l123,plain,
    ( ~ a_member_of(sK1(sK3,sK2),sK2)
    | equalish(sK3,sK2)
    | sP0(sK2,sK3) ),
    inference(instantiation,[status(thm)],[3]) ).

cnf(6,plain,
    ( ~ a_member_of(sK1(X0,X1),X0)
    | ~ sP0(X1,X0) ),
    inference(cnf,[status(esa)],[prove_this_negated]) ).

cnf(l124,plain,
    ( ~ a_member_of(sK1(sK3,sK2),sK3)
    | ~ sP0(sK2,sK3) ),
    inference(instantiation,[status(thm)],[6]) ).

cnf(2,plain,
    ( equalish(X0,X1)
    | a_member_of(sK1(X0,X1),X0)
    | sP0(X1,X0) ),
    inference(cnf,[status(esa)],[prove_this_negated]) ).

cnf(l103,plain,
    ( equalish(sK3,sK2)
    | a_member_of(sK1(sK3,sK2),sK3)
    | sP0(sK2,sK3) ),
    inference(instantiation,[status(thm)],[2]) ).

cnf(5,plain,
    ( ~ equalish(sK2,sK3)
    | ~ equalish(sK3,sK2) ),
    inference(cnf,[status(esa)],[prove_this_negated]) ).

cnf(l104,plain,
    ( ~ equalish(sK2,sK3)
    | ~ equalish(sK3,sK2) ),
    inference(instantiation,[status(thm)],[5]) ).

cnf(1,plain,
    ( ~ equalish(X0,X1)
    | ~ a_member_of(X2,X1)
    | a_member_of(X2,X0) ),
    inference(cnf,[status(esa)],[prove_this_negated]) ).

cnf(l105,plain,
    ( ~ equalish(sK2,sK3)
    | ~ a_member_of(sK1(sK3,sK2),sK3)
    | a_member_of(sK1(sK3,sK2),sK2) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(l1,plain,
    ( ~ equalish(sK3,sK2)
    | ~ a_member_of(sK1(sK2,sK3),sK3)
    | a_member_of(sK1(sK2,sK3),sK2) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(l127,plain,
    ( ~ equalish(sK2,sK3)
    | ~ equalish(sK3,sK2) ),
    inference(instantiation,[status(thm)],[5]) ).

cnf(l78,plain,
    ( ~ equalish(sK3,sK2)
    | ~ a_member_of(sK1(sK2,sK3),sK2)
    | a_member_of(sK1(sK2,sK3),sK3) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(l134,plain,
    ( ~ a_member_of(sK1(sK2,sK3),sK3)
    | equalish(sK2,sK3)
    | sP0(sK3,sK2) ),
    inference(instantiation,[status(thm)],[3]) ).

cnf(l136,plain,
    ( ~ a_member_of(sK1(sK2,sK3),sK2)
    | ~ sP0(sK3,sK2) ),
    inference(instantiation,[status(thm)],[6]) ).

cnf(l18,plain,
    ( ~ a_member_of(sK1(sK3,sK2),sK2)
    | equalish(sK3,sK2)
    | sP0(sK2,sK3) ),
    inference(instantiation,[status(thm)],[3]) ).

cnf(l4,plain,
    ( ~ equalish(sK3,sK2)
    | ~ a_member_of(sK1(sK2,sK3),sK2)
    | a_member_of(sK1(sK2,sK3),sK3) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(l28,plain,
    ( ~ a_member_of(sK1(sK3,sK2),sK3)
    | ~ sP0(sK2,sK3) ),
    inference(instantiation,[status(thm)],[6]) ).

cnf(l6,plain,
    ( equalish(sK2,sK3)
    | a_member_of(sK1(sK2,sK3),sK2)
    | sP0(sK3,sK2) ),
    inference(instantiation,[status(thm)],[2]) ).

cnf(l51,plain,
    ( a_member_of(sK1(sK2,sK3),sK3)
    | ~ sP0(sK3,sK2) ),
    inference(instantiation,[status(thm)],[7]) ).

cnf(l30,plain,
    ( ~ equalish(sK2,sK3)
    | ~ equalish(sK3,sK2) ),
    inference(instantiation,[status(thm)],[5]) ).

cnf(l39,plain,
    ( ~ equalish(sK2,sK3)
    | ~ a_member_of(sK1(sK3,sK2),sK3)
    | a_member_of(sK1(sK3,sK2),sK2) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(l149,plain,
    ( ~ equalish(sK2,sK3)
    | ~ equalish(sK3,sK2) ),
    inference(instantiation,[status(thm)],[5]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l2,l80,l16,l123,l124,l103,l104,l105,l1,l127,l78,l134,l136,l18,l4,l28,l6,l51,l30,l39,l149]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET788+1 : TPTP v9.0.0. Released v3.1.0.
% 0.07/0.14  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.35  % Computer : n024.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon Jul 21 22:42:34 EDT 2025
% 0.13/0.35  % CPUTime  : 
% 0.13/0.35  % launching worker at depth: 3
% 0.13/0.35  % launching worker at depth: 7
% 0.13/0.35  % launching worker at depth: 4
% 0.13/0.35  % launching worker at depth: 6
% 0.13/0.35  % launching worker at depth: 5
% 0.13/0.35  % launching worker at depth: 2
% 0.13/0.35  % launching worker at depth: 1
% 0.13/0.35  % launching worker at depth: 8
% 0.13/0.35  % launching worker at depth: 9
% 0.13/0.36  % launching worker at depth: 10
% 0.13/0.38  % launching worker at depth: 11
% 2.31/0.70  % SZS status Theorem for theBenchmark
% 2.31/0.70  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------