↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n012.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 03:07:54 PM UTC 2026

% Result   : Theorem 0.12s 0.38s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (   8 unt;   0 def)
%            Number of atoms       :   52 (  15 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   55 (  24   ~;  16   |;  10   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   16 (  11   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ( hoare_165779456gleton
  <=> ? [S,T] :
        ( S != T
        & is_state(T)
        & is_state(S) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f6,hypothesis,
    hoare_165779456gleton,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f7,conjecture,
    ! [T] :
      ( is_state(T)
     => ~ ! [S] :
            ( is_state(S)
           => S = T ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f8,negated_conjecture,
    ~ ! [T] :
        ( is_state(T)
       => ~ ! [S] :
              ( is_state(S)
             => S = T ) ),
    inference(negated_conjecture,[status(cth)],[f7]) ).

fof(f10,plain,
    ( ( ! [S,T] :
          ( S = T
          | ~ is_state(T)
          | ~ is_state(S) )
      | hoare_165779456gleton )
    & ( ? [S,T] :
          ( S != T
          & is_state(T)
          & is_state(S) )
      | ~ hoare_165779456gleton ) ),
    inference(NNF_transformation,[status(thm)],[f2]) ).

fof(f11,plain,
    ( ( ! [S,T] :
          ( S = T
          | ~ is_state(T)
          | ~ is_state(S) )
      | hoare_165779456gleton )
    & ( ( sK0_skl != sK1_skl
        & is_state(sK1_skl)
        & is_state(sK0_skl) )
      | ~ hoare_165779456gleton ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(S,sK0_skl),skolemize(T,sK1_skl)],[f10]) ).

fof(f12,plain,
    ( is_state(sK0_skl)
    | ~ hoare_165779456gleton ),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f13,plain,
    ( is_state(sK1_skl)
    | ~ hoare_165779456gleton ),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f14,plain,
    ( sK0_skl != sK1_skl
    | ~ hoare_165779456gleton ),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f19,plain,
    hoare_165779456gleton,
    inference(cnf_transformation,[status(thm)],[f6]) ).

fof(f20,plain,
    ? [T] :
      ( ! [S] :
          ( S = T
          | ~ is_state(S) )
      & is_state(T) ),
    inference(pre_NNF_transformation,[status(thm)],[f8]) ).

fof(f21,plain,
    ( ! [S] :
        ( S = sK2_skl
        | ~ is_state(S) )
    & is_state(sK2_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl]),skolemize(T,sK2_skl)],[f20]) ).

fof(f23,plain,
    ! [X0] :
      ( X0 = sK2_skl
      | ~ is_state(X0) ),
    inference(cnf_transformation,[status(thm)],[f21]) ).

fof(f27,plain,
    is_state(sK0_skl),
    inference(forward_subsumption_resolution,[status(thm)],[f12,f19]) ).

fof(f28,plain,
    sK0_skl = sK2_skl,
    inference(resolution,[status(thm)],[f27,f23]) ).

fof(f30,plain,
    is_state(sK1_skl),
    inference(forward_subsumption_resolution,[status(thm)],[f13,f19]) ).

fof(f31,plain,
    sK1_skl = sK2_skl,
    inference(resolution,[status(thm)],[f30,f23]) ).

fof(f33,plain,
    ( sK2_skl != sK1_skl
    | ~ hoare_165779456gleton ),
    inference(forward_demodulation,[status(thm)],[f28,f14]) ).

fof(f34,plain,
    ( sK2_skl != sK2_skl
    | ~ hoare_165779456gleton ),
    inference(forward_demodulation,[status(thm)],[f31,f33]) ).

fof(f35,plain,
    ~ hoare_165779456gleton,
    inference(trivial_equality_resolution,[status(thm)],[f34]) ).

fof(f36,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f35,f19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWW469+1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.03  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n012.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 09:55:06 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.12/0.36  % Drodi V4.1.1
% 0.12/0.38  % Refutation found
% 0.12/0.38  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.38  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.40  % Elapsed time: 0.044807 seconds
% 0.12/0.40  % CPU time: 0.115935 seconds
% 0.12/0.40  % Total memory used: 79.782 MB
% 0.12/0.40  % Net memory used: 79.305 MB
%------------------------------------------------------------------------------