↑ Up

hopCoP---0.1.THM-CRf.s

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

% Result   : Theorem 165.38s 21.16s
% Output   : CNFRefutation 165.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   34 (   1 unt;   0 def)
%            Number of atoms       :   78 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   75 (  31   ~;  37   |;   1   &)
%                                         (   5 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   32 (   2 sgn  12   !;   0   ?)

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

fof(thI20_negated,plain,
    ~ ! [A,B] :
        ( equal_set(A,union(A,B))
      <=> subset(B,A) ),
    inference(negate_conjecture,[status(cth)],[thI20]) ).

cnf(29,plain,
    ( subset(sK6,sK5)
    | equal_set(sK5,union(sK5,sK6)) ),
    inference(cnf,[status(esa)],[thI20_negated]) ).

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

cnf(30,plain,
    ( ~ subset(sK6,sK5)
    | ~ equal_set(sK5,union(sK5,sK6)) ),
    inference(cnf,[status(esa)],[thI20_negated]) ).

cnf(l2,plain,
    ( ~ subset(sK6,sK5)
    | ~ equal_set(sK5,union(sK5,sK6)) ),
    inference(instantiation,[status(thm)],[30]) ).

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

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(l6,plain,
    ( ~ subset(sK5,union(sK5,sK6))
    | ~ subset(union(sK5,sK6),sK5)
    | equal_set(sK5,union(sK5,sK6)) ),
    inference(instantiation,[status(thm)],[5]) ).

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(l99,plain,
    ( ~ member(sK1(union(sK5,sK6),sK5),sK5)
    | subset(union(sK5,sK6),sK5) ),
    inference(instantiation,[status(thm)],[2]) ).

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

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(l100,plain,
    ( ~ member(sK1(union(sK5,sK6),sK5),union(union(sK5,sK6),sK5))
    | member(sK1(union(sK5,sK6),sK5),union(sK5,sK6))
    | member(sK1(union(sK5,sK6),sK5),sK5) ),
    inference(instantiation,[status(thm)],[11]) ).

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

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

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

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

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

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

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

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

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

cnf(l129,plain,
    ( subset(union(sK5,sK6),sK5)
    | member(sK1(union(sK5,sK6),sK5),union(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(l140,plain,
    ( ~ subset(sK6,sK5)
    | ~ member(sK1(union(sK5,sK6),sK5),sK6)
    | member(sK1(union(sK5,sK6),sK5),sK5) ),
    inference(instantiation,[status(thm)],[0]) ).

cnf(l263,plain,
    ( ~ subset(union(sK5,sK6),sK5)
    | ~ member(sK1(sK6,sK5),union(sK5,sK6))
    | 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(l264,plain,
    ( ~ equal_set(sK5,union(sK5,sK6))
    | subset(union(sK5,sK6),sK5) ),
    inference(instantiation,[status(thm)],[4]) ).

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

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l2,l1,l6,l99,l10,l100,l12,l227,l105,l231,l14,l108,l129,l140,l263,l264,l410]) ).

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