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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV253-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n026.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 : Wed Jul 20 21:41:50 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    equal(c_Message_OinvKey(c_Message_OinvKey(u)),u),
    file('SWV253-2.p',unknown),
    [] ).

cnf(2,axiom,
    ( ~ equal(v_K_H,v_K)
    | ~ equal(c_Message_OinvKey(v_K_H),c_Message_OinvKey(v_K)) ),
    file('SWV253-2.p',unknown),
    [] ).

cnf(3,axiom,
    ( equal(v_K_H,v_K)
    | equal(c_Message_OinvKey(v_K_H),c_Message_OinvKey(v_K)) ),
    file('SWV253-2.p',unknown),
    [] ).

cnf(6,plain,
    equal(v_K_H,v_K),
    inference(spt,[spt(split,[position(s1)])],[3]),
    [iquote('1:Spt:3.0')] ).

cnf(7,plain,
    ( ~ equal(v_K_H,v_K)
    | ~ equal(c_Message_OinvKey(v_K),c_Message_OinvKey(v_K)) ),
    inference(rew,[status(thm),theory(equality)],[6,2]),
    [iquote('1:Rew:6.0,2.1')] ).

cnf(8,plain,
    ~ equal(v_K_H,v_K),
    inference(obv,[status(thm),theory(equality)],[7]),
    [iquote('1:Obv:7.1')] ).

cnf(9,plain,
    ~ equal(v_K,v_K),
    inference(rew,[status(thm),theory(equality)],[6,8]),
    [iquote('1:Rew:6.0,8.0')] ).

cnf(10,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[9]),
    [iquote('1:Obv:9.0')] ).

cnf(11,plain,
    ~ equal(v_K_H,v_K),
    inference(spt,[spt(split,[position(sa)])],[10,6]),
    [iquote('1:Spt:10.0,3.0,6.0')] ).

cnf(12,plain,
    equal(c_Message_OinvKey(v_K_H),c_Message_OinvKey(v_K)),
    inference(spt,[spt(split,[position(s2)])],[3]),
    [iquote('1:Spt:10.0,3.1')] ).

cnf(13,plain,
    equal(c_Message_OinvKey(c_Message_OinvKey(v_K)),v_K_H),
    inference(spr,[status(thm),theory(equality)],[12,1]),
    [iquote('1:SpR:12.0,1.0')] ).

cnf(15,plain,
    equal(v_K_H,v_K),
    inference(rew,[status(thm),theory(equality)],[1,13]),
    [iquote('1:Rew:1.0,13.0')] ).

cnf(16,plain,
    $false,
    inference(mrr,[status(thm)],[15,11]),
    [iquote('1:MRR:15.0,11.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SWV253-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n026.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Wed Jun 15 19:06:52 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.21/0.42  
% 0.21/0.42  SPASS V 3.9 
% 0.21/0.42  SPASS beiseite: Proof found.
% 0.21/0.42  % SZS status Theorem
% 0.21/0.42  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.21/0.42  SPASS derived 6 clauses, backtracked 3 clauses, performed 1 splits and kept 8 clauses.
% 0.21/0.42  SPASS allocated 63082 KBytes.
% 0.21/0.42  SPASS spent	0:00:00.06 on the problem.
% 0.21/0.42  		0:00:00.04 for the input.
% 0.21/0.42  		0:00:00.00 for the FLOTTER CNF translation.
% 0.21/0.42  		0:00:00.00 for inferences.
% 0.21/0.42  		0:00:00.00 for the backtracking.
% 0.21/0.42  		0:00:00.00 for the reduction.
% 0.21/0.42  
% 0.21/0.42  
% 0.21/0.42  Here is a proof with depth 2, length 13 :
% 0.21/0.42  % SZS output start Refutation
% See solution above
% 0.21/0.42  Formulae used in the proof : cls_Message_OinvKey_A_IinvKey_Ay_J_A_61_61_Ay_0 cls_conjecture_0 cls_conjecture_1
% 0.21/0.42  
%------------------------------------------------------------------------------