↑ Up

SPASS---3.9.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV322-1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n018.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:42:16 EDT 2022

% Result   : Unsatisfiable 0.69s 0.89s
% Output   : Refutation 0.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    7 (   6 unt;   1 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  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-1 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ~ c_in(c_Message_Omsg_OKey(v_KAB),c_Event_Oused(v_evs3),tc_Message_Omsg),
    file('SWV322-1.p',unknown),
    [] ).

cnf(4,axiom,
    ~ c_in(v_A,c_Event_Obad,tc_Message_Oagent),
    file('SWV322-1.p',unknown),
    [] ).

cnf(8,axiom,
    ( equal(c_Public_OshrK(v_A),v_KAB)
    | c_in(v_A,c_Event_Obad,tc_Message_Oagent) ),
    file('SWV322-1.p',unknown),
    [] ).

cnf(1474,axiom,
    c_in(c_Message_Omsg_OKey(c_Public_OshrK(u)),c_Event_Oused(v),tc_Message_Omsg),
    file('SWV322-1.p',unknown),
    [] ).

cnf(1480,plain,
    equal(c_Public_OshrK(v_A),v_KAB),
    inference(mrr,[status(thm)],[8,4]),
    [iquote('0:MRR:8.1,4.0')] ).

cnf(1592,plain,
    c_in(c_Message_Omsg_OKey(v_KAB),c_Event_Oused(u),tc_Message_Omsg),
    inference(spr,[status(thm),theory(equality)],[1480,1474]),
    [iquote('0:SpR:1480.0,1474.0')] ).

cnf(1593,plain,
    $false,
    inference(unc,[status(thm)],[1592,2]),
    [iquote('0:UnC:1592.0,2.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWV322-1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.11/0.33  % Computer : n018.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Tue Jun 14 22:08:14 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.69/0.89  
% 0.69/0.89  SPASS V 3.9 
% 0.69/0.89  SPASS beiseite: Proof found.
% 0.69/0.89  % SZS status Theorem
% 0.69/0.89  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.69/0.89  SPASS derived 62 clauses, backtracked 0 clauses, performed 0 splits and kept 1469 clauses.
% 0.69/0.89  SPASS allocated 78075 KBytes.
% 0.69/0.89  SPASS spent	0:00:00.53 on the problem.
% 0.69/0.89  		0:00:00.09 for the input.
% 0.69/0.89  		0:00:00.00 for the FLOTTER CNF translation.
% 0.69/0.89  		0:00:00.02 for inferences.
% 0.69/0.89  		0:00:00.00 for the backtracking.
% 0.69/0.89  		0:00:00.12 for the reduction.
% 0.69/0.89  
% 0.69/0.89  
% 0.69/0.89  Here is a proof with depth 1, length 7 :
% 0.69/0.89  % SZS output start Refutation
% See solution above
% 0.69/0.89  Formulae used in the proof : cls_conjecture_1 cls_conjecture_3 cls_conjecture_7 cls_Public_OshrK__in__used_0
% 0.69/0.89  
%------------------------------------------------------------------------------