↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n009.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:29 PM UTC 2026

% Result   : Theorem 0.18s 0.48s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   8 unt;   0 def)
%            Number of atoms       :   50 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   50 (  20   ~;  18   |;   8   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   41 (  38   !;   3   ?)

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

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

fof(f12,conjecture,
    ! [A] : member(A,power_set(A)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f13,negated_conjecture,
    ~ ! [A] : member(A,power_set(A)),
    inference(negated_conjecture,[status(cth)],[f12]) ).

fof(f14,plain,
    ! [A,B] :
      ( subset(A,B)
    <=> ! [X] :
          ( member(X,B)
          | ~ member(X,A) ) ),
    inference(pre_NNF_transformation,[status(thm)],[f1]) ).

fof(f15,plain,
    ! [A,B] :
      ( ( ? [X] :
            ( ~ member(X,B)
            & member(X,A) )
        | subset(A,B) )
      & ( ! [X] :
            ( member(X,B)
            | ~ member(X,A) )
        | ~ subset(A,B) ) ),
    inference(NNF_transformation,[status(thm)],[f14]) ).

fof(f16,plain,
    ( ! [A,B] :
        ( ? [X] :
            ( ~ member(X,B)
            & member(X,A) )
        | subset(A,B) )
    & ! [A,B] :
        ( ! [X] :
            ( member(X,B)
            | ~ member(X,A) )
        | ~ subset(A,B) ) ),
    inference(miniscoping,[status(thm)],[f15]) ).

fof(f17,plain,
    ( ! [A,B] :
        ( ( ~ member(sK0_skl(B,A),B)
          & member(sK0_skl(B,A),A) )
        | subset(A,B) )
    & ! [A,B] :
        ( ! [X] :
            ( member(X,B)
            | ~ member(X,A) )
        | ~ subset(A,B) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(X,sK0_skl(B,A))],[f16]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( member(sK0_skl(X1,X0),X0)
      | subset(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f17]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( ~ member(sK0_skl(X1,X0),X1)
      | subset(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f17]) ).

fof(f26,plain,
    ! [X,A] :
      ( ( ~ subset(X,A)
        | member(X,power_set(A)) )
      & ( subset(X,A)
        | ~ member(X,power_set(A)) ) ),
    inference(NNF_transformation,[status(thm)],[f3]) ).

fof(f27,plain,
    ( ! [X,A] :
        ( ~ subset(X,A)
        | member(X,power_set(A)) )
    & ! [X,A] :
        ( subset(X,A)
        | ~ member(X,power_set(A)) ) ),
    inference(miniscoping,[status(thm)],[f26]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ~ subset(X0,X1)
      | member(X0,power_set(X1)) ),
    inference(cnf_transformation,[status(thm)],[f27]) ).

fof(f68,plain,
    ? [A] : ~ member(A,power_set(A)),
    inference(pre_NNF_transformation,[status(thm)],[f13]) ).

fof(f69,plain,
    ~ member(sK3_skl,power_set(sK3_skl)),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl]),skolemize(A,sK3_skl)],[f68]) ).

fof(f70,plain,
    ~ member(sK3_skl,power_set(sK3_skl)),
    inference(cnf_transformation,[status(thm)],[f69]) ).

fof(f83,plain,
    ! [X0] :
      ( subset(X0,X0)
      | subset(X0,X0) ),
    inference(resolution,[status(thm)],[f20,f19]) ).

fof(f84,plain,
    ! [X0] : subset(X0,X0),
    inference(duplicate_literals_removal,[status(thm)],[f83]) ).

fof(f86,plain,
    ! [X0] : member(X0,power_set(X0)),
    inference(resolution,[status(thm)],[f84,f29]) ).

fof(f88,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f70,f86]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SET705+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44  % Computer : n009.cluster.edu
% 0.18/0.44  % Model    : x86_64 x86_64
% 0.18/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44  % Memory   : 8046.5625MB
% 0.18/0.44  % OS       : Linux 6.8.0-71-generic
% 0.18/0.44  % CPULimit : 300
% 0.18/0.44  % WCLimit  : 300
% 0.18/0.44  % DateTime : Mon Sep 21 05:33:28 UTC 2026
% 0.18/0.44  % CPUTime  : 
% 0.18/0.46  % Drodi V4.1.1
% 0.18/0.48  % Refutation found
% 0.18/0.48  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.18/0.48  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.25/0.51  % Elapsed time: 0.063505 seconds
% 0.25/0.51  % CPU time: 0.173502 seconds
% 0.25/0.51  % Total memory used: 65.488 MB
% 0.25/0.51  % Net memory used: 65.254 MB
%------------------------------------------------------------------------------