↑ Up

hopCoP---0.1.THM-CRf.s

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

% Computer : n027.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:41 PM UTC 2025

% Result   : Theorem 30.52s 4.20s
% Output   : CNFRefutation 30.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   8 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   40 (  14   ~;  12   |;   4   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-3 aty)
%            Number of variables   :   30 (   0 sgn  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thIV9,plain,
    ! [R,E] :
      ( order(R,E)
     => ! [X,Y] :
          ( ( subset(X,E)
            & subset(Y,E)
            & subset(X,Y) )
         => ! [M] :
              ( upper_bound(M,R,Y)
             => upper_bound(M,R,X) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV9) ).

fof(thIV9_negated,plain,
    ~ ! [R,E] :
        ( order(R,E)
       => ! [X,Y] :
            ( ( subset(X,E)
              & subset(Y,E)
              & subset(X,Y) )
           => ! [M] :
                ( upper_bound(M,R,Y)
               => upper_bound(M,R,X) ) ) ),
    inference(negate_conjecture,[status(cth)],[thIV9]) ).

cnf(90,plain,
    subset(sK23,sK24),
    inference(cnf,[status(esa)],[thIV9_negated]) ).

cnf(l0,plain,
    subset(sK23,sK24),
    inference(instantiation,[status(thm)],[90]) ).

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

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

cnf(l1,plain,
    ( ~ subset(sK23,sK24)
    | ~ member(sK13(sK21,sK23,sK25),sK23)
    | member(sK13(sK21,sK23,sK25),sK24) ),
    inference(instantiation,[status(thm)],[0]) ).

fof(upper_bound,plain,
    ! [R,E,M] :
      ( upper_bound(M,R,E)
    <=> ! [X] :
          ( member(X,E)
         => apply(R,X,M) ) ),
    file('Axioms/SET006+3.ax',upper_bound) ).

cnf(52,plain,
    ( member(sK13(X0,X1,X2),X1)
    | upper_bound(X2,X0,X1) ),
    inference(cnf,[status(esa)],[upper_bound]) ).

cnf(l2,plain,
    ( member(sK13(sK21,sK23,sK25),sK23)
    | upper_bound(sK25,sK21,sK23) ),
    inference(instantiation,[status(thm)],[52]) ).

cnf(92,plain,
    ~ upper_bound(sK25,sK21,sK23),
    inference(cnf,[status(esa)],[thIV9_negated]) ).

cnf(l8,plain,
    ~ upper_bound(sK25,sK21,sK23),
    inference(instantiation,[status(thm)],[92]) ).

cnf(51,plain,
    ( ~ member(X0,X1)
    | ~ upper_bound(X2,X3,X1)
    | apply(X3,X0,X2) ),
    inference(cnf,[status(esa)],[upper_bound]) ).

cnf(l4,plain,
    ( ~ member(sK13(sK21,sK23,sK25),sK24)
    | ~ upper_bound(sK25,sK21,sK24)
    | apply(sK21,sK13(sK21,sK23,sK25),sK25) ),
    inference(instantiation,[status(thm)],[51]) ).

cnf(91,plain,
    upper_bound(sK25,sK21,sK24),
    inference(cnf,[status(esa)],[thIV9_negated]) ).

cnf(l7,plain,
    upper_bound(sK25,sK21,sK24),
    inference(instantiation,[status(thm)],[91]) ).

cnf(53,plain,
    ( ~ apply(X0,sK13(X0,X1,X2),X2)
    | upper_bound(X2,X0,X1) ),
    inference(cnf,[status(esa)],[upper_bound]) ).

cnf(l234,plain,
    ( ~ apply(sK21,sK13(sK21,sK23,sK25),sK25)
    | upper_bound(sK25,sK21,sK23) ),
    inference(instantiation,[status(thm)],[53]) ).

cnf(l239,plain,
    ~ upper_bound(sK25,sK21,sK23),
    inference(instantiation,[status(thm)],[92]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l2,l8,l4,l7,l234,l239]) ).

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