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

View Problem - Process Solution

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

% Computer : n013.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:49 EDT 2022

% Result   : Unsatisfiable 1.54s 1.71s
% Output   : Refutation 1.54s
% 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(11,axiom,
    equal(c_Message_OinvKey(c_Message_OinvKey(u)),u),
    file('SWV253-1.p',unknown),
    [] ).

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

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

cnf(3224,plain,
    equal(v_K_H,v_K),
    inference(spt,[spt(split,[position(s1)])],[31]),
    [iquote('1:Spt:31.0')] ).

cnf(3225,plain,
    ( ~ equal(v_K_H,v_K)
    | ~ equal(c_Message_OinvKey(v_K),c_Message_OinvKey(v_K)) ),
    inference(rew,[status(thm),theory(equality)],[3224,30]),
    [iquote('1:Rew:3224.0,30.1')] ).

cnf(3226,plain,
    ~ equal(v_K_H,v_K),
    inference(obv,[status(thm),theory(equality)],[3225]),
    [iquote('1:Obv:3225.1')] ).

cnf(3227,plain,
    ~ equal(v_K,v_K),
    inference(rew,[status(thm),theory(equality)],[3224,3226]),
    [iquote('1:Rew:3224.0,3226.0')] ).

cnf(3228,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[3227]),
    [iquote('1:Obv:3227.0')] ).

cnf(3229,plain,
    ~ equal(v_K_H,v_K),
    inference(spt,[spt(split,[position(sa)])],[3228,3224]),
    [iquote('1:Spt:3228.0,31.0,3224.0')] ).

cnf(3230,plain,
    equal(c_Message_OinvKey(v_K_H),c_Message_OinvKey(v_K)),
    inference(spt,[spt(split,[position(s2)])],[31]),
    [iquote('1:Spt:3228.0,31.1')] ).

cnf(3231,plain,
    equal(c_Message_OinvKey(c_Message_OinvKey(v_K)),v_K_H),
    inference(spr,[status(thm),theory(equality)],[3230,11]),
    [iquote('1:SpR:3230.0,11.0')] ).

cnf(3233,plain,
    equal(v_K_H,v_K),
    inference(rew,[status(thm),theory(equality)],[11,3231]),
    [iquote('1:Rew:11.0,3231.0')] ).

cnf(3234,plain,
    $false,
    inference(mrr,[status(thm)],[3233,3229]),
    [iquote('1:MRR:3233.0,3229.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SWV253-1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n013.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Thu Jun 16 06:01:14 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 1.54/1.71  
% 1.54/1.71  SPASS V 3.9 
% 1.54/1.71  SPASS beiseite: Proof found.
% 1.54/1.71  % SZS status Theorem
% 1.54/1.71  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 1.54/1.71  SPASS derived 293 clauses, backtracked 3 clauses, performed 2 splits and kept 2645 clauses.
% 1.54/1.71  SPASS allocated 80314 KBytes.
% 1.54/1.71  SPASS spent	0:00:01.31 on the problem.
% 1.54/1.71  		0:00:00.21 for the input.
% 1.54/1.71  		0:00:00.00 for the FLOTTER CNF translation.
% 1.54/1.71  		0:00:00.03 for inferences.
% 1.54/1.71  		0:00:00.00 for the backtracking.
% 1.54/1.71  		0:00:00.62 for the reduction.
% 1.54/1.71  
% 1.54/1.71  
% 1.54/1.71  Here is a proof with depth 2, length 13 :
% 1.54/1.71  % SZS output start Refutation
% See solution above
% 1.54/1.71  Formulae used in the proof : cls_Message_OinvKey_A_IinvKey_Ay_J_A_61_61_Ay_0 cls_conjecture_0 cls_conjecture_1
% 1.54/1.71  
%------------------------------------------------------------------------------