↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SWV215+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n006.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 : Thu Sep 24 02:46:54 PM UTC 2026

% Result   : Theorem 0.13s 0.39s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   24 (  12 unt;   2 def)
%            Number of atoms       :  328 ( 299 equ)
%            Maximal formula atoms :   75 (  13 avg)
%            Number of connectives :  511 ( 207   ~;  72   |; 226   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   45 (   8 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(B,n5)
        & leq(A,n5)
        & leq(n0,B)
        & leq(n0,A) )
     => ( ( n4 = B
          & n2 = B
          & n2 = A
          & n0 = A
          & ~ ( n5 = B
              & n5 = A )
          & ~ ( n5 = A
              & n4 = B )
          & ~ ( n5 = B
              & n4 = A )
          & ~ ( n4 = B
              & n4 = A )
          & ~ ( n5 = A
              & n3 = B )
          & ~ ( n4 = A
              & n3 = B )
          & ~ ( n5 = B
              & n3 = A )
          & ~ ( n4 = B
              & n3 = A )
          & ~ ( n3 = B
              & n3 = A )
          & ~ ( n5 = A
              & n2 = B )
          & ~ ( n4 = A
              & n2 = B )
          & ~ ( n3 = A
              & n2 = B )
          & ~ ( n5 = B
              & n2 = A )
          & ~ ( n4 = B
              & n2 = A )
          & ~ ( n3 = B
              & n2 = A )
          & ~ ( n2 = B
              & n2 = A )
          & ~ ( n5 = A
              & n1 = B )
          & ~ ( n4 = A
              & n1 = B )
          & ~ ( n3 = A
              & n1 = B )
          & ~ ( n2 = A
              & n1 = B )
          & ~ ( n5 = B
              & n1 = A )
          & ~ ( n4 = B
              & n1 = A )
          & ~ ( n3 = B
              & n1 = A )
          & ~ ( n2 = B
              & n1 = A )
          & ~ ( n1 = B
              & n1 = A )
          & ~ ( n5 = A
              & n0 = B )
          & ~ ( n4 = A
              & n0 = B )
          & ~ ( n3 = A
              & n0 = B )
          & ~ ( n2 = A
              & n0 = B )
          & ~ ( n1 = A
              & n0 = B )
          & ~ ( n5 = B
              & n0 = A )
          & ~ ( n4 = B
              & n0 = A )
          & ~ ( n3 = B
              & n0 = A ) )
       => n0 = times(divide(n1,n400),a_select2(sigma,n2)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

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

fof(f252,plain,
    ( n0 != times(divide(n1,n400),a_select2(sigma,n2))
    & n4 = sK24_skl
    & n2 = sK24_skl
    & n2 = sK23_skl
    & n0 = sK23_skl
    & ( n5 != sK24_skl
      | n5 != sK23_skl )
    & ( n5 != sK23_skl
      | n4 != sK24_skl )
    & ( n5 != sK24_skl
      | n4 != sK23_skl )
    & ( n4 != sK24_skl
      | n4 != sK23_skl )
    & ( n5 != sK23_skl
      | n3 != sK24_skl )
    & ( n4 != sK23_skl
      | n3 != sK24_skl )
    & ( n5 != sK24_skl
      | n3 != sK23_skl )
    & ( n4 != sK24_skl
      | n3 != sK23_skl )
    & ( n3 != sK24_skl
      | n3 != sK23_skl )
    & ( n5 != sK23_skl
      | n2 != sK24_skl )
    & ( n4 != sK23_skl
      | n2 != sK24_skl )
    & ( n3 != sK23_skl
      | n2 != sK24_skl )
    & ( n5 != sK24_skl
      | n2 != sK23_skl )
    & ( n4 != sK24_skl
      | n2 != sK23_skl )
    & ( n3 != sK24_skl
      | n2 != sK23_skl )
    & ( n2 != sK24_skl
      | n2 != sK23_skl )
    & ( n5 != sK23_skl
      | n1 != sK24_skl )
    & ( n4 != sK23_skl
      | n1 != sK24_skl )
    & ( n3 != sK23_skl
      | n1 != sK24_skl )
    & ( n2 != sK23_skl
      | n1 != sK24_skl )
    & ( n5 != sK24_skl
      | n1 != sK23_skl )
    & ( n4 != sK24_skl
      | n1 != sK23_skl )
    & ( n3 != sK24_skl
      | n1 != sK23_skl )
    & ( n2 != sK24_skl
      | n1 != sK23_skl )
    & ( n1 != sK24_skl
      | n1 != sK23_skl )
    & ( n5 != sK23_skl
      | n0 != sK24_skl )
    & ( n4 != sK23_skl
      | n0 != sK24_skl )
    & ( n3 != sK23_skl
      | n0 != sK24_skl )
    & ( n2 != sK23_skl
      | n0 != sK24_skl )
    & ( n1 != sK23_skl
      | n0 != sK24_skl )
    & ( n5 != sK24_skl
      | n0 != sK23_skl )
    & ( n4 != sK24_skl
      | n0 != sK23_skl )
    & ( n3 != sK24_skl
      | n0 != sK23_skl )
    & leq(sK24_skl,n5)
    & leq(sK23_skl,n5)
    & leq(n0,sK24_skl)
    & leq(n0,sK23_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl,sK24_skl]),skolemize(A,sK23_skl),skolemize(B,sK24_skl)],[f251]) ).

fof(f286,plain,
    ( n4 != sK24_skl
    | n4 != sK23_skl ),
    inference(cnf_transformation,[status(thm)],[f252]) ).

fof(f290,plain,
    n0 = sK23_skl,
    inference(cnf_transformation,[status(thm)],[f252]) ).

fof(f291,plain,
    n2 = sK23_skl,
    inference(cnf_transformation,[status(thm)],[f252]) ).

fof(f292,plain,
    n2 = sK24_skl,
    inference(cnf_transformation,[status(thm)],[f252]) ).

fof(f293,plain,
    n4 = sK24_skl,
    inference(cnf_transformation,[status(thm)],[f252]) ).

fof(f383,definition,
    ( sQ2_spl
  <=> n4 = sK24_skl ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f385,plain,
    ( sQ2_spl
    | n4 != sK24_skl ),
    inference(component_clause,[status(thm)],[f383]) ).

fof(f406,definition,
    ( sQ8_spl
  <=> n4 = sK23_skl ),
    introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).

fof(f408,plain,
    ( sQ8_spl
    | n4 != sK23_skl ),
    inference(component_clause,[status(thm)],[f406]) ).

fof(f441,plain,
    ( ~ sQ2_spl
    | ~ sQ8_spl ),
    inference(split_clause,[status(thm)],[f286,f406,f383]) ).

fof(f447,plain,
    n2 = sK23_skl,
    inference(backward_demodulation,[status(thm)],[f448,f290]) ).

fof(f448,plain,
    n2 = n0,
    inference(forward_demodulation,[status(thm)],[f290,f291]) ).

fof(f449,plain,
    n4 = sK24_skl,
    inference(backward_demodulation,[status(thm)],[f451,f292]) ).

fof(f451,plain,
    n4 = n2,
    inference(forward_demodulation,[status(thm)],[f292,f293]) ).

fof(f453,plain,
    n4 = sK23_skl,
    inference(forward_demodulation,[status(thm)],[f451,f447]) ).

fof(f454,plain,
    ( sQ8_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f453,f408]) ).

fof(f455,plain,
    sQ8_spl,
    inference(contradiction_clause,[status(thm)],[f454]) ).

fof(f457,plain,
    ( sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f449,f385]) ).

fof(f458,plain,
    sQ2_spl,
    inference(contradiction_clause,[status(thm)],[f457]) ).

fof(f459,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f441,f455,f458]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV215+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n006.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 08:34:12 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.37  % Drodi V4.1.1
% 0.13/0.39  % Refutation found
% 0.13/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.43  % Elapsed time: 0.059847 seconds
% 0.13/0.43  % CPU time: 0.165028 seconds
% 0.13/0.43  % Total memory used: 106.909 MB
% 0.13/0.43  % Net memory used: 106.748 MB
%------------------------------------------------------------------------------