TSTP Solution File: SWV356-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SWV356-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n010.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:33:14 EDT 2023
% Result : Unsatisfiable 0.20s 0.68s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV356-2 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 05:15:19 EDT 2023
% 0.19/0.35 % CPUTime :
% 0.20/0.61 start to proof:theBenchmark
% 0.20/0.67 %-------------------------------------------
% 0.20/0.67 % File :CSE---1.6
% 0.20/0.67 % Problem :theBenchmark
% 0.20/0.67 % Transform :cnf
% 0.20/0.67 % Format :tptp:raw
% 0.20/0.67 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.67
% 0.20/0.67 % Result :Theorem 0.000000s
% 0.20/0.67 % Output :CNFRefutation 0.000000s
% 0.20/0.67 %-------------------------------------------
% 0.20/0.68 %------------------------------------------------------------------------------
% 0.20/0.68 % File : SWV356-2 : TPTP v8.1.2. Released v3.2.0.
% 0.20/0.68 % Domain : Software Verification (Security)
% 0.20/0.68 % Problem : Cryptographic protocol problem for Yahalom
% 0.20/0.68 % Version : [Pau06] axioms : Reduced > Especial.
% 0.20/0.68 % English :
% 0.20/0.68
% 0.20/0.68 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.20/0.68 % Source : [Pau06]
% 0.20/0.68 % Names :
% 0.20/0.68
% 0.20/0.68 % Status : Unsatisfiable
% 0.20/0.68 % Rating : 0.00 v5.3.0, 0.05 v5.2.0, 0.00 v3.2.0
% 0.20/0.68 % Syntax : Number of clauses : 4 ( 2 unt; 0 nHn; 4 RR)
% 0.20/0.68 % Number of literals : 6 ( 0 equ; 3 neg)
% 0.20/0.68 % Maximal clause size : 2 ( 1 avg)
% 0.20/0.68 % Maximal term depth : 3 ( 1 avg)
% 0.20/0.68 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% 0.20/0.68 % Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% 0.20/0.68 % Number of variables : 4 ( 0 sgn)
% 0.20/0.68 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.68
% 0.20/0.68 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.20/0.68 % of which only a small selection are required for the refutation.
% 0.20/0.68 % The mission is to find those few axioms, after which a refutation
% 0.20/0.68 % can be quite easily found. This version has only the necessary
% 0.20/0.68 % axioms.
% 0.20/0.68 %------------------------------------------------------------------------------
% 0.20/0.68 cnf(cls_conjecture_3,negated_conjecture,
% 0.20/0.68 ~ c_in(c_Message_Omsg_ONonce(v_NB),c_Event_Oused(v_evs2),tc_Message_Omsg) ).
% 0.20/0.68
% 0.20/0.68 cnf(cls_conjecture_7,negated_conjecture,
% 0.20/0.68 c_in(c_Message_Omsg_ONonce(v_NB),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg) ).
% 0.20/0.68
% 0.20/0.68 cnf(cls_Event_Oc_A_58_Aparts_A_Iknows_ASpy_Aevs1_J_A_61_61_62_Ac_A_58_Aused_Aevs1_0,axiom,
% 0.20/0.68 ( ~ c_in(V_c,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,V_evs)),tc_Message_Omsg)
% 0.20/0.68 | c_in(V_c,c_Event_Oused(V_evs),tc_Message_Omsg) ) ).
% 0.20/0.68
% 0.20/0.68 cnf(cls_Message_Oanalz__conj__parts_0,axiom,
% 0.20/0.68 ( ~ c_in(V_X,c_Message_Oanalz(V_H),tc_Message_Omsg)
% 0.20/0.68 | c_in(V_X,c_Message_Oparts(V_H),tc_Message_Omsg) ) ).
% 0.20/0.68
% 0.20/0.68 %------------------------------------------------------------------------------
% 0.20/0.68 %-------------------------------------------
% 0.20/0.68 % Proof found
% 0.20/0.68 % SZS status Theorem for theBenchmark
% 0.20/0.68 % SZS output start Proof
% 0.20/0.68 %ClaNum:4(EqnAxiom:0)
% 0.20/0.68 %VarNum:8(SingletonVarNum:4)
% 0.20/0.68 %MaxLitNum:2
% 0.20/0.68 %MaxfuncDepth:2
% 0.20/0.68 %SharedTerms:10
% 0.20/0.68 %goalClause: 1 2
% 0.20/0.68 %singleGoalClaCount:2
% 0.20/0.68 [2]~P1(f2(a1),f5(a9),a7)
% 0.20/0.68 [1]P1(f2(a1),f6(f4(a3,a9)),a7)
% 0.20/0.68 [3]~P1(x31,f6(x32),a7)+P1(x31,f8(x32),a7)
% 0.20/0.68 [4]P1(x41,f5(x42),a7)+~P1(x41,f8(f4(a3,x42)),a7)
% 0.20/0.68 %EqnAxiom
% 0.20/0.68
% 0.20/0.68 %-------------------------------------------
% 0.20/0.69 cnf(6,plain,
% 0.20/0.69 ($false),
% 0.20/0.69 inference(scs_inference,[],[1,2,4,3]),
% 0.20/0.69 ['proof']).
% 0.20/0.69 % SZS output end Proof
% 0.20/0.69 % Total time :0.000000s
%------------------------------------------------------------------------------