↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n015.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:19:18 PM UTC 2026

% Result   : Theorem 0.13s 0.40s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   35 (  15 unt;   0 def)
%            Number of atoms       :  147 (  20 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  177 (  65   ~;  68   |;  37   &)
%                                         (   6 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :  108 ( 100   !;   8   ?)

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

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

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

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

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

fof(f24,negated_conjecture,
    ~ ! [A,B] : subset(set_intersection2(A,B),A),
    inference(negated_conjecture,[status(cth)],[f23]) ).

fof(f25,axiom,
    ! [A] : set_union2(A,empty_set) = A,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f40,plain,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f51,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)],[f6]) ).

fof(f52,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)],[f51]) ).

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

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

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

fof(f61,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)],[f60]) ).

fof(f62,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)],[f61]) ).

fof(f63,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))],[f62]) ).

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

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

fof(f67,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_intersection2(A,B) )
      & ( ! [D] :
            ( ( ~ in(D,B)
              | ~ in(D,A)
              | in(D,C) )
            & ( ( in(D,B)
                & in(D,A) )
              | ~ in(D,C) ) )
        | C != set_intersection2(A,B) ) ),
    inference(NNF_transformation,[status(thm)],[f8]) ).

fof(f68,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_intersection2(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_intersection2(A,B) ) ),
    inference(miniscoping,[status(thm)],[f67]) ).

fof(f69,plain,
    ( ! [A,B,C] :
        ( ( ( ( in(sK3_skl(C,B,A),B)
              & in(sK3_skl(C,B,A),A) )
            | in(sK3_skl(C,B,A),C) )
          & ( ~ in(sK3_skl(C,B,A),B)
            | ~ in(sK3_skl(C,B,A),A)
            | ~ in(sK3_skl(C,B,A),C) ) )
        | C = set_intersection2(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_intersection2(A,B) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl]),skolemize(D,sK3_skl(C,B,A))],[f68]) ).

fof(f71,plain,
    ! [X0,X1,X2,X3] :
      ( in(X3,X2)
      | ~ in(X3,X0)
      | X0 != set_intersection2(X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f69]) ).

fof(f101,plain,
    ? [A,B] : ~ subset(set_intersection2(A,B),A),
    inference(pre_NNF_transformation,[status(thm)],[f24]) ).

fof(f102,plain,
    ~ subset(set_intersection2(sK6_skl,sK7_skl),sK6_skl),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK6_skl,sK7_skl]),skolemize(A,sK6_skl),skolemize(B,sK7_skl)],[f101]) ).

fof(f103,plain,
    ~ subset(set_intersection2(sK6_skl,sK7_skl),sK6_skl),
    inference(cnf_transformation,[status(thm)],[f102]) ).

fof(f104,plain,
    ! [X0] : set_union2(X0,empty_set) = X0,
    inference(cnf_transformation,[status(thm)],[f25]) ).

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

fof(f141,plain,
    ! [X0,X1,X2] :
      ( in(X0,X2)
      | ~ in(X0,set_intersection2(X1,X2)) ),
    inference(destructive_equality_resolution,[status(thm)],[f71]) ).

fof(f147,plain,
    ~ subset(set_intersection2(sK7_skl,sK6_skl),sK6_skl),
    inference(paramodulation,[status(thm)],[f40,f103]) ).

fof(f278,plain,
    ! [X0,X1,X2,X3] :
      ( ~ in(X0,set_intersection2(X3,X1))
      | in(X0,set_union2(X1,X2)) ),
    inference(resolution,[status(thm)],[f138,f141]) ).

fof(f488,plain,
    in(sK2_skl(sK6_skl,set_intersection2(sK7_skl,sK6_skl)),set_intersection2(sK7_skl,sK6_skl)),
    inference(resolution,[status(thm)],[f65,f147]) ).

fof(f498,plain,
    ! [X0] : in(sK2_skl(sK6_skl,set_intersection2(sK7_skl,sK6_skl)),set_union2(sK6_skl,X0)),
    inference(resolution,[status(thm)],[f488,f278]) ).

fof(f519,plain,
    in(sK2_skl(sK6_skl,set_intersection2(sK7_skl,sK6_skl)),sK6_skl),
    inference(paramodulation,[status(thm)],[f104,f498]) ).

fof(f669,plain,
    subset(set_intersection2(sK7_skl,sK6_skl),sK6_skl),
    inference(resolution,[status(thm)],[f66,f519]) ).

fof(f679,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f669,f147]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU127+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n015.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:54:50 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.37  % Drodi V4.1.1
% 0.13/0.40  % Refutation found
% 0.13/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.43  % Elapsed time: 0.072111 seconds
% 0.13/0.43  % CPU time: 0.289190 seconds
% 0.13/0.43  % Total memory used: 96.218 MB
% 0.13/0.43  % Net memory used: 95.605 MB
%------------------------------------------------------------------------------