TSTP Solution File: NUN087+2 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : NUN087+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n009.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed May 31 12:31:18 EDT 2023

% Result   : Theorem 0.11s 0.34s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   35 (  14 unt;   0 def)
%            Number of atoms       :   75 (  18 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   69 (  29   ~;  20   |;  18   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   2 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   45 (;  34   !;  11   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ? [Y24] :
    ! [X19] :
      ( ( ~ r1(X19)
        & X19 != Y24 )
      | ( r1(X19)
        & X19 = Y24 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f9,axiom,
    ! [X5] :
    ? [Y8] :
      ( ? [Y17] :
          ( r1(Y17)
          & r4(X5,Y17,Y8) )
      & ? [Y18] :
          ( r1(Y18)
          & Y8 = Y18 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f12,conjecture,
    ? [Y1] :
      ( ? [Y2] :
          ( r1(Y2)
          & r4(Y2,Y2,Y1) )
      & ? [Y3] :
          ( r1(Y3)
          & Y1 = Y3 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f13,negated_conjecture,
    ~ ? [Y1] :
        ( ? [Y2] :
            ( r1(Y2)
            & r4(Y2,Y2,Y1) )
        & ? [Y3] :
            ( r1(Y3)
            & Y1 = Y3 ) ),
    inference(negated_conjecture,[status(cth)],[f12]) ).

fof(f14,plain,
    ! [Y24,X19] :
      ( pd0_0(X19,Y24)
     => ( ~ r1(X19)
        & X19 != Y24 ) ),
    introduced(predicate_definition,[f1]) ).

fof(f15,plain,
    ? [Y24] :
    ! [X19] :
      ( pd0_0(X19,Y24)
      | ( r1(X19)
        & X19 = Y24 ) ),
    inference(formula_renaming,[status(thm)],[f1,f14]) ).

fof(f16,plain,
    ! [X19] :
      ( pd0_0(X19,sk0_0)
      | ( r1(X19)
        & X19 = sk0_0 ) ),
    inference(skolemization,[status(esa)],[f15]) ).

fof(f17,plain,
    ! [X0] :
      ( pd0_0(X0,sk0_0)
      | r1(X0) ),
    inference(cnf_transformation,[status(esa)],[f16]) ).

fof(f18,plain,
    ! [X0] :
      ( pd0_0(X0,sk0_0)
      | X0 = sk0_0 ),
    inference(cnf_transformation,[status(esa)],[f16]) ).

fof(f51,plain,
    ! [X5] :
      ( r1(sk0_15(X5))
      & r4(X5,sk0_15(X5),sk0_14(X5))
      & r1(sk0_16(X5))
      & sk0_14(X5) = sk0_16(X5) ),
    inference(skolemization,[status(esa)],[f9]) ).

fof(f52,plain,
    ! [X0] : r1(sk0_15(X0)),
    inference(cnf_transformation,[status(esa)],[f51]) ).

fof(f53,plain,
    ! [X0] : r4(X0,sk0_15(X0),sk0_14(X0)),
    inference(cnf_transformation,[status(esa)],[f51]) ).

fof(f54,plain,
    ! [X0] : r1(sk0_16(X0)),
    inference(cnf_transformation,[status(esa)],[f51]) ).

fof(f55,plain,
    ! [X0] : sk0_14(X0) = sk0_16(X0),
    inference(cnf_transformation,[status(esa)],[f51]) ).

fof(f64,plain,
    ! [Y1] :
      ( ! [Y2] :
          ( ~ r1(Y2)
          | ~ r4(Y2,Y2,Y1) )
      | ! [Y3] :
          ( ~ r1(Y3)
          | Y1 != Y3 ) ),
    inference(pre_NNF_transformation,[status(esa)],[f13]) ).

fof(f65,plain,
    ! [X0,X1,X2] :
      ( ~ r1(X0)
      | ~ r4(X0,X0,X1)
      | ~ r1(X2)
      | X1 != X2 ),
    inference(cnf_transformation,[status(esa)],[f64]) ).

fof(f66,plain,
    ! [Y24,X19] :
      ( ~ pd0_0(X19,Y24)
      | ( ~ r1(X19)
        & X19 != Y24 ) ),
    inference(pre_NNF_transformation,[status(esa)],[f14]) ).

fof(f67,plain,
    ! [X0,X1] :
      ( ~ pd0_0(X0,X1)
      | ~ r1(X0) ),
    inference(cnf_transformation,[status(esa)],[f66]) ).

fof(f68,plain,
    ! [X0,X1] :
      ( ~ pd0_0(X0,X1)
      | X0 != X1 ),
    inference(cnf_transformation,[status(esa)],[f66]) ).

fof(f83,plain,
    ! [X0,X1] :
      ( ~ r1(X0)
      | ~ r4(X0,X0,X1)
      | ~ r1(X1) ),
    inference(destructive_equality_resolution,[status(esa)],[f65]) ).

fof(f84,plain,
    ! [X0] : ~ pd0_0(X0,X0),
    inference(destructive_equality_resolution,[status(esa)],[f68]) ).

fof(f88,plain,
    r1(sk0_0),
    inference(resolution,[status(thm)],[f17,f84]) ).

fof(f89,plain,
    ! [X0] : r1(sk0_14(X0)),
    inference(backward_demodulation,[status(thm)],[f55,f54]) ).

fof(f92,plain,
    ! [X0] :
      ( ~ r1(X0)
      | X0 = sk0_0 ),
    inference(resolution,[status(thm)],[f67,f18]) ).

fof(f93,plain,
    ! [X0] : sk0_14(X0) = sk0_0,
    inference(resolution,[status(thm)],[f92,f89]) ).

fof(f94,plain,
    ! [X0] : sk0_15(X0) = sk0_0,
    inference(resolution,[status(thm)],[f92,f52]) ).

fof(f103,plain,
    ! [X0] : r4(X0,sk0_0,sk0_14(X0)),
    inference(forward_demodulation,[status(thm)],[f94,f53]) ).

fof(f104,plain,
    ! [X0] : r4(X0,sk0_0,sk0_0),
    inference(forward_demodulation,[status(thm)],[f93,f103]) ).

fof(f105,plain,
    ( spl0_0
  <=> r1(sk0_0) ),
    introduced(split_symbol_definition) ).

fof(f107,plain,
    ( ~ r1(sk0_0)
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f105]) ).

fof(f108,plain,
    ( ~ r1(sk0_0)
    | ~ r1(sk0_0) ),
    inference(resolution,[status(thm)],[f104,f83]) ).

fof(f109,plain,
    ~ spl0_0,
    inference(split_clause,[status(thm)],[f108,f105]) ).

fof(f110,plain,
    ( $false
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f107,f88]) ).

fof(f111,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f110]) ).

fof(f112,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f109,f111]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : NUN087+2 : TPTP v8.1.2. Released v7.3.0.
% 0.03/0.12  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.33  % Computer : n009.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 300
% 0.11/0.33  % DateTime : Tue May 30 10:39:31 EDT 2023
% 0.11/0.33  % CPUTime  : 
% 0.11/0.34  % Drodi V3.5.1
% 0.11/0.34  % Refutation found
% 0.11/0.34  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.34  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.27/0.57  % Elapsed time: 0.022014 seconds
% 0.27/0.57  % CPU time: 0.034301 seconds
% 0.27/0.57  % Memory used: 18.092 MB
%------------------------------------------------------------------------------