↑ Up

Drodi---4.1.1.UNS-CRf.s

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

% Computer : n014.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:46:00 PM UTC 2026

% Result   : Unsatisfiable 0.14s 0.40s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   56 (  26 unt;   4 def)
%            Number of atoms       :   99 (  30 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   81 (  38   ~;  39   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   5 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   29 (  29   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X_1] : gt(plus(X_1,n1),n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f5,axiom,
    ! [X_3,Y_4,Z_5] :
      ( def_10(Y_4,X_3)
      | plus(Z_5,Y_4) != X_3
      | minus(X_3,Y_4) = Z_5 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f7,axiom,
    ! [Y_4,X_3] :
      ( X_3 != Y_4
      | ~ def_10(Y_4,X_3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f19,axiom,
    ! [X_31] : plus(n0,X_31) = X_31,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f24,axiom,
    ! [X_t_35] :
      ( p_Empty(X_t_35)
      | int_level(X_t_35) != n0 ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p') ).

fof(f91,negated_conjecture,
    level(t_139) = n1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f92,negated_conjecture,
    ~ p_Wr(t_139),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f93,negated_conjecture,
    p_Rd(t_139),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f95,negated_conjecture,
    ~ p_Empty(plus(t_139,n1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f97,plain,
    ! [X0] : gt(plus(X0,n1),n0),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f101,plain,
    ! [X_3,Y_4] :
      ( def_10(Y_4,X_3)
      | ! [Z_5] :
          ( plus(Z_5,Y_4) != X_3
          | minus(X_3,Y_4) = Z_5 ) ),
    inference(miniscoping,[status(thm)],[f5]) ).

fof(f102,plain,
    ! [X0,X1,X2] :
      ( def_10(X1,X0)
      | plus(X2,X1) != X0
      | minus(X0,X1) = X2 ),
    inference(cnf_transformation,[status(thm)],[f101]) ).

fof(f104,plain,
    ! [X0,X1] :
      ( X1 != X0
      | ~ def_10(X0,X1) ),
    inference(cnf_transformation,[status(thm)],[f7]) ).

fof(f117,plain,
    ! [X0] : plus(n0,X0) = X0,
    inference(cnf_transformation,[status(thm)],[f19]) ).

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

fof(f122,plain,
    ! [X0] :
      ( p_Empty(X0)
      | int_level(X0) != n0 ),
    inference(cnf_transformation,[status(thm)],[f24]) ).

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,
    level(t_139) = n1,
    inference(cnf_transformation,[status(thm)],[f91]) ).

fof(f192,plain,
    ~ p_Wr(t_139),
    inference(cnf_transformation,[status(thm)],[f92]) ).

fof(f193,plain,
    p_Rd(t_139),
    inference(cnf_transformation,[status(thm)],[f93]) ).

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

fof(f195,plain,
    ~ p_Empty(plus(t_139,n1)),
    inference(cnf_transformation,[status(thm)],[f95]) ).

fof(f197,plain,
    ! [X0,X1] :
      ( def_10(X1,plus(X0,X1))
      | minus(plus(X0,X1),X1) = X0 ),
    inference(destructive_equality_resolution,[status(thm)],[f102]) ).

fof(f198,plain,
    ! [X0] : ~ def_10(X0,X0),
    inference(destructive_equality_resolution,[status(thm)],[f104]) ).

fof(f255,plain,
    int_level(t_139) = n1,
    inference(forward_demodulation,[status(thm)],[f119,f191]) ).

fof(f266,plain,
    gt(n1,n0),
    inference(paramodulation,[status(thm)],[f117,f97]) ).

fof(f268,definition,
    ( sQ0_spl
  <=> p_Reset(t_139) ),
    introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).

fof(f269,plain,
    ( ~ sQ0_spl
    | p_Reset(t_139) ),
    inference(component_clause,[status(thm)],[f268]) ).

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

fof(f273,plain,
    ( sQ1_spl
    | ~ p_Rd(t_139) ),
    inference(component_clause,[status(thm)],[f271]) ).

fof(f292,plain,
    ! [X0] :
      ( def_10(X0,X0)
      | minus(plus(n0,X0),X0) = n0 ),
    inference(paramodulation,[status(thm)],[f117,f197]) ).

fof(f293,plain,
    ! [X0] :
      ( def_10(X0,X0)
      | minus(X0,X0) = n0 ),
    inference(forward_demodulation,[status(thm)],[f117,f292]) ).

fof(f295,plain,
    ! [X0] : minus(X0,X0) = n0,
    inference(forward_subsumption_resolution,[status(thm)],[f293,f198]) ).

fof(f307,plain,
    ( ~ sQ0_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f269,f194]) ).

fof(f308,plain,
    ~ sQ0_spl,
    inference(contradiction_clause,[status(thm)],[f307]) ).

fof(f347,definition,
    ( sQ15_spl
  <=> gt(int_level(t_139),n0) ),
    introduced(definition,[new_symbols(definition,[sQ15_spl])],[split_symbol_definition]) ).

fof(f349,plain,
    ( sQ15_spl
    | ~ gt(int_level(t_139),n0) ),
    inference(component_clause,[status(thm)],[f347]) ).

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

fof(f416,definition,
    ( sQ27_spl
  <=> int_level(plus(t_139,n1)) = minus(int_level(t_139),n1) ),
    introduced(definition,[new_symbols(definition,[sQ27_spl])],[split_symbol_definition]) ).

fof(f417,plain,
    ( ~ sQ27_spl
    | int_level(plus(t_139,n1)) = minus(int_level(t_139),n1) ),
    inference(component_clause,[status(thm)],[f416]) ).

fof(f419,plain,
    ( sQ27_spl
    | ~ sQ15_spl
    | ~ sQ1_spl
    | sQ0_spl ),
    inference(split_clause,[status(thm)],[f415,f268,f271,f347,f416]) ).

fof(f420,plain,
    ( sQ15_spl
    | ~ gt(n1,n0) ),
    inference(forward_demodulation,[status(thm)],[f255,f349]) ).

fof(f421,plain,
    ( sQ15_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f420,f266]) ).

fof(f422,plain,
    sQ15_spl,
    inference(contradiction_clause,[status(thm)],[f421]) ).

fof(f423,plain,
    ( sQ1_spl
    | $false ),
    inference(forward_subsumption_resolution,[status(thm)],[f273,f193]) ).

fof(f424,plain,
    sQ1_spl,
    inference(contradiction_clause,[status(thm)],[f423]) ).

fof(f431,plain,
    ( ~ sQ27_spl
    | int_level(plus(t_139,n1)) = minus(n1,n1) ),
    inference(forward_demodulation,[status(thm)],[f255,f417]) ).

fof(f432,plain,
    ( ~ sQ27_spl
    | int_level(plus(t_139,n1)) = n0 ),
    inference(forward_demodulation,[status(thm)],[f295,f431]) ).

fof(f499,plain,
    int_level(plus(t_139,n1)) != n0,
    inference(resolution,[status(thm)],[f122,f195]) ).

fof(f500,plain,
    ( ~ sQ27_spl
    | n0 != n0 ),
    inference(forward_demodulation,[status(thm)],[f432,f499]) ).

fof(f501,plain,
    ( ~ sQ27_spl
    | $false ),
    inference(trivial_equality_resolution,[status(thm)],[f500]) ).

fof(f502,plain,
    ~ sQ27_spl,
    inference(contradiction_clause,[status(thm)],[f501]) ).

fof(f503,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f308,f419,f422,f424,f502]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV023-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.35  % Computer : n014.cluster.edu
% 0.11/0.35  % Model    : x86_64 x86_64
% 0.11/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.35  % Memory   : 8046.5625MB
% 0.11/0.35  % OS       : Linux 6.8.0-71-generic
% 0.11/0.35  % CPULimit : 300
% 0.11/0.35  % WCLimit  : 300
% 0.11/0.35  % DateTime : Sun Sep 20 20:48:34 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.37  % Drodi V4.1.1
% 0.14/0.40  % Refutation found
% 0.14/0.40  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.43  % Elapsed time: 0.065165 seconds
% 0.14/0.43  % CPU time: 0.213306 seconds
% 0.14/0.43  % Total memory used: 106.456 MB
% 0.14/0.43  % Net memory used: 106.254 MB
%------------------------------------------------------------------------------