TSTP Solution File: SWV273-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SWV273-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 : n008.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:38 EDT 2023
% Result : Unsatisfiable 0.21s 0.65s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV273-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Tue Aug 29 10:50:47 EDT 2023
% 0.13/0.36 % CPUTime :
% 0.21/0.59 start to proof:theBenchmark
% 0.21/0.64 %-------------------------------------------
% 0.21/0.64 % File :CSE---1.6
% 0.21/0.64 % Problem :theBenchmark
% 0.21/0.64 % Transform :cnf
% 0.21/0.64 % Format :tptp:raw
% 0.21/0.64 % Command :java -jar mcs_scs.jar %d %s
% 0.21/0.64
% 0.21/0.64 % Result :Theorem 0.000000s
% 0.21/0.64 % Output :CNFRefutation 0.000000s
% 0.21/0.64 %-------------------------------------------
% 0.21/0.65 %------------------------------------------------------------------------------
% 0.21/0.65 % File : SWV273-2 : TPTP v8.1.2. Released v3.2.0.
% 0.21/0.65 % Domain : Software Verification (Security)
% 0.21/0.65 % Problem : Cryptographic protocol problem for messages
% 0.21/0.65 % Version : [Pau06] axioms : Reduced > Especial.
% 0.21/0.65 % English :
% 0.21/0.65
% 0.21/0.65 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.21/0.65 % Source : [Pau06]
% 0.21/0.65 % Names :
% 0.21/0.65
% 0.21/0.65 % Status : Unsatisfiable
% 0.21/0.65 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.21/0.65 % Syntax : Number of clauses : 6 ( 3 unt; 0 nHn; 4 RR)
% 0.21/0.65 % Number of literals : 10 ( 0 equ; 5 neg)
% 0.21/0.65 % Maximal clause size : 3 ( 1 avg)
% 0.21/0.65 % Maximal term depth : 3 ( 1 avg)
% 0.21/0.65 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% 0.21/0.65 % Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% 0.21/0.65 % Number of variables : 11 ( 1 sgn)
% 0.21/0.65 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.21/0.65
% 0.21/0.65 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.21/0.65 % of which only a small selection are required for the refutation.
% 0.21/0.65 % The mission is to find those few axioms, after which a refutation
% 0.21/0.65 % can be quite easily found. This version has only the necessary
% 0.21/0.65 % axioms.
% 0.21/0.65 %------------------------------------------------------------------------------
% 0.21/0.65 cnf(cls_conjecture_0,negated_conjecture,
% 0.21/0.65 ~ c_lessequals(c_union(c_Message_Oparts(v_H),c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Oparts(c_Message_Osynth(v_H)),tc_set(tc_Message_Omsg)) ).
% 0.21/0.65
% 0.21/0.65 cnf(cls_Message_Oparts__mono_0,axiom,
% 0.21/0.65 ( ~ c_lessequals(V_G,V_H,tc_set(tc_Message_Omsg))
% 0.21/0.65 | c_lessequals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) ) ).
% 0.21/0.65
% 0.21/0.65 cnf(cls_Message_Oparts__subset__iff_0,axiom,
% 0.21/0.65 ( ~ c_lessequals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg))
% 0.21/0.65 | c_lessequals(V_G,c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) ) ).
% 0.21/0.65
% 0.21/0.65 cnf(cls_Message_Osynth__increasing_0,axiom,
% 0.21/0.65 c_lessequals(V_H,c_Message_Osynth(V_H),tc_set(tc_Message_Omsg)) ).
% 0.21/0.65
% 0.21/0.65 cnf(cls_Set_OUn__subset__iff_2,axiom,
% 0.21/0.65 ( ~ c_lessequals(V_B,V_C,tc_set(T_a))
% 0.21/0.65 | ~ c_lessequals(V_A,V_C,tc_set(T_a))
% 0.21/0.65 | c_lessequals(c_union(V_A,V_B,T_a),V_C,tc_set(T_a)) ) ).
% 0.21/0.65
% 0.21/0.65 cnf(cls_Set_Osubset__refl_0,axiom,
% 0.21/0.65 c_lessequals(V_A,V_A,tc_set(T_a)) ).
% 0.21/0.65
% 0.21/0.65 %------------------------------------------------------------------------------
% 0.21/0.65 %-------------------------------------------
% 0.21/0.65 % Proof found
% 0.21/0.65 % SZS status Theorem for theBenchmark
% 0.21/0.65 % SZS output start Proof
% 0.21/0.65 %ClaNum:6(EqnAxiom:0)
% 0.21/0.65 %VarNum:24(SingletonVarNum:11)
% 0.21/0.65 %MaxLitNum:3
% 0.21/0.65 %MaxfuncDepth:2
% 0.21/0.65 %SharedTerms:8
% 0.21/0.65 %goalClause: 3
% 0.21/0.65 %singleGoalClaCount:1
% 0.21/0.65 [3]~P1(f5(f3(a6),f2(a6),a4),f3(f2(a6)),f1(a4))
% 0.21/0.65 [2]P1(x21,f2(x21),f1(a4))
% 0.21/0.65 [1]P1(x11,x11,f1(x12))
% 0.21/0.65 [4]~P1(x41,x42,f1(a4))+P1(f3(x41),f3(x42),f1(a4))
% 0.21/0.65 [5]P1(x51,f3(x52),f1(a4))+~P1(f3(x51),f3(x52),f1(a4))
% 0.21/0.65 [6]~P1(x61,x64,f1(x63))+~P1(x62,x64,f1(x63))+P1(f5(x61,x62,x63),x64,f1(x63))
% 0.21/0.65 %EqnAxiom
% 0.21/0.65
% 0.21/0.65 %-------------------------------------------
% 0.21/0.66 cnf(7,plain,
% 0.21/0.66 (P1(f3(x71),f3(f2(x71)),f1(a4))),
% 0.21/0.66 inference(scs_inference,[],[2,4])).
% 0.21/0.66 cnf(8,plain,
% 0.21/0.66 (P1(x81,f3(x81),f1(a4))),
% 0.21/0.66 inference(scs_inference,[],[1,2,4,5])).
% 0.21/0.66 cnf(16,plain,
% 0.21/0.66 ($false),
% 0.21/0.66 inference(scs_inference,[],[7,8,3,6]),
% 0.21/0.66 ['proof']).
% 0.21/0.66 % SZS output end Proof
% 0.21/0.66 % Total time :0.000000s
%------------------------------------------------------------------------------