TSTP Solution File: SWV220+1 by Drodi---3.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.5.1
% Problem  : SWV220+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n011.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:40:56 EDT 2023

% Result   : Theorem 0.11s 0.34s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   26 (  10 unt;   0 def)
%            Number of atoms       :  190 ( 157 equ)
%            Maximal formula atoms :   39 (   7 avg)
%            Number of connectives :  267 ( 103   ~;  40   |; 118   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   27 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  10 con; 0-2 aty)
%            Number of variables   :    6 (;   4   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ! [A,B] :
      ( ( leq(n0,A)
        & leq(n0,B)
        & leq(A,n5)
        & leq(B,n5) )
     => ( ( ~ ( n0 = B
              & n4 = A )
          & ~ ( n0 = B
              & n5 = A )
          & ~ ( n1 = B
              & n4 = A )
          & ~ ( n1 = B
              & n5 = A )
          & ~ ( n2 = A
              & n5 = B )
          & ~ ( n2 = B
              & n4 = A )
          & ~ ( n2 = B
              & n5 = A )
          & ~ ( n3 = A
              & n4 = B )
          & ~ ( n3 = A
              & n5 = B )
          & ~ ( n3 = B
              & n4 = A )
          & ~ ( n3 = B
              & n5 = A )
          & ~ ( n4 = A
              & n4 = B )
          & ~ ( n4 = A
              & n5 = B )
          & ~ ( n4 = B
              & n5 = A )
          & ~ ( n5 = A
              & n5 = B )
          & n1 = A
          & n3 = A
          & n3 = B
          & n5 = B )
       => times(divide(n1,n400),a_select2(sigma,n3)) = n0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f54,negated_conjecture,
    ~ ! [A,B] :
        ( ( leq(n0,A)
          & leq(n0,B)
          & leq(A,n5)
          & leq(B,n5) )
       => ( ( ~ ( n0 = B
                & n4 = A )
            & ~ ( n0 = B
                & n5 = A )
            & ~ ( n1 = B
                & n4 = A )
            & ~ ( n1 = B
                & n5 = A )
            & ~ ( n2 = A
                & n5 = B )
            & ~ ( n2 = B
                & n4 = A )
            & ~ ( n2 = B
                & n5 = A )
            & ~ ( n3 = A
                & n4 = B )
            & ~ ( n3 = A
                & n5 = B )
            & ~ ( n3 = B
                & n4 = A )
            & ~ ( n3 = B
                & n5 = A )
            & ~ ( n4 = A
                & n4 = B )
            & ~ ( n4 = A
                & n5 = B )
            & ~ ( n4 = B
                & n5 = A )
            & ~ ( n5 = A
                & n5 = B )
            & n1 = A
            & n3 = A
            & n3 = B
            & n5 = B )
         => times(divide(n1,n400),a_select2(sigma,n3)) = n0 ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f251,plain,
    ? [A,B] :
      ( leq(n0,A)
      & leq(n0,B)
      & leq(A,n5)
      & leq(B,n5)
      & ( n0 != B
        | n4 != A )
      & ( n0 != B
        | n5 != A )
      & ( n1 != B
        | n4 != A )
      & ( n1 != B
        | n5 != A )
      & ( n2 != A
        | n5 != B )
      & ( n2 != B
        | n4 != A )
      & ( n2 != B
        | n5 != A )
      & ( n3 != A
        | n4 != B )
      & ( n3 != A
        | n5 != B )
      & ( n3 != B
        | n4 != A )
      & ( n3 != B
        | n5 != A )
      & ( n4 != A
        | n4 != B )
      & ( n4 != A
        | n5 != B )
      & ( n4 != B
        | n5 != A )
      & ( n5 != A
        | n5 != B )
      & n1 = A
      & n3 = A
      & n3 = B
      & n5 = B
      & times(divide(n1,n400),a_select2(sigma,n3)) != n0 ),
    inference(pre_NNF_transformation,[status(esa)],[f54]) ).

fof(f252,plain,
    ( leq(n0,sk0_23)
    & leq(n0,sk0_24)
    & leq(sk0_23,n5)
    & leq(sk0_24,n5)
    & ( n0 != sk0_24
      | n4 != sk0_23 )
    & ( n0 != sk0_24
      | n5 != sk0_23 )
    & ( n1 != sk0_24
      | n4 != sk0_23 )
    & ( n1 != sk0_24
      | n5 != sk0_23 )
    & ( n2 != sk0_23
      | n5 != sk0_24 )
    & ( n2 != sk0_24
      | n4 != sk0_23 )
    & ( n2 != sk0_24
      | n5 != sk0_23 )
    & ( n3 != sk0_23
      | n4 != sk0_24 )
    & ( n3 != sk0_23
      | n5 != sk0_24 )
    & ( n3 != sk0_24
      | n4 != sk0_23 )
    & ( n3 != sk0_24
      | n5 != sk0_23 )
    & ( n4 != sk0_23
      | n4 != sk0_24 )
    & ( n4 != sk0_23
      | n5 != sk0_24 )
    & ( n4 != sk0_24
      | n5 != sk0_23 )
    & ( n5 != sk0_23
      | n5 != sk0_24 )
    & n1 = sk0_23
    & n3 = sk0_23
    & n3 = sk0_24
    & n5 = sk0_24
    & times(divide(n1,n400),a_select2(sigma,n3)) != n0 ),
    inference(skolemization,[status(esa)],[f251]) ).

fof(f267,plain,
    ( n3 != sk0_24
    | n5 != sk0_23 ),
    inference(cnf_transformation,[status(esa)],[f252]) ).

fof(f272,plain,
    n1 = sk0_23,
    inference(cnf_transformation,[status(esa)],[f252]) ).

fof(f273,plain,
    n3 = sk0_23,
    inference(cnf_transformation,[status(esa)],[f252]) ).

fof(f274,plain,
    n3 = sk0_24,
    inference(cnf_transformation,[status(esa)],[f252]) ).

fof(f275,plain,
    n5 = sk0_24,
    inference(cnf_transformation,[status(esa)],[f252]) ).

fof(f356,plain,
    ( spl0_2
  <=> n5 = sk0_23 ),
    introduced(split_symbol_definition) ).

fof(f358,plain,
    ( n5 != sk0_23
    | spl0_2 ),
    inference(component_clause,[status(thm)],[f356]) ).

fof(f385,plain,
    ( spl0_9
  <=> n3 = sk0_24 ),
    introduced(split_symbol_definition) ).

fof(f387,plain,
    ( n3 != sk0_24
    | spl0_9 ),
    inference(component_clause,[status(thm)],[f385]) ).

fof(f389,plain,
    ( ~ spl0_9
    | ~ spl0_2 ),
    inference(split_clause,[status(thm)],[f267,f385,f356]) ).

fof(f396,plain,
    n3 = n1,
    inference(forward_demodulation,[status(thm)],[f272,f273]) ).

fof(f397,plain,
    n1 = sk0_24,
    inference(forward_demodulation,[status(thm)],[f396,f274]) ).

fof(f398,plain,
    n5 = n1,
    inference(forward_demodulation,[status(thm)],[f397,f275]) ).

fof(f415,plain,
    ( n1 != sk0_24
    | spl0_9 ),
    inference(forward_demodulation,[status(thm)],[f396,f387]) ).

fof(f416,plain,
    ( n1 != n1
    | spl0_9 ),
    inference(forward_demodulation,[status(thm)],[f397,f415]) ).

fof(f417,plain,
    ( $false
    | spl0_9 ),
    inference(trivial_equality_resolution,[status(esa)],[f416]) ).

fof(f418,plain,
    spl0_9,
    inference(contradiction_clause,[status(thm)],[f417]) ).

fof(f425,plain,
    ( n1 != sk0_23
    | spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f398,f358]) ).

fof(f426,plain,
    ( n1 != n1
    | spl0_2 ),
    inference(forward_demodulation,[status(thm)],[f272,f425]) ).

fof(f427,plain,
    ( $false
    | spl0_2 ),
    inference(trivial_equality_resolution,[status(esa)],[f426]) ).

fof(f428,plain,
    spl0_2,
    inference(contradiction_clause,[status(thm)],[f427]) ).

fof(f429,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f389,f418,f428]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11  % Problem  : SWV220+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.08/0.11  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32  % Computer : n011.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 300
% 0.11/0.32  % DateTime : Tue May 30 11:36:12 EDT 2023
% 0.11/0.32  % CPUTime  : 
% 0.11/0.33  % 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.16/0.56  % Elapsed time: 0.016976 seconds
% 0.16/0.56  % CPU time: 0.018644 seconds
% 0.16/0.56  % Memory used: 4.039 MB
%------------------------------------------------------------------------------