↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 0.15s 6.02s
% Output   : Proof 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    8 (   3 unt;   0 def)
%            Number of atoms       :   17 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   13 (   4   ~;   5   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   19 (   2 sgn  12   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ( ! [X] :
        ( ! [Y] : big_f(X,Y)
        | big_f(a,X) )
   => ? [X1] :
      ! [Y1] : big_f(X1,Y1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel50) ).

fof(f0_neg,negated_conjecture,
    ~ ( ! [X] :
          ( ! [Y] : big_f(X,Y)
          | big_f(a,X) )
     => ? [X1] :
        ! [Y1] : big_f(X1,Y1) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ( ! [X1] :
      ? [Y1] : ~ big_f(X1,Y1)
    & ! [X] :
        ( ! [Y] : big_f(X,Y)
        | big_f(a,X) ) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

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

cnf(c0,plain,
    ( big_f(X0,X1)
    | big_f(a,X0) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(c1,plain,
    ~ big_f(X2,sk0(X2)),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p4,plain,
    big_f(a,X0),
    inference(resolution,[status(thm)],[c0,c1]) ).

cnf(p5,plain,
    $false,
    inference(resolution,[status(thm)],[p4,c1]) ).

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