↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 4.57s 1.07s
% Output   : Proof 4.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (   6 unt;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   37 (  12   ~;   9   |;   8   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   20 (   4 sgn  10   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ! [A,B] :
      ( ! [Y] :
          ( q(Y)
         => p(Y) )
     => ? [X] :
          ( ( q(X)
           => p(B) )
          & ( p(X)
           => p(A) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f0_neg,negated_conjecture,
    ~ ! [A,B] :
        ( ! [Y] :
            ( q(Y)
           => p(Y) )
       => ? [X] :
            ( ( q(X)
             => p(B) )
            & ( p(X)
             => p(A) ) ) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ? [A,B] :
      ( ! [X] :
          ( ( ~ p(B)
            & q(X) )
          | ( ~ p(A)
            & p(X) ) )
      & ! [Y] :
          ( p(Y)
          | ~ q(Y) ) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

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

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

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

cnf(p6,plain,
    ( q(sk0)
    | q(X0) ),
    inference(resolution,[status(thm)],[c3,c1]) ).

cnf(p10,plain,
    q(sk0),
    inference(factoring,[status(thm)],[p6]) ).

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

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

cnf(p12,plain,
    q(X0),
    inference(resolution,[status(thm)],[p11,c3]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN950+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n010.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 02:38:44 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.57/1.07  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.57/1.07  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------