TSTP Solution File: HWV030-2 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n019.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:58 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(t_206)),
    file('HWV030-2.p',unknown),
    [] ).

cnf(2,axiom,
    p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,fwork_DOTfifo_DOTrtl_DOTwr__level_(f_ADD_(t_206,n1))),
    file('HWV030-2.p',unknown),
    [] ).

cnf(3,axiom,
    ~ p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
    file('HWV030-2.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ p__pred_(fwork_DOTfifo_DOTrtl_DOTreset_(u))
    | equal(fwork_DOTfifo_DOTrtl_DOTwr__level_(f_ADD_(u,n1)),n0) ),
    file('HWV030-2.p',unknown),
    [] ).

cnf(196,plain,
    equal(fwork_DOTfifo_DOTrtl_DOTwr__level_(f_ADD_(t_206,n1)),n0),
    inference(res,[status(thm),theory(equality)],[1,13]),
    [iquote('0:Res:1.0,13.0')] ).

cnf(241,plain,
    p_LES_EQU_(fwork_DOTfifo_DOTrtl_DOTfifo__length_,n0),
    inference(rew,[status(thm),theory(equality)],[196,2]),
    [iquote('0:Rew:196.0,2.0')] ).

cnf(242,plain,
    $false,
    inference(mrr,[status(thm)],[241,3]),
    [iquote('0:MRR:241.0,3.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : HWV030-2 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n019.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Fri Jun 17 02:56:54 EDT 2022
% 0.18/0.34  % CPUTime  : 
% 0.18/0.44  
% 0.18/0.44  SPASS V 3.9 
% 0.18/0.44  SPASS beiseite: Proof found.
% 0.18/0.44  % SZS status Theorem
% 0.18/0.44  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.44  SPASS derived 23 clauses, backtracked 0 clauses, performed 0 splits and kept 143 clauses.
% 0.18/0.44  SPASS allocated 75854 KBytes.
% 0.18/0.44  SPASS spent	0:00:00.09 on the problem.
% 0.18/0.44  		0:00:00.04 for the input.
% 0.18/0.44  		0:00:00.00 for the FLOTTER CNF translation.
% 0.18/0.44  		0:00:00.00 for inferences.
% 0.18/0.44  		0:00:00.00 for the backtracking.
% 0.18/0.44  		0:00:00.02 for the reduction.
% 0.18/0.44  
% 0.18/0.44  
% 0.18/0.44  Here is a proof with depth 1, length 7 :
% 0.18/0.44  % SZS output start Refutation
% See solution above
% 0.18/0.44  Formulae used in the proof : quest_1 quest_2 quest_3 axiom_11
% 0.18/0.44  
%------------------------------------------------------------------------------