↑ Up

CSE---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : SWV245-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n020.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 : Mon Jun 24 16:46:15 EDT 2024

% Result   : Unsatisfiable 0.63s 0.69s
% Output   : CNFRefutation 0.63s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SWV245-2 : TPTP v8.2.0. Released v3.2.0.
% 0.04/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34  % Computer : n020.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.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Thu Jun 20 20:14:24 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.62/0.64  start to proof:theBenchmark
% 0.63/0.68  %-------------------------------------------
% 0.63/0.68  % File        :CSE---1.7
% 0.63/0.68  % Problem     :theBenchmark
% 0.63/0.68  % Transform   :cnf
% 0.63/0.68  % Format      :tptp:raw
% 0.63/0.68  % Command     :java -jar mcs_scs.jar %d %s
% 0.63/0.68  
% 0.63/0.68  % Result      :Theorem 0.000000s
% 0.63/0.68  % Output      :CNFRefutation 0.000000s
% 0.63/0.68  %-------------------------------------------
% 0.63/0.68  %------------------------------------------------------------------------------
% 0.63/0.68  % File     : SWV245-2 : TPTP v8.2.0. Released v3.2.0.
% 0.63/0.68  % Domain   : Software Verification (Security)
% 0.63/0.68  % Problem  : Cryptographic protocol problem for messages
% 0.63/0.68  % Version  : [Pau06] axioms : Reduced > Especial.
% 0.63/0.68  % English  :
% 0.63/0.68  
% 0.63/0.68  % Refs     : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.63/0.68  % Source   : [Pau06]
% 0.63/0.68  % Names    :
% 0.63/0.68  
% 0.63/0.68  % Status   : Unsatisfiable
% 0.63/0.69  % Rating   : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.14 v6.2.0, 0.11 v6.1.0, 0.14 v5.5.0, 0.12 v5.4.0, 0.10 v5.1.0, 0.09 v5.0.0, 0.00 v4.0.0, 0.14 v3.4.0, 0.00 v3.2.0
% 0.63/0.69  % Syntax   : Number of clauses     :    8 (   2 unt;   2 nHn;   6 RR)
% 0.63/0.69  %            Number of literals    :   16 (   0 equ;   7 neg)
% 0.63/0.69  %            Maximal clause size   :    3 (   2 avg)
% 0.63/0.69  %            Maximal term depth    :    4 (   1 avg)
% 0.63/0.69  %            Number of predicates  :    1 (   1 usr;   0 prp; 3-3 aty)
% 0.63/0.69  %            Number of functors    :    9 (   9 usr;   5 con; 0-3 aty)
% 0.63/0.69  %            Number of variables   :   20 (   3 sgn)
% 0.63/0.69  % SPC      : CNF_UNS_RFO_NEQ_NHN
% 0.63/0.69  
% 0.63/0.69  % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.63/0.69  %            of which only a small selection are required for the refutation.
% 0.63/0.69  %            The mission is to find those few axioms, after which a refutation
% 0.63/0.69  %            can be quite easily found. This version has only the necessary
% 0.63/0.69  %            axioms.
% 0.63/0.69  %------------------------------------------------------------------------------
% 0.63/0.69  cnf(cls_conjecture_1,negated_conjecture,
% 0.63/0.69      c_in(c_Message_Omsg_OMPair(v_X,v_Y),c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg) ).
% 0.63/0.69  
% 0.63/0.69  cnf(cls_conjecture_2,negated_conjecture,
% 0.63/0.69      ~ c_in(v_X,c_union(c_Message_Oanalz(c_union(v_G,v_H,tc_Message_Omsg)),c_Message_Osynth(v_G),tc_Message_Omsg),tc_Message_Omsg) ).
% 0.63/0.69  
% 0.63/0.69  cnf(cls_Message_OMPair__analz_1,axiom,
% 0.63/0.69      ( ~ c_in(c_Message_Omsg_OMPair(V_X,V_Y),c_Message_Oanalz(V_H),tc_Message_Omsg)
% 0.63/0.69      | c_in(V_X,c_Message_Oanalz(V_H),tc_Message_Omsg) ) ).
% 0.63/0.69  
% 0.63/0.69  cnf(cls_Message_OMPair__synth_1,axiom,
% 0.63/0.69      ( ~ c_in(c_Message_Omsg_OMPair(V_X,V_Y),c_Message_Osynth(V_H),tc_Message_Omsg)
% 0.63/0.69      | c_in(V_X,c_Message_Osynth(V_H),tc_Message_Omsg)
% 0.63/0.69      | c_in(c_Message_Omsg_OMPair(V_X,V_Y),V_H,tc_Message_Omsg) ) ).
% 0.63/0.69  
% 0.63/0.69  cnf(cls_Message_Oanalz_OInj_0,axiom,
% 0.63/0.69      ( ~ c_in(V_X,V_H,tc_Message_Omsg)
% 0.63/0.69      | c_in(V_X,c_Message_Oanalz(V_H),tc_Message_Omsg) ) ).
% 0.63/0.69  
% 0.63/0.69  cnf(cls_Set_OUnCI_0,axiom,
% 0.63/0.69      ( ~ c_in(V_c,V_B,T_a)
% 0.63/0.69      | c_in(V_c,c_union(V_A,V_B,T_a),T_a) ) ).
% 0.63/0.69  
% 0.63/0.69  cnf(cls_Set_OUnCI_1,axiom,
% 0.63/0.69      ( ~ c_in(V_c,V_A,T_a)
% 0.63/0.69      | c_in(V_c,c_union(V_A,V_B,T_a),T_a) ) ).
% 0.63/0.69  
% 0.63/0.69  cnf(cls_Set_OUnE_0,axiom,
% 0.63/0.69      ( ~ c_in(V_c,c_union(V_A,V_B,T_a),T_a)
% 0.63/0.69      | c_in(V_c,V_B,T_a)
% 0.63/0.69      | c_in(V_c,V_A,T_a) ) ).
% 0.63/0.69  
% 0.63/0.69  %------------------------------------------------------------------------------
% 0.63/0.69  %-------------------------------------------
% 0.63/0.69  % Proof found
% 0.63/0.69  % SZS status Theorem for theBenchmark
% 0.63/0.69  % SZS output start Proof
% 0.63/0.69  %ClaNum:8(EqnAxiom:0)
% 0.63/0.69  %VarNum:44(SingletonVarNum:20)
% 0.63/0.69  %MaxLitNum:3
% 0.63/0.69  %MaxfuncDepth:2
% 0.63/0.69  %SharedTerms:12
% 0.63/0.69  %goalClause: 1 2
% 0.63/0.69  %singleGoalClaCount:2
% 0.63/0.69  [1]P1(f2(a1,a9),f6(f3(f6(a4,a8,a5)),f7(a4),a5),a5)
% 0.63/0.69  [2]~P1(a1,f6(f3(f6(a4,a8,a5)),f7(a4),a5),a5)
% 0.63/0.69  [3]~P1(x31,x32,a5)+P1(x31,f3(x32),a5)
% 0.63/0.69  [4]P1(x41,f3(x42),a5)+~P1(f2(x41,x43),f3(x42),a5)
% 0.63/0.69  [5]~P1(x51,x53,x54)+P1(x51,f6(x52,x53,x54),x54)
% 0.63/0.69  [6]~P1(x61,x62,x64)+P1(x61,f6(x62,x63,x64),x64)
% 0.63/0.69  [7]P1(x71,f7(x72),a5)+P1(f2(x71,x73),x72,a5)+~P1(f2(x71,x73),f7(x72),a5)
% 0.63/0.69  [8]P1(x81,x82,x83)+P1(x81,x84,x83)+~P1(x81,f6(x84,x82,x83),x83)
% 0.63/0.69  %EqnAxiom
% 0.63/0.69  
% 0.63/0.69  %-------------------------------------------
% 0.63/0.69  cnf(9,plain,
% 0.63/0.69     (~P1(a1,f7(a4),a5)),
% 0.63/0.69     inference(scs_inference,[],[2,5])).
% 0.63/0.69  cnf(13,plain,
% 0.63/0.69     (~P1(a1,f6(a4,a8,a5),a5)),
% 0.63/0.69     inference(scs_inference,[],[2,5,6,3])).
% 0.63/0.69  cnf(15,plain,
% 0.63/0.69     (~P1(f2(a1,x151),f3(f6(a4,a8,a5)),a5)),
% 0.63/0.69     inference(scs_inference,[],[2,5,6,3,4])).
% 0.63/0.69  cnf(19,plain,
% 0.63/0.69     (P1(f2(a1,a9),f7(a4),a5)),
% 0.63/0.69     inference(scs_inference,[],[1,2,5,6,3,4,7,8])).
% 0.63/0.69  cnf(21,plain,
% 0.63/0.69     (~P1(f2(a1,x211),f6(a4,a8,a5),a5)),
% 0.63/0.69     inference(scs_inference,[],[15,3])).
% 0.63/0.69  cnf(29,plain,
% 0.63/0.69     (P1(f2(a1,a9),a4,a5)),
% 0.63/0.69     inference(scs_inference,[],[13,19,15,9,3,4,6,5,7])).
% 0.63/0.69  cnf(31,plain,
% 0.63/0.69     ($false),
% 0.63/0.69     inference(scs_inference,[],[21,29,6]),
% 0.63/0.69     ['proof']).
% 0.63/0.69  % SZS output end Proof
% 0.63/0.69  % Total time :0.000000s
%------------------------------------------------------------------------------