↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SET947+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 : n011.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:11:02 PM UTC 2026

% Result   : Theorem 0.09s 0.40s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   26 (   7 unt;   0 def)
%            Number of atoms       :   85 (   8 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   94 (  35   ~;  38   |;  15   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   65 (  60   !;   5   ?)

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

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

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

fof(f8,conjecture,
    ! [A] : subset(A,powerset(union(A))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f9,negated_conjecture,
    ~ ! [A] : subset(A,powerset(union(A))),
    inference(negated_conjecture,[status(cth)],[f8]) ).

fof(f12,plain,
    ! [A,B] :
      ( ( ? [C] :
            ( ( subset(C,A)
              | in(C,B) )
            & ( ~ subset(C,A)
              | ~ in(C,B) ) )
        | B = powerset(A) )
      & ( ! [C] :
            ( ( ~ subset(C,A)
              | in(C,B) )
            & ( subset(C,A)
              | ~ in(C,B) ) )
        | B != powerset(A) ) ),
    inference(NNF_transformation,[status(thm)],[f2]) ).

fof(f13,plain,
    ( ! [A,B] :
        ( ? [C] :
            ( ( subset(C,A)
              | in(C,B) )
            & ( ~ subset(C,A)
              | ~ in(C,B) ) )
        | B = powerset(A) )
    & ! [A,B] :
        ( ( ! [C] :
              ( ~ subset(C,A)
              | in(C,B) )
          & ! [C] :
              ( subset(C,A)
              | ~ in(C,B) ) )
        | B != powerset(A) ) ),
    inference(miniscoping,[status(thm)],[f12]) ).

fof(f14,plain,
    ( ! [A,B] :
        ( ( ( subset(sK0_skl(B,A),A)
            | in(sK0_skl(B,A),B) )
          & ( ~ subset(sK0_skl(B,A),A)
            | ~ in(sK0_skl(B,A),B) ) )
        | B = powerset(A) )
    & ! [A,B] :
        ( ( ! [C] :
              ( ~ subset(C,A)
              | in(C,B) )
          & ! [C] :
              ( subset(C,A)
              | ~ in(C,B) ) )
        | B != powerset(A) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(C,sK0_skl(B,A))],[f13]) ).

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

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

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

fof(f21,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)],[f20]) ).

fof(f22,plain,
    ( ! [A,B] :
        ( ( ~ in(sK1_skl(B,A),B)
          & in(sK1_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,[sK1_skl]),skolemize(C,sK1_skl(B,A))],[f21]) ).

fof(f24,plain,
    ! [X0,X1] :
      ( in(sK1_skl(X1,X0),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f22]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ~ in(sK1_skl(X1,X0),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f22]) ).

fof(f26,plain,
    ! [A,B] :
      ( subset(A,union(B))
      | ~ in(A,B) ),
    inference(pre_NNF_transformation,[status(thm)],[f4]) ).

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

fof(f34,plain,
    ? [A] : ~ subset(A,powerset(union(A))),
    inference(pre_NNF_transformation,[status(thm)],[f9]) ).

fof(f35,plain,
    ~ subset(sK4_skl,powerset(union(sK4_skl))),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK4_skl]),skolemize(A,sK4_skl)],[f34]) ).

fof(f36,plain,
    ~ subset(sK4_skl,powerset(union(sK4_skl))),
    inference(cnf_transformation,[status(thm)],[f35]) ).

fof(f38,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | in(X0,powerset(X1)) ),
    inference(destructive_equality_resolution,[status(thm)],[f16]) ).

fof(f62,plain,
    ! [X0,X1] :
      ( subset(sK1_skl(X1,X0),union(X0))
      | subset(X0,X1) ),
    inference(resolution,[status(thm)],[f24,f27]) ).

fof(f65,plain,
    ! [X0,X1] :
      ( in(sK1_skl(X1,X0),powerset(union(X0)))
      | subset(X0,X1) ),
    inference(resolution,[status(thm)],[f62,f38]) ).

fof(f68,plain,
    ! [X0] :
      ( subset(X0,powerset(union(X0)))
      | subset(X0,powerset(union(X0))) ),
    inference(resolution,[status(thm)],[f65,f25]) ).

fof(f73,plain,
    ! [X0] : subset(X0,powerset(union(X0))),
    inference(duplicate_literals_removal,[status(thm)],[f68]) ).

fof(f74,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f36,f73]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET947+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n011.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep 21 05:44:40 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.39  % Drodi V4.1.1
% 0.09/0.40  % Refutation found
% 0.09/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.45  % Elapsed time: 0.075348 seconds
% 0.14/0.45  % CPU time: 0.107045 seconds
% 0.14/0.45  % Total memory used: 7.708 MB
% 0.14/0.45  % Net memory used: 7.672 MB
%------------------------------------------------------------------------------