TSTP Solution File: ALG070+1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : ALG070+1 : TPTP v8.1.2. Released v2.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n007.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 : Tue Apr 30 20:09:25 EDT 2024

% Result   : Theorem 0.13s 0.38s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   49 (  16 unt;   0 def)
%            Number of atoms       :  137 (  42 equ)
%            Maximal formula atoms :   14 (   2 avg)
%            Number of connectives :  136 (  48   ~;  42   |;  19   &)
%                                         (   3 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    7 (   5 usr;   4 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   47 (  45   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [U] :
      ( sorti2(U)
     => ! [V] :
          ( sorti2(V)
         => sorti2(op2(U,V)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [U] :
      ( sorti1(U)
     => ! [V] :
          ( sorti1(V)
         => ( op1(U,U) != V
            | op1(U,V) = U ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ~ ! [U] :
        ( sorti2(U)
       => ! [V] :
            ( sorti2(V)
           => ( op2(U,U) != V
              | op2(U,V) = U ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,conjecture,
    ( ( ! [U] :
          ( sorti1(U)
         => sorti2(h(U)) )
      & ! [V] :
          ( sorti2(V)
         => sorti1(j(V)) ) )
   => ~ ( ! [W] :
            ( sorti1(W)
           => ! [X] :
                ( sorti1(X)
               => h(op1(W,X)) = op2(h(W),h(X)) ) )
        & ! [Y] :
            ( sorti2(Y)
           => ! [Z] :
                ( sorti2(Z)
               => j(op2(Y,Z)) = op1(j(Y),j(Z)) ) )
        & ! [X1] :
            ( sorti2(X1)
           => h(j(X1)) = X1 )
        & ! [X2] :
            ( sorti1(X2)
           => j(h(X2)) = X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f6,negated_conjecture,
    ~ ( ( ! [U] :
            ( sorti1(U)
           => sorti2(h(U)) )
        & ! [V] :
            ( sorti2(V)
           => sorti1(j(V)) ) )
     => ~ ( ! [W] :
              ( sorti1(W)
             => ! [X] :
                  ( sorti1(X)
                 => h(op1(W,X)) = op2(h(W),h(X)) ) )
          & ! [Y] :
              ( sorti2(Y)
             => ! [Z] :
                  ( sorti2(Z)
                 => j(op2(Y,Z)) = op1(j(Y),j(Z)) ) )
          & ! [X1] :
              ( sorti2(X1)
             => h(j(X1)) = X1 )
          & ! [X2] :
              ( sorti1(X2)
             => j(h(X2)) = X2 ) ) ),
    inference(negated_conjecture,[status(cth)],[f5]) ).

fof(f9,plain,
    ! [U] :
      ( ~ sorti2(U)
      | ! [V] :
          ( ~ sorti2(V)
          | sorti2(op2(U,V)) ) ),
    inference(pre_NNF_transformation,[status(esa)],[f2]) ).

fof(f10,plain,
    ! [X0,X1] :
      ( ~ sorti2(X0)
      | ~ sorti2(X1)
      | sorti2(op2(X0,X1)) ),
    inference(cnf_transformation,[status(esa)],[f9]) ).

fof(f11,plain,
    ! [U] :
      ( ~ sorti1(U)
      | ! [V] :
          ( ~ sorti1(V)
          | op1(U,U) != V
          | op1(U,V) = U ) ),
    inference(pre_NNF_transformation,[status(esa)],[f3]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ~ sorti1(X0)
      | ~ sorti1(X1)
      | op1(X0,X0) != X1
      | op1(X0,X1) = X0 ),
    inference(cnf_transformation,[status(esa)],[f11]) ).

fof(f13,plain,
    ? [U] :
      ( sorti2(U)
      & ? [V] :
          ( sorti2(V)
          & op2(U,U) = V
          & op2(U,V) != U ) ),
    inference(pre_NNF_transformation,[status(esa)],[f4]) ).

fof(f14,plain,
    ( sorti2(sk0_0)
    & sorti2(sk0_1)
    & op2(sk0_0,sk0_0) = sk0_1
    & op2(sk0_0,sk0_1) != sk0_0 ),
    inference(skolemization,[status(esa)],[f13]) ).

fof(f15,plain,
    sorti2(sk0_0),
    inference(cnf_transformation,[status(esa)],[f14]) ).

fof(f16,plain,
    sorti2(sk0_1),
    inference(cnf_transformation,[status(esa)],[f14]) ).

fof(f17,plain,
    op2(sk0_0,sk0_0) = sk0_1,
    inference(cnf_transformation,[status(esa)],[f14]) ).

fof(f18,plain,
    op2(sk0_0,sk0_1) != sk0_0,
    inference(cnf_transformation,[status(esa)],[f14]) ).

fof(f19,plain,
    ( ! [U] :
        ( ~ sorti1(U)
        | sorti2(h(U)) )
    & ! [V] :
        ( ~ sorti2(V)
        | sorti1(j(V)) )
    & ! [W] :
        ( ~ sorti1(W)
        | ! [X] :
            ( ~ sorti1(X)
            | h(op1(W,X)) = op2(h(W),h(X)) ) )
    & ! [Y] :
        ( ~ sorti2(Y)
        | ! [Z] :
            ( ~ sorti2(Z)
            | j(op2(Y,Z)) = op1(j(Y),j(Z)) ) )
    & ! [X1] :
        ( ~ sorti2(X1)
        | h(j(X1)) = X1 )
    & ! [X2] :
        ( ~ sorti1(X2)
        | j(h(X2)) = X2 ) ),
    inference(pre_NNF_transformation,[status(esa)],[f6]) ).

fof(f21,plain,
    ! [X0] :
      ( ~ sorti2(X0)
      | sorti1(j(X0)) ),
    inference(cnf_transformation,[status(esa)],[f19]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ~ sorti2(X0)
      | ~ sorti2(X1)
      | j(op2(X0,X1)) = op1(j(X0),j(X1)) ),
    inference(cnf_transformation,[status(esa)],[f19]) ).

fof(f24,plain,
    ! [X0] :
      ( ~ sorti2(X0)
      | h(j(X0)) = X0 ),
    inference(cnf_transformation,[status(esa)],[f19]) ).

fof(f26,plain,
    ! [X0] :
      ( ~ sorti1(X0)
      | ~ sorti1(op1(X0,X0))
      | op1(X0,op1(X0,X0)) = X0 ),
    inference(destructive_equality_resolution,[status(esa)],[f12]) ).

fof(f27,plain,
    ! [X0] :
      ( ~ sorti2(X0)
      | sorti2(op2(sk0_0,X0)) ),
    inference(resolution,[status(thm)],[f15,f10]) ).

fof(f28,plain,
    ! [X0] :
      ( ~ sorti2(X0)
      | j(op2(sk0_0,X0)) = op1(j(sk0_0),j(X0)) ),
    inference(resolution,[status(thm)],[f15,f23]) ).

fof(f29,plain,
    h(j(sk0_0)) = sk0_0,
    inference(resolution,[status(thm)],[f15,f24]) ).

fof(f30,plain,
    sorti1(j(sk0_0)),
    inference(resolution,[status(thm)],[f15,f21]) ).

fof(f47,plain,
    j(op2(sk0_0,sk0_0)) = op1(j(sk0_0),j(sk0_0)),
    inference(resolution,[status(thm)],[f28,f15]) ).

fof(f50,plain,
    j(op2(sk0_0,sk0_1)) = op1(j(sk0_0),j(sk0_1)),
    inference(resolution,[status(thm)],[f16,f28]) ).

fof(f51,plain,
    sorti2(op2(sk0_0,sk0_1)),
    inference(resolution,[status(thm)],[f16,f27]) ).

fof(f55,plain,
    sorti1(j(sk0_1)),
    inference(resolution,[status(thm)],[f16,f21]) ).

fof(f67,plain,
    h(j(op2(sk0_0,sk0_1))) = op2(sk0_0,sk0_1),
    inference(resolution,[status(thm)],[f51,f24]) ).

fof(f117,plain,
    j(sk0_1) = op1(j(sk0_0),j(sk0_0)),
    inference(forward_demodulation,[status(thm)],[f17,f47]) ).

fof(f118,plain,
    ( spl0_0
  <=> sorti1(j(sk0_0)) ),
    introduced(split_symbol_definition) ).

fof(f120,plain,
    ( ~ sorti1(j(sk0_0))
    | spl0_0 ),
    inference(component_clause,[status(thm)],[f118]) ).

fof(f121,plain,
    ( spl0_1
  <=> sorti1(j(sk0_1)) ),
    introduced(split_symbol_definition) ).

fof(f123,plain,
    ( ~ sorti1(j(sk0_1))
    | spl0_1 ),
    inference(component_clause,[status(thm)],[f121]) ).

fof(f124,plain,
    ( spl0_2
  <=> op1(j(sk0_0),op1(j(sk0_0),j(sk0_0))) = j(sk0_0) ),
    introduced(split_symbol_definition) ).

fof(f125,plain,
    ( op1(j(sk0_0),op1(j(sk0_0),j(sk0_0))) = j(sk0_0)
    | ~ spl0_2 ),
    inference(component_clause,[status(thm)],[f124]) ).

fof(f127,plain,
    ( ~ sorti1(j(sk0_0))
    | ~ sorti1(j(sk0_1))
    | op1(j(sk0_0),op1(j(sk0_0),j(sk0_0))) = j(sk0_0) ),
    inference(paramodulation,[status(thm)],[f117,f26]) ).

fof(f128,plain,
    ( ~ spl0_0
    | ~ spl0_1
    | spl0_2 ),
    inference(split_clause,[status(thm)],[f127,f118,f121,f124]) ).

fof(f129,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[status(thm)],[f123,f55]) ).

fof(f130,plain,
    spl0_1,
    inference(contradiction_clause,[status(thm)],[f129]) ).

fof(f131,plain,
    ( $false
    | spl0_0 ),
    inference(forward_subsumption_resolution,[status(thm)],[f120,f30]) ).

fof(f132,plain,
    spl0_0,
    inference(contradiction_clause,[status(thm)],[f131]) ).

fof(f133,plain,
    ( op1(j(sk0_0),j(sk0_1)) = j(sk0_0)
    | ~ spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f117,f125]) ).

fof(f367,plain,
    ( j(op2(sk0_0,sk0_1)) = j(sk0_0)
    | ~ spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f50,f133]) ).

fof(f515,plain,
    ( h(j(sk0_0)) = op2(sk0_0,sk0_1)
    | ~ spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f367,f67]) ).

fof(f516,plain,
    ( sk0_0 = op2(sk0_0,sk0_1)
    | ~ spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f29,f515]) ).

fof(f517,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[status(thm)],[f516,f18]) ).

fof(f518,plain,
    ~ spl0_2,
    inference(contradiction_clause,[status(thm)],[f517]) ).

fof(f519,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f128,f130,f132,f518]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ALG070+1 : TPTP v8.1.2. Released v2.7.0.
% 0.07/0.13  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34  % Computer : n007.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Mon Apr 29 23:18:47 EDT 2024
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  % Drodi V3.6.0
% 0.13/0.38  % Refutation found
% 0.13/0.38  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.41  % Elapsed time: 0.045942 seconds
% 0.20/0.41  % CPU time: 0.242434 seconds
% 0.20/0.41  % Total memory used: 33.665 MB
% 0.20/0.41  % Net memory used: 33.461 MB
%------------------------------------------------------------------------------