↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : SET591+3 : 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 : n029.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:17 PM UTC 2025

% Result   : Theorem 0.19s 0.46s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (   8 unt;   0 def)
%            Number of atoms       :   43 (   7 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   40 (  19   ~;  13   |;   2   &)
%                                         (   3 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   2 sgn  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_th50,plain,
    ! [B,C] :
      ( subset(B,difference(C,B))
     => B = empty_set ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th50) ).

fof(prove_th50_negated,plain,
    ~ ! [B,C] :
        ( subset(B,difference(C,B))
       => B = empty_set ),
    inference(negate_conjecture,[status(cth)],[prove_th50]) ).

cnf(14,plain,
    sK3 != empty_set,
    inference(cnf,[status(esa)],[prove_th50_negated]) ).

cnf(l0,plain,
    sK3 != empty_set,
    inference(instantiation,[status(thm)],[14]) ).

fof(equal_defn,plain,
    ! [B,C] :
      ( B = C
    <=> ( subset(B,C)
        & subset(C,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).

cnf(9,plain,
    ( ~ subset(X0,X1)
    | ~ subset(X1,X0)
    | X0 = X1 ),
    inference(cnf,[status(esa)],[equal_defn]) ).

cnf(l1,plain,
    ( ~ subset(sK3,empty_set)
    | ~ subset(empty_set,sK3)
    | sK3 = empty_set ),
    inference(instantiation,[status(thm)],[9]) ).

fof(subset_defn,plain,
    ! [B,C] :
      ( subset(B,C)
    <=> ! [D] :
          ( member(D,B)
         => member(D,C) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).

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

cnf(l2,plain,
    ( subset(empty_set,sK3)
    | member(sK1(empty_set,sK3),empty_set) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(l33,plain,
    ( subset(sK3,empty_set)
    | member(sK1(sK3,empty_set),sK3) ),
    inference(instantiation,[status(thm)],[1]) ).

fof(empty_set_defn,plain,
    ! [B] : ~ member(B,empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn) ).

cnf(6,plain,
    ~ member(X0,empty_set),
    inference(cnf,[status(esa)],[empty_set_defn]) ).

cnf(l18,plain,
    ~ member(sK1(empty_set,sK3),empty_set),
    inference(instantiation,[status(thm)],[6]) ).

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

cnf(l48,plain,
    ( ~ subset(sK3,difference(sK4,sK3))
    | ~ member(sK1(sK3,empty_set),sK3)
    | member(sK1(sK3,empty_set),difference(sK4,sK3)) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(13,plain,
    subset(sK3,difference(sK4,sK3)),
    inference(cnf,[status(esa)],[prove_th50_negated]) ).

cnf(l50,plain,
    subset(sK3,difference(sK4,sK3)),
    inference(instantiation,[status(thm)],[13]) ).

fof(difference_defn,plain,
    ! [B,C,D] :
      ( member(D,difference(B,C))
    <=> ( member(D,B)
        & ~ member(D,C) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).

cnf(4,plain,
    ( ~ member(X0,X1)
    | ~ member(X0,difference(X2,X1)) ),
    inference(cnf,[status(esa)],[difference_defn]) ).

cnf(l51,plain,
    ( ~ member(sK1(sK3,empty_set),sK3)
    | ~ member(sK1(sK3,empty_set),difference(sK4,sK3)) ),
    inference(instantiation,[status(thm)],[4]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l2,l33,l18,l48,l50,l51]) ).

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