↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n018.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:10 PM UTC 2026

% Result   : Theorem 0.13s 0.40s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   19 (   6 unt;   0 def)
%            Number of atoms       :   37 (  15 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   31 (  13   ~;   6   |;   8   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   28 (  22   !;   6   ?)

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

fof(f2,axiom,
    ! [B,C,D] :
      ( subset(B,C)
     => subset(intersection(B,D),intersection(C,D)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f11,conjecture,
    ! [B,C,D] :
      ( ( intersection(C,D) = empty_set
        & subset(B,C) )
     => intersection(B,D) = empty_set ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f12,negated_conjecture,
    ~ ! [B,C,D] :
        ( ( intersection(C,D) = empty_set
          & subset(B,C) )
       => intersection(B,D) = empty_set ),
    inference(negated_conjecture,[status(cth)],[f11]) ).

fof(f13,plain,
    ! [B] :
      ( B = empty_set
      | ~ subset(B,empty_set) ),
    inference(pre_NNF_transformation,[status(thm)],[f1]) ).

fof(f14,plain,
    ! [X0] :
      ( X0 = empty_set
      | ~ subset(X0,empty_set) ),
    inference(cnf_transformation,[status(thm)],[f13]) ).

fof(f15,plain,
    ! [B,C,D] :
      ( subset(intersection(B,D),intersection(C,D))
      | ~ subset(B,C) ),
    inference(pre_NNF_transformation,[status(thm)],[f2]) ).

fof(f16,plain,
    ! [B,C] :
      ( ! [D] : subset(intersection(B,D),intersection(C,D))
      | ~ subset(B,C) ),
    inference(miniscoping,[status(thm)],[f15]) ).

fof(f17,plain,
    ! [X0,X1,X2] :
      ( subset(intersection(X0,X2),intersection(X1,X2))
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f16]) ).

fof(f50,plain,
    ? [B,C,D] :
      ( intersection(B,D) != empty_set
      & intersection(C,D) = empty_set
      & subset(B,C) ),
    inference(pre_NNF_transformation,[status(thm)],[f12]) ).

fof(f51,plain,
    ? [B,D] :
      ( intersection(B,D) != empty_set
      & ? [C] :
          ( intersection(C,D) = empty_set
          & subset(B,C) ) ),
    inference(miniscoping,[status(thm)],[f50]) ).

fof(f52,plain,
    ( intersection(sK3_skl,sK4_skl) != empty_set
    & intersection(sK5_skl,sK4_skl) = empty_set
    & subset(sK3_skl,sK5_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl,sK4_skl,sK5_skl]),skolemize(B,sK3_skl),skolemize(D,sK4_skl),skolemize(C,sK5_skl)],[f51]) ).

fof(f53,plain,
    subset(sK3_skl,sK5_skl),
    inference(cnf_transformation,[status(thm)],[f52]) ).

fof(f54,plain,
    intersection(sK5_skl,sK4_skl) = empty_set,
    inference(cnf_transformation,[status(thm)],[f52]) ).

fof(f55,plain,
    intersection(sK3_skl,sK4_skl) != empty_set,
    inference(cnf_transformation,[status(thm)],[f52]) ).

fof(f59,plain,
    ! [X0] :
      ( subset(intersection(X0,sK4_skl),empty_set)
      | ~ subset(X0,sK5_skl) ),
    inference(paramodulation,[status(thm)],[f54,f17]) ).

fof(f72,plain,
    ~ subset(intersection(sK3_skl,sK4_skl),empty_set),
    inference(resolution,[status(thm)],[f55,f14]) ).

fof(f107,plain,
    ~ subset(sK3_skl,sK5_skl),
    inference(resolution,[status(thm)],[f72,f59]) ).

fof(f108,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f107,f53]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET596+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n018.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 05:30:13 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/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.42  % Elapsed time: 0.061848 seconds
% 0.13/0.42  % CPU time: 0.164151 seconds
% 0.13/0.42  % Total memory used: 101.949 MB
% 0.13/0.42  % Net memory used: 101.569 MB
%------------------------------------------------------------------------------