↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : SYN369+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 : n018.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:34:31 PM UTC 2026

% Result   : Theorem 3.85s 0.93s
% Output   : Proof 3.85s
% 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 :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :   25 (   4 sgn  16   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ( ! [U,V,W] :
        ( big_p(V,W)
        | big_p(U,V) )
   => ? [X] :
      ! [Y] : big_p(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x2120) ).

fof(f0_neg,negated_conjecture,
    ~ ( ! [U,V,W] :
          ( big_p(V,W)
          | big_p(U,V) )
     => ? [X] :
        ! [Y] : big_p(X,Y) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ( ! [X] :
      ? [Y] : ~ big_p(X,Y)
    & ! [U,V,W] :
        ( big_p(V,W)
        | big_p(U,V) ) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

fof(f0_sk,plain,
    ! [U,V,W,X] :
      ( ~ big_p(X,sk0(X))
      & ( big_p(V,W)
        | big_p(U,V) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f0_nnf]) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN369+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.36  % Computer : n018.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Fri Sep 25 01:02:34 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.85/0.93  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.85/0.93  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------