↑ Up

CSE---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : SWV341-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n029.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 : Mon Jun 24 16:46:50 EDT 2024

% Result   : Unsatisfiable 0.54s 0.59s
% Output   : CNFRefutation 0.54s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWV341-2 : TPTP v8.2.0. Released v3.2.0.
% 0.00/0.12  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33  % Computer : n029.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   : Thu Jun 20 21:24:09 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.20/0.56  start to proof:theBenchmark
% 0.54/0.59  %-------------------------------------------
% 0.54/0.59  % File        :CSE---1.7
% 0.54/0.59  % Problem     :theBenchmark
% 0.54/0.59  % Transform   :cnf
% 0.54/0.59  % Format      :tptp:raw
% 0.54/0.59  % Command     :java -jar mcs_scs.jar %d %s
% 0.54/0.59  
% 0.54/0.59  % Result      :Theorem 0.000000s
% 0.54/0.59  % Output      :CNFRefutation 0.000000s
% 0.54/0.59  %-------------------------------------------
% 0.54/0.59  %------------------------------------------------------------------------------
% 0.54/0.59  % File     : SWV341-2 : TPTP v8.2.0. Released v3.2.0.
% 0.54/0.59  % Domain   : Software Verification (Security)
% 0.54/0.59  % Problem  : Cryptographic protocol problem for Yahalom
% 0.54/0.59  % Version  : [Pau06] axioms : Reduced > Especial.
% 0.54/0.59  % English  :
% 0.54/0.59  
% 0.54/0.59  % Refs     : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.54/0.59  % Source   : [Pau06]
% 0.54/0.59  % Names    :
% 0.54/0.59  
% 0.54/0.59  % Status   : Unsatisfiable
% 0.54/0.59  % Rating   : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.54/0.59  % Syntax   : Number of clauses     :    4 (   2 unt;   0 nHn;   4 RR)
% 0.54/0.59  %            Number of literals    :    6 (   0 equ;   3 neg)
% 0.54/0.59  %            Maximal clause size   :    2 (   1 avg)
% 0.54/0.59  %            Maximal term depth    :    3 (   1 avg)
% 0.54/0.59  %            Number of predicates  :    1 (   1 usr;   0 prp; 3-3 aty)
% 0.54/0.59  %            Number of functors    :    9 (   9 usr;   4 con; 0-2 aty)
% 0.54/0.59  %            Number of variables   :    4 (   0 sgn)
% 0.54/0.59  % SPC      : CNF_UNS_RFO_NEQ_HRN
% 0.54/0.59  
% 0.54/0.59  % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.54/0.59  %            of which only a small selection are required for the refutation.
% 0.54/0.59  %            The mission is to find those few axioms, after which a refutation
% 0.54/0.59  %            can be quite easily found. This version has only the necessary
% 0.54/0.59  %            axioms.
% 0.54/0.59  %------------------------------------------------------------------------------
% 0.54/0.59  cnf(cls_conjecture_1,negated_conjecture,
% 0.54/0.59      ~ c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(v_evs3),tc_Message_Omsg) ).
% 0.54/0.59  
% 0.54/0.59  cnf(cls_conjecture_8,negated_conjecture,
% 0.54/0.59      c_in(c_Message_Omsg_OKey(v_K),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs3)),tc_Message_Omsg) ).
% 0.54/0.59  
% 0.54/0.59  cnf(cls_Event_Oc_A_58_Aparts_A_Iknows_ASpy_Aevs1_J_A_61_61_62_Ac_A_58_Aused_Aevs1_0,axiom,
% 0.54/0.59      ( ~ c_in(V_c,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,V_evs)),tc_Message_Omsg)
% 0.54/0.59      | c_in(V_c,c_Event_Oused(V_evs),tc_Message_Omsg) ) ).
% 0.54/0.59  
% 0.54/0.59  cnf(cls_Message_Oanalz__conj__parts_0,axiom,
% 0.54/0.59      ( ~ c_in(V_X,c_Message_Oanalz(V_H),tc_Message_Omsg)
% 0.54/0.59      | c_in(V_X,c_Message_Oparts(V_H),tc_Message_Omsg) ) ).
% 0.54/0.59  
% 0.54/0.59  %------------------------------------------------------------------------------
% 0.54/0.59  %-------------------------------------------
% 0.54/0.59  % Proof found
% 0.54/0.59  % SZS status Theorem for theBenchmark
% 0.54/0.59  % SZS output start Proof
% 0.54/0.60  %ClaNum:4(EqnAxiom:0)
% 0.54/0.60  %VarNum:8(SingletonVarNum:4)
% 0.54/0.60  %MaxLitNum:2
% 0.54/0.60  %MaxfuncDepth:2
% 0.54/0.60  %SharedTerms:10
% 0.54/0.60  %goalClause: 1 2
% 0.54/0.60  %singleGoalClaCount:2
% 0.54/0.60  [2]~P1(f2(a1),f5(a9),a7)
% 0.54/0.60  [1]P1(f2(a1),f6(f4(a3,a9)),a7)
% 0.54/0.60  [3]~P1(x31,f6(x32),a7)+P1(x31,f8(x32),a7)
% 0.54/0.60  [4]P1(x41,f5(x42),a7)+~P1(x41,f8(f4(a3,x42)),a7)
% 0.54/0.60  %EqnAxiom
% 0.54/0.60  
% 0.54/0.60  %-------------------------------------------
% 0.54/0.60  cnf(5,plain,
% 0.54/0.60     ($false),
% 0.54/0.60     inference(scs_inference,[],[1,2,3,4]),
% 0.54/0.60     ['proof']).
% 0.54/0.60  % SZS output end Proof
% 0.54/0.60  % Total time :0.000000s
%------------------------------------------------------------------------------