TSTP Solution File: SWV280-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SWV280-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 : n018.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:40 EDT 2023
% Result : Unsatisfiable 0.20s 0.64s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV280-2 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 08:28:48 EDT 2023
% 0.14/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 : SWV280-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 public
% 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 : 3 ( 2 unt; 0 nHn; 1 RR)
% 0.20/0.63 % Number of literals : 4 ( 0 equ; 2 neg)
% 0.20/0.63 % Maximal clause size : 2 ( 1 avg)
% 0.20/0.63 % Maximal term depth : 2 ( 1 avg)
% 0.20/0.63 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty)
% 0.20/0.63 % Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% 0.20/0.63 % Number of variables : 5 ( 2 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_in(c_Message_Omsg_ONonce(V_U),c_Event_Oused(v_evs),tc_Message_Omsg) ).
% 0.20/0.63
% 0.20/0.63 cnf(cls_Nat_Ole__add1_0,axiom,
% 0.20/0.63 c_lessequals(V_n,c_plus(V_n,V_m,tc_nat),tc_nat) ).
% 0.20/0.63
% 0.20/0.64 cnf(cls_Public_ONonce__supply__lemma_0,axiom,
% 0.20/0.64 ( ~ c_in(c_Message_Omsg_ONonce(V_U),c_Event_Oused(V_evs),tc_Message_Omsg)
% 0.20/0.64 | ~ c_lessequals(v_sko__urX(V_evs),V_U,tc_nat) ) ).
% 0.20/0.64
% 0.20/0.64 %------------------------------------------------------------------------------
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 % Proof found
% 0.20/0.64 % SZS status Theorem for theBenchmark
% 0.20/0.64 % SZS output start Proof
% 0.20/0.64 %ClaNum:3(EqnAxiom:0)
% 0.20/0.64 %VarNum:8(SingletonVarNum:5)
% 0.20/0.64 %MaxLitNum:2
% 0.20/0.64 %MaxfuncDepth:1
% 0.20/0.64 %SharedTerms:4
% 0.20/0.64 %goalClause: 1
% 0.20/0.64 %singleGoalClaCount:1
% 0.20/0.64 [1]P1(f1(x11),f2(a3),a4)
% 0.20/0.64 [2]P2(x21,f5(x21,x22,a6),a6)
% 0.20/0.64 [3]~P1(f1(x32),f2(x31),a4)+~P2(f7(x31),x32,a6)
% 0.20/0.64 %EqnAxiom
% 0.20/0.64
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 cnf(4,plain,
% 0.20/0.64 ($false),
% 0.20/0.64 inference(scs_inference,[],[1,2,3]),
% 0.20/0.64 ['proof']).
% 0.20/0.64 % SZS output end Proof
% 0.20/0.64 % Total time :0.000000s
%------------------------------------------------------------------------------