↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : SEU119+2 : 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 : 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:44:30 PM UTC 2025

% Result   : Theorem 56.69s 7.46s
% Output   : CNFRefutation 56.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   36 (   5 unt;   0 def)
%            Number of atoms       :   86 (  22 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   94 (  44   ~;  35   |;  11   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 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   :   36 (   2 sgn  16   !;   2   ?)

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

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

cnf(19,plain,
    ( ~ disjoint(sK5,sK6)
    | sP1 ),
    inference(cnf,[status(esa)],[t3_xboole_0_negated]) ).

cnf(l0,plain,
    ( ~ disjoint(sK5,sK6)
    | sP1 ),
    inference(instantiation,[status(thm)],[19]) ).

cnf(21,plain,
    ( disjoint(sK5,sK6)
    | ~ sP1 ),
    inference(cnf,[status(esa)],[t3_xboole_0_negated]) ).

cnf(l2,plain,
    ( disjoint(sK5,sK6)
    | ~ sP1 ),
    inference(instantiation,[status(thm)],[21]) ).

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(12,plain,
    ( ~ disjoint(X0,X1)
    | set_intersection2(X0,X1) = empty_set ),
    inference(cnf,[status(esa)],[d7_xboole_0]) ).

cnf(l4,plain,
    ( ~ disjoint(sK5,sK6)
    | set_intersection2(sK5,sK6) = empty_set ),
    inference(instantiation,[status(thm)],[12]) ).

cnf(l1,plain,
    ( disjoint(sK5,sK6)
    | ~ sP1 ),
    inference(instantiation,[status(thm)],[21]) ).

cnf(20,plain,
    ( ~ in(X0,sK6)
    | ~ in(X0,sK5)
    | sP1 ),
    inference(cnf,[status(esa)],[t3_xboole_0_negated]) ).

cnf(l136,plain,
    ( ~ in(sK1(set_intersection2(sK5,sK6)),sK6)
    | ~ in(sK1(set_intersection2(sK5,sK6)),sK5)
    | sP1 ),
    inference(instantiation,[status(thm)],[20]) ).

fof(d3_xboole_0,plain,
    ! [A,B,C] :
      ( C = set_intersection2(A,B)
    <=> ! [D] :
          ( in(D,C)
        <=> ( in(D,A)
            & in(D,B) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).

cnf(4,plain,
    ( X0 != set_intersection2(X1,X2)
    | ~ in(X3,X0)
    | in(X3,X1) ),
    inference(cnf,[status(esa)],[d3_xboole_0]) ).

cnf(l195,plain,
    ( set_intersection2(sK5,sK6) != set_intersection2(sK5,sK6)
    | ~ in(sK1(set_intersection2(sK5,sK6)),set_intersection2(sK5,sK6))
    | in(sK1(set_intersection2(sK5,sK6)),sK5) ),
    inference(instantiation,[status(thm)],[4]) ).

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

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

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

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

cnf(l215,plain,
    ( set_intersection2(sK5,sK6) != empty_set
    | disjoint(sK5,sK6) ),
    inference(instantiation,[status(thm)],[13]) ).

cnf(6,plain,
    ( X0 != set_intersection2(X1,X2)
    | ~ in(X3,X1)
    | ~ in(X3,X2)
    | in(X3,X0) ),
    inference(cnf,[status(esa)],[d3_xboole_0]) ).

cnf(l77,plain,
    ( set_intersection2(sK5,sK6) != set_intersection2(sK6,sK5)
    | ~ in(sK7,sK6)
    | ~ in(sK7,sK5)
    | in(sK7,set_intersection2(sK5,sK6)) ),
    inference(instantiation,[status(thm)],[6]) ).

cnf(22,plain,
    ( in(sK7,sK6)
    | ~ sP1 ),
    inference(cnf,[status(esa)],[t3_xboole_0_negated]) ).

cnf(l99,plain,
    ( in(sK7,sK6)
    | ~ sP1 ),
    inference(instantiation,[status(thm)],[22]) ).

cnf(l196,plain,
    ( set_intersection2(sK5,sK6) != set_intersection2(sK6,sK5)
    | ~ in(sK1(set_intersection2(sK5,sK6)),set_intersection2(sK5,sK6))
    | in(sK1(set_intersection2(sK5,sK6)),sK6) ),
    inference(instantiation,[status(thm)],[4]) ).

cnf(23,plain,
    ( in(sK7,sK5)
    | ~ sP1 ),
    inference(cnf,[status(esa)],[t3_xboole_0_negated]) ).

cnf(l100,plain,
    ( in(sK7,sK5)
    | ~ sP1 ),
    inference(instantiation,[status(thm)],[23]) ).

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

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

fof(commutativity_k3_xboole_0,plain,
    ! [A,B] : set_intersection2(A,B) = set_intersection2(B,A),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).

cnf(1,plain,
    set_intersection2(X0,X1) = set_intersection2(X1,X0),
    inference(cnf,[status(esa)],[commutativity_k3_xboole_0]) ).

cnf(l83,plain,
    set_intersection2(sK5,sK6) = set_intersection2(sK6,sK5),
    inference(instantiation,[status(thm)],[1]) ).

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

cnf(l205,plain,
    ( set_intersection2(sK5,sK6) != empty_set
    | disjoint(sK5,sK6) ),
    inference(instantiation,[status(thm)],[13]) ).

cnf(l212,plain,
    set_intersection2(sK6,sK5) = set_intersection2(sK5,sK6),
    inference(instantiation,[status(thm)],[1]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l2,l4,l1,l136,l195,l198,l215,l77,l99,l196,l100,l102,l83,l202,l205,l212]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU119+2 : 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.34  % Computer : n017.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Mon Jul 21 23:31:04 EDT 2025
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  % launching worker at depth: 1
% 0.12/0.35  % launching worker at depth: 6
% 0.12/0.35  % launching worker at depth: 5
% 0.12/0.35  % launching worker at depth: 3
% 0.12/0.35  % launching worker at depth: 4
% 0.12/0.35  % launching worker at depth: 2
% 0.12/0.35  % launching worker at depth: 7
% 0.12/0.35  % launching worker at depth: 8
% 0.12/0.35  % launching worker at depth: 9
% 0.12/0.35  % launching worker at depth: 10
% 0.12/0.39  % launching worker at depth: 11
% 14.98/2.29  % launching worker at depth: 12
% 56.69/7.46  % SZS status Theorem for theBenchmark
% 56.69/7.46  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------