↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n002.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:12 PM UTC 2026

% Result   : Theorem 0.14s 0.39s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   30 (  11 unt;   0 def)
%            Number of atoms       :   82 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   88 (  36   ~;  31   |;  16   &)
%                                         (   4 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   69 (  66   !;   3   ?)

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

fof(f2,axiom,
    ! [A,B] :
      ( equal_set(A,B)
    <=> ( subset(B,A)
        & subset(A,B) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f6,axiom,
    ! [X] : ~ member(X,empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f7,axiom,
    ! [B,A,E] :
      ( member(B,difference(E,A))
    <=> ( ~ member(B,A)
        & member(B,E) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f12,conjecture,
    ! [E] : equal_set(difference(E,E),empty_set),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f13,negated_conjecture,
    ~ ! [E] : equal_set(difference(E,E),empty_set),
    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(f21,plain,
    ! [A,B] :
      ( ( ~ subset(B,A)
        | ~ subset(A,B)
        | equal_set(A,B) )
      & ( ( subset(B,A)
          & subset(A,B) )
        | ~ equal_set(A,B) ) ),
    inference(NNF_transformation,[status(thm)],[f2]) ).

fof(f22,plain,
    ( ! [A,B] :
        ( ~ subset(B,A)
        | ~ subset(A,B)
        | equal_set(A,B) )
    & ! [A,B] :
        ( ( subset(B,A)
          & subset(A,B) )
        | ~ equal_set(A,B) ) ),
    inference(miniscoping,[status(thm)],[f21]) ).

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

fof(f40,plain,
    ! [X0] : ~ member(X0,empty_set),
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f41,plain,
    ! [B,A,E] :
      ( ( member(B,A)
        | ~ member(B,E)
        | member(B,difference(E,A)) )
      & ( ( ~ member(B,A)
          & member(B,E) )
        | ~ member(B,difference(E,A)) ) ),
    inference(NNF_transformation,[status(thm)],[f7]) ).

fof(f42,plain,
    ( ! [B,A,E] :
        ( member(B,A)
        | ~ member(B,E)
        | member(B,difference(E,A)) )
    & ! [B,A,E] :
        ( ( ~ member(B,A)
          & member(B,E) )
        | ~ member(B,difference(E,A)) ) ),
    inference(miniscoping,[status(thm)],[f41]) ).

fof(f43,plain,
    ! [X0,X1,X2] :
      ( member(X0,X1)
      | ~ member(X0,difference(X1,X2)) ),
    inference(cnf_transformation,[status(thm)],[f42]) ).

fof(f44,plain,
    ! [X0,X1,X2] :
      ( ~ member(X0,X2)
      | ~ member(X0,difference(X1,X2)) ),
    inference(cnf_transformation,[status(thm)],[f42]) ).

fof(f68,plain,
    ? [E] : ~ equal_set(difference(E,E),empty_set),
    inference(pre_NNF_transformation,[status(thm)],[f13]) ).

fof(f69,plain,
    ~ equal_set(difference(sK3_skl,sK3_skl),empty_set),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl]),skolemize(E,sK3_skl)],[f68]) ).

fof(f70,plain,
    ~ equal_set(difference(sK3_skl,sK3_skl),empty_set),
    inference(cnf_transformation,[status(thm)],[f69]) ).

fof(f80,plain,
    ! [X0,X1,X2] :
      ( ~ member(sK0_skl(X2,difference(X0,X1)),X1)
      | subset(difference(X0,X1),X2) ),
    inference(resolution,[status(thm)],[f19,f44]) ).

fof(f81,plain,
    ! [X0,X1,X2] :
      ( member(sK0_skl(X2,difference(X0,X1)),X0)
      | subset(difference(X0,X1),X2) ),
    inference(resolution,[status(thm)],[f19,f43]) ).

fof(f82,plain,
    ! [X0] : subset(empty_set,X0),
    inference(resolution,[status(thm)],[f19,f40]) ).

fof(f83,plain,
    ! [X0] :
      ( ~ subset(X0,empty_set)
      | equal_set(X0,empty_set) ),
    inference(resolution,[status(thm)],[f82,f25]) ).

fof(f89,plain,
    ! [X0,X1] :
      ( subset(difference(X0,X0),X1)
      | subset(difference(X0,X0),X1) ),
    inference(resolution,[status(thm)],[f81,f80]) ).

fof(f95,plain,
    ! [X0,X1] : subset(difference(X0,X0),X1),
    inference(duplicate_literals_removal,[status(thm)],[f89]) ).

fof(f96,plain,
    ! [X0] : equal_set(difference(X0,X0),empty_set),
    inference(resolution,[status(thm)],[f95,f83]) ).

fof(f101,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f70,f96]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET602+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35  % Computer : n002.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.35  % DateTime : Mon Sep 21 05:31:16 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.14/0.37  % Drodi V4.1.1
% 0.14/0.39  % Refutation found
% 0.14/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.41  % Elapsed time: 0.050790 seconds
% 0.14/0.41  % CPU time: 0.144449 seconds
% 0.14/0.41  % Total memory used: 80.733 MB
% 0.14/0.41  % Net memory used: 80.426 MB
%------------------------------------------------------------------------------