↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : SYN939+1 : TPTP v9.0.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/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 09:28:40 PM UTC 2025

% Result   : Theorem 0.14s 0.34s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   22 (   4 unt;   0 def)
%            Number of atoms       :   61 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   66 (  27   ~;  27   |;   6   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   17 (   4 sgn   6   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,plain,
    ! [C,B] :
      ( ! [Z] : q(f(Z))
     => ? [X,Y] :
          ( ( p(f(Y))
           => p(X) )
          & ( r(Y)
           => ( r(B)
              & r(C) ) )
          & q(X) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(prove_this_negated,plain,
    ~ ! [C,B] :
        ( ! [Z] : q(f(Z))
       => ? [X,Y] :
            ( ( p(f(Y))
             => p(X) )
            & ( r(Y)
             => ( r(B)
                & r(C) ) )
            & q(X) ) ),
    inference(negate_conjecture,[status(cth)],[prove_this]) ).

cnf(0,plain,
    q(f(X0)),
    inference(cnf,[status(esa)],[prove_this_negated]) ).

cnf(l0,plain,
    q(f(sK1)),
    inference(instantiation,[status(thm)],[0]) ).

cnf(2,plain,
    ( ~ p(X0)
    | ~ q(X0)
    | sP0(X1) ),
    inference(cnf,[status(esa)],[prove_this_negated]) ).

cnf(l1,plain,
    ( ~ p(f(sK1))
    | ~ q(f(sK1))
    | sP0(sK2) ),
    inference(instantiation,[status(thm)],[2]) ).

cnf(1,plain,
    ( ~ q(X0)
    | p(f(X1))
    | sP0(X1) ),
    inference(cnf,[status(esa)],[prove_this_negated]) ).

cnf(l2,plain,
    ( ~ q(f(sK1))
    | p(f(sK1))
    | sP0(sK1) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(4,plain,
    ( r(X0)
    | ~ sP0(X0) ),
    inference(cnf,[status(esa)],[prove_this_negated]) ).

cnf(l3,plain,
    ( r(sK1)
    | ~ sP0(sK1) ),
    inference(instantiation,[status(thm)],[4]) ).

cnf(l4,plain,
    ( r(sK2)
    | ~ sP0(sK2) ),
    inference(instantiation,[status(thm)],[4]) ).

cnf(3,plain,
    ( ~ r(sK1)
    | ~ r(sK2)
    | ~ sP0(X0) ),
    inference(cnf,[status(esa)],[prove_this_negated]) ).

cnf(l5,plain,
    ( ~ r(sK1)
    | ~ r(sK2)
    | ~ sP0(sK1) ),
    inference(instantiation,[status(thm)],[3]) ).

cnf(l6,plain,
    ( r(sK2)
    | ~ sP0(sK2) ),
    inference(instantiation,[status(thm)],[4]) ).

cnf(l7,plain,
    ( ~ r(sK1)
    | ~ r(sK2)
    | ~ sP0(sK2) ),
    inference(instantiation,[status(thm)],[3]) ).

cnf(l8,plain,
    ( ~ q(f(sK1))
    | p(f(sK2))
    | sP0(sK2) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(l9,plain,
    ( r(sK1)
    | ~ sP0(sK1) ),
    inference(instantiation,[status(thm)],[4]) ).

cnf(l10,plain,
    ( ~ p(f(sK2))
    | ~ q(f(sK2))
    | sP0(sK2) ),
    inference(instantiation,[status(thm)],[2]) ).

cnf(l11,plain,
    ( ~ p(f(sK1))
    | ~ q(f(sK1))
    | sP0(sK1) ),
    inference(instantiation,[status(thm)],[2]) ).

cnf(l12,plain,
    ( ~ q(f(sK1))
    | p(f(sK1))
    | sP0(sK1) ),
    inference(instantiation,[status(thm)],[1]) ).

cnf(l13,plain,
    q(f(sK2)),
    inference(instantiation,[status(thm)],[0]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l2,l3,l4,l5,l6,l7,l8,l9,l10,l11,l12,l13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN939+1 : TPTP v9.0.0. Released v3.1.0.
% 0.07/0.13  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.34  % Computer : n028.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Tue Jul 22 18:50:19 EDT 2025
% 0.14/0.34  % CPUTime  : 
% 0.14/0.34  % launching worker at depth: 1
% 0.14/0.34  % launching worker at depth: 3
% 0.14/0.34  % launching worker at depth: 6
% 0.14/0.34  % launching worker at depth: 7
% 0.14/0.34  % launching worker at depth: 8
% 0.14/0.34  % launching worker at depth: 2
% 0.14/0.34  % launching worker at depth: 4
% 0.14/0.34  % launching worker at depth: 5
% 0.14/0.34  % launching worker at depth: 9
% 0.14/0.34  % SZS status Theorem for theBenchmark
% 0.14/0.34  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------