↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n020.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:56 PM UTC 2026

% Result   : Theorem 0.13s 0.38s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   26 (   9 unt;   0 def)
%            Number of atoms       :  114 (  43 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  144 (  56   ~;  56   |;  27   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   80 (  72   !;   8   ?)

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

fof(f4,axiom,
    ! [A] :
      ( A = empty_set
    <=> ! [B] : ~ in(B,A) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f12,conjecture,
    ! [A,B] : set_union2(singleton(A),B) != empty_set,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f13,negated_conjecture,
    ~ ! [A,B] : set_union2(singleton(A),B) != empty_set,
    inference(negated_conjecture,[status(cth)],[f12]) ).

fof(f17,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(f18,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)],[f17]) ).

fof(f19,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))],[f18]) ).

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

fof(f24,plain,
    ! [A] :
      ( ( ? [B] : in(B,A)
        | A = empty_set )
      & ( ! [B] : ~ in(B,A)
        | A != empty_set ) ),
    inference(NNF_transformation,[status(thm)],[f4]) ).

fof(f25,plain,
    ( ! [A] :
        ( ? [B] : in(B,A)
        | A = empty_set )
    & ! [A] :
        ( ! [B] : ~ in(B,A)
        | A != empty_set ) ),
    inference(miniscoping,[status(thm)],[f24]) ).

fof(f26,plain,
    ( ! [A] :
        ( in(sK1_skl(A),A)
        | A = empty_set )
    & ! [A] :
        ( ! [B] : ~ in(B,A)
        | A != empty_set ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl]),skolemize(B,sK1_skl(A))],[f25]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ~ in(X1,X0)
      | X0 != empty_set ),
    inference(cnf_transformation,[status(thm)],[f26]) ).

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

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

fof(f31,plain,
    ( ! [A,B,C] :
        ( ( ( in(sK2_skl(C,B,A),B)
            | in(sK2_skl(C,B,A),A)
            | in(sK2_skl(C,B,A),C) )
          & ( ( ~ in(sK2_skl(C,B,A),B)
              & ~ in(sK2_skl(C,B,A),A) )
            | ~ in(sK2_skl(C,B,A),C) ) )
        | C = set_union2(A,B) )
    & ! [A,B,C] :
        ( ( ! [D] :
              ( ( ~ in(D,B)
                & ~ in(D,A) )
              | in(D,C) )
          & ! [D] :
              ( in(D,B)
              | in(D,A)
              | ~ in(D,C) ) )
        | C != set_union2(A,B) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl]),skolemize(D,sK2_skl(C,B,A))],[f30]) ).

fof(f33,plain,
    ! [X0,X1,X2,X3] :
      ( ~ in(X3,X1)
      | in(X3,X0)
      | X0 != set_union2(X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f31]) ).

fof(f51,plain,
    ? [A,B] : set_union2(singleton(A),B) = empty_set,
    inference(pre_NNF_transformation,[status(thm)],[f13]) ).

fof(f52,plain,
    set_union2(singleton(sK5_skl),sK6_skl) = empty_set,
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5_skl,sK6_skl]),skolemize(A,sK5_skl),skolemize(B,sK6_skl)],[f51]) ).

fof(f53,plain,
    set_union2(singleton(sK5_skl),sK6_skl) = empty_set,
    inference(cnf_transformation,[status(thm)],[f52]) ).

fof(f55,plain,
    ! [X0] : in(X0,singleton(X0)),
    inference(destructive_equality_resolution,[status(thm)],[f21]) ).

fof(f56,plain,
    ! [X0] : ~ in(X0,empty_set),
    inference(destructive_equality_resolution,[status(thm)],[f27]) ).

fof(f58,plain,
    ! [X0,X1,X2] :
      ( ~ in(X0,X1)
      | in(X0,set_union2(X1,X2)) ),
    inference(destructive_equality_resolution,[status(thm)],[f33]) ).

fof(f70,plain,
    ! [X0] :
      ( ~ in(X0,singleton(sK5_skl))
      | in(X0,empty_set) ),
    inference(paramodulation,[status(thm)],[f53,f58]) ).

fof(f74,plain,
    ! [X0] : ~ in(X0,singleton(sK5_skl)),
    inference(forward_subsumption_resolution,[status(thm)],[f70,f56]) ).

fof(f75,plain,
    $false,
    inference(resolution,[status(thm)],[f74,f55]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET908+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.35  % Computer : n020.cluster.edu
% 0.07/0.35  % Model    : x86_64 x86_64
% 0.07/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35  % Memory   : 8046.5625MB
% 0.07/0.35  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Mon Sep 21 05:44:03 UTC 2026
% 0.13/0.36  % CPUTime  : 
% 0.13/0.37  % Drodi V4.1.1
% 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.13/0.41  % Elapsed time: 0.042897 seconds
% 0.13/0.41  % CPU time: 0.116565 seconds
% 0.13/0.41  % Total memory used: 69.843 MB
% 0.13/0.41  % Net memory used: 69.625 MB
%------------------------------------------------------------------------------