↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SWV232+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 : n016.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:56 PM UTC 2026

% Result   : Theorem 0.08s 0.53s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   24 (   9 unt;   2 def)
%            Number of atoms       :  143 (  95 equ)
%            Maximal formula atoms :   28 (   5 avg)
%            Number of connectives :  181 (  62   ~;  31   |;  78   &)
%                                         (   2 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-3 aty)
%            Number of variables   :   14 (  12   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f53,conjecture,
    ( ! [A,B] :
        ( ( leq(B,n5)
          & leq(A,n5)
          & leq(n0,B)
          & leq(n0,A) )
       => a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A) )
   => ! [C,D] :
        ( ( leq(D,n2)
          & leq(C,n2)
          & leq(n0,D)
          & leq(n0,C) )
       => ( ( n2 = C
            & n1 = D
            & n1 = C
            & n0 = D
            & ~ ( n2 = D
                & n2 = C )
            & ~ ( n2 = C
                & n1 = D )
            & ~ ( n2 = D
                & n1 = C )
            & ~ ( n1 = D
                & n1 = C )
            & ~ ( n2 = C
                & n0 = D )
            & ~ ( n2 = D
                & n0 = C )
            & ~ ( n1 = D
                & n0 = C ) )
         => a_select2(rho,n1) = n0 ) ) ),
    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) )
         => a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A) )
     => ! [C,D] :
          ( ( leq(D,n2)
            & leq(C,n2)
            & leq(n0,D)
            & leq(n0,C) )
         => ( ( n2 = C
              & n1 = D
              & n1 = C
              & n0 = D
              & ~ ( n2 = D
                  & n2 = C )
              & ~ ( n2 = C
                  & n1 = D )
              & ~ ( n2 = D
                  & n1 = C )
              & ~ ( n1 = D
                  & n1 = C )
              & ~ ( n2 = C
                  & n0 = D )
              & ~ ( n2 = D
                  & n0 = C )
              & ~ ( n1 = D
                  & n0 = C ) )
           => a_select2(rho,n1) = n0 ) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f244,plain,
    ( ? [C,D] :
        ( a_select2(rho,n1) != n0
        & n2 = C
        & n1 = D
        & n1 = C
        & n0 = D
        & ( n2 != D
          | n2 != C )
        & ( n2 != C
          | n1 != D )
        & ( n2 != D
          | n1 != C )
        & ( n1 != D
          | n1 != C )
        & ( n2 != C
          | n0 != D )
        & ( n2 != D
          | n0 != C )
        & ( n1 != D
          | n0 != C )
        & leq(D,n2)
        & leq(C,n2)
        & leq(n0,D)
        & leq(n0,C) )
    & ! [A,B] :
        ( a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A)
        | ~ leq(B,n5)
        | ~ leq(A,n5)
        | ~ leq(n0,B)
        | ~ leq(n0,A) ) ),
    inference(pre_NNF_transformation,[status(thm)],[f54]) ).

fof(f245,plain,
    ( a_select2(rho,n1) != n0
    & n2 = sK23_skl
    & n1 = sK24_skl
    & n1 = sK23_skl
    & n0 = sK24_skl
    & ( n2 != sK24_skl
      | n2 != sK23_skl )
    & ( n2 != sK23_skl
      | n1 != sK24_skl )
    & ( n2 != sK24_skl
      | n1 != sK23_skl )
    & ( n1 != sK24_skl
      | n1 != sK23_skl )
    & ( n2 != sK23_skl
      | n0 != sK24_skl )
    & ( n2 != sK24_skl
      | n0 != sK23_skl )
    & ( n1 != sK24_skl
      | n0 != sK23_skl )
    & leq(sK24_skl,n2)
    & leq(sK23_skl,n2)
    & leq(n0,sK24_skl)
    & leq(n0,sK23_skl)
    & ! [A,B] :
        ( a_select3(q_ds1_filter,A,B) = a_select3(q_ds1_filter,B,A)
        | ~ leq(B,n5)
        | ~ leq(A,n5)
        | ~ leq(n0,B)
        | ~ leq(n0,A) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK23_skl,sK24_skl]),skolemize(C,sK23_skl),skolemize(D,sK24_skl)],[f244]) ).

