↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SET875+1 : TPTP v9.3.1. Released v3.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:53 PM UTC 2026

% Result   : Theorem 0.14s 5.61s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   6 unt;   0 def)
%            Number of atoms       :   56 (  27 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :   64 (  26   ~;  22   |;  14   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   36 (  32   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [A,B] :
      ( B = singleton(A)
    <=> ! [C] :
          ( in(C,B)
        <=> C = A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f3,axiom,
    ! [A,B] :
      ~ ( in(A,B)
        & disjoint(singleton(A),B) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

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

fof(f8,negated_conjecture,
    ~ ! [A,B] :
        ~ ( A = B
          & disjoint(singleton(A),singleton(B)) ),
    inference(negated_conjecture,[status(cth)],[f7]) ).

fof(f11,plain,
    ! [A,B] :
      ( ( ? [C] :
            ( ( C = A
              | in(C,B) )
            & ( C != A
              | ~ in(C,B) ) )
        | B = singleton(A) )
      & ( ! [C] :
            ( ( C != A
              | in(C,B) )
            & ( C = A
              | ~ in(C,B) ) )
        | B != singleton(A) ) ),
    inference(NNF_transformation,[status(thm)],[f2]) ).

fof(f12,plain,
    ( ! [A,B] :
        ( ? [C] :
            ( ( C = A
              | in(C,B) )
            & ( C != A
              | ~ in(C,B) ) )
        | B = singleton(A) )
    & ! [A,B] :
        ( ( ! [C] :
              ( C != A
              | in(C,B) )
          & ! [C] :
              ( C = A
              | ~ in(C,B) ) )
        | B != singleton(A) ) ),
    inference(miniscoping,[status(thm)],[f11]) ).

fof(f13,plain,
    ( ! [A,B] :
        ( ( ( sK0_skl(B,A) = A
            | in(sK0_skl(B,A),B) )
          & ( sK0_skl(B,A) != A
            | ~ in(sK0_skl(B,A),B) ) )
        | B = singleton(A) )
    & ! [A,B] :
        ( ( ! [C] :
              ( C != A
              | in(C,B) )
          & ! [C] :
              ( C = A
              | ~ in(C,B) ) )
        | B != singleton(A) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(C,sK0_skl(B,A))],[f12]) ).

fof(f15,plain,
    ! [X0,X1,X2] :
      ( X2 != X1
      | in(X2,X0)
      | X0 != singleton(X1) ),
    inference(cnf_transformation,[status(thm)],[f13]) ).

fof(f18,plain,
    ! [A,B] :
      ( ~ in(A,B)
      | ~ disjoint(singleton(A),B) ),
    inference(pre_NNF_transformation,[status(thm)],[f3]) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | ~ disjoint(singleton(X0),X1) ),
    inference(cnf_transformation,[status(thm)],[f18]) ).

fof(f26,plain,
    ? [A,B] :
      ( A = B
      & disjoint(singleton(A),singleton(B)) ),
    inference(pre_NNF_transformation,[status(thm)],[f8]) ).

fof(f27,plain,
    ( sK3_skl = sK4_skl
    & disjoint(singleton(sK3_skl),singleton(sK4_skl)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl,sK4_skl]),skolemize(A,sK3_skl),skolemize(B,sK4_skl)],[f26]) ).

fof(f28,plain,
    disjoint(singleton(sK3_skl),singleton(sK4_skl)),
    inference(cnf_transformation,[status(thm)],[f27]) ).

fof(f29,plain,
    sK3_skl = sK4_skl,
    inference(cnf_transformation,[status(thm)],[f27]) ).

fof(f31,plain,
    ! [X0] : in(X0,singleton(X0)),
    inference(destructive_equality_resolution,[status(thm)],[f15]) ).

fof(f32,plain,
    disjoint(singleton(sK3_skl),singleton(sK3_skl)),
    inference(forward_demodulation,[status(thm)],[f29,f28]) ).

fof(f34,plain,
    ~ in(sK3_skl,singleton(sK3_skl)),
    inference(resolution,[status(thm)],[f19,f32]) ).

fof(f36,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f34,f31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET875+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/5.57  % Computer : n002.cluster.edu
% 0.11/5.57  % Model    : x86_64 x86_64
% 0.11/5.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.57  % Memory   : 8046.5625MB
% 0.11/5.57  % OS       : Linux 6.8.0-71-generic
% 0.11/5.57  % CPULimit : 300
% 0.11/5.57  % WCLimit  : 300
% 0.11/5.57  % DateTime : Mon Sep 21 05:45:23 UTC 2026
% 0.11/5.57  % CPUTime  : 
% 0.11/5.58  % Drodi V4.1.1
% 0.14/5.61  % Refutation found
% 0.14/5.61  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/5.61  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/5.63  % Elapsed time: 0.057369 seconds
% 0.14/5.63  % CPU time: 0.155006 seconds
% 0.14/5.63  % Total memory used: 101.228 MB
% 0.14/5.63  % Net memory used: 100.741 MB
%------------------------------------------------------------------------------