TSTP Solution File: SWV267-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SWV267-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 : n026.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:35 EDT 2023
% Result : Unsatisfiable 0.20s 0.63s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV267-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n026.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 06:48:20 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof:theBenchmark
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % File :CSE---1.6
% 0.20/0.63 % Problem :theBenchmark
% 0.20/0.63 % Transform :cnf
% 0.20/0.63 % Format :tptp:raw
% 0.20/0.63 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.63
% 0.20/0.63 % Result :Theorem 0.000000s
% 0.20/0.63 % Output :CNFRefutation 0.000000s
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 %------------------------------------------------------------------------------
% 0.20/0.63 % File : SWV267-2 : TPTP v8.1.2. Released v3.2.0.
% 0.20/0.63 % Domain : Software Verification (Security)
% 0.20/0.63 % Problem : Cryptographic protocol problem for messages
% 0.20/0.63 % Version : [Pau06] axioms : Reduced > Especial.
% 0.20/0.63 % English :
% 0.20/0.63
% 0.20/0.63 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.20/0.63 % Source : [Pau06]
% 0.20/0.63 % Names :
% 0.20/0.63
% 0.20/0.63 % Status : Unsatisfiable
% 0.20/0.63 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0
% 0.20/0.63 % Syntax : Number of clauses : 4 ( 3 unt; 0 nHn; 3 RR)
% 0.20/0.63 % Number of literals : 6 ( 0 equ; 3 neg)
% 0.20/0.63 % Maximal clause size : 3 ( 1 avg)
% 0.20/0.63 % Maximal term depth : 2 ( 1 avg)
% 0.20/0.63 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty)
% 0.20/0.63 % Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% 0.20/0.63 % Number of variables : 5 ( 0 sgn)
% 0.20/0.63 % SPC : CNF_UNS_RFO_NEQ_HRN
% 0.20/0.63
% 0.20/0.63 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.20/0.63 % of which only a small selection are required for the refutation.
% 0.20/0.63 % The mission is to find those few axioms, after which a refutation
% 0.20/0.63 % can be quite easily found. This version has only the necessary
% 0.20/0.63 % axioms.
% 0.20/0.63 %------------------------------------------------------------------------------
% 0.20/0.63 cnf(cls_conjecture_0,negated_conjecture,
% 0.20/0.63 c_lessequals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)) ).
% 0.20/0.63
% 0.20/0.63 cnf(cls_conjecture_1,negated_conjecture,
% 0.20/0.63 ~ c_lessequals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)) ).
% 0.20/0.63
% 0.20/0.63 cnf(cls_Message_Oparts__increasing_0,axiom,
% 0.20/0.63 c_lessequals(V_H,c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)) ).
% 0.20/0.63
% 0.20/0.63 cnf(cls_Set_Osubset__trans_0,axiom,
% 0.20/0.63 ( ~ c_lessequals(V_B,V_C,tc_set(T_a))
% 0.20/0.63 | ~ c_lessequals(V_A,V_B,tc_set(T_a))
% 0.20/0.63 | c_lessequals(V_A,V_C,tc_set(T_a)) ) ).
% 0.20/0.63
% 0.20/0.63 %------------------------------------------------------------------------------
% 0.20/0.63 %-------------------------------------------
% 0.20/0.63 % Proof found
% 0.20/0.63 % SZS status Theorem for theBenchmark
% 0.20/0.63 % SZS output start Proof
% 0.20/0.63 %ClaNum:4(EqnAxiom:0)
% 0.20/0.63 %VarNum:11(SingletonVarNum:5)
% 0.20/0.63 %MaxLitNum:3
% 0.20/0.63 %MaxfuncDepth:1
% 0.20/0.63 %SharedTerms:8
% 0.20/0.63 %goalClause: 2 3
% 0.20/0.63 %singleGoalClaCount:2
% 0.20/0.63 [2]P1(f1(a4),f1(a5),f3(a2))
% 0.20/0.63 [3]~P1(a4,f1(a5),f3(a2))
% 0.20/0.63 [1]P1(x11,f1(x11),f3(a2))
% 0.20/0.63 [4]P1(x41,x42,f3(x43))+~P1(x44,x42,f3(x43))+~P1(x41,x44,f3(x43))
% 0.20/0.63 %EqnAxiom
% 0.20/0.63
% 0.20/0.63 %-------------------------------------------
% 0.20/0.64 cnf(5,plain,
% 0.20/0.64 ($false),
% 0.20/0.64 inference(scs_inference,[],[3,2,1,4]),
% 0.20/0.64 ['proof']).
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time :0.000000s
%------------------------------------------------------------------------------