TSTP Solution File: SWV277-2 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : SWV277-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d

% Computer : n016.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  : 300s
% DateTime : Thu Aug 31 21:32:39 EDT 2023

% Result   : Unsatisfiable 0.52s 0.60s
% Output   : CNFRefutation 0.52s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : SWV277-2 : TPTP v8.1.2. Released v3.2.0.
% 0.03/0.12  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.12/0.33  % Computer : n016.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Tue Aug 29 05:07:30 EDT 2023
% 0.12/0.33  % CPUTime    : 
% 0.51/0.55  start to proof:theBenchmark
% 0.52/0.60  %-------------------------------------------
% 0.52/0.60  % File        :CSE---1.6
% 0.52/0.60  % Problem     :theBenchmark
% 0.52/0.60  % Transform   :cnf
% 0.52/0.60  % Format      :tptp:raw
% 0.52/0.60  % Command     :java -jar mcs_scs.jar %d %s
% 0.52/0.60  
% 0.52/0.60  % Result      :Theorem 0.000000s
% 0.52/0.60  % Output      :CNFRefutation 0.000000s
% 0.52/0.60  %-------------------------------------------
% 0.52/0.60  %------------------------------------------------------------------------------
% 0.52/0.60  % File     : SWV277-2 : TPTP v8.1.2. Released v3.2.0.
% 0.52/0.60  % Domain   : Software Verification (Security)
% 0.52/0.60  % Problem  : Cryptographic protocol problem for events
% 0.52/0.60  % Version  : [Pau06] axioms : Reduced > Especial.
% 0.52/0.60  % English  :
% 0.52/0.60  
% 0.52/0.60  % Refs     : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.52/0.60  % Source   : [Pau06]
% 0.52/0.60  % Names    :
% 0.52/0.60  
% 0.52/0.60  % Status   : Unsatisfiable
% 0.52/0.60  % Rating   : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.52/0.60  % Syntax   : Number of clauses     :    5 (   3 unt;   0 nHn;   4 RR)
% 0.52/0.60  %            Number of literals    :    8 (   0 equ;   4 neg)
% 0.52/0.60  %            Maximal clause size   :    3 (   1 avg)
% 0.52/0.60  %            Maximal term depth    :    3 (   1 avg)
% 0.52/0.60  %            Number of predicates  :    2 (   2 usr;   0 prp; 3-3 aty)
% 0.52/0.60  %            Number of functors    :    8 (   8 usr;   4 con; 0-1 aty)
% 0.52/0.60  %            Number of variables   :    7 (   0 sgn)
% 0.52/0.60  % SPC      : CNF_UNS_RFO_NEQ_HRN
% 0.52/0.60  
% 0.52/0.60  % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.52/0.60  %            of which only a small selection are required for the refutation.
% 0.52/0.60  %            The mission is to find those few axioms, after which a refutation
% 0.52/0.60  %            can be quite easily found. This version has only the necessary
% 0.52/0.60  %            axioms.
% 0.52/0.60  %------------------------------------------------------------------------------
% 0.52/0.60  cnf(cls_Message_Oanalz__subset__parts_0,axiom,
% 0.52/0.60      c_lessequals(c_Message_Oanalz(V_H),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) ).
% 0.52/0.60  
% 0.52/0.60  cnf(cls_Message_OkeysFor__mono_0,axiom,
% 0.52/0.60      ( ~ c_lessequals(V_G,V_H,tc_set(tc_Message_Omsg))
% 0.52/0.60      | c_lessequals(c_Message_OkeysFor(V_G),c_Message_OkeysFor(V_H),tc_set(tc_nat)) ) ).
% 0.52/0.60  
% 0.52/0.60  cnf(cls_Set_OsubsetD_0,axiom,
% 0.52/0.60      ( ~ c_in(V_c,V_A,T_a)
% 0.52/0.60      | ~ c_lessequals(V_A,V_B,tc_set(T_a))
% 0.52/0.60      | c_in(V_c,V_B,T_a) ) ).
% 0.52/0.60  
% 0.52/0.60  cnf(cls_conjecture_2,negated_conjecture,
% 0.52/0.60      ~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat) ).
% 0.52/0.60  
% 0.52/0.60  cnf(cls_conjecture_3,negated_conjecture,
% 0.52/0.60      c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat) ).
% 0.52/0.60  
% 0.52/0.60  %------------------------------------------------------------------------------
% 0.52/0.60  %-------------------------------------------
% 0.52/0.60  % Proof found
% 0.52/0.60  % SZS status Theorem for theBenchmark
% 0.52/0.60  % SZS output start Proof
% 0.52/0.60  %ClaNum:5(EqnAxiom:0)
% 0.52/0.60  %VarNum:15(SingletonVarNum:7)
% 0.52/0.60  %MaxLitNum:3
% 0.52/0.60  %MaxfuncDepth:2
% 0.52/0.60  %SharedTerms:12
% 0.52/0.60  %goalClause: 1 3
% 0.52/0.60  %singleGoalClaCount:2
% 0.52/0.60  [1]P1(a1,f4(f3(a2)),a5)
% 0.52/0.60  [3]~P1(a1,f4(f6(a2)),a5)
% 0.52/0.60  [2]P2(f3(x21),f6(x21),f8(a7))
% 0.52/0.60  [4]~P2(x41,x42,f8(a7))+P2(f4(x41),f4(x42),f8(a5))
% 0.52/0.60  [5]P1(x51,x52,x53)+~P1(x51,x54,x53)+~P2(x54,x52,f8(x53))
% 0.52/0.60  %EqnAxiom
% 0.52/0.60  
% 0.52/0.60  %-------------------------------------------
% 0.52/0.60  cnf(7,plain,
% 0.52/0.60     ($false),
% 0.52/0.60     inference(scs_inference,[],[1,3,2,4,5]),
% 0.52/0.60     ['proof']).
% 0.52/0.60  % SZS output end Proof
% 0.52/0.60  % Total time :0.000000s
%------------------------------------------------------------------------------