↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n005.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 12:45:57 PM UTC 2026

% Result   : Unsatisfiable 0.16s 0.57s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   36 (  20 unt;   4 def)
%            Number of atoms       :   62 (  11 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   50 (  24   ~;  22   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :   10 (   8 usr;   5 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :    4 (   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f21,axiom,
    ! [X_t_32] : level(X_t_32) = int_level(X_t_32),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f71,axiom,
    ! [X_t_42] :
      ( int_level(plus(X_t_42,n1)) = minus(int_level(X_t_42),n1)
      | ~ gt(int_level(X_t_42),n0)
      | ~ p_Rd(X_t_42)
      | p_Wr(X_t_42)
      | p_Reset(X_t_42) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f91,negated_conjecture,
    gt(level(x_139),n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f92,negated_conjecture,
    p_Rd(x_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f93,negated_conjecture,
    ~ p_Wr(x_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f94,negated_conjecture,
    ~ p_Reset(x_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f95,negated_conjecture,
    level(plus(x_139,n1)) != minus(level(x_139),n1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).

fof(f119,plain,
    ! [X0] : level(X0) = int_level(X0),
    inference(cnf_transformation,[status(thm)],[f21]) ).

fof(f171,plain,
    ! [X0] :
      ( int_level(plus(X0,n1)) = minus(int_level(X0),n1)
      | ~ gt(int_level(X0),n0)
      | ~ p_Rd(X0)
      | p_Wr(X0)
      | p_Reset(X0) ),
    inference(cnf_transformation,[status(thm)],[f71]) ).

fof(f191,plain,
    gt(level(x_139),n0),
    inference(cnf_transformation,[status(thm)],[f91]) ).

fof(f192,plain,
    p_Rd(x_139),
    inference(cnf_transformation,[status(thm)],[f92]) ).

fof(f193,plain,
    ~ p_Wr(x_139),
    inference(cnf_transformation,[status(thm)],[f93]) ).

fof(f194,plain,
    ~ p_Reset(x_139),
    inference(cnf_transformation,[status(thm)],[f94]) ).

fof(f195,plain,
    level(plus(x_139,n1)) != minus(level(x_139),n1),
    inference(cnf_transformation,[status(thm)],[f95]) ).

fof(f255,plain,
    gt(int_level(x_139),n0),
    inference(forward_demodulation,[status(thm)],[f119,f191]) ).

fof(f256,plain,
    int_level(plus(x_139,n1)) != minus(level(x_139),n1),
    inference(forward_demodulation,[status(thm)],[f119,f195]) ).

fof(f257,plain,
    int_level(plus(x_139,n1)) != minus(int_level(x_139),n1),
    inference(forward_demodulation,[status(thm)],[f119,f256]) ).

fof(f278,definition,
    ( sQ1_spl
  <=> p_Rd(x_139) ),
    introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).

fof(f280,plain,
    ( sQ1_spl
    | ~ p_Rd(x_139) ),
    inference(component_clause,[status(thm)],[f278]) ).

fof(f281,definition,
    ( sQ2_spl
  <=> gt(int_level(x_139),n0) ),
    introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).

fof(f283,plain,
    ( sQ2_spl
    | ~ gt(int_level(x_139),n0) ),
    inference(component_clause,[status(thm)],[f281]) ).

fof(f297,plain,
    ( sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f280,f192]) ).

fof(f298,plain,
    sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f297]) ).

fof(f309,plain,
    ( int_level(plus(x_139,n1)) = minus(int_level(x_139),n1)
    | ~ gt(int_level(x_139),n0)
    | ~ p_Rd(x_139)
    | p_Reset(x_139) ),
    inference(resolution,[status(thm)],[f171,f193]) ).

fof(f310,definition,
    ( sQ8_spl
  <=> p_Reset(x_139) ),
    introduced(definition,[new_symbols(definition,[sQ8_spl])],[split_symbol_definition]) ).

fof(f311,plain,
    ( ~ sQ8_spl
    | p_Reset(x_139) ),
    inference(component_clause,[status(thm)],[f310]) ).

fof(f313,definition,
    ( sQ9_spl
  <=> int_level(plus(x_139,n1)) = minus(int_level(x_139),n1) ),
    introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).

fof(f314,plain,
    ( ~ sQ9_spl
    | int_level(plus(x_139,n1)) = minus(int_level(x_139),n1) ),
    inference(component_clause,[status(thm)],[f313]) ).

fof(f316,plain,
    ( sQ9_spl
    | ~ sQ2_spl
    | ~ sQ1_spl
    | sQ8_spl ),
    inference(split_clause,[status(thm)],[f309,f310,f278,f281,f313]) ).

fof(f317,plain,
    ( sQ2_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f283,f255]) ).

fof(f318,plain,
    sQ2_spl,
    inference(contradiction_clause,[status(thm)],[f317]) ).

fof(f319,plain,
    ( ~ sQ8_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f311,f194]) ).

fof(f320,plain,
    ~ sQ8_spl,
    inference(contradiction_clause,[status(thm)],[f319]) ).

fof(f321,plain,
    ( ~ sQ9_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f314,f257]) ).

fof(f322,plain,
    ~ sQ9_spl,
    inference(contradiction_clause,[status(thm)],[f321]) ).

fof(f323,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f298,f316,f318,f320,f322]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV014-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.53  % Computer : n005.cluster.edu
% 0.08/0.53  % Model    : x86_64 x86_64
% 0.08/0.53  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.53  % Memory   : 8046.5625MB
% 0.08/0.53  % OS       : Linux 6.8.0-71-generic
% 0.08/0.53  % CPULimit : 300
% 0.08/0.53  % WCLimit  : 300
% 0.08/0.53  % DateTime : Sun Sep 20 20:48:03 UTC 2026
% 0.08/0.53  % CPUTime  : 
% 0.08/0.54  % Drodi V4.1.1
% 0.16/0.57  % Refutation found
% 0.16/0.57  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.16/0.57  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.60  % Elapsed time: 0.053389 seconds
% 0.16/0.60  % CPU time: 0.172458 seconds
% 0.16/0.60  % Total memory used: 105.690 MB
% 0.16/0.60  % Net memory used: 105.500 MB
%------------------------------------------------------------------------------