↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : SET014+3 : TPTP v9.0.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n020.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:31:05 PM UTC 2025

% Result   : Theorem 0.18s 0.48s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (   7 unt;   0 def)
%            Number of atoms       :   44 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   37 (  14   ~;  16   |;   2   &)
%                                         (   2 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_union_subset,plain,
    ! [B,C,D] :
      ( ( subset(B,C)
        & subset(D,C) )
     => subset(union(B,D),C) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_union_subset) ).

fof(prove_union_subset_negated,plain,
    ~ ! [B,C,D] :
        ( ( subset(B,C)
          & subset(D,C) )
       => subset(union(B,D),C) ),
    inference(negate_conjecture,[status(cth)],[prove_union_subset]) ).

cnf(16,plain,
    ~ subset(union(sK3,sK5),sK4),
    inference(cnf,[status(esa)],[prove_union_subset_negated]) ).

cnf(l0,plain,
    ~ subset(union(sK3,sK5),sK4),
    inference(instantiation,[status(thm)],[16]) ).

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

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

cnf(l1,plain,
    ( subset(union(sK3,sK5),sK4)
    | member(sK1(union(sK3,sK5),sK4),union(sK3,sK5)) ),
    inference(instantiation,[status(thm)],[4]) ).

fof(union_defn,plain,
    ! [B,C,D] :
      ( member(D,union(B,C))
    <=> ( member(D,B)
        | member(D,C) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).

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

cnf(l3,plain,
    ( ~ member(sK1(union(sK3,sK5),sK4),union(sK3,sK5))
    | member(sK1(union(sK3,sK5),sK4),sK3)
    | member(sK1(union(sK3,sK5),sK4),sK5) ),
    inference(instantiation,[status(thm)],[0]) ).

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

cnf(l32,plain,
    ( ~ subset(sK3,sK4)
    | ~ member(sK1(union(sK3,sK5),sK4),sK3)
    | member(sK1(union(sK3,sK5),sK4),sK4) ),
    inference(instantiation,[status(thm)],[3]) ).

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

cnf(l33,plain,
    ( ~ member(sK1(union(sK3,sK5),sK4),sK4)
    | subset(union(sK3,sK5),sK4) ),
    inference(instantiation,[status(thm)],[5]) ).

cnf(14,plain,
    subset(sK3,sK4),
    inference(cnf,[status(esa)],[prove_union_subset_negated]) ).

cnf(l34,plain,
    subset(sK3,sK4),
    inference(instantiation,[status(thm)],[14]) ).

cnf(l25,plain,
    ( ~ subset(sK5,sK4)
    | ~ member(sK1(union(sK3,sK5),sK4),sK5)
    | member(sK1(union(sK3,sK5),sK4),sK4) ),
    inference(instantiation,[status(thm)],[3]) ).

cnf(15,plain,
    subset(sK5,sK4),
    inference(cnf,[status(esa)],[prove_union_subset_negated]) ).

cnf(l26,plain,
    subset(sK5,sK4),
    inference(instantiation,[status(thm)],[15]) ).

cnf(l64,plain,
    ( ~ member(sK1(union(sK3,sK5),sK4),sK4)
    | subset(union(sK3,sK5),sK4) ),
    inference(instantiation,[status(thm)],[5]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l3,l32,l33,l34,l25,l26,l64]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET014+3 : TPTP v9.0.0. Released v2.2.0.
% 0.07/0.12  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.33  % Computer : n020.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 19:14:19 EDT 2025
% 0.12/0.33  % CPUTime  : 
% 0.12/0.33  % launching worker at depth: 4
% 0.12/0.33  % launching worker at depth: 1
% 0.12/0.33  % launching worker at depth: 3
% 0.12/0.33  % launching worker at depth: 5
% 0.12/0.33  % launching worker at depth: 2
% 0.12/0.33  % launching worker at depth: 6
% 0.12/0.33  % launching worker at depth: 7
% 0.12/0.33  % launching worker at depth: 8
% 0.12/0.34  % launching worker at depth: 9
% 0.12/0.34  % launching worker at depth: 10
% 0.12/0.37  % launching worker at depth: 11
% 0.18/0.48  % SZS status Theorem for theBenchmark
% 0.18/0.48  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------