TSTP Solution File: SWV258-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SWV258-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 : n014.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:31 EDT 2023
% Result : Unsatisfiable 0.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV258-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n014.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 03:19:15 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.56 start to proof:theBenchmark
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % File :CSE---1.6
% 0.20/0.61 % Problem :theBenchmark
% 0.20/0.61 % Transform :cnf
% 0.20/0.61 % Format :tptp:raw
% 0.20/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.61
% 0.20/0.61 % Result :Theorem 0.000000s
% 0.20/0.61 % Output :CNFRefutation 0.000000s
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 %------------------------------------------------------------------------------
% 0.20/0.61 % File : SWV258-2 : TPTP v8.1.2. Released v3.2.0.
% 0.20/0.62 % Domain : Software Verification (Security)
% 0.20/0.62 % Problem : Cryptographic protocol problem for messages
% 0.20/0.62 % Version : [Pau06] axioms : Reduced > Especial.
% 0.20/0.62 % English :
% 0.20/0.62
% 0.20/0.62 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.20/0.62 % Source : [Pau06]
% 0.20/0.62 % Names :
% 0.20/0.62
% 0.20/0.62 % Status : Unsatisfiable
% 0.20/0.62 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.20/0.62 % Syntax : Number of clauses : 6 ( 3 unt; 0 nHn; 5 RR)
% 0.20/0.62 % Number of literals : 10 ( 0 equ; 5 neg)
% 0.20/0.62 % Maximal clause size : 3 ( 1 avg)
% 0.20/0.62 % Maximal term depth : 3 ( 1 avg)
% 0.20/0.62 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty)
% 0.20/0.62 % Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% 0.20/0.62 % Number of variables : 10 ( 1 sgn)
% 0.20/0.62 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.62
% 0.20/0.62 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.20/0.62 % of which only a small selection are required for the refutation.
% 0.20/0.62 % The mission is to find those few axioms, after which a refutation
% 0.20/0.62 % can be quite easily found. This version has only the necessary
% 0.20/0.62 % axioms.
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 cnf(cls_conjecture_0,negated_conjecture,
% 0.20/0.62 c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_conjecture_1,negated_conjecture,
% 0.20/0.62 ~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_Message_Oparts__subset__iff_0,axiom,
% 0.20/0.62 ( ~ c_lessequals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg))
% 0.20/0.62 | c_lessequals(V_G,c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_Message_Oparts__subset__iff_1,axiom,
% 0.20/0.62 ( ~ c_lessequals(V_G,c_Message_Oparts(V_H),tc_set(tc_Message_Omsg))
% 0.20/0.62 | c_lessequals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_Set_Oinsert__subset_2,axiom,
% 0.20/0.62 ( ~ c_in(V_x,V_B,T_a)
% 0.20/0.62 | ~ c_lessequals(V_A,V_B,tc_set(T_a))
% 0.20/0.62 | c_lessequals(c_insert(V_x,V_A,T_a),V_B,tc_set(T_a)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_Set_Osubset__refl_0,axiom,
% 0.20/0.62 c_lessequals(V_A,V_A,tc_set(T_a)) ).
% 0.20/0.62
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % Proof found
% 0.20/0.62 % SZS status Theorem for theBenchmark
% 0.20/0.62 % SZS output start Proof
% 0.20/0.62 %ClaNum:6(EqnAxiom:0)
% 0.20/0.62 %VarNum:22(SingletonVarNum:10)
% 0.20/0.62 %MaxLitNum:3
% 0.20/0.62 %MaxfuncDepth:2
% 0.20/0.62 %SharedTerms:9
% 0.20/0.62 %goalClause: 1 3
% 0.20/0.62 %singleGoalClaCount:2
% 0.20/0.62 [1]P1(a1,f3(a2),a4)
% 0.20/0.62 [3]~P2(f3(f5(a1,a2,a4)),f3(a2),f6(a4))
% 0.20/0.62 [2]P2(x21,x21,f6(x22))
% 0.20/0.62 [4]P2(f3(x41),f3(x42),f6(a4))+~P2(x41,f3(x42),f6(a4))
% 0.20/0.62 [5]P2(x51,f3(x52),f6(a4))+~P2(f3(x51),f3(x52),f6(a4))
% 0.20/0.62 [6]~P1(x61,x64,x63)+~P2(x62,x64,f6(x63))+P2(f5(x61,x62,x63),x64,f6(x63))
% 0.20/0.62 %EqnAxiom
% 0.20/0.62
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 cnf(9,plain,
% 0.20/0.62 ($false),
% 0.20/0.62 inference(scs_inference,[],[1,3,2,4,6,5]),
% 0.20/0.62 ['proof']).
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------