↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n017.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:36:22 PM UTC 2026

% Result   : Theorem 4.34s 1.07s
% Output   : Proof 4.34s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   19 (   5 unt;   0 def)
%            Number of atoms       :   83 (   0 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :   88 (  24   ~;  32   |;  24   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   28 (   0 sgn  12   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ! [A] :
    ? [X,X2,X3,X4,Y] :
      ( ( ( s(A,Y)
         => p(Y) )
        & ( e(X2)
         => ( c(f(X2))
            | g(X2) ) )
        & ( e(X)
         => ( s(X,f(X))
            | g(X) ) )
        & e(A)
        & p(A) )
     => ( ( c(X4)
          & p(X4) )
        | ( g(X3)
          & p(X3) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f0_neg,negated_conjecture,
    ~ ! [A] :
      ? [X,X2,X3,X4,Y] :
        ( ( ( s(A,Y)
           => p(Y) )
          & ( e(X2)
           => ( c(f(X2))
              | g(X2) ) )
          & ( e(X)
           => ( s(X,f(X))
              | g(X) ) )
          & e(A)
          & p(A) )
       => ( ( c(X4)
            & p(X4) )
          | ( g(X3)
            & p(X3) ) ) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ? [A] :
    ! [X,X2,X3,X4,Y] :
      ( ( ~ c(X4)
        | ~ p(X4) )
      & ( ~ g(X3)
        | ~ p(X3) )
      & ( p(Y)
        | ~ s(A,Y) )
      & ( c(f(X2))
        | g(X2)
        | ~ e(X2) )
      & ( s(X,f(X))
        | g(X)
        | ~ e(X) )
      & e(A)
      & p(A) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

fof(f0_sk,plain,
    ! [X,X2,Y,X3,X4] :
      ( ( ~ c(X4)
        | ~ p(X4) )
      & ( ~ g(X3)
        | ~ p(X3) )
      & ( p(Y)
        | ~ s(sk0,Y) )
      & ( c(f(X2))
        | g(X2)
        | ~ e(X2) )
      & ( s(X,f(X))
        | g(X)
        | ~ e(X) )
      & e(sk0)
      & p(sk0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).

cnf(c2,plain,
    ( s(X1,f(X1))
    | g(X1)
    | ~ e(X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(c1,plain,
    e(sk0),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p8,plain,
    ( s(sk0,f(sk0))
    | g(sk0) ),
    inference(resolution,[status(thm)],[c2,c1]) ).

cnf(c4,plain,
    ( p(X5)
    | ~ s(sk0,X5) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p10,plain,
    ( p(f(sk0))
    | g(sk0) ),
    inference(resolution,[status(thm)],[p8,c4]) ).

cnf(c6,plain,
    ( ~ c(X4)
    | ~ p(X4) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p13,plain,
    ( ~ c(f(sk0))
    | g(sk0) ),
    inference(resolution,[status(thm)],[p10,c6]) ).

cnf(c3,plain,
    ( c(f(X2))
    | g(X2)
    | ~ e(X2) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p11,plain,
    ( c(f(sk0))
    | g(sk0) ),
    inference(resolution,[status(thm)],[c3,c1]) ).

cnf(p14,plain,
    ( g(sk0)
    | g(sk0) ),
    inference(resolution,[status(thm)],[p13,p11]) ).

cnf(p15,plain,
    g(sk0),
    inference(factoring,[status(thm)],[p14]) ).

cnf(c5,plain,
    ( ~ g(X3)
    | ~ p(X3) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(c0,plain,
    p(sk0),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p7,plain,
    ~ g(sk0),
    inference(resolution,[status(thm)],[c5,c0]) ).

cnf(p16,plain,
    $false,
    inference(resolution,[status(thm)],[p15,p7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN943+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.11/0.36  % Computer : n017.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Fri Sep 25 02:32:05 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.34/1.07  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.34/1.07  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------