↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN070+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 : n020.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:33:42 PM UTC 2026

% Result   : Theorem 4.35s 1.13s
% Output   : Proof 4.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   34 (   6 unt;   0 def)
%            Number of atoms       :  104 (   0 equ)
%            Maximal formula atoms :    7 (   3 avg)
%            Number of connectives :  115 (  45   ~;  45   |;  18   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   50 (  11 sgn  19   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,conjecture,
    ! [X] :
      ( big_f(X)
     => big_g(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46) ).

fof(f3_neg,negated_conjecture,
    ~ ! [X] :
        ( big_f(X)
       => big_g(X) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

fof(f3_nnf,plain,
    ? [X] :
      ( ~ big_g(X)
      & big_f(X) ),
    inference(nnf_transformation,[status(thm)],[f3_neg]) ).

fof(f3_sk,plain,
    ( ~ big_g(sk1)
    & big_f(sk1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f3_nnf]) ).

cnf(c7,plain,
    big_f(sk1),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

fof(f0,axiom,
    ! [X,Y] :
      ( ( ( ( big_h(Y,X)
            & big_f(Y) )
         => big_g(Y) )
        & big_f(X) )
     => big_g(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_1) ).

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

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

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

cnf(p12,plain,
    ( big_g(sk1)
    | big_f(X0) ),
    inference(resolution,[status(thm)],[c7,c0]) ).

cnf(c8,plain,
    ~ big_g(sk1),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(p21,plain,
    big_f(X0),
    inference(resolution,[status(thm)],[p12,c8]) ).

fof(f2,axiom,
    ! [X,Y] :
      ( ( big_h(X,Y)
        & big_f(Y)
        & big_f(X) )
     => ~ big_j(Y,X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_3) ).

fof(f2_nnf,plain,
    ! [X,Y] :
      ( ~ big_j(Y,X)
      | ~ big_h(X,Y)
      | ~ big_f(Y)
      | ~ big_f(X) ),
    inference(nnf_transformation,[status(thm)],[f2]) ).

fof(f2_sk,plain,
    ! [X,Y] :
      ( ~ big_j(Y,X)
      | ~ big_h(X,Y)
      | ~ big_f(Y)
      | ~ big_f(X) ),
    inference(skolemisation,[status(esa)],[f2_nnf]) ).

cnf(c6,plain,
    ( ~ big_j(X1,X0)
    | ~ big_h(X0,X1)
    | ~ big_f(X1)
    | ~ big_f(X0) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p25,plain,
    ( ~ big_j(X0,X1)
    | ~ big_h(X1,X0)
    | ~ big_f(X0) ),
    inference(resolution,[status(thm)],[p21,c6]) ).

cnf(p27,plain,
    ( ~ big_j(X1,X0)
    | ~ big_h(X0,X1) ),
    inference(resolution,[status(thm)],[p25,p21]) ).

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

cnf(p23,plain,
    ( big_g(X1)
    | big_h(X0,X1) ),
    inference(resolution,[status(thm)],[p21,c1]) ).

cnf(p28,plain,
    ( big_g(X0)
    | ~ big_j(X0,X1) ),
    inference(resolution,[status(thm)],[p27,p23]) ).

fof(f1,axiom,
    ( ? [X] :
        ( ~ big_g(X)
        & big_f(X) )
   => ? [X1] :
        ( ! [Y] :
            ( ( ~ big_g(Y)
              & big_f(Y) )
           => big_j(X1,Y) )
        & ~ big_g(X1)
        & big_f(X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel46_2) ).

fof(f1_nnf,plain,
    ( ? [X1] :
        ( ! [Y] :
            ( big_j(X1,Y)
            | big_g(Y)
            | ~ big_f(Y) )
        & ~ big_g(X1)
        & big_f(X1) )
    | ! [X] :
        ( big_g(X)
        | ~ big_f(X) ) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [X,Y] :
      ( ( ( big_j(sk0,Y)
          | big_g(Y)
          | ~ big_f(Y) )
        & ~ big_g(sk0)
        & big_f(sk0) )
      | big_g(X)
      | ~ big_f(X) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f1_nnf]) ).

cnf(c5,plain,
    ( big_j(sk0,X2)
    | big_g(X2)
    | ~ big_f(X2)
    | big_g(X0)
    | ~ big_f(X0) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p9,plain,
    ( big_j(sk0,X0)
    | big_g(X0)
    | big_g(X0)
    | ~ big_f(X0) ),
    inference(factoring,[status(thm)],[c5]) ).

cnf(p17,plain,
    ( big_j(sk0,X0)
    | big_g(X0)
    | ~ big_f(X0) ),
    inference(factoring,[status(thm)],[p9]) ).

cnf(p26,plain,
    ( big_j(sk0,X0)
    | big_g(X0) ),
    inference(resolution,[status(thm)],[p21,p17]) ).

cnf(p29,plain,
    ( big_g(X0)
    | big_g(sk0) ),
    inference(resolution,[status(thm)],[p28,p26]) ).

cnf(p30,plain,
    big_g(sk0),
    inference(factoring,[status(thm)],[p29]) ).

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

cnf(p24,plain,
    ( big_g(X1)
    | ~ big_g(X0) ),
    inference(resolution,[status(thm)],[p21,c2]) ).

cnf(p31,plain,
    big_g(X0),
    inference(resolution,[status(thm)],[p30,p24]) ).

cnf(p32,plain,
    $false,
    inference(resolution,[status(thm)],[p31,c8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN070+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.35  % Computer : n020.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Fri Sep 25 00:04:48 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.35/1.13  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.35/1.13  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------