↑ Up

Drodi---4.1.1.THM-CRf.s

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

% Computer : n007.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 11:48:53 AM UTC 2026

% Result   : Theorem 0.11s 0.40s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   7 unt;   0 def)
%            Number of atoms       :   66 (  23 equ)
%            Maximal formula atoms :   14 (   3 avg)
%            Number of connectives :   70 (  22   ~;  13   |;  15   &)
%                                         (   0 <=>;  20  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   32 (  31   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [U] :
      ( sorti1(U)
     => op1(U,U) != U ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f4,axiom,
    ~ ! [U] :
        ( sorti2(U)
       => op2(U,U) != U ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f5,conjecture,
    ( ( ! [V] :
          ( sorti2(V)
         => sorti1(j(V)) )
      & ! [U] :
          ( sorti1(U)
         => sorti2(h(U)) ) )
   => ~ ( ! [X2] :
            ( sorti1(X2)
           => j(h(X2)) = X2 )
        & ! [X1] :
            ( sorti2(X1)
           => h(j(X1)) = X1 )
        & ! [Y] :
            ( sorti2(Y)
           => ! [Z] :
                ( sorti2(Z)
               => j(op2(Y,Z)) = op1(j(Y),j(Z)) ) )
        & ! [W] :
            ( sorti1(W)
           => ! [X] :
                ( sorti1(X)
               => h(op1(W,X)) = op2(h(W),h(X)) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f6,negated_conjecture,
    ~ ( ( ! [V] :
            ( sorti2(V)
           => sorti1(j(V)) )
        & ! [U] :
            ( sorti1(U)
           => sorti2(h(U)) ) )
     => ~ ( ! [X2] :
              ( sorti1(X2)
             => j(h(X2)) = X2 )
          & ! [X1] :
              ( sorti2(X1)
             => h(j(X1)) = X1 )
          & ! [Y] :
              ( sorti2(Y)
             => ! [Z] :
                  ( sorti2(Z)
                 => j(op2(Y,Z)) = op1(j(Y),j(Z)) ) )
          & ! [W] :
              ( sorti1(W)
             => ! [X] :
                  ( sorti1(X)
                 => h(op1(W,X)) = op2(h(W),h(X)) ) ) ) ),
    inference(negated_conjecture,[status(cth)],[f5]) ).

fof(f11,plain,
    ! [U] :
      ( op1(U,U) != U
      | ~ sorti1(U) ),
    inference(pre_NNF_transformation,[status(thm)],[f3]) ).

fof(f12,plain,
    ! [X0] :
      ( op1(X0,X0) != X0
      | ~ sorti1(X0) ),
    inference(cnf_transformation,[status(thm)],[f11]) ).

fof(f13,plain,
    ? [U] :
      ( op2(U,U) = U
      & sorti2(U) ),
    inference(pre_NNF_transformation,[status(thm)],[f4]) ).

fof(f14,plain,
    ( op2(sK0_skl,sK0_skl) = sK0_skl
    & sorti2(sK0_skl) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(U,sK0_skl)],[f13]) ).

fof(f15,plain,
    sorti2(sK0_skl),
    inference(cnf_transformation,[status(thm)],[f14]) ).

fof(f16,plain,
    op2(sK0_skl,sK0_skl) = sK0_skl,
    inference(cnf_transformation,[status(thm)],[f14]) ).

fof(f17,plain,
    ( ! [X2] :
        ( j(h(X2)) = X2
        | ~ sorti1(X2) )
    & ! [X1] :
        ( h(j(X1)) = X1
        | ~ sorti2(X1) )
    & ! [Y] :
        ( ! [Z] :
            ( j(op2(Y,Z)) = op1(j(Y),j(Z))
            | ~ sorti2(Z) )
        | ~ sorti2(Y) )
    & ! [W] :
        ( ! [X] :
            ( h(op1(W,X)) = op2(h(W),h(X))
            | ~ sorti1(X) )
        | ~ sorti1(W) )
    & ! [V] :
        ( sorti1(j(V))
        | ~ sorti2(V) )
    & ! [U] :
        ( sorti2(h(U))
        | ~ sorti1(U) ) ),
    inference(pre_NNF_transformation,[status(thm)],[f6]) ).

fof(f19,plain,
    ! [X0] :
      ( sorti1(j(X0))
      | ~ sorti2(X0) ),
    inference(cnf_transformation,[status(thm)],[f17]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( j(op2(X0,X1)) = op1(j(X0),j(X1))
      | ~ sorti2(X1)
      | ~ sorti2(X0) ),
    inference(cnf_transformation,[status(thm)],[f17]) ).

fof(f28,plain,
    sorti1(j(sK0_skl)),
    inference(resolution,[status(thm)],[f19,f15]) ).

fof(f34,plain,
    op1(j(sK0_skl),j(sK0_skl)) != j(sK0_skl),
    inference(resolution,[status(thm)],[f28,f12]) ).

fof(f39,plain,
    j(op2(sK0_skl,sK0_skl)) = op1(j(sK0_skl),j(sK0_skl)),
    inference(resolution,[status(thm)],[f21,f15]) ).

fof(f42,plain,
    j(sK0_skl) = op1(j(sK0_skl),j(sK0_skl)),
    inference(forward_demodulation,[status(thm)],[f16,f39]) ).

fof(f43,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[f42,f34]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ALG201+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.37  % Computer : n007.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 21 12:59:36 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.38  % Drodi V4.1.1
% 0.11/0.40  % Refutation found
% 0.11/0.40  % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.43  % Elapsed time: 0.049876 seconds
% 0.11/0.43  % CPU time: 0.133004 seconds
% 0.11/0.43  % Total memory used: 52.135 MB
% 0.11/0.43  % Net memory used: 51.661 MB
%------------------------------------------------------------------------------