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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE---1.6
% Problem  : SWV254-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d

% Computer : n001.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:29 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.00/0.12  % Problem    : SWV254-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.12/0.34  % Computer : n001.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 29 09:12:06 EDT 2023
% 0.12/0.34  % CPUTime    : 
% 0.20/0.57  start to proof:theBenchmark
% 0.20/0.64  %-------------------------------------------
% 0.20/0.64  % File        :CSE---1.6
% 0.20/0.64  % Problem     :theBenchmark
% 0.20/0.64  % Transform   :cnf
% 0.20/0.64  % Format      :tptp:raw
% 0.20/0.64  % Command     :java -jar mcs_scs.jar %d %s
% 0.20/0.64  
% 0.20/0.64  % Result      :Theorem 0.000000s
% 0.20/0.64  % Output      :CNFRefutation 0.000000s
% 0.20/0.64  %-------------------------------------------
% 0.20/0.64  %------------------------------------------------------------------------------
% 0.20/0.64  % File     : SWV254-2 : TPTP v8.1.2. Released v3.2.0.
% 0.20/0.64  % Domain   : Software Verification (Security)
% 0.20/0.64  % Problem  : Cryptographic protocol problem for messages
% 0.20/0.64  % Version  : [Pau06] axioms : Reduced > Especial.
% 0.20/0.64  % English  :
% 0.20/0.64  
% 0.20/0.64  % Refs     : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.20/0.64  % Source   : [Pau06]
% 0.20/0.64  % Names    :
% 0.20/0.64  
% 0.20/0.64  % Status   : Unsatisfiable
% 0.20/0.64  % Rating   : 0.00 v5.3.0, 0.08 v5.2.0, 0.00 v4.1.0, 0.11 v4.0.1, 0.17 v3.3.0, 0.43 v3.2.0
% 0.20/0.64  % Syntax   : Number of clauses     :    6 (   5 unt;   0 nHn;   3 RR)
% 0.20/0.64  %            Number of literals    :    8 (   4 equ;   3 neg)
% 0.20/0.64  %            Maximal clause size   :    3 (   1 avg)
% 0.20/0.64  %            Maximal term depth    :    3 (   1 avg)
% 0.20/0.64  %            Number of predicates  :    3 (   2 usr;   0 prp; 1-3 aty)
% 0.20/0.64  %            Number of functors    :    7 (   7 usr;   3 con; 0-3 aty)
% 0.20/0.64  %            Number of variables   :    9 (   4 sgn)
% 0.20/0.64  % SPC      : CNF_UNS_RFO_SEQ_HRN
% 0.20/0.64  
% 0.20/0.64  % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.20/0.64  %            of which only a small selection are required for the refutation.
% 0.20/0.64  %            The mission is to find those few axioms, after which a refutation
% 0.20/0.64  %            can be quite easily found. This version has only the necessary
% 0.20/0.64  %            axioms.
% 0.20/0.64  %------------------------------------------------------------------------------
% 0.20/0.64  cnf(cls_SetInterval_OatLeastLessThan__empty_0,axiom,
% 0.20/0.64      ( ~ class_Orderings_Oorder(T_a)
% 0.20/0.64      | ~ c_lessequals(V_n,V_m,T_a)
% 0.20/0.64      | c_SetInterval_OatLeastLessThan(V_m,V_n,T_a) = c_emptyset ) ).
% 0.20/0.64  
% 0.20/0.64  cnf(cls_SetInterval_OatLeastLessThan__singleton_0,axiom,
% 0.20/0.64      c_SetInterval_OatLeastLessThan(V_m,c_Suc(V_m),tc_nat) = c_insert(V_m,c_emptyset,tc_nat) ).
% 0.20/0.64  
% 0.20/0.64  cnf(cls_Set_Oempty__not__insert_0,axiom,
% 0.20/0.64      c_emptyset != c_insert(V_a,V_A,T_a) ).
% 0.20/0.64  
% 0.20/0.64  cnf(cls_conjecture_0,negated_conjecture,
% 0.20/0.64      c_lessequals(V_U,v_x(V_U),tc_nat) ).
% 0.20/0.64  
% 0.20/0.64  cnf(cls_conjecture_1,negated_conjecture,
% 0.20/0.64      v_x(V_U) = v_nat ).
% 0.20/0.64  
% 0.20/0.64  cnf(clsarity_nat_3,axiom,
% 0.20/0.64      class_Orderings_Oorder(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:19(EqnAxiom:14)
% 0.20/0.64  %VarNum:14(SingletonVarNum:8)
% 0.20/0.64  %MaxLitNum:3
% 0.20/0.64  %MaxfuncDepth:2
% 0.20/0.64  %SharedTerms:4
% 0.20/0.64  %goalClause: 16
% 0.20/0.64  %singleGoalClaCount:1
% 0.20/0.64  [15]P1(a1)
% 0.20/0.64  [16]P2(x161,a6,a1)
% 0.20/0.64  [17]E(f3(x171,f2(x171),a1),f5(x171,a4,a1))
% 0.20/0.64  [18]~E(f5(x181,x182,x183),a4)
% 0.20/0.64  [19]~P1(x193)+~P2(x192,x191,x193)+E(f3(x191,x192,x193),a4)
% 0.20/0.64  %EqnAxiom
% 0.20/0.64  [1]E(x11,x11)
% 0.20/0.64  [2]E(x22,x21)+~E(x21,x22)
% 0.20/0.64  [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.20/0.64  [4]~E(x41,x42)+E(f2(x41),f2(x42))
% 0.20/0.64  [5]~E(x51,x52)+E(f3(x51,x53,x54),f3(x52,x53,x54))
% 0.20/0.64  [6]~E(x61,x62)+E(f3(x63,x61,x64),f3(x63,x62,x64))
% 0.20/0.64  [7]~E(x71,x72)+E(f3(x73,x74,x71),f3(x73,x74,x72))
% 0.20/0.64  [8]~E(x81,x82)+E(f5(x81,x83,x84),f5(x82,x83,x84))
% 0.20/0.64  [9]~E(x91,x92)+E(f5(x93,x91,x94),f5(x93,x92,x94))
% 0.20/0.64  [10]~E(x101,x102)+E(f5(x103,x104,x101),f5(x103,x104,x102))
% 0.20/0.64  [11]~P1(x111)+P1(x112)+~E(x111,x112)
% 0.20/0.64  [12]P2(x122,x123,x124)+~E(x121,x122)+~P2(x121,x123,x124)
% 0.20/0.64  [13]P2(x133,x132,x134)+~E(x131,x132)+~P2(x133,x131,x134)
% 0.20/0.64  [14]P2(x143,x144,x142)+~E(x141,x142)+~P2(x143,x144,x141)
% 0.20/0.64  
% 0.20/0.65  %-------------------------------------------
% 0.20/0.65  cnf(22,plain,
% 0.20/0.65     (~E(f3(x221,f2(x221),a1),a4)),
% 0.20/0.65     inference(scs_inference,[],[15,18,17,2,11,3])).
% 0.20/0.65  cnf(30,plain,
% 0.20/0.65     ($false),
% 0.20/0.65     inference(scs_inference,[],[16,15,22,19]),
% 0.20/0.65     ['proof']).
% 0.20/0.65  % SZS output end Proof
% 0.20/0.65  % Total time :0.000000s
%------------------------------------------------------------------------------