TSTP Solution File: HWV009-1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : HWV009-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n020.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 19:14:43 EDT 2022

% Result   : Unsatisfiable 0.22s 0.44s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   14 (   7 unt;   1 nHn;  14 RR)
%            Number of literals    :   22 (   0 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    p_Reset(t_139),
    file('HWV009-1.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ equal(level(plus(t_139,n1)),n0)
    | p_Wr_error(plus(t_139,n1))
    | p_Rd_error(plus(t_139,n1)) ),
    file('HWV009-1.p',unknown),
    [] ).

cnf(23,axiom,
    equal(int_level(u),level(u)),
    file('HWV009-1.p',unknown),
    [] ).

cnf(28,axiom,
    ( ~ p_Reset(u)
    | equal(int_level(plus(u,n1)),n0) ),
    file('HWV009-1.p',unknown),
    [] ).

cnf(31,axiom,
    ( ~ p_Reset(u)
    | ~ p_Wr_error(plus(u,n1)) ),
    file('HWV009-1.p',unknown),
    [] ).

cnf(32,axiom,
    ( ~ p_Reset(u)
    | ~ p_Rd_error(plus(u,n1)) ),
    file('HWV009-1.p',unknown),
    [] ).

cnf(97,plain,
    ( ~ p_Reset(u)
    | equal(level(plus(u,n1)),n0) ),
    inference(rew,[status(thm),theory(equality)],[23,28]),
    [iquote('0:Rew:23.0,28.1')] ).

cnf(176,plain,
    equal(level(plus(t_139,n1)),n0),
    inference(res,[status(thm),theory(equality)],[1,97]),
    [iquote('0:Res:1.0,97.0')] ).

cnf(180,plain,
    ~ p_Wr_error(plus(t_139,n1)),
    inference(res,[status(thm),theory(equality)],[1,31]),
    [iquote('0:Res:1.0,31.0')] ).

cnf(181,plain,
    ~ p_Rd_error(plus(t_139,n1)),
    inference(res,[status(thm),theory(equality)],[1,32]),
    [iquote('0:Res:1.0,32.0')] ).

cnf(182,plain,
    ( ~ equal(level(plus(t_139,n1)),n0)
    | p_Rd_error(plus(t_139,n1)) ),
    inference(mrr,[status(thm)],[2,180]),
    [iquote('0:MRR:2.1,180.0')] ).

cnf(183,plain,
    ( ~ equal(n0,n0)
    | p_Rd_error(plus(t_139,n1)) ),
    inference(rew,[status(thm),theory(equality)],[176,182]),
    [iquote('0:Rew:176.0,182.0')] ).

cnf(184,plain,
    p_Rd_error(plus(t_139,n1)),
    inference(obv,[status(thm),theory(equality)],[183]),
    [iquote('0:Obv:183.0')] ).

cnf(185,plain,
    $false,
    inference(mrr,[status(thm)],[184,181]),
    [iquote('0:MRR:184.0,181.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : HWV009-1 : TPTP v8.1.0. Released v2.5.0.
% 0.12/0.14  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n020.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Fri Jun 17 09:16:19 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.22/0.44  
% 0.22/0.44  SPASS V 3.9 
% 0.22/0.44  SPASS beiseite: Proof found.
% 0.22/0.44  % SZS status Theorem
% 0.22/0.44  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.22/0.44  SPASS derived 8 clauses, backtracked 0 clauses, performed 0 splits and kept 98 clauses.
% 0.22/0.44  SPASS allocated 75748 KBytes.
% 0.22/0.44  SPASS spent	0:00:00.07 on the problem.
% 0.22/0.44  		0:00:00.04 for the input.
% 0.22/0.44  		0:00:00.00 for the FLOTTER CNF translation.
% 0.22/0.44  		0:00:00.00 for inferences.
% 0.22/0.44  		0:00:00.00 for the backtracking.
% 0.22/0.44  		0:00:00.01 for the reduction.
% 0.22/0.44  
% 0.22/0.44  
% 0.22/0.44  Here is a proof with depth 1, length 14 :
% 0.22/0.44  % SZS output start Refutation
% See solution above
% 0.22/0.44  Formulae used in the proof : quest_1 quest_2 axiom_21 axiom_26 axiom_29 axiom_30
% 0.22/0.44  
%------------------------------------------------------------------------------