TSTP Solution File: HWV023-1 by Drodi---3.6.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Drodi---3.6.0
% Problem  : HWV023-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Apr 30 20:21:59 EDT 2024

% Result   : Unsatisfiable 0.23s 0.66s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   64 (  26 unt;   0 def)
%            Number of atoms       :  127 (  41 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :  111 (  48   ~;  59   |;   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   :   45 (  45   !;   0   ?)

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

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

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

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

fof(f71,axiom,
    ! [X_t_42] :
      ( p_Reset(X_t_42)
      | p_Wr(X_t_42)
      | ~ p_Rd(X_t_42)
      | ~ gt(int_level(X_t_42),n0)
      | int_level(plus(X_t_42,n1)) = minus(int_level(X_t_42),n1) ),
    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(esa)],[f2]) ).

fof(f99,plain,
    ! [X_3,Y_4] :
      ( ! [Z_5] :
          ( minus(X_3,Y_4) != Z_5
          | plus(Z_5,Y_4) = X_3 )
      | def_10(Y_4,X_3) ),
    inference(miniscoping,[status(esa)],[f4]) ).

fof(f100,plain,
    ! [X0,X1,X2] :
      ( minus(X0,X1) != X2
      | plus(X2,X1) = X0
      | def_10(X1,X0) ),
    inference(cnf_transformation,[status(esa)],[f99]) ).

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

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

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

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

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

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

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

fof(f191,plain,
    level(t_139) = n1,
    inference(cnf_transformation,[status(esa)],[f91]) ).

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

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

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

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

fof(f196,plain,
    ! [X0,X1] :
      ( plus(minus(X0,X1),X1) = X0
      | def_10(X1,X0) ),
    inference(destructive_equality_resolution,[status(esa)],[f100]) ).

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

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

fof(f201,plain,
    ! [X0] :
      ( level(X0) != n0
      | p_Empty(X0) ),
    inference(forward_demodulation,[status(thm)],[f119,f122]) ).

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

fof(f256,plain,
    ! [X0] :
      ( p_Reset(X0)
      | p_Wr(X0)
      | ~ p_Rd(X0)
      | ~ gt(level(X0),n0)
      | level(plus(X0,n1)) = minus(int_level(X0),n1) ),
    inference(forward_demodulation,[status(thm)],[f119,f255]) ).

fof(f257,plain,
    ! [X0] :
      ( p_Reset(X0)
      | p_Wr(X0)
      | ~ p_Rd(X0)
      | ~ gt(level(X0),n0)
      | level(plus(X0,n1)) = minus(level(X0),n1) ),
    inference(forward_demodulation,[status(thm)],[f119,f256]) ).

fof(f348,plain,
    ! [X0] : plus(minus(X0,X0),X0) = X0,
    inference(resolution,[status(thm)],[f196,f198]) ).

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

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

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

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

fof(f489,plain,
    level(plus(t_139,n1)) != n0,
    inference(resolution,[status(thm)],[f201,f195]) ).

fof(f498,plain,
    ( spl0_26
  <=> p_Reset(t_139) ),
    introduced(split_symbol_definition) ).

fof(f499,plain,
    ( p_Reset(t_139)
    | ~ spl0_26 ),
    inference(component_clause,[status(thm)],[f498]) ).

fof(f506,plain,
    ( $false
    | ~ spl0_26 ),
    inference(forward_subsumption_resolution,[status(thm)],[f499,f194]) ).

fof(f507,plain,
    ~ spl0_26,
    inference(contradiction_clause,[status(thm)],[f506]) ).

fof(f511,plain,
    ( spl0_28
  <=> p_Wr(t_139) ),
    introduced(split_symbol_definition) ).

fof(f512,plain,
    ( p_Wr(t_139)
    | ~ spl0_28 ),
    inference(component_clause,[status(thm)],[f511]) ).

fof(f520,plain,
    ( $false
    | ~ spl0_28 ),
    inference(forward_subsumption_resolution,[status(thm)],[f512,f192]) ).

fof(f521,plain,
    ~ spl0_28,
    inference(contradiction_clause,[status(thm)],[f520]) ).

fof(f543,plain,
    ( spl0_34
  <=> gt(level(t_139),n0) ),
    introduced(split_symbol_definition) ).

fof(f545,plain,
    ( ~ gt(level(t_139),n0)
    | spl0_34 ),
    inference(component_clause,[status(thm)],[f543]) ).

fof(f554,plain,
    ( ~ gt(n1,n0)
    | spl0_34 ),
    inference(forward_demodulation,[status(thm)],[f191,f545]) ).

fof(f555,plain,
    ( $false
    | spl0_34 ),
    inference(forward_subsumption_resolution,[status(thm)],[f554,f368]) ).

fof(f556,plain,
    spl0_34,
    inference(contradiction_clause,[status(thm)],[f555]) ).

fof(f558,plain,
    ( spl0_36
  <=> level(plus(t_139,n1)) = minus(level(t_139),n1) ),
    introduced(split_symbol_definition) ).

fof(f559,plain,
    ( level(plus(t_139,n1)) = minus(level(t_139),n1)
    | ~ spl0_36 ),
    inference(component_clause,[status(thm)],[f558]) ).

fof(f561,plain,
    ( p_Reset(t_139)
    | p_Wr(t_139)
    | ~ gt(level(t_139),n0)
    | level(plus(t_139,n1)) = minus(level(t_139),n1) ),
    inference(resolution,[status(thm)],[f257,f193]) ).

fof(f562,plain,
    ( spl0_26
    | spl0_28
    | ~ spl0_34
    | spl0_36 ),
    inference(split_clause,[status(thm)],[f561,f498,f511,f543,f558]) ).

fof(f571,plain,
    ( level(plus(t_139,n1)) = minus(n1,n1)
    | ~ spl0_36 ),
    inference(forward_demodulation,[status(thm)],[f191,f559]) ).

fof(f572,plain,
    ( level(plus(t_139,n1)) = n0
    | ~ spl0_36 ),
    inference(forward_demodulation,[status(thm)],[f400,f571]) ).

fof(f573,plain,
    ( n0 != n0
    | ~ spl0_36 ),
    inference(forward_demodulation,[status(thm)],[f572,f489]) ).

fof(f574,plain,
    ( $false
    | ~ spl0_36 ),
    inference(trivial_equality_resolution,[status(esa)],[f573]) ).

fof(f575,plain,
    ~ spl0_36,
    inference(contradiction_clause,[status(thm)],[f574]) ).

fof(f576,plain,
    $false,
    inference(sat_refutation,[status(thm)],[f507,f521,f556,f562,f575]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.33  % Problem  : HWV023-1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.34  % Command  : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.57  % Computer : n004.cluster.edu
% 0.13/0.57  % Model    : x86_64 x86_64
% 0.13/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.57  % Memory   : 8042.1875MB
% 0.13/0.57  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.57  % CPULimit : 300
% 0.13/0.57  % WCLimit  : 300
% 0.13/0.57  % DateTime : Tue Apr 30 01:01:49 EDT 2024
% 0.13/0.57  % CPUTime  : 
% 0.21/0.59  % Drodi V3.6.0
% 0.23/0.66  % Refutation found
% 0.23/0.66  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.23/0.66  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.23/0.68  % Elapsed time: 0.087439 seconds
% 0.23/0.68  % CPU time: 0.560688 seconds
% 0.23/0.68  % Total memory used: 69.700 MB
% 0.23/0.68  % Net memory used: 69.126 MB
%------------------------------------------------------------------------------