↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n008.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:25 PM UTC 2026

% Result   : Theorem 0.14s 0.40s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   29 (  12 unt;   0 def)
%            Number of atoms       :   64 (  24 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   62 (  27   ~;  20   |;  10   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   48 (  46   !;   2   ?)

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

fof(f15,axiom,
    ! [A,B] :
      ( disjoint(A,B)
    <=> set_intersection2(A,B) = empty_set ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f33,conjecture,
    ! [A,B] :
      ( ~ in(A,B)
     => disjoint(singleton(A),B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f34,negated_conjecture,
    ~ ! [A,B] :
        ( ~ in(A,B)
       => disjoint(singleton(A),B) ),
    inference(negated_conjecture,[status(cth)],[f33]) ).

fof(f35,lemma,
    ! [A,B] :
      ( subset(singleton(A),B)
    <=> in(A,B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f38,lemma,
    ! [A,B] :
      ( subset(A,singleton(B))
    <=> ( A = singleton(B)
        | A = empty_set ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f45,lemma,
    ! [A,B] : subset(set_intersection2(A,B),A),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f153,plain,
    ! [A,B] :
      ( ( set_intersection2(A,B) != empty_set
        | disjoint(A,B) )
      & ( set_intersection2(A,B) = empty_set
        | ~ disjoint(A,B) ) ),
    inference(NNF_transformation,[status(thm)],[f15]) ).

fof(f154,plain,
    ( ! [A,B] :
        ( set_intersection2(A,B) != empty_set
        | disjoint(A,B) )
    & ! [A,B] :
        ( set_intersection2(A,B) = empty_set
        | ~ disjoint(A,B) ) ),
    inference(miniscoping,[status(thm)],[f153]) ).

fof(f156,plain,
    ! [X0,X1] :
      ( set_intersection2(X0,X1) != empty_set
      | disjoint(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f154]) ).

fof(f180,plain,
    ? [A,B] :
      ( ~ disjoint(singleton(A),B)
      & ~ in(A,B) ),
    inference(pre_NNF_transformation,[status(thm)],[f34]) ).

fof(f181,plain,
    ( ~ disjoint(singleton(sK8_skl),sK9_skl)
    & ~ in(sK8_skl,sK9_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK8_skl,sK9_skl]),skolemize(A,sK8_skl),skolemize(B,sK9_skl)],[f180]) ).

fof(f182,plain,
    ~ in(sK8_skl,sK9_skl),
    inference(cnf_transformation,[status(thm)],[f181]) ).

fof(f183,plain,
    ~ disjoint(singleton(sK8_skl),sK9_skl),
    inference(cnf_transformation,[status(thm)],[f181]) ).

fof(f184,plain,
    ! [A,B] :
      ( ( ~ in(A,B)
        | subset(singleton(A),B) )
      & ( in(A,B)
        | ~ subset(singleton(A),B) ) ),
    inference(NNF_transformation,[status(thm)],[f35]) ).

fof(f185,plain,
    ( ! [A,B] :
        ( ~ in(A,B)
        | subset(singleton(A),B) )
    & ! [A,B] :
        ( in(A,B)
        | ~ subset(singleton(A),B) ) ),
    inference(miniscoping,[status(thm)],[f184]) ).

fof(f186,plain,
    ! [X0,X1] :
      ( in(X0,X1)
      | ~ subset(singleton(X0),X1) ),
    inference(cnf_transformation,[status(thm)],[f185]) ).

fof(f195,plain,
    ! [A,B] :
      ( ( ( A != singleton(B)
          & A != empty_set )
        | subset(A,singleton(B)) )
      & ( A = singleton(B)
        | A = empty_set
        | ~ subset(A,singleton(B)) ) ),
    inference(NNF_transformation,[status(thm)],[f38]) ).

fof(f196,plain,
    ( ! [A,B] :
        ( ( A != singleton(B)
          & A != empty_set )
        | subset(A,singleton(B)) )
    & ! [A,B] :
        ( A = singleton(B)
        | A = empty_set
        | ~ subset(A,singleton(B)) ) ),
    inference(miniscoping,[status(thm)],[f195]) ).

fof(f197,plain,
    ! [X0,X1] :
      ( X0 = singleton(X1)
      | X0 = empty_set
      | ~ subset(X0,singleton(X1)) ),
    inference(cnf_transformation,[status(thm)],[f196]) ).

fof(f213,plain,
    ! [X0,X1] : subset(set_intersection2(X0,X1),X0),
    inference(cnf_transformation,[status(thm)],[f45]) ).

fof(f320,plain,
    set_intersection2(singleton(sK8_skl),sK9_skl) != empty_set,
    inference(resolution,[status(thm)],[f156,f183]) ).

fof(f394,plain,
    ! [X0,X1] :
      ( set_intersection2(singleton(X0),X1) = singleton(X0)
      | set_intersection2(singleton(X0),X1) = empty_set ),
    inference(resolution,[status(thm)],[f213,f197]) ).

fof(f412,plain,
    ! [X0,X1] : subset(set_intersection2(X0,X1),X1),
    inference(paramodulation,[status(thm)],[f85,f213]) ).

fof(f656,plain,
    set_intersection2(singleton(sK8_skl),sK9_skl) = singleton(sK8_skl),
    inference(resolution,[status(thm)],[f394,f320]) ).

fof(f853,plain,
    subset(singleton(sK8_skl),sK9_skl),
    inference(paramodulation,[status(thm)],[f656,f412]) ).

fof(f878,plain,
    in(sK8_skl,sK9_skl),
    inference(resolution,[status(thm)],[f853,f186]) ).

fof(f882,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f878,f182]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU154+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36  % Computer : n008.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 05:54:08 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.38  % Drodi V4.1.1
% 0.14/0.40  % Refutation found
% 0.14/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.44  % Elapsed time: 0.065859 seconds
% 0.14/0.44  % CPU time: 0.174656 seconds
% 0.14/0.44  % Total memory used: 80.068 MB
% 0.14/0.44  % Net memory used: 79.927 MB
%------------------------------------------------------------------------------