TSTP Solution File: SWV253-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SWV253-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 : n032.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:28 EDT 2023
% Result : Unsatisfiable 0.13s 0.52s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWV253-2 : TPTP v8.1.2. Released v3.2.0.
% 0.05/0.10 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Tue Aug 29 08:30:31 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.13/0.48 start to proof:theBenchmark
% 0.13/0.51 %-------------------------------------------
% 0.13/0.51 % File :CSE---1.6
% 0.13/0.51 % Problem :theBenchmark
% 0.13/0.51 % Transform :cnf
% 0.13/0.51 % Format :tptp:raw
% 0.13/0.51 % Command :java -jar mcs_scs.jar %d %s
% 0.13/0.51
% 0.13/0.51 % Result :Theorem 0.000000s
% 0.13/0.51 % Output :CNFRefutation 0.000000s
% 0.13/0.51 %-------------------------------------------
% 0.13/0.52 %------------------------------------------------------------------------------
% 0.13/0.52 % File : SWV253-2 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.52 % Domain : Software Verification (Security)
% 0.13/0.52 % Problem : Cryptographic protocol problem for messages
% 0.13/0.52 % Version : [Pau06] axioms : Reduced > Especial.
% 0.13/0.52 % English :
% 0.13/0.52
% 0.13/0.52 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.13/0.52 % Source : [Pau06]
% 0.13/0.52 % Names :
% 0.13/0.52
% 0.13/0.52 % Status : Unsatisfiable
% 0.13/0.52 % Rating : 0.06 v8.1.0, 0.11 v7.5.0, 0.06 v7.4.0, 0.00 v7.3.0, 0.08 v7.2.0, 0.00 v6.3.0, 0.10 v6.2.0, 0.20 v6.1.0, 0.09 v6.0.0, 0.00 v5.3.0, 0.10 v5.2.0, 0.00 v3.7.0, 0.14 v3.4.0, 0.17 v3.3.0, 0.11 v3.2.0
% 0.13/0.52 % Syntax : Number of clauses : 3 ( 1 unt; 1 nHn; 2 RR)
% 0.13/0.52 % Number of literals : 5 ( 5 equ; 2 neg)
% 0.13/0.52 % Maximal clause size : 2 ( 1 avg)
% 0.13/0.52 % Maximal term depth : 3 ( 1 avg)
% 0.13/0.52 % Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty)
% 0.13/0.52 % Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% 0.13/0.52 % Number of variables : 1 ( 0 sgn)
% 0.13/0.52 % SPC : CNF_UNS_RFO_PEQ_NUE
% 0.13/0.52
% 0.13/0.52 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.13/0.52 % of which only a small selection are required for the refutation.
% 0.13/0.52 % The mission is to find those few axioms, after which a refutation
% 0.13/0.52 % can be quite easily found. This version has only the necessary
% 0.13/0.52 % axioms.
% 0.13/0.52 %------------------------------------------------------------------------------
% 0.13/0.52 cnf(cls_conjecture_0,negated_conjecture,
% 0.13/0.52 ( v_K != v_K_H
% 0.13/0.52 | c_Message_OinvKey(v_K) != c_Message_OinvKey(v_K_H) ) ).
% 0.13/0.52
% 0.13/0.52 cnf(cls_conjecture_1,negated_conjecture,
% 0.13/0.52 ( c_Message_OinvKey(v_K) = c_Message_OinvKey(v_K_H)
% 0.13/0.52 | v_K = v_K_H ) ).
% 0.13/0.52
% 0.13/0.52 cnf(cls_Message_OinvKey_A_IinvKey_Ay_J_A_61_61_Ay_0,axiom,
% 0.13/0.52 c_Message_OinvKey(c_Message_OinvKey(V_y)) = V_y ).
% 0.13/0.52
% 0.13/0.52 %------------------------------------------------------------------------------
% 0.13/0.52 %-------------------------------------------
% 0.13/0.52 % Proof found
% 0.13/0.52 % SZS status Theorem for theBenchmark
% 0.13/0.52 % SZS output start Proof
% 0.13/0.52 %ClaNum:7(EqnAxiom:4)
% 0.13/0.52 %VarNum:2(SingletonVarNum:1)
% 0.13/0.52 %MaxLitNum:2
% 0.13/0.52 %MaxfuncDepth:2
% 0.13/0.52 %SharedTerms:8
% 0.13/0.52 %goalClause: 6 7
% 0.13/0.52 [5]E(f1(f1(x51)),x51)
% 0.13/0.52 [6]E(a2,a3)+E(f1(a2),f1(a3))
% 0.13/0.52 [7]~E(a2,a3)+~E(f1(a2),f1(a3))
% 0.13/0.52 %EqnAxiom
% 0.13/0.52 [1]E(x11,x11)
% 0.13/0.52 [2]E(x22,x21)+~E(x21,x22)
% 0.13/0.52 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.13/0.52 [4]~E(x41,x42)+E(f1(x41),f1(x42))
% 0.13/0.52
% 0.13/0.52 %-------------------------------------------
% 0.13/0.52 cnf(8,plain,
% 0.13/0.52 (E(x81,f1(f1(x81)))),
% 0.13/0.52 inference(scs_inference,[],[5,2])).
% 0.13/0.52 cnf(9,plain,
% 0.13/0.52 (E(f1(a2),f1(a3))),
% 0.13/0.52 inference(scs_inference,[],[4,6])).
% 0.13/0.52 cnf(10,plain,
% 0.13/0.52 (~E(a2,a3)),
% 0.13/0.52 inference(scs_inference,[],[9,7])).
% 0.13/0.52 cnf(11,plain,
% 0.13/0.52 (E(f1(f1(a2)),f1(f1(a3)))),
% 0.13/0.52 inference(scs_inference,[],[9,4])).
% 0.13/0.52 cnf(14,plain,
% 0.13/0.52 (~E(f1(f1(a3)),a2)),
% 0.13/0.52 inference(scs_inference,[],[10,8,2,3])).
% 0.13/0.52 cnf(16,plain,
% 0.13/0.52 (~E(f1(f1(a3)),f1(f1(a2)))),
% 0.13/0.52 inference(scs_inference,[],[5,14,2,3])).
% 0.13/0.52 cnf(20,plain,
% 0.13/0.52 ($false),
% 0.13/0.52 inference(scs_inference,[],[11,16,2]),
% 0.13/0.52 ['proof']).
% 0.13/0.52 % SZS output end Proof
% 0.13/0.52 % Total time :0.000000s
%------------------------------------------------------------------------------