↑ Up

FindProof---0.1.THM-Prf.s

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

% Result   : Theorem 4.11s 0.92s
% Output   : Proof 4.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   17 (  11 unt;   0 def)
%            Number of atoms       :   44 (   8 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   42 (  15   ~;   9   |;  10   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-4 aty)
%            Number of variables   :   34 (   0 sgn  22   !;   2   ?)

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

fof(f0_neg,negated_conjecture,
    ~ ( ( ! [X,Y,Z] :
            ( ( r(Y,Z)
              & r(X,Y) )
           => r(X,Z) )
        & ! [X,Y] :
            ( r(X,Y)
           => r(Y,X) ) )
     => ! [X,Y] :
          ( r(X,Y)
         => r(X,X) ) ),
    inference(negated_conjecture,[status(cth)],[f0]) ).

fof(f0_nnf,plain,
    ( ? [X,Y] :
        ( ~ r(X,X)
        & r(X,Y) )
    & ! [X,Y,Z] :
        ( r(X,Z)
        | ~ r(Y,Z)
        | ~ r(X,Y) )
    & ! [X,Y] :
        ( r(Y,X)
        | ~ r(X,Y) ) ),
    inference(nnf_transformation,[status(thm)],[f0_neg]) ).

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

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

cnf(hi0,negated_conjecture,
    ifeq(r(X0,X1),true,r(X1,X0),true) = true,
    inference(equality_encoding,[status(esa)],[c0]) ).

cnf(c2,plain,
    r(sk0,sk1),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi2,negated_conjecture,
    r(sk0,sk1) = true,
    inference(equality_encoding,[status(esa)],[c2]) ).

cnf(h0,plain,
    r(sk1,sk0) = true,
    inference(hyper_resolution,[status(thm)],[hi0,hi2]) ).

cnf(c1,plain,
    ( r(X0,X2)
    | ~ r(X1,X2)
    | ~ r(X0,X1) ),
    inference(cnf_transformation,[status(esa)],[f0_sk]) ).

cnf(hi1,negated_conjecture,
    ifeq(r(X0,X1),true,ifeq(r(X1,X2),true,r(X0,X2),true),true) = true,
    inference(equality_encoding,[status(esa)],[c1]) ).

cnf(t0,plain,
    r(sk0,sk0) = true,
    inference(hyper_resolution,[status(thm)],[hi1,hi2,h0]) ).

cnf(t7,plain,
    r(sk0,sk0) = true,
    inference(orient,[status(thm)],[t0]) ).

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

cnf(goal_0,negated_conjecture,
    r(sk0,sk0) != true,
    inference(equality_encoding,[status(esa)],[c3]) ).

cnf(g0_0,plain,
    true != true,
    inference(rw,[status(thm)],[goal_0,t7]) ).

cnf(contradiction_0,plain,
    $false,
    inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN919+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.09/0.36  % Computer : n013.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:33:51 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_findproof /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 4.11/0.92  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.11/0.92  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------