fof(f253,plain,
    ( n2 != sK23_skl
    | n0 != sK24_skl ),
    inference(cnf_transformation,[status(thm)],[f245]) ).

fof(f258,plain,
    n0 = sK24_skl,
    inference(cnf_transformation,[status(thm)],[f245]) ).

fof(f259,plain,
    n1 = sK23_skl,
    inference(cnf_transformation,[status(thm)],[f245]) ).

fof(f260,plain,
    n1 = sK24_skl,
    inference(cnf_transformation,[status(thm)],[f245]) ).

fof(f261,plain,
    n2 = sK23_skl,
    inference(cnf_transformation,[status(thm)],[f245]) ).

fof(f348,definition,
    ( sQ3_spl
  <=> n0 = sK24_skl ),
    introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).

fof(f350,plain,
    ( sQ3_spl
    | n0 != sK24_skl ),
    inference(component_clause,[status(thm)],[f348]) ).

fof(f351,definition,
    ( sQ4_spl
  <=> n2 = sK23_skl ),
    introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).

fof(f353,plain,
    ( sQ4_spl
    | n2 != sK23_skl ),
    inference(component_clause,[status(thm)],[f351]) ).

fof(f354,plain,
    ( ~ sQ4_spl
    | ~ sQ3_spl ),
    inference(split_clause,[status(thm)],[f253,f348,f351]) ).

fof(f365,plain,
    sK23_skl = sK24_skl,
    inference(forward_demodulation,[status(thm)],[f259,f260]) ).

fof(f366,plain,
    n2 = sK24_skl,
    inference(forward_demodulation,[status(thm)],[f365,f261]) ).

fof(f367,plain,
    ( sQ4_spl
    | sK24_skl != sK23_skl ),
    inference(forward_demodulation,[status(thm)],[f366,f353]) ).

fof(f368,plain,
    ( sQ4_spl
    | sK24_skl != sK24_skl ),
    inference(forward_demodulation,[status(thm)],[f365,f367]) ).

fof(f369,plain,
    ( sQ4_spl
    | $false ),
    inference(trivial_equality_resolution,[status(thm)],[f368]) ).

fof(f370,plain,
    sQ4_spl,
    inference(contradiction_clause,[status(thm)],[f369]) ).

fof(f371,plain,
    ( sQ3_spl
    | sK24_skl != sK24_skl ),
    inference(forward_demodulation,[status(thm)],[f258,f350]) ).

fof(f372,plain,
    ( sQ3_spl
    | $false ),
    inference(trivial_equality_resolution,[status(thm)],[f371]) ).

fof(f373,plain,
    sQ3_spl,
    inference(contradiction_clause,[status(thm)],[f372]) ).

fof(f374,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f354,f370,f373]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV232+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.50  % Computer : n016.cluster.edu
% 0.08/0.50  % Model    : x86_64 x86_64
% 0.08/0.50  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.50  % Memory   : 8046.5625MB
% 0.08/0.50  % OS       : Linux 6.8.0-71-generic
% 0.08/0.50  % CPULimit : 300
% 0.08/0.50  % WCLimit  : 300
% 0.08/0.50  % DateTime : Mon Sep 21 08:39:53 UTC 2026
% 0.08/0.51  % CPUTime  : 
% 0.08/0.52  % Drodi V4.1.1
% 0.08/0.53  % Refutation found
% 0.08/0.53  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/0.53  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.56  % Elapsed time: 0.050940 seconds
% 0.15/0.56  % CPU time: 0.076158 seconds
% 0.15/0.56  % Total memory used: 6.818 MB
% 0.15/0.56  % Net memory used: 6.808 MB
%------------------------------------------------------------------------------