↑ Up

FindProof---0.1.THM-Prf.s

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

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

% Comments : 
%------------------------------------------------------------------------------
fof(f0,conjecture,
    ! [A] :
      ( ( ! [X] :
            ( q(X)
            & p(X) )
        & ( g
          | f ) )
     => q(A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f0_neg,negated_conjecture,
    ~ ! [A] :
        ( ( ! [X] :
              ( q(X)
              & p(X) )
          & ( g
            | f ) )
       => q(A) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

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

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

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

cnf(c2,plain,
    q(X1),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(p4,plain,
    $false,
    inference(resolution,[status(thm)],[c3,c2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN976+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37  % Computer : n010.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Fri Sep 25 02:41:58 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.89/1.03  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.89/1.03  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------