TSTP Solution File: SWV242-2 by CSE---1.6

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : SWV242-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 : n025.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:24 EDT 2023

% Result   : Unsatisfiable 0.19s 0.64s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : SWV242-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.33  % Computer : n025.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % 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 09:18:55 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.19/0.56  start to proof:theBenchmark
% 0.19/0.63  %-------------------------------------------
% 0.19/0.63  % File        :CSE---1.6
% 0.19/0.63  % Problem     :theBenchmark
% 0.19/0.63  % Transform   :cnf
% 0.19/0.63  % Format      :tptp:raw
% 0.19/0.63  % Command     :java -jar mcs_scs.jar %d %s
% 0.19/0.63  
% 0.19/0.63  % Result      :Theorem 0.020000s
% 0.19/0.63  % Output      :CNFRefutation 0.020000s
% 0.19/0.63  %-------------------------------------------
% 0.19/0.64  %------------------------------------------------------------------------------
% 0.19/0.64  % File     : SWV242-2 : TPTP v8.1.2. Released v3.2.0.
% 0.19/0.64  % Domain   : Software Verification (Security)
% 0.19/0.64  % Problem  : Cryptographic protocol problem for messages
% 0.19/0.64  % Version  : [Pau06] axioms : Reduced > Especial.
% 0.19/0.64  % English  :
% 0.19/0.64  
% 0.19/0.64  % Refs     : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.19/0.64  % Source   : [Pau06]
% 0.19/0.64  % Names    :
% 0.19/0.64  
% 0.19/0.64  % Status   : Unsatisfiable
% 0.19/0.64  % Rating   : 0.00 v5.3.0, 0.05 v5.2.0, 0.00 v3.2.0
% 0.19/0.64  % Syntax   : Number of clauses     :    7 (   4 unt;   0 nHn;   5 RR)
% 0.19/0.64  %            Number of literals    :   11 (   0 equ;   5 neg)
% 0.19/0.64  %            Maximal clause size   :    3 (   1 avg)
% 0.19/0.64  %            Maximal term depth    :    3 (   1 avg)
% 0.19/0.64  %            Number of predicates  :    1 (   1 usr;   0 prp; 3-3 aty)
% 0.19/0.64  %            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
% 0.19/0.64  %            Number of variables   :   12 (   2 sgn)
% 0.19/0.64  % SPC      : CNF_UNS_RFO_NEQ_HRN
% 0.19/0.64  
% 0.19/0.64  % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.19/0.64  %            of which only a small selection are required for the refutation.
% 0.19/0.64  %            The mission is to find those few axioms, after which a refutation
% 0.19/0.64  %            can be quite easily found. This version has only the necessary
% 0.19/0.64  %            axioms.
% 0.19/0.64  %------------------------------------------------------------------------------
% 0.19/0.64  cnf(cls_conjecture_0,negated_conjecture,
% 0.19/0.64      c_lessequals(v_G,c_Message_Oanalz(v_G_H),tc_set(tc_Message_Omsg)) ).
% 0.19/0.64  
% 0.19/0.64  cnf(cls_conjecture_1,negated_conjecture,
% 0.19/0.64      c_lessequals(v_H,c_Message_Oanalz(v_H_H),tc_set(tc_Message_Omsg)) ).
% 0.19/0.64  
% 0.19/0.64  cnf(cls_conjecture_2,negated_conjecture,
% 0.19/0.64      ( ~ c_lessequals(v_H,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg))
% 0.19/0.64      | ~ c_lessequals(v_G,c_Message_Oanalz(c_union(v_G_H,v_H_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)) ) ).
% 0.19/0.64  
% 0.19/0.64  cnf(cls_Message_Oanalz__mono_0,axiom,
% 0.19/0.64      ( ~ c_lessequals(V_G,V_H,tc_set(tc_Message_Omsg))
% 0.19/0.64      | c_lessequals(c_Message_Oanalz(V_G),c_Message_Oanalz(V_H),tc_set(tc_Message_Omsg)) ) ).
% 0.19/0.64  
% 0.19/0.64  cnf(cls_Set_OUn__upper1_0,axiom,
% 0.19/0.64      c_lessequals(V_A,c_union(V_A,V_B,T_a),tc_set(T_a)) ).
% 0.19/0.64  
% 0.19/0.64  cnf(cls_Set_OUn__upper2_0,axiom,
% 0.19/0.64      c_lessequals(V_B,c_union(V_A,V_B,T_a),tc_set(T_a)) ).
% 0.19/0.64  
% 0.19/0.64  cnf(cls_Set_Osubset__trans_0,axiom,
% 0.19/0.64      ( ~ c_lessequals(V_B,V_C,tc_set(T_a))
% 0.19/0.64      | ~ c_lessequals(V_A,V_B,tc_set(T_a))
% 0.19/0.64      | c_lessequals(V_A,V_C,tc_set(T_a)) ) ).
% 0.19/0.64  
% 0.19/0.64  %------------------------------------------------------------------------------
% 0.19/0.64  %-------------------------------------------
% 0.19/0.64  % Proof found
% 0.19/0.64  % SZS status Theorem for theBenchmark
% 0.19/0.64  % SZS output start Proof
% 0.19/0.64  %ClaNum:7(EqnAxiom:0)
% 0.19/0.64  %VarNum:23(SingletonVarNum:12)
% 0.19/0.64  %MaxLitNum:3
% 0.19/0.64  %MaxfuncDepth:2
% 0.19/0.64  %SharedTerms:14
% 0.19/0.64  %goalClause: 1 2 7
% 0.19/0.64  %singleGoalClaCount:2
% 0.19/0.64  [1]P1(a1,f2(a6),f5(a3))
% 0.19/0.64  [2]P1(a7,f2(a8),f5(a3))
% 0.19/0.64  [3]P1(x31,f4(x32,x31,x33),f5(x33))
% 0.19/0.64  [4]P1(x41,f4(x41,x42,x43),f5(x43))
% 0.19/0.64  [7]~P1(a1,f2(f4(a6,a8,a3)),f5(a3))+~P1(a7,f2(f4(a6,a8,a3)),f5(a3))
% 0.19/0.64  [5]~P1(x51,x52,f5(a3))+P1(f2(x51),f2(x52),f5(a3))
% 0.19/0.64  [6]P1(x61,x62,f5(x63))+~P1(x64,x62,f5(x63))+~P1(x61,x64,f5(x63))
% 0.19/0.64  %EqnAxiom
% 0.19/0.64  
% 0.19/0.64  %-------------------------------------------
% 0.19/0.64  cnf(12,plain,
% 0.19/0.64     (P1(a1,f4(f2(a6),x121,a3),f5(a3))),
% 0.19/0.64     inference(scs_inference,[],[1,4,6])).
% 0.19/0.64  cnf(18,plain,
% 0.19/0.64     (P1(f2(x181),f2(f4(x182,x181,a3)),f5(a3))),
% 0.19/0.64     inference(scs_inference,[],[3,5])).
% 0.19/0.64  cnf(34,plain,
% 0.19/0.64     (P1(a7,f2(f4(x341,a8,a3)),f5(a3))),
% 0.19/0.64     inference(scs_inference,[],[18,2,6])).
% 0.19/0.64  cnf(37,plain,
% 0.19/0.64     (~P1(a1,f2(f4(a6,a8,a3)),f5(a3))),
% 0.19/0.64     inference(scs_inference,[],[34,7])).
% 0.19/0.64  cnf(50,plain,
% 0.19/0.64     (P1(f2(x501),f2(f4(x501,x502,a3)),f5(a3))),
% 0.19/0.64     inference(scs_inference,[],[12,4,6,5])).
% 0.19/0.64  cnf(63,plain,
% 0.19/0.64     ($false),
% 0.19/0.64     inference(scs_inference,[],[50,37,1,6]),
% 0.19/0.64     ['proof']).
% 0.19/0.64  % SZS output end Proof
% 0.19/0.64  % Total time :0.020000s
%------------------------------------------------------------------------------