↑ Up

FindProof---0.1.THM-Prf.s

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

% Computer : n012.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:35:35 PM UTC 2026

% Result   : Theorem 1.86s 0.72s
% Output   : Proof 1.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   18 (   5 unt;   0 def)
%            Number of atoms       :   59 (   0 equ)
%            Maximal formula atoms :    9 (   3 avg)
%            Number of connectives :   62 (  21   ~;  19   |;  16   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   46 (   8 sgn  22   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ( ( ! [W] :
          ( q(W)
         => ~ m(g(W)) )
      & ! [R] :
        ? [S] :
          ( ( q(f(R,S))
            & m(R) )
          | p(R,S) )
      & ! [X] :
          ( ? [Y] : p(X,Y)
         => ! [Z] : p(Z,Z) ) )
   => ! [U] :
      ? [V] :
        ( p(U,U)
        & p(g(U),V) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm69) ).

fof(f0_neg,negated_conjecture,
    ~ ( ( ! [W] :
            ( q(W)
           => ~ m(g(W)) )
        & ! [R] :
          ? [S] :
            ( ( q(f(R,S))
              & m(R) )
            | p(R,S) )
        & ! [X] :
            ( ? [Y] : p(X,Y)
           => ! [Z] : p(Z,Z) ) )
     => ! [U] :
        ? [V] :
          ( p(U,U)
          & p(g(U),V) ) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ( ? [U] :
      ! [V] :
        ( ~ p(U,U)
        | ~ p(g(U),V) )
    & ! [W] :
        ( ~ m(g(W))
        | ~ q(W) )
    & ! [R] :
      ? [S] :
        ( ( q(f(R,S))
          & m(R) )
        | p(R,S) )
    & ! [X] :
        ( ! [Z] : p(Z,Z)
        | ! [Y] : ~ p(X,Y) ) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

fof(f0_sk,plain,
    ! [X,Y,Z,R,W,V] :
      ( ( ~ p(sk1,sk1)
        | ~ p(g(sk1),V) )
      & ( ~ m(g(W))
        | ~ q(W) )
      & ( ( q(f(R,sk0(R)))
          & m(R) )
        | p(R,sk0(R)) )
      & ( p(Z,Z)
        | ~ p(X,Y) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).

cnf(c2,plain,
    ( q(f(X3,sk0(X3)))
    | p(X3,sk0(X3)) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(c3,plain,
    ( ~ m(g(X5))
    | ~ q(X5) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p6,plain,
    ( ~ m(g(f(X0,sk0(X0))))
    | p(X0,sk0(X0)) ),
    inference(resolution,[status(thm)],[c2,c3]) ).

cnf(c4,plain,
    ( ~ p(sk1,sk1)
    | ~ p(g(sk1),X7) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(c1,plain,
    ( m(X3)
    | p(X3,sk0(X3)) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

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

cnf(p5,plain,
    ( p(X1,X1)
    | m(X0) ),
    inference(resolution,[status(thm)],[c1,c0]) ).

cnf(p8,plain,
    ( m(X0)
    | ~ p(sk1,sk1) ),
    inference(resolution,[status(thm)],[c4,p5]) ).

cnf(p9,plain,
    ( m(X1)
    | m(X0) ),
    inference(resolution,[status(thm)],[p8,p5]) ).

cnf(p10,plain,
    m(X0),
    inference(factoring,[status(thm)],[p9]) ).

cnf(p11,plain,
    p(X0,sk0(X0)),
    inference(resolution,[status(thm)],[p6,p10]) ).

cnf(p13,plain,
    ~ p(sk1,sk1),
    inference(resolution,[status(thm)],[p11,c4]) ).

cnf(p12,plain,
    p(X0,X0),
    inference(resolution,[status(thm)],[p11,c0]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SYN728+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.02  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.02/0.32  % Computer : n012.cluster.edu
% 0.02/0.32  % Model    : x86_64 x86_64
% 0.02/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.32  % Memory   : 8046.5625MB
% 0.02/0.32  % OS       : Linux 6.8.0-71-generic
% 0.02/0.32  % CPULimit : 300
% 0.02/0.32  % WCLimit  : 300
% 0.02/0.32  % DateTime : Fri Sep 25 02:12:05 UTC 2026
% 0.02/0.32  % CPUTime  : 
% 0.02/0.32  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.86/0.72  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.86/0.72  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------