↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : SET688+4 : TPTP v9.0.0. Released v2.2.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:32:31 PM UTC 2025

% Result   : Theorem 3.84s 0.77s
% Output   : CNFRefutation 3.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   35 (   9 unt;   0 def)
%            Number of atoms       :   79 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   76 (  32   ~;  29   |;   8   &)
%                                         (   4 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   45 (   6 sgn  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thI04,plain,
    ! [A,B,C] :
      ( ( subset(A,B)
        & ~ equal_set(A,B)
        & subset(B,C)
        & ~ equal_set(B,C) )
     => ~ equal_set(A,C) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI04) ).

fof(thI04_negated,plain,
    ~ ! [A,B,C] :
        ( ( subset(A,B)
          & ~ equal_set(A,B)
          & subset(B,C)
          & ~ equal_set(B,C) )
       => ~ equal_set(A,C) ),
    inference(negate_conjecture,[status(cth)],[thI04]) ).

cnf(29,plain,
    subset(sK5,sK6),
    inference(cnf,[status(esa)],[thI04_negated]) ).

cnf(l0,plain,
    subset(sK5,sK6),
    inference(instantiation,[status(thm)],[29]) ).

fof(equal_set,plain,
    ! [A,B] :
      ( equal_set(A,B)
    <=> ( subset(A,B)
        & subset(B,A) ) ),
    file('Axioms/SET006+0.ax',equal_set) ).

cnf(5,plain,
    ( ~ subset(X0,X1)
    | ~ subset(X1,X0)
    | equal_set(X0,X1) ),
    inference(cnf,[status(esa)],[equal_set]) ).

cnf(l1,plain,
    ( ~ subset(sK5,sK6)
    | ~ subset(sK6,sK5)
    | equal_set(sK5,sK6) ),
    inference(instantiation,[status(thm)],[5]) ).

cnf(30,plain,
    ~ equal_set(sK5,sK6),
    inference(cnf,[status(esa)],[thI04_negated]) ).

cnf(l3,plain,
    ~ equal_set(sK5,sK6),
    inference(instantiation,[status(thm)],[30]) ).

fof(subset,plain,
    ! [A,B] :
      ( subset(A,B)
    <=> ! [X] :
          ( member(X,A)
         => member(X,B) ) ),
    file('Axioms/SET006+0.ax',subset) ).

cnf(2,plain,
    ( ~ member(sK1(X0,X1),X1)
    | subset(X0,X1) ),
    inference(cnf,[status(esa)],[subset]) ).

cnf(l2,plain,
    ( ~ member(sK1(sK6,sK5),sK5)
    | subset(sK6,sK5) ),
    inference(instantiation,[status(thm)],[2]) ).

fof(intersection,plain,
    ! [X,A,B] :
      ( member(X,intersection(A,B))
    <=> ( member(X,A)
        & member(X,B) ) ),
    file('Axioms/SET006+0.ax',intersection) ).

cnf(9,plain,
    ( ~ member(X0,intersection(X1,X2))
    | member(X0,X2) ),
    inference(cnf,[status(esa)],[intersection]) ).

cnf(l25,plain,
    ( ~ member(sK1(sK6,sK5),intersection(X1_25,sK5))
    | member(sK1(sK6,sK5),sK5) ),
    inference(instantiation,[status(thm)],[9]) ).

fof(union,plain,
    ! [X,A,B] :
      ( member(X,union(A,B))
    <=> ( member(X,A)
        | member(X,B) ) ),
    file('Axioms/SET006+0.ax',union) ).

cnf(11,plain,
    ( ~ member(X0,union(X1,X2))
    | member(X0,X1)
    | member(X0,X2) ),
    inference(cnf,[status(esa)],[union]) ).

cnf(l26,plain,
    ( ~ member(sK1(sK6,sK5),union(sK7,intersection(X1_25,sK5)))
    | member(sK1(sK6,sK5),sK7)
    | member(sK1(sK6,sK5),intersection(X1_25,sK5)) ),
    inference(instantiation,[status(thm)],[11]) ).

cnf(l27,plain,
    ( ~ member(sK1(sK6,sK5),union(union(sK7,intersection(X1_25,sK5)),sK6))
    | member(sK1(sK6,sK5),union(sK7,intersection(X1_25,sK5)))
    | member(sK1(sK6,sK5),sK6) ),
    inference(instantiation,[status(thm)],[11]) ).

cnf(13,plain,
    ( ~ member(X0,X1)
    | member(X0,union(X2,X1)) ),
    inference(cnf,[status(esa)],[union]) ).

cnf(l28,plain,
    ( ~ member(sK1(sK6,sK5),sK6)
    | member(sK1(sK6,sK5),union(union(sK7,intersection(X1_25,sK5)),sK6)) ),
    inference(instantiation,[status(thm)],[13]) ).

cnf(1,plain,
    ( subset(X0,X1)
    | member(sK1(X0,X1),X0) ),
    inference(cnf,[status(esa)],[subset]) ).

cnf(l29,plain,
    ( subset(sK6,sK5)
    | member(sK1(sK6,sK5),sK6) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(0,plain,
    ( ~ subset(X0,X1)
    | ~ member(X2,X0)
    | member(X2,X1) ),
    inference(cnf,[status(esa)],[subset]) ).

cnf(l32,plain,
    ( ~ subset(sK6,sK7)
    | ~ member(sK1(sK6,sK5),sK6)
    | member(sK1(sK6,sK5),sK7) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(12,plain,
    ( ~ member(X0,X1)
    | member(X0,union(X1,X2)) ),
    inference(cnf,[status(esa)],[union]) ).

cnf(l34,plain,
    ( ~ member(sK1(sK6,sK5),sK7)
    | member(sK1(sK6,sK5),union(sK7,intersection(X1_25,sK5))) ),
    inference(instantiation,[status(thm)],[12]) ).

cnf(31,plain,
    subset(sK6,sK7),
    inference(cnf,[status(esa)],[thI04_negated]) ).

cnf(l35,plain,
    subset(sK6,sK7),
    inference(instantiation,[status(thm)],[31]) ).

cnf(l42,plain,
    ( ~ subset(sK7,sK5)
    | ~ member(sK1(sK6,sK5),sK7)
    | member(sK1(sK6,sK5),sK5) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(4,plain,
    ( ~ equal_set(X0,X1)
    | subset(X1,X0) ),
    inference(cnf,[status(esa)],[equal_set]) ).

cnf(l45,plain,
    ( ~ equal_set(sK5,sK7)
    | subset(sK7,sK5) ),
    inference(instantiation,[status(thm)],[4]) ).

cnf(33,plain,
    equal_set(sK5,sK7),
    inference(cnf,[status(esa)],[thI04_negated]) ).

cnf(l49,plain,
    equal_set(sK5,sK7),
    inference(instantiation,[status(thm)],[33]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l3,l2,l25,l26,l27,l28,l29,l32,l34,l35,l42,l45,l49]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.06  % Problem  : SET688+4 : TPTP v9.0.0. Released v2.2.0.
% 0.04/0.07  % Command  : /export/starexec/sandbox2/solver/bin/execute.py 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.25  % Computer : n017.cluster.edu
% 0.07/0.25  % Model    : x86_64 x86_64
% 0.07/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.25  % Memory   : 8042.1875MB
% 0.07/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.25  % CPULimit : 300
% 0.07/0.25  % WCLimit  : 300
% 0.07/0.25  % DateTime : Mon Jul 21 22:19:19 EDT 2025
% 0.07/0.25  % CPUTime  : 
% 0.07/0.25  % launching worker at depth: 2
% 0.07/0.25  % launching worker at depth: 3
% 0.07/0.25  % launching worker at depth: 1
% 0.07/0.25  % launching worker at depth: 4
% 0.07/0.25  % launching worker at depth: 5
% 0.07/0.25  % launching worker at depth: 6
% 0.07/0.25  % launching worker at depth: 7
% 0.07/0.25  % launching worker at depth: 8
% 0.11/0.25  % launching worker at depth: 9
% 0.11/0.26  % launching worker at depth: 10
% 0.11/0.28  % launching worker at depth: 11
% 3.84/0.77  % SZS status Theorem for theBenchmark
% 3.84/0.77  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------