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