↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n019.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:10:52 PM UTC 2026

% Result   : Theorem 0.09s 5.39s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   40 (  13 unt;   2 def)
%            Number of atoms       :  146 (  62 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :  169 (  63   ~;  67   |;  30   &)
%                                         (   8 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-3 aty)
%            Number of variables   :   94 (  86   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [A,B] :
      ( B = singleton(A)
    <=> ! [C] :
          ( in(C,B)
        <=> C = A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ! [A,B,C] :
      ( C = unordered_pair(A,B)
    <=> ! [D] :
          ( in(D,C)
        <=> ( D = B
            | D = A ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ! [A,B] :
      ( subset(A,B)
    <=> ! [C] :
          ( in(C,A)
         => in(C,B) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f9,conjecture,
    ! [A,B] : subset(singleton(A),unordered_pair(A,B)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f10,negated_conjecture,
    ~ ! [A,B] : subset(singleton(A),unordered_pair(A,B)),
    inference(negated_conjecture,[status(cth)],[f9]) ).

fof(f13,plain,
    ! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f14,plain,
    ! [A,B] :
      ( ( ? [C] :
            ( ( C = A
              | in(C,B) )
            & ( C != A
              | ~ in(C,B) ) )
        | B = singleton(A) )
      & ( ! [C] :
            ( ( C != A
              | in(C,B) )
            & ( C = A
              | ~ in(C,B) ) )
        | B != singleton(A) ) ),
    inference(NNF_transformation,[status(thm)],[f3]) ).

fof(f15,plain,
    ( ! [A,B] :
        ( ? [C] :
            ( ( C = A
              | in(C,B) )
            & ( C != A
              | ~ in(C,B) ) )
        | B = singleton(A) )
    & ! [A,B] :
        ( ( ! [C] :
              ( C != A
              | in(C,B) )
          & ! [C] :
              ( C = A
              | ~ in(C,B) ) )
        | B != singleton(A) ) ),
    inference(miniscoping,[status(thm)],[f14]) ).

fof(f16,plain,
    ( ! [A,B] :
        ( ( ( sK0_skl(B,A) = A
            | in(sK0_skl(B,A),B) )
          & ( sK0_skl(B,A) != A
            | ~ in(sK0_skl(B,A),B) ) )
        | B = singleton(A) )
    & ! [A,B] :
        ( ( ! [C] :
              ( C != A
              | in(C,B) )
          & ! [C] :
              ( C = A
              | ~ in(C,B) ) )
        | B != singleton(A) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(C,sK0_skl(B,A))],[f15]) ).

fof(f17,plain,
    ! [X0,X1,X2] :
      ( X2 = X1
      | ~ in(X2,X0)
      | X0 != singleton(X1) ),
    inference(cnf_transformation,[status(thm)],[f16]) ).

fof(f21,plain,
    ! [A,B,C] :
      ( ( ? [D] :
            ( ( D = B
              | D = A
              | in(D,C) )
            & ( ( D != B
                & D != A )
              | ~ in(D,C) ) )
        | C = unordered_pair(A,B) )
      & ( ! [D] :
            ( ( ( D != B
                & D != A )
              | in(D,C) )
            & ( D = B
              | D = A
              | ~ in(D,C) ) )
        | C != unordered_pair(A,B) ) ),
    inference(NNF_transformation,[status(thm)],[f4]) ).

fof(f22,plain,
    ( ! [A,B,C] :
        ( ? [D] :
            ( ( D = B
              | D = A
              | in(D,C) )
            & ( ( D != B
                & D != A )
              | ~ in(D,C) ) )
        | C = unordered_pair(A,B) )
    & ! [A,B,C] :
        ( ( ! [D] :
              ( ( D != B
                & D != A )
              | in(D,C) )
          & ! [D] :
              ( D = B
              | D = A
              | ~ in(D,C) ) )
        | C != unordered_pair(A,B) ) ),
    inference(miniscoping,[status(thm)],[f21]) ).

fof(f23,plain,
    ( ! [A,B,C] :
        ( ( ( sK1_skl(C,B,A) = B
            | sK1_skl(C,B,A) = A
            | in(sK1_skl(C,B,A),C) )
          & ( ( sK1_skl(C,B,A) != B
              & sK1_skl(C,B,A) != A )
            | ~ in(sK1_skl(C,B,A),C) ) )
        | C = unordered_pair(A,B) )
    & ! [A,B,C] :
        ( ( ! [D] :
              ( ( D != B
                & D != A )
              | in(D,C) )
          & ! [D] :
              ( D = B
              | D = A
              | ~ in(D,C) ) )
        | C != unordered_pair(A,B) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl]),skolemize(D,sK1_skl(C,B,A))],[f22]) ).

fof(f26,plain,
    ! [X0,X1,X2,X3] :
      ( X3 != X2
      | in(X3,X0)
      | X0 != unordered_pair(X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f23]) ).

fof(f30,plain,
    ! [A,B] :
      ( subset(A,B)
    <=> ! [C] :
          ( in(C,B)
          | ~ in(C,A) ) ),
    inference(pre_NNF_transformation,[status(thm)],[f5]) ).

fof(f31,plain,
    ! [A,B] :
      ( ( ? [C] :
            ( ~ in(C,B)
            & in(C,A) )
        | subset(A,B) )
      & ( ! [C] :
            ( in(C,B)
            | ~ in(C,A) )
        | ~ subset(A,B) ) ),
    inference(NNF_transformation,[status(thm)],[f30]) ).

fof(f32,plain,
    ( ! [A,B] :
        ( ? [C] :
            ( ~ in(C,B)
            & in(C,A) )
        | subset(A,B) )
    & ! [A,B] :
        ( ! [C] :
            ( in(C,B)
            | ~ in(C,A) )
        | ~ subset(A,B) ) ),
    inference(miniscoping,[status(thm)],[f31]) ).

fof(f33,plain,
    ( ! [A,B] :
        ( ( ~ in(sK2_skl(B,A),B)
          & in(sK2_skl(B,A),A) )
        | subset(A,B) )
    & ! [A,B] :
        ( ! [C] :
            ( in(C,B)
            | ~ in(C,A) )
        | ~ subset(A,B) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl]),skolemize(C,sK2_skl(B,A))],[f32]) ).

fof(f35,plain,
    ! [X0,X1] :
      ( in(sK2_skl(X1,X0),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f33]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( ~ in(sK2_skl(X1,X0),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f33]) ).

fof(f43,plain,
    ? [A,B] : ~ subset(singleton(A),unordered_pair(A,B)),
    inference(pre_NNF_transformation,[status(thm)],[f10]) ).

fof(f44,plain,
    ~ subset(singleton(sK5_skl),unordered_pair(sK5_skl,sK6_skl)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5_skl,sK6_skl]),skolemize(A,sK5_skl),skolemize(B,sK6_skl)],[f43]) ).

fof(f45,plain,
    ~ subset(singleton(sK5_skl),unordered_pair(sK5_skl,sK6_skl)),
    inference(cnf_transformation,[status(thm)],[f44]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ~ in(X0,singleton(X1)) ),
    inference(destructive_equality_resolution,[status(thm)],[f17]) ).

fof(f50,plain,
    ! [X0,X1] : in(X0,unordered_pair(X1,X0)),
    inference(destructive_equality_resolution,[status(thm)],[f26]) ).

fof(f55,plain,
    ~ subset(singleton(sK5_skl),unordered_pair(sK6_skl,sK5_skl)),
    inference(paramodulation,[status(thm)],[f13,f45]) ).

fof(f75,plain,
    ! [X0,X1] :
      ( sK2_skl(X1,singleton(X0)) = X0
      | subset(singleton(X0),X1) ),
    inference(resolution,[status(thm)],[f35,f46]) ).

fof(f79,plain,
    sK2_skl(unordered_pair(sK6_skl,sK5_skl),singleton(sK5_skl)) = sK5_skl,
    inference(resolution,[status(thm)],[f75,f55]) ).

fof(f83,plain,
    ( ~ in(sK5_skl,unordered_pair(sK6_skl,sK5_skl))
    | subset(singleton(sK5_skl),unordered_pair(sK6_skl,sK5_skl)) ),
    inference(paramodulation,[status(thm)],[f79,f36]) ).

fof(f85,definition,
    ( sQ0_spl
  <=> subset(singleton(sK5_skl),unordered_pair(sK6_skl,sK5_skl)) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f86,plain,
    ( ~ sQ0_spl
    | subset(singleton(sK5_skl),unordered_pair(sK6_skl,sK5_skl)) ),
    inference(component_clause,[status(thm)],[f85]) ).

fof(f92,definition,
    ( sQ2_spl
  <=> in(sK5_skl,unordered_pair(sK6_skl,sK5_skl)) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f94,plain,
    ( sQ2_spl
    | ~ in(sK5_skl,unordered_pair(sK6_skl,sK5_skl)) ),
    inference(component_clause,[status(thm)],[f92]) ).

fof(f95,plain,
    ( ~ sQ2_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f83,f85,f92]) ).

fof(f100,plain,
    ( ~ sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f86,f55]) ).

fof(f101,plain,
    ~ sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f100]) ).

fof(f102,plain,
    ( sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f94,f50]) ).

fof(f103,plain,
    sQ2_spl,
    inference(contradiction_clause,[status(thm)],[f102]) ).

fof(f104,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f95,f101,f103]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET872+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/5.36  % Computer : n019.cluster.edu
% 0.09/5.36  % Model    : x86_64 x86_64
% 0.09/5.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.36  % Memory   : 8046.5625MB
% 0.09/5.36  % OS       : Linux 6.8.0-71-generic
% 0.09/5.36  % CPULimit : 300
% 0.09/5.36  % WCLimit  : 300
% 0.09/5.36  % DateTime : Mon Sep 21 05:42:57 UTC 2026
% 0.09/5.37  % CPUTime  : 
% 0.09/5.38  % Drodi V4.1.1
% 0.09/5.39  % Refutation found
% 0.09/5.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/5.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/5.42  % Elapsed time: 0.045209 seconds
% 0.14/5.42  % CPU time: 0.125350 seconds
% 0.14/5.42  % Total memory used: 63.622 MB
% 0.14/5.42  % Net memory used: 63.421 MB
%------------------------------------------------------------------------------