TSTP Solution File: HWV028-1 by Metis---2.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Metis---2.4
% Problem  : HWV028-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : metis --show proof --show saturation %s

% Computer : n010.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  : 600s
% DateTime : Sat Jul 16 18:29:47 EDT 2022

% Result   : Unsatisfiable 5.21s 5.49s
% Output   : CNFRefutation 5.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   22 (  12 unt;   0 nHn;  21 RR)
%            Number of literals    :   36 (   7 equ;  16 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :    8 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_13,axiom,
    ( ~ gt(Z_21,Y_20)
    | gt(Z_21,X_19)
    | ~ gt(Y_20,X_19) ) ).

cnf(axiom_17,axiom,
    ~ gt(X_28,X_28) ).

cnf(axiom_21,axiom,
    level(X_t_32) = int_level(X_t_32) ).

cnf(axiom_26,axiom,
    ( ~ p_Reset(X_t_37)
    | int_level(plus(X_t_37,n1)) = n0 ) ).

cnf(quest_1,negated_conjecture,
    p_Reset(t_139) ).

cnf(quest_2,negated_conjecture,
    gt(level(plus(t_139,n1)),fifo_length) ).

cnf(quest_3,negated_conjecture,
    gt(fifo_length,n0) ).

cnf(refute_0_0,plain,
    level(plus(t_139,n1)) = int_level(plus(t_139,n1)),
    inference(subst,[],[axiom_21:[bind(X_t_32,$fot(plus(t_139,n1)))]]) ).

cnf(refute_0_1,plain,
    ( level(plus(t_139,n1)) != int_level(plus(t_139,n1))
    | ~ gt(level(plus(t_139,n1)),fifo_length)
    | gt(int_level(plus(t_139,n1)),fifo_length) ),
    introduced(tautology,[equality,[$cnf( gt(level(plus(t_139,n1)),fifo_length) ),[0],$fot(int_level(plus(t_139,n1)))]]) ).

cnf(refute_0_2,plain,
    ( ~ gt(level(plus(t_139,n1)),fifo_length)
    | gt(int_level(plus(t_139,n1)),fifo_length) ),
    inference(resolve,[$cnf( $equal(level(plus(t_139,n1)),int_level(plus(t_139,n1))) )],[refute_0_0,refute_0_1]) ).

cnf(refute_0_3,plain,
    gt(int_level(plus(t_139,n1)),fifo_length),
    inference(resolve,[$cnf( gt(level(plus(t_139,n1)),fifo_length) )],[quest_2,refute_0_2]) ).

cnf(refute_0_4,plain,
    ( ~ p_Reset(t_139)
    | int_level(plus(t_139,n1)) = n0 ),
    inference(subst,[],[axiom_26:[bind(X_t_37,$fot(t_139))]]) ).

cnf(refute_0_5,plain,
    int_level(plus(t_139,n1)) = n0,
    inference(resolve,[$cnf( p_Reset(t_139) )],[quest_1,refute_0_4]) ).

cnf(refute_0_6,plain,
    ( int_level(plus(t_139,n1)) != n0
    | ~ gt(int_level(plus(t_139,n1)),fifo_length)
    | gt(n0,fifo_length) ),
    introduced(tautology,[equality,[$cnf( gt(int_level(plus(t_139,n1)),fifo_length) ),[0],$fot(n0)]]) ).

cnf(refute_0_7,plain,
    ( ~ gt(int_level(plus(t_139,n1)),fifo_length)
    | gt(n0,fifo_length) ),
    inference(resolve,[$cnf( $equal(int_level(plus(t_139,n1)),n0) )],[refute_0_5,refute_0_6]) ).

cnf(refute_0_8,plain,
    gt(n0,fifo_length),
    inference(resolve,[$cnf( gt(int_level(plus(t_139,n1)),fifo_length) )],[refute_0_3,refute_0_7]) ).

cnf(refute_0_9,plain,
    ( ~ gt(X_192,n0)
    | ~ gt(n0,fifo_length)
    | gt(X_192,fifo_length) ),
    inference(subst,[],[axiom_13:[bind(X_19,$fot(fifo_length)),bind(Y_20,$fot(n0)),bind(Z_21,$fot(X_192))]]) ).

cnf(refute_0_10,plain,
    ( ~ gt(X_192,n0)
    | gt(X_192,fifo_length) ),
    inference(resolve,[$cnf( gt(n0,fifo_length) )],[refute_0_8,refute_0_9]) ).

cnf(refute_0_11,plain,
    ( ~ gt(fifo_length,n0)
    | gt(fifo_length,fifo_length) ),
    inference(subst,[],[refute_0_10:[bind(X_192,$fot(fifo_length))]]) ).

cnf(refute_0_12,plain,
    gt(fifo_length,fifo_length),
    inference(resolve,[$cnf( gt(fifo_length,n0) )],[quest_3,refute_0_11]) ).

cnf(refute_0_13,plain,
    ~ gt(fifo_length,fifo_length),
    inference(subst,[],[axiom_17:[bind(X_28,$fot(fifo_length))]]) ).

cnf(refute_0_14,plain,
    $false,
    inference(resolve,[$cnf( gt(fifo_length,fifo_length) )],[refute_0_12,refute_0_13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.21  % Problem  : HWV028-1 : TPTP v8.1.0. Released v2.5.0.
% 0.08/0.22  % Command  : metis --show proof --show saturation %s
% 0.14/0.43  % Computer : n010.cluster.edu
% 0.14/0.43  % Model    : x86_64 x86_64
% 0.14/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.43  % Memory   : 8042.1875MB
% 0.14/0.43  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.43  % CPULimit : 300
% 0.14/0.43  % WCLimit  : 600
% 0.14/0.43  % DateTime : Fri Jun 17 07:05:23 EDT 2022
% 0.14/0.44  % CPUTime  : 
% 0.14/0.44  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% 5.21/5.49  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.21/5.49  
% 5.21/5.49  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.21/5.49  
%------------------------------------------------------------------------------