↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n001.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:06 PM UTC 2026

% Result   : Theorem 0.22s 0.62s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   16 (   5 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   47 (  17   ~;  12   |;  15   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   34 (  25   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [B,C] :
      ( intersect(B,C)
    <=> ? [D] :
          ( member(D,C)
          & member(D,B) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,conjecture,
    ! [B,C,D] :
      ( ( member(B,D)
        & member(B,C) )
     => intersect(C,D) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,negated_conjecture,
    ~ ! [B,C,D] :
        ( ( member(B,D)
          & member(B,C) )
       => intersect(C,D) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

fof(f5,plain,
    ! [B,C] :
      ( ( ! [D] :
            ( ~ member(D,C)
            | ~ member(D,B) )
        | intersect(B,C) )
      & ( ? [D] :
            ( member(D,C)
            & member(D,B) )
        | ~ intersect(B,C) ) ),
    inference(NNF_transformation,[status(thm)],[f1]) ).

fof(f6,plain,
    ( ! [B,C] :
        ( ! [D] :
            ( ~ member(D,C)
            | ~ member(D,B) )
        | intersect(B,C) )
    & ! [B,C] :
        ( ? [D] :
            ( member(D,C)
            & member(D,B) )
        | ~ intersect(B,C) ) ),
    inference(miniscoping,[status(thm)],[f5]) ).

fof(f7,plain,
    ( ! [B,C] :
        ( ! [D] :
            ( ~ member(D,C)
            | ~ member(D,B) )
        | intersect(B,C) )
    & ! [B,C] :
        ( ( member(sK0_skl(C,B),C)
          & member(sK0_skl(C,B),B) )
        | ~ intersect(B,C) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(D,sK0_skl(C,B))],[f6]) ).

fof(f10,plain,
    ! [X0,X1,X2] :
      ( ~ member(X2,X1)
      | ~ member(X2,X0)
      | intersect(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f7]) ).

fof(f13,plain,
    ? [B,C,D] :
      ( ~ intersect(C,D)
      & member(B,D)
      & member(B,C) ),
    inference(pre_NNF_transformation,[status(thm)],[f4]) ).

fof(f14,plain,
    ? [C,D] :
      ( ~ intersect(C,D)
      & ? [B] :
          ( member(B,D)
          & member(B,C) ) ),
    inference(miniscoping,[status(thm)],[f13]) ).

fof(f15,plain,
    ( ~ intersect(sK1_skl,sK2_skl)
    & member(sK3_skl,sK2_skl)
    & member(sK3_skl,sK1_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl,sK2_skl,sK3_skl]),skolemize(C,sK1_skl),skolemize(D,sK2_skl),skolemize(B,sK3_skl)],[f14]) ).

fof(f16,plain,
    member(sK3_skl,sK1_skl),
    inference(cnf_transformation,[status(thm)],[f15]) ).

fof(f17,plain,
    member(sK3_skl,sK2_skl),
    inference(cnf_transformation,[status(thm)],[f15]) ).

fof(f18,plain,
    ~ intersect(sK1_skl,sK2_skl),
    inference(cnf_transformation,[status(thm)],[f15]) ).

fof(f22,plain,
    ! [X0] :
      ( ~ member(sK3_skl,X0)
      | intersect(sK1_skl,X0) ),
    inference(resolution,[status(thm)],[f10,f16]) ).

fof(f28,plain,
    intersect(sK1_skl,sK2_skl),
    inference(resolution,[status(thm)],[f22,f17]) ).

fof(f30,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f28,f18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SET574+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.58  % Computer : n001.cluster.edu
% 0.17/0.58  % Model    : x86_64 x86_64
% 0.17/0.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.58  % Memory   : 8046.5625MB
% 0.17/0.58  % OS       : Linux 6.8.0-71-generic
% 0.17/0.58  % CPULimit : 300
% 0.17/0.58  % WCLimit  : 300
% 0.17/0.58  % DateTime : Mon Sep 21 05:31:59 UTC 2026
% 0.17/0.59  % CPUTime  : 
% 0.17/0.60  % Drodi V4.1.1
% 0.22/0.62  % Refutation found
% 0.22/0.62  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.22/0.62  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.22/0.65  % Elapsed time: 0.054792 seconds
% 0.22/0.65  % CPU time: 0.144089 seconds
% 0.22/0.65  % Total memory used: 36.322 MB
% 0.22/0.65  % Net memory used: 35.962 MB
%------------------------------------------------------------------------------