↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : SEU120+1 : TPTP v9.0.0. Released v3.3.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:44:31 PM UTC 2025

% Result   : Theorem 0.12s 0.35s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   22 (   1 unt;   0 def)
%            Number of atoms       :   47 (  10 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   52 (  27   ~;  17   |;   6   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   20 (   2 sgn  10   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t4_xboole_0,plain,
    ! [A,B] :
      ( ~ ( ~ disjoint(A,B)
          & ! [C] : ~ in(C,set_intersection2(A,B)) )
      & ~ ( ? [C] : in(C,set_intersection2(A,B))
          & disjoint(A,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).

fof(t4_xboole_0_negated,plain,
    ~ ! [A,B] :
        ( ~ ( ~ disjoint(A,B)
            & ! [C] : ~ in(C,set_intersection2(A,B)) )
        & ~ ( ? [C] : in(C,set_intersection2(A,B))
            & disjoint(A,B) ) ),
    inference(negate_conjecture,[status(cth)],[t4_xboole_0]) ).

cnf(11,plain,
    ( ~ disjoint(sK4,sK5)
    | sP0 ),
    inference(cnf,[status(esa)],[t4_xboole_0_negated]) ).

cnf(l0,plain,
    ( ~ disjoint(sK4,sK5)
    | sP0 ),
    inference(instantiation,[status(thm)],[11]) ).

cnf(14,plain,
    ( in(sK6,set_intersection2(sK4,sK5))
    | ~ sP0 ),
    inference(cnf,[status(esa)],[t4_xboole_0_negated]) ).

cnf(l2,plain,
    ( in(sK6,set_intersection2(sK4,sK5))
    | ~ sP0 ),
    inference(instantiation,[status(thm)],[14]) ).

cnf(13,plain,
    ( disjoint(sK4,sK5)
    | ~ sP0 ),
    inference(cnf,[status(esa)],[t4_xboole_0_negated]) ).

cnf(l1,plain,
    ( disjoint(sK4,sK5)
    | ~ sP0 ),
    inference(instantiation,[status(thm)],[13]) ).

fof(d1_xboole_0,plain,
    ! [A] :
      ( A = empty_set
    <=> ! [B] : ~ in(B,A) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).

cnf(2,plain,
    ( X0 != empty_set
    | ~ in(X1,X0) ),
    inference(cnf,[status(esa)],[d1_xboole_0]) ).

cnf(l4,plain,
    ( set_intersection2(sK4,sK5) != empty_set
    | ~ in(sK6,set_intersection2(sK4,sK5)) ),
    inference(instantiation,[status(thm)],[2]) ).

fof(d7_xboole_0,plain,
    ! [A,B] :
      ( disjoint(A,B)
    <=> set_intersection2(A,B) = empty_set ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).

cnf(4,plain,
    ( ~ disjoint(X0,X1)
    | set_intersection2(X0,X1) = empty_set ),
    inference(cnf,[status(esa)],[d7_xboole_0]) ).

cnf(l6,plain,
    ( ~ disjoint(sK4,sK5)
    | set_intersection2(sK4,sK5) = empty_set ),
    inference(instantiation,[status(thm)],[4]) ).

cnf(12,plain,
    ( ~ in(X0,set_intersection2(sK4,sK5))
    | sP0 ),
    inference(cnf,[status(esa)],[t4_xboole_0_negated]) ).

cnf(l27,plain,
    ( ~ in(sK1(set_intersection2(sK4,sK5)),set_intersection2(sK4,sK5))
    | sP0 ),
    inference(instantiation,[status(thm)],[12]) ).

cnf(3,plain,
    ( X0 = empty_set
    | in(sK1(X0),X0) ),
    inference(cnf,[status(esa)],[d1_xboole_0]) ).

cnf(l28,plain,
    ( set_intersection2(sK4,sK5) = empty_set
    | in(sK1(set_intersection2(sK4,sK5)),set_intersection2(sK4,sK5)) ),
    inference(instantiation,[status(thm)],[3]) ).

cnf(l9,plain,
    ( disjoint(sK4,sK5)
    | ~ sP0 ),
    inference(instantiation,[status(thm)],[13]) ).

cnf(5,plain,
    ( set_intersection2(X0,X1) != empty_set
    | disjoint(X0,X1) ),
    inference(cnf,[status(esa)],[d7_xboole_0]) ).

cnf(l29,plain,
    ( set_intersection2(sK4,sK5) != empty_set
    | disjoint(sK4,sK5) ),
    inference(instantiation,[status(thm)],[5]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l2,l1,l4,l6,l27,l28,l9,l29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU120+1 : TPTP v9.0.0. Released v3.3.0.
% 0.11/0.13  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.33  % Computer : n024.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 23:31:19 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  % launching worker at depth: 1
% 0.12/0.34  % launching worker at depth: 7
% 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: 5
% 0.12/0.34  % launching worker at depth: 6
% 0.12/0.34  % launching worker at depth: 8
% 0.12/0.34  % launching worker at depth: 4
% 0.12/0.34  % launching worker at depth: 9
% 0.12/0.34  % launching worker at depth: 10
% 0.12/0.35  % SZS status Theorem for theBenchmark
% 0.12/0.35  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------