↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN063+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/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:33:39 PM UTC 2026

% Result   : Theorem 3.64s 1.13s
% Output   : Proof 3.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   17 (   4 unt;   0 def)
%            Number of atoms       :   94 (   0 equ)
%            Maximal formula atoms :   20 (   5 avg)
%            Number of connectives :  116 (  39   ~;  47   |;  24   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   17 (   7 sgn   8   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ( ! [X] :
        ( ( ( big_p(X)
           => big_p(b) )
          & big_p(a) )
       => big_p(c) )
  <=> ! [X1] :
        ( ( big_p(c)
          | ~ big_p(b)
          | ~ big_p(a) )
        & ( big_p(c)
          | big_p(X1)
          | ~ big_p(a) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel33) ).

fof(f0_neg,negated_conjecture,
    ~ ( ! [X] :
          ( ( ( big_p(X)
             => big_p(b) )
            & big_p(a) )
         => big_p(c) )
    <=> ! [X1] :
          ( ( big_p(c)
            | ~ big_p(b)
            | ~ big_p(a) )
          & ( big_p(c)
            | big_p(X1)
            | ~ big_p(a) ) ) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ( ( ! [X1] :
          ( ( big_p(c)
            | ~ big_p(b)
            | ~ big_p(a) )
          & ( big_p(c)
            | big_p(X1)
            | ~ big_p(a) ) )
      & ? [X] :
          ( ~ big_p(c)
          & ( big_p(b)
            | ~ big_p(X) )
          & big_p(a) ) )
    | ( ? [X1] :
          ( ( ~ big_p(c)
            & big_p(b)
            & big_p(a) )
          | ( ~ big_p(c)
            & ~ big_p(X1)
            & big_p(a) ) )
      & ! [X] :
          ( big_p(c)
          | ( ~ big_p(b)
            & big_p(X) )
          | ~ big_p(a) ) ) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

fof(f0_sk,plain,
    ! [X,X1] :
      ( ( ( big_p(c)
          | ~ big_p(b)
          | ~ big_p(a) )
        & ( big_p(c)
          | big_p(X1)
          | ~ big_p(a) )
        & ~ big_p(c)
        & ( big_p(b)
          | ~ big_p(sk1) )
        & big_p(a) )
      | ( ( ( ~ big_p(c)
            & big_p(b)
            & big_p(a) )
          | ( ~ big_p(c)
            & ~ big_p(sk0)
            & big_p(a) ) )
        & ( big_p(c)
          | ( ~ big_p(b)
            & big_p(X) )
          | ~ big_p(a) ) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0,sk1])],[f0_nnf]) ).

cnf(c3,plain,
    ( big_p(c)
    | big_p(X1)
    | ~ big_p(a)
    | big_p(c)
    | big_p(X0)
    | ~ big_p(a) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p63,plain,
    ( big_p(c)
    | big_p(X1)
    | big_p(c)
    | big_p(X0)
    | ~ big_p(a) ),
    inference(factoring,[status(thm)],[c3]) ).

cnf(p72,plain,
    ( big_p(X1)
    | big_p(c)
    | big_p(X0)
    | ~ big_p(a) ),
    inference(factoring,[status(thm)],[p63]) ).

cnf(p73,plain,
    ( big_p(X0)
    | big_p(c)
    | ~ big_p(a) ),
    inference(factoring,[status(thm)],[p72]) ).

cnf(p74,plain,
    ( big_p(c)
    | ~ big_p(a) ),
    inference(factoring,[status(thm)],[p73]) ).

cnf(c10,plain,
    ( big_p(a)
    | big_p(a)
    | big_p(a) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p55,plain,
    ( big_p(a)
    | big_p(a) ),
    inference(factoring,[status(thm)],[c10]) ).

cnf(p56,plain,
    big_p(a),
    inference(factoring,[status(thm)],[p55]) ).

cnf(p75,plain,
    big_p(c),
    inference(resolution,[status(thm)],[p74,p56]) ).

cnf(c52,plain,
    ( ~ big_p(c)
    | ~ big_p(c)
    | ~ big_p(c) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p60,plain,
    ( ~ big_p(c)
    | ~ big_p(c) ),
    inference(factoring,[status(thm)],[c52]) ).

cnf(p61,plain,
    ~ big_p(c),
    inference(factoring,[status(thm)],[p60]) ).

cnf(p76,plain,
    $false,
    inference(resolution,[status(thm)],[p75,p61]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN063+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.36  % Computer : n017.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Thu Sep 24 23:56:46 UTC 2026
% 0.03/0.36  % CPUTime  : 
% 0.03/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.64/1.13  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.64/1.13  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------