↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN069+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 : n019.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:41 PM UTC 2026

% Result   : Theorem 3.04s 0.83s
% Output   : Proof 3.04s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   33 (   9 unt;   0 def)
%            Number of atoms       :   92 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   94 (  35   ~;  29   |;  26   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   40 (   5 sgn  17   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,axiom,
    ! [X] :
      ( ( ! [Y] :
            ( ( big_h(X,Y)
              & big_g(Y) )
           => big_j(X,Y) )
        & big_f(X) )
     => ! [Y1] :
          ( big_k(Y1)
          & big_h(X,Y1)
          & big_g(Y1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel45_1) ).

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

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

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

cnf(p15,plain,
    ( big_g(sk0(X0))
    | ~ big_f(X0) ),
    inference(factoring,[status(thm)],[c0]) ).

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

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

fof(f2_sk,plain,
    ! [Y,Y1] :
      ( ( big_j(sk1,Y1)
        | ~ big_h(sk1,Y1)
        | ~ big_g(Y1) )
      & ( big_l(Y)
        | ~ big_h(sk1,Y) )
      & big_f(sk1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f2_nnf]) ).

cnf(c10,plain,
    big_f(sk1),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p22,plain,
    big_g(sk0(sk1)),
    inference(resolution,[status(thm)],[p15,c10]) ).

cnf(c12,plain,
    ( big_j(sk1,X2)
    | ~ big_h(sk1,X2)
    | ~ big_g(X2) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p26,plain,
    ( big_j(sk1,sk0(sk1))
    | ~ big_h(sk1,sk0(sk1)) ),
    inference(resolution,[status(thm)],[p22,c12]) ).

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

cnf(p16,plain,
    ( big_h(X0,sk0(X0))
    | ~ big_f(X0) ),
    inference(factoring,[status(thm)],[c4]) ).

cnf(p23,plain,
    big_h(sk1,sk0(sk1)),
    inference(resolution,[status(thm)],[p16,c10]) ).

cnf(p30,plain,
    big_j(sk1,sk0(sk1)),
    inference(resolution,[status(thm)],[p26,p23]) ).

cnf(c8,plain,
    ( big_k(X2)
    | ~ big_j(X0,sk0(X0))
    | ~ big_f(X0) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p19,plain,
    ( big_k(X0)
    | ~ big_j(sk1,sk0(sk1)) ),
    inference(resolution,[status(thm)],[c10,c8]) ).

cnf(p34,plain,
    big_k(X0),
    inference(resolution,[status(thm)],[p30,p19]) ).

fof(f3,conjecture,
    ? [X] :
      ( ~ ? [Y] :
            ( big_h(X,Y)
            & big_g(Y) )
      & big_f(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel45) ).

fof(f3_neg,negated_conjecture,
    ~ ? [X] :
        ( ~ ? [Y] :
              ( big_h(X,Y)
              & big_g(Y) )
        & big_f(X) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

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

fof(f3_sk,plain,
    ! [X] :
      ( ( big_h(X,sk2(X))
        & big_g(sk2(X)) )
      | ~ big_f(X) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk2])],[f3_nnf]) ).

cnf(c14,plain,
    ( big_h(X0,sk2(X0))
    | ~ big_f(X0) ),
    inference(cnf_transformation,[status(esa)],[f3_sk]) ).

cnf(p21,plain,
    big_h(sk1,sk2(sk1)),
    inference(resolution,[status(thm)],[c14,c10]) ).

cnf(c11,plain,
    ( big_l(X1)
    | ~ big_h(sk1,X1) ),
    inference(cnf_transformation,[status(esa)],[f2_sk]) ).

cnf(p25,plain,
    big_l(sk2(sk1)),
    inference(resolution,[status(thm)],[p21,c11]) ).

fof(f1,axiom,
    ~ ? [Y] :
        ( big_k(Y)
        & big_l(Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel45_2) ).

fof(f1_nnf,plain,
    ! [Y] :
      ( ~ big_k(Y)
      | ~ big_l(Y) ),
    inference(nnf_transformation,[status(thm)],[f1]) ).

fof(f1_sk,plain,
    ! [Y] :
      ( ~ big_k(Y)
      | ~ big_l(Y) ),
    inference(skolemisation,[status(esa)],[f1_nnf]) ).

cnf(c9,plain,
    ( ~ big_k(X0)
    | ~ big_l(X0) ),
    inference(cnf_transformation,[status(esa)],[f1_sk]) ).

cnf(p29,plain,
    ~ big_k(sk2(sk1)),
    inference(resolution,[status(thm)],[p25,c9]) ).

cnf(p37,plain,
    $false,
    inference(resolution,[status(thm)],[p34,p29]) ).

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