↑ Up

Drodi---4.1.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : SEU149+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 : n003.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:24 PM UTC 2026

% Result   : Theorem 0.12s 0.39s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   22 (   6 unt;   0 def)
%            Number of atoms       :  103 (  71 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :  127 (  46   ~;  48   |;  27   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-3 aty)
%            Number of variables   :   69 (  59   !;  10   ?)

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

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

fof(f72,conjecture,
    ! [A,B,C] :
      ( singleton(A) = unordered_pair(B,C)
     => A = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f73,negated_conjecture,
    ~ ! [A,B,C] :
        ( singleton(A) = unordered_pair(B,C)
       => A = B ),
    inference(negated_conjecture,[status(cth)],[f72]) ).

fof(f86,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)],[f7]) ).

fof(f87,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)],[f86]) ).

fof(f88,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))],[f87]) ).

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

fof(f105,plain,
    ! [A,B,C] :
      ( ( ? [D] :
            ( ( D = B
              | D = A
              | in(D,C) )
            & ( ( D != B
                & D != A )
              | ~ in(D,C) ) )
        | C = unordered_pair(A,B) )
      & ( ! [D] :
            ( ( ( D != B
                & D != A )
              | in(D,C) )
            & ( D = B
              | D = A
              | ~ in(D,C) ) )
        | C != unordered_pair(A,B) ) ),
    inference(NNF_transformation,[status(thm)],[f10]) ).

fof(f106,plain,
    ( ! [A,B,C] :
        ( ? [D] :
            ( ( D = B
              | D = A
              | in(D,C) )
            & ( ( D != B
                & D != A )
              | ~ in(D,C) ) )
        | C = unordered_pair(A,B) )
    & ! [A,B,C] :
        ( ( ! [D] :
              ( ( D != B
                & D != A )
              | in(D,C) )
          & ! [D] :
              ( D = B
              | D = A
              | ~ in(D,C) ) )
        | C != unordered_pair(A,B) ) ),
    inference(miniscoping,[status(thm)],[f105]) ).

fof(f107,plain,
    ( ! [A,B,C] :
        ( ( ( sK3_skl(C,B,A) = B
            | sK3_skl(C,B,A) = A
            | in(sK3_skl(C,B,A),C) )
          & ( ( sK3_skl(C,B,A) != B
              & sK3_skl(C,B,A) != A )
            | ~ in(sK3_skl(C,B,A),C) ) )
        | C = unordered_pair(A,B) )
    & ! [A,B,C] :
        ( ( ! [D] :
              ( ( D != B
                & D != A )
              | in(D,C) )
          & ! [D] :
              ( D = B
              | D = A
              | ~ in(D,C) ) )
        | C != unordered_pair(A,B) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl]),skolemize(D,sK3_skl(C,B,A))],[f106]) ).

fof(f109,plain,
    ! [X0,X1,X2,X3] :
      ( X3 != X1
      | in(X3,X0)
      | X0 != unordered_pair(X1,X2) ),
    inference(cnf_transformation,[status(thm)],[f107]) ).

fof(f268,plain,
    ? [A,B,C] :
      ( A != B
      & singleton(A) = unordered_pair(B,C) ),
    inference(pre_NNF_transformation,[status(thm)],[f73]) ).

fof(f269,plain,
    ? [A,B] :
      ( A != B
      & ? [C] : singleton(A) = unordered_pair(B,C) ),
    inference(miniscoping,[status(thm)],[f268]) ).

fof(f270,plain,
    ( sK13_skl != sK14_skl
    & singleton(sK13_skl) = unordered_pair(sK14_skl,sK15_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK13_skl,sK14_skl,sK15_skl]),skolemize(A,sK13_skl),skolemize(B,sK14_skl),skolemize(C,sK15_skl)],[f269]) ).

fof(f271,plain,
    singleton(sK13_skl) = unordered_pair(sK14_skl,sK15_skl),
    inference(cnf_transformation,[status(thm)],[f270]) ).

fof(f272,plain,
    sK13_skl != sK14_skl,
    inference(cnf_transformation,[status(thm)],[f270]) ).

fof(f275,plain,
    ! [X0,X1] :
      ( X0 = X1
      | ~ in(X0,singleton(X1)) ),
    inference(destructive_equality_resolution,[status(thm)],[f89]) ).

fof(f281,plain,
    ! [X0,X1] : in(X0,unordered_pair(X0,X1)),
    inference(destructive_equality_resolution,[status(thm)],[f109]) ).

fof(f295,plain,
    in(sK14_skl,singleton(sK13_skl)),
    inference(paramodulation,[status(thm)],[f271,f281]) ).

fof(f311,plain,
    sK14_skl = sK13_skl,
    inference(resolution,[status(thm)],[f275,f295]) ).

fof(f313,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f311,f272]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SEU149+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n003.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:54:46 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.37  % Drodi V4.1.1
% 0.12/0.39  % Refutation found
% 0.12/0.39  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.39  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.41  % Elapsed time: 0.054600 seconds
% 0.12/0.41  % CPU time: 0.132736 seconds
% 0.12/0.41  % Total memory used: 82.097 MB
% 0.12/0.41  % Net memory used: 82.047 MB
%------------------------------------------------------------------------------