↑ Up

FindProof---0.1.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : FindProof---0.1
% Problem  : NUN088+1 : TPTP v9.3.1. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n001.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 02:29:33 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f17,axiom,
    ! [X7,Y10] :
      ( ~ r2(X7,Y10)
      | ! [Y20] :
          ( ~ r1(Y20)
          | ~ id(Y20,Y10) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7a) ).

fof(f17_nnf,plain,
    ! [X7,Y10] :
      ( ~ r2(X7,Y10)
      | ! [Y20] :
          ( ~ r1(Y20)
          | ~ id(Y20,Y10) ) ),
    inference(nnf_transformation,[status(thm)],[f17]) ).

fof(f17_sk,plain,
    ! [Y20,Y10,X7] :
      ( ~ r2(X7,Y10)
      | ~ r1(Y20)
      | ~ id(Y20,Y10) ),
    inference(skolemisation,[status(esa)],[f17_nnf]) ).

cnf(c57,plain,
    ( ~ r2(X0,X1)
    | ~ r1(X2)
    | ~ id(X2,X1) ),
    inference(cnf_transformation,[status(esa)],[f17_sk]) ).

cnf(hi45,axiom,
    ifeq(id(X0,X1),true,ifeq(r1(X0),true,ifeq(r2(X2,X1),true,false,true),true),true) = true,
    inference(equality_encoding,[status(esa)],[c57]) ).

fof(f18,conjecture,
    ! [Y1] :
      ( ! [Y3] :
          ( ~ r2(Y3,Y1)
          | ~ r1(Y3) )
      | ! [Y2] :
          ( ~ r1(Y2)
          | ~ id(Y2,Y1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',zerounidone) ).

fof(f18_neg,negated_conjecture,
    ~ ! [Y1] :
        ( ! [Y3] :
            ( ~ r2(Y3,Y1)
            | ~ r1(Y3) )
        | ! [Y2] :
            ( ~ r1(Y2)
            | ~ id(Y2,Y1) ) ),
    inference(negated_conjecture,[status(cth)],[f18]) ).

fof(f18_nnf,plain,
    ? [Y1] :
      ( ? [Y3] :
          ( r2(Y3,Y1)
          & r1(Y3) )
      & ? [Y2] :
          ( r1(Y2)
          & id(Y2,Y1) ) ),
    inference(nnf_transformation,[status(thm)],[f18_neg]) ).

fof(f18_sk,plain,
    ( r2(sk22,sk20)
    & r1(sk22)
    & r1(sk21)
    & id(sk21,sk20) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sk20,sk21,sk22])],[f18_nnf]) ).

cnf(c58,plain,
    id(sk21,sk20),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(hi41,negated_conjecture,
    id(sk21,sk20) = true,
    inference(equality_encoding,[status(esa)],[c58]) ).

cnf(c59,plain,
    r1(sk21),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(hi42,negated_conjecture,
    r1(sk21) = true,
    inference(equality_encoding,[status(esa)],[c59]) ).

cnf(c61,plain,
    r2(sk22,sk20),
    inference(cnf_transformation,[status(esa)],[f18_sk]) ).

cnf(hi44,negated_conjecture,
    r2(sk22,sk20) = true,
    inference(equality_encoding,[status(esa)],[c61]) ).

cnf(t0,plain,
    true = false,
    inference(hyper_resolution,[status(thm)],[hi45,hi41,hi42,hi44]) ).

cnf(t644,plain,
    false = true,
    inference(orient,[status(thm)],[t0]) ).

cnf(goal_0,negated_conjecture,
    true != false,
    inference(equality_encoding,[status(esa)],[c57]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUN088+1 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04  % Command  : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/5.38  % Computer : n001.cluster.edu
% 0.09/5.38  % Model    : x86_64 x86_64
% 0.09/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38  % Memory   : 8046.5625MB
% 0.09/5.38  % OS       : Linux 6.8.0-71-generic
% 0.09/5.38  % CPULimit : 300
% 0.09/5.38  % WCLimit  : 300
% 0.09/5.38  % DateTime : Thu Sep 24 06:06:28 UTC 2026
% 0.09/5.38  % CPUTime  : 
% 0.09/5.38  Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 6.75/6.35  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.75/6.35  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------