↑ Up

hopCoP---0.1.THM-CRf.s

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

% Result   : Theorem 0.19s 0.38s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   23 (   5 unt;   0 def)
%            Number of atoms       :   49 (   7 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   42 (  16   ~;  19   |;   2   &)
%                                         (   4 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   30 (   2 sgn  15   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_absorbtion_for_union,plain,
    ! [B,C] : union(B,intersection(B,C)) = B,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_absorbtion_for_union) ).

fof(prove_absorbtion_for_union_negated,plain,
    ~ ! [B,C] : union(B,intersection(B,C)) = B,
    inference(negate_conjecture,[status(cth)],[prove_absorbtion_for_union]) ).

cnf(21,plain,
    union(sK3,intersection(sK3,sK4)) != sK3,
    inference(cnf,[status(esa)],[prove_absorbtion_for_union_negated]) ).

cnf(l0,plain,
    union(sK3,intersection(sK3,sK4)) != sK3,
    inference(instantiation,[status(thm)],[21]) ).

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

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

cnf(l1,plain,
    ( ~ subset(union(sK3,intersection(sK3,sK4)),sK3)
    | ~ subset(sK3,union(sK3,intersection(sK3,sK4)))
    | union(sK3,intersection(sK3,sK4)) = sK3 ),
    inference(instantiation,[status(thm)],[8]) ).

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(12,plain,
    ( member(sK1(X0,X1),X0)
    | subset(X0,X1) ),
    inference(cnf,[status(esa)],[subset_defn]) ).

cnf(l3,plain,
    ( member(sK1(sK3,union(sK3,intersection(sK3,sK4))),sK3)
    | subset(sK3,union(sK3,intersection(sK3,sK4))) ),
    inference(instantiation,[status(thm)],[12]) ).

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

cnf(l2,plain,
    ( ~ member(sK1(union(sK3,intersection(sK3,sK4)),sK3),sK3)
    | subset(union(sK3,intersection(sK3,sK4)),sK3) ),
    inference(instantiation,[status(thm)],[13]) ).

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(1,plain,
    ( ~ member(X0,X1)
    | member(X0,union(X1,X2)) ),
    inference(cnf,[status(esa)],[union_defn]) ).

cnf(l5,plain,
    ( ~ member(sK1(sK3,union(sK3,intersection(sK3,sK4))),sK3)
    | member(sK1(sK3,union(sK3,intersection(sK3,sK4))),union(sK3,intersection(sK3,sK4))) ),
    inference(instantiation,[status(thm)],[1]) ).

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

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

cnf(l7,plain,
    ( member(sK1(union(sK3,intersection(sK3,sK4)),sK3),union(sK3,intersection(sK3,sK4)))
    | subset(union(sK3,intersection(sK3,sK4)),sK3) ),
    inference(instantiation,[status(thm)],[12]) ).

cnf(l19,plain,
    ( ~ member(sK1(sK3,union(sK3,intersection(sK3,sK4))),union(sK3,intersection(sK3,sK4)))
    | subset(sK3,union(sK3,intersection(sK3,sK4))) ),
    inference(instantiation,[status(thm)],[13]) ).

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

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

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

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l3,l2,l5,l4,l7,l19,l6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET175+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.13/0.33  % Computer : n023.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 20:18:19 EDT 2025
% 0.13/0.33  % CPUTime  : 
% 0.13/0.34  % launching worker at depth: 1
% 0.13/0.34  % launching worker at depth: 3
% 0.13/0.34  % launching worker at depth: 5
% 0.13/0.34  % launching worker at depth: 4
% 0.13/0.34  % launching worker at depth: 2
% 0.13/0.34  % launching worker at depth: 6
% 0.13/0.34  % launching worker at depth: 8
% 0.13/0.34  % launching worker at depth: 7
% 0.13/0.34  % launching worker at depth: 9
% 0.13/0.34  % launching worker at depth: 10
% 0.13/0.36  % launching worker at depth: 11
% 0.19/0.38  % SZS status Theorem for theBenchmark
% 0.19/0.38  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------