↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN319+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300

% Computer : n014.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 03:34:20 PM UTC 2026

% Result   : Theorem 2.59s 0.83s
% Output   : Proof 2.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   13 (   3 unt;   0 def)
%            Number of atoms       :   63 (   0 equ)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :   70 (  20   ~;  18   |;  18   &)
%                                         (   0 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 2-2 aty)
%            Number of variables   :   27 (   9 sgn   8   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ? [X,Y] :
    ! [Z1,Z2] :
      ( ( ( big_f(Y)
         => big_g(Z1) )
       => ( ~ big_f(Z1)
          & big_g(X) ) )
     => ( ( ( big_g(X)
            | big_f(X) )
         => big_h(X) )
       => ( ( big_h(Y)
           => ( ( big_g(Z2)
                | big_f(Z2) )
             => big_h(Z2) ) )
          & big_h(Z2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_2_5) ).

fof(f0_neg,negated_conjecture,
    ~ ? [X,Y] :
      ! [Z1,Z2] :
        ( ( ( big_f(Y)
           => big_g(Z1) )
         => ( ~ big_f(Z1)
            & big_g(X) ) )
       => ( ( ( big_g(X)
              | big_f(X) )
           => big_h(X) )
         => ( ( big_h(Y)
             => ( ( big_g(Z2)
                  | big_f(Z2) )
               => big_h(Z2) ) )
            & big_h(Z2) ) ) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ! [X,Y] :
    ? [Z1,Z2] :
      ( ( ( ~ big_h(Z2)
          & ( big_g(Z2)
            | big_f(Z2) )
          & big_h(Y) )
        | ~ big_h(Z2) )
      & ( big_h(X)
        | ( ~ big_g(X)
          & ~ big_f(X) ) )
      & ( ( ~ big_f(Z1)
          & big_g(X) )
        | ( ~ big_g(Z1)
          & big_f(Y) ) ) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

fof(f0_sk,plain,
    ! [Y,X] :
      ( ( ( ~ big_h(sk1(X,Y))
          & ( big_g(sk1(X,Y))
            | big_f(sk1(X,Y)) )
          & big_h(Y) )
        | ~ big_h(sk1(X,Y)) )
      & ( big_h(X)
        | ( ~ big_g(X)
          & ~ big_f(X) ) )
      & ( ( ~ big_f(sk0(X,Y))
          & big_g(X) )
        | ( ~ big_g(sk0(X,Y))
          & big_f(Y) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).

cnf(c8,plain,
    ( ~ big_h(sk1(X0,X1))
    | ~ big_h(sk1(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p14,plain,
    ~ big_h(sk1(X0,X1)),
    inference(factoring,[status(thm)],[c8]) ).

cnf(c5,plain,
    ( big_h(X0)
    | ~ big_g(X0) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(c0,plain,
    ( big_g(X0)
    | big_f(X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p10,plain,
    ( big_f(X1)
    | big_h(X0) ),
    inference(resolution,[status(thm)],[c5,c0]) ).

cnf(c4,plain,
    ( big_h(X0)
    | ~ big_f(X0) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p11,plain,
    ( big_h(X1)
    | big_h(X0) ),
    inference(resolution,[status(thm)],[p10,c4]) ).

cnf(p12,plain,
    big_h(X0),
    inference(factoring,[status(thm)],[p11]) ).

cnf(p15,plain,
    $false,
    inference(resolution,[status(thm)],[p14,p12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN319+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n014.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Fri Sep 25 00:49:03 UTC 2026
% 0.14/0.36  % CPUTime  : 
% 0.14/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 2.59/0.83  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.59/0.83  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------