TSTP Solution File: SWW951+1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SWW951+1 : TPTP v8.1.2. Released v7.4.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 : Fri Sep 1 00:15:53 EDT 2023
% Result : Theorem 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 : SWW951+1 : TPTP v8.1.2. Released v7.4.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n025.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 : Sun Aug 27 21:19:54 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.56 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 : SWW951+1 : TPTP v8.1.2. Released v7.4.0.
% 0.20/0.63 % Domain : Software Verification
% 0.20/0.63 % Problem : Attack on OTYT06 protocol
% 0.20/0.63 % Version : [LT19] axioms : Especial.
% 0.20/0.63 % English : Attack demonstrates violation of aliveness property of tag
% 0.20/0.63 % : guaranteed to reader.
% 0.20/0.63
% 0.20/0.63 % Refs : [BO97] Bull & Otway (1997), The Authentication Protocol
% 0.20/0.63 % : [RS98] Ryan & Schneider (1998), An Attack on a Recursive Auth
% 0.20/0.63 % : [LT19] Li & Tiu (2019), Combining ProVerif and Automated Theo
% 0.20/0.63 % : [Li20] Li (2020), Email to Geoff Sutcliffe
% 0.20/0.63 % Source : [Li20]
% 0.20/0.63 % Names : OTYT06-reader-auth.p [LT20]
% 0.20/0.63
% 0.20/0.63 % Status : Theorem
% 0.20/0.63 % Rating : 0.17 v7.5.0, 0.19 v7.4.0
% 0.20/0.63 % Syntax : Number of formulae : 66 ( 52 unt; 0 def)
% 0.20/0.63 % Number of atoms : 84 ( 40 equ)
% 0.20/0.63 % Maximal formula atoms : 3 ( 1 avg)
% 0.20/0.63 % Number of connectives : 54 ( 36 ~; 0 |; 4 &)
% 0.20/0.63 % ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% 0.20/0.63 % Maximal formula depth : 5 ( 2 avg)
% 0.20/0.63 % Maximal term depth : 4 ( 1 avg)
% 0.20/0.63 % Number of predicates : 4 ( 3 usr; 0 prp; 1-2 aty)
% 0.20/0.63 % Number of functors : 18 ( 18 usr; 11 con; 0-2 aty)
% 0.20/0.63 % Number of variables : 27 ( 27 !; 0 ?)
% 0.20/0.63 % SPC : FOF_THM_RFO_SEQ
% 0.20/0.63
% 0.20/0.63 % Comments : Generated by a modified version of ProVerif used in the
% 0.20/0.63 % ProVerif-ATP project [LT19].
% 0.20/0.63 %--------------------------------------------------------------------------
% 0.20/0.63 fof(ax0,axiom,
% 0.20/0.63 constr_CONST_0x30 != constr_CONST_1 ).
% 0.20/0.63
% 0.20/0.63 fof(ax1,axiom,
% 0.20/0.63 constr_CONST_0x30 != constr_CONST_2 ).
% 0.20/0.63
% 0.20/0.63 fof(ax2,axiom,
% 0.20/0.63 constr_CONST_0x30 != constr_CONST_3 ).
% 0.20/0.63
% 0.20/0.63 fof(ax3,axiom,
% 0.20/0.63 constr_CONST_0x30 != constr_CONST_4 ).
% 0.20/0.63
% 0.20/0.63 fof(ax4,axiom,
% 0.20/0.63 constr_CONST_0x30 != constr_ZERO ).
% 0.20/0.63
% 0.20/0.63 fof(ax5,axiom,
% 0.20/0.63 constr_CONST_0x30 != name_c ).
% 0.20/0.63
% 0.20/0.63 fof(ax6,axiom,
% 0.20/0.63 constr_CONST_0x30 != name_k ).
% 0.20/0.63
% 0.20/0.63 fof(ax7,axiom,
% 0.20/0.63 constr_CONST_0x30 != name_objective ).
% 0.20/0.63
% 0.20/0.63 fof(ax8,axiom,
% 0.20/0.63 constr_CONST_1 != constr_CONST_2 ).
% 0.20/0.63
% 0.20/0.63 fof(ax9,axiom,
% 0.20/0.63 constr_CONST_1 != constr_CONST_3 ).
% 0.20/0.63
% 0.20/0.63 fof(ax10,axiom,
% 0.20/0.63 constr_CONST_1 != constr_CONST_4 ).
% 0.20/0.63
% 0.20/0.63 fof(ax11,axiom,
% 0.20/0.63 constr_CONST_1 != constr_ZERO ).
% 0.20/0.63
% 0.20/0.63 fof(ax12,axiom,
% 0.20/0.63 constr_CONST_1 != name_c ).
% 0.20/0.63
% 0.20/0.63 fof(ax13,axiom,
% 0.20/0.63 constr_CONST_1 != name_k ).
% 0.20/0.63
% 0.20/0.63 fof(ax14,axiom,
% 0.20/0.63 constr_CONST_1 != name_objective ).
% 0.20/0.63
% 0.20/0.63 fof(ax15,axiom,
% 0.20/0.63 constr_CONST_2 != constr_CONST_3 ).
% 0.20/0.63
% 0.20/0.63 fof(ax16,axiom,
% 0.20/0.63 constr_CONST_2 != constr_CONST_4 ).
% 0.20/0.63
% 0.20/0.63 fof(ax17,axiom,
% 0.20/0.63 constr_CONST_2 != constr_ZERO ).
% 0.20/0.63
% 0.20/0.63 fof(ax18,axiom,
% 0.20/0.63 constr_CONST_2 != name_c ).
% 0.20/0.64
% 0.20/0.64 fof(ax19,axiom,
% 0.20/0.64 constr_CONST_2 != name_k ).
% 0.20/0.64
% 0.20/0.64 fof(ax20,axiom,
% 0.20/0.64 constr_CONST_2 != name_objective ).
% 0.20/0.64
% 0.20/0.64 fof(ax21,axiom,
% 0.20/0.64 constr_CONST_3 != constr_CONST_4 ).
% 0.20/0.64
% 0.20/0.64 fof(ax22,axiom,
% 0.20/0.64 constr_CONST_3 != constr_ZERO ).
% 0.20/0.64
% 0.20/0.64 fof(ax23,axiom,
% 0.20/0.64 constr_CONST_3 != name_c ).
% 0.20/0.64
% 0.20/0.64 fof(ax24,axiom,
% 0.20/0.64 constr_CONST_3 != name_k ).
% 0.20/0.64
% 0.20/0.64 fof(ax25,axiom,
% 0.20/0.64 constr_CONST_3 != name_objective ).
% 0.20/0.64
% 0.20/0.64 fof(ax26,axiom,
% 0.20/0.64 constr_CONST_4 != constr_ZERO ).
% 0.20/0.64
% 0.20/0.64 fof(ax27,axiom,
% 0.20/0.64 constr_CONST_4 != name_c ).
% 0.20/0.64
% 0.20/0.64 fof(ax28,axiom,
% 0.20/0.64 constr_CONST_4 != name_k ).
% 0.20/0.64
% 0.20/0.64 fof(ax29,axiom,
% 0.20/0.64 constr_CONST_4 != name_objective ).
% 0.20/0.64
% 0.20/0.64 fof(ax30,axiom,
% 0.20/0.64 constr_ZERO != name_c ).
% 0.20/0.64
% 0.20/0.64 fof(ax31,axiom,
% 0.20/0.64 constr_ZERO != name_k ).
% 0.20/0.64
% 0.20/0.64 fof(ax32,axiom,
% 0.20/0.64 constr_ZERO != name_objective ).
% 0.20/0.64
% 0.20/0.64 fof(ax33,axiom,
% 0.20/0.64 name_c != name_k ).
% 0.20/0.64
% 0.20/0.64 fof(ax34,axiom,
% 0.20/0.64 name_c != name_objective ).
% 0.20/0.64
% 0.20/0.64 fof(ax35,axiom,
% 0.20/0.64 name_k != name_objective ).
% 0.20/0.64
% 0.20/0.64 fof(ax36,axiom,
% 0.20/0.64 ! [VAR_X_10X30] : constr_xor(VAR_X_10X30,VAR_X_10X30) = constr_ZERO ).
% 0.20/0.64
% 0.20/0.64 fof(ax37,axiom,
% 0.20/0.64 ! [VAR_X_9] : constr_xor(VAR_X_9,constr_ZERO) = VAR_X_9 ).
% 0.20/0.64
% 0.20/0.64 fof(ax38,axiom,
% 0.20/0.64 ! [VAR_X_7,VAR_Y_8] : constr_xor(VAR_X_7,VAR_Y_8) = constr_xor(VAR_Y_8,VAR_X_7) ).
% 0.20/0.64
% 0.20/0.64 fof(ax39,axiom,
% 0.20/0.64 ! [VAR_X_0X30,VAR_Y_0X30,VAR_Z_0X30] : constr_xor(VAR_X_0X30,constr_xor(VAR_Y_0X30,VAR_Z_0X30)) = constr_xor(constr_xor(VAR_X_0X30,VAR_Y_0X30),VAR_Z_0X30) ).
% 0.20/0.64
% 0.20/0.64 fof(ax40,axiom,
% 0.20/0.64 ! [VAR_V_26,VAR_V_27] :
% 0.20/0.64 ( ( pred_attacker(VAR_V_26)
% 0.20/0.64 & pred_attacker(VAR_V_27) )
% 0.20/0.64 => pred_attacker(constr_xor(VAR_V_26,VAR_V_27)) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ax41,axiom,
% 0.20/0.64 pred_attacker(tuple_true) ).
% 0.20/0.64
% 0.20/0.64 fof(ax42,axiom,
% 0.20/0.64 ! [VAR_V_30X30] :
% 0.20/0.64 ( pred_attacker(VAR_V_30X30)
% 0.20/0.64 => pred_attacker(constr_h(VAR_V_30X30)) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ax43,axiom,
% 0.20/0.64 pred_attacker(tuple_false) ).
% 0.20/0.64
% 0.20/0.64 fof(ax44,axiom,
% 0.20/0.64 pred_attacker(constr_ZERO) ).
% 0.20/0.64
% 0.20/0.64 fof(ax45,axiom,
% 0.20/0.64 ! [VAR_V_32] :
% 0.20/0.64 ( pred_attacker(VAR_V_32)
% 0.20/0.64 => pred_attacker(tuple_T_out_4(VAR_V_32)) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ax46,axiom,
% 0.20/0.64 ! [VAR_V_35] :
% 0.20/0.64 ( pred_attacker(tuple_T_out_4(VAR_V_35))
% 0.20/0.64 => pred_attacker(VAR_V_35) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ax47,axiom,
% 0.20/0.64 ! [VAR_V_38] :
% 0.20/0.64 ( pred_attacker(VAR_V_38)
% 0.20/0.64 => pred_attacker(tuple_T_out_2(VAR_V_38)) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ax48,axiom,
% 0.20/0.64 ! [VAR_V_41] :
% 0.20/0.64 ( pred_attacker(tuple_T_out_2(VAR_V_41))
% 0.20/0.64 => pred_attacker(VAR_V_41) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ax49,axiom,
% 0.20/0.64 ! [VAR_V_44] :
% 0.20/0.64 ( pred_attacker(VAR_V_44)
% 0.20/0.64 => pred_attacker(tuple_T_in_3(VAR_V_44)) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ax50,axiom,
% 0.20/0.64 ! [VAR_V_47] :
% 0.20/0.64 ( pred_attacker(tuple_T_in_3(VAR_V_47))
% 0.20/0.64 => pred_attacker(VAR_V_47) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ax51,axiom,
% 0.20/0.64 ! [VAR_V_50X30] :
% 0.20/0.64 ( pred_attacker(VAR_V_50X30)
% 0.20/0.64 => pred_attacker(tuple_T_in_1(VAR_V_50X30)) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ax52,axiom,
% 0.20/0.64 ! [VAR_V_53] :
% 0.20/0.64 ( pred_attacker(tuple_T_in_1(VAR_V_53))
% 0.20/0.64 => pred_attacker(VAR_V_53) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ax53,axiom,
% 0.20/0.64 pred_attacker(constr_CONST_4) ).
% 0.20/0.64
% 0.20/0.64 fof(ax54,axiom,
% 0.20/0.64 pred_attacker(constr_CONST_3) ).
% 0.20/0.64
% 0.20/0.64 fof(ax55,axiom,
% 0.20/0.64 pred_attacker(constr_CONST_2) ).
% 0.20/0.64
% 0.20/0.64 fof(ax56,axiom,
% 0.20/0.64 pred_attacker(constr_CONST_1) ).
% 0.20/0.64
% 0.20/0.64 fof(ax57,axiom,
% 0.20/0.64 pred_attacker(constr_CONST_0x30) ).
% 0.20/0.64
% 0.20/0.64 fof(ax58,axiom,
% 0.20/0.64 ! [VAR_V_59,VAR_V_60X30] :
% 0.20/0.64 ( ( pred_mess(VAR_V_60X30,VAR_V_59)
% 0.20/0.64 & pred_attacker(VAR_V_60X30) )
% 0.20/0.64 => pred_attacker(VAR_V_59) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ax59,axiom,
% 0.20/0.64 ! [VAR_V_61,VAR_V_62] :
% 0.20/0.64 ( ( pred_attacker(VAR_V_62)
% 0.20/0.64 & pred_attacker(VAR_V_61) )
% 0.20/0.64 => pred_mess(VAR_V_62,VAR_V_61) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ax60,axiom,
% 0.20/0.64 pred_attacker(name_c) ).
% 0.20/0.64
% 0.20/0.64 fof(ax61,axiom,
% 0.20/0.64 ! [VAR_V_64] : pred_equal(VAR_V_64,VAR_V_64) ).
% 0.20/0.64
% 0.20/0.64 fof(ax62,axiom,
% 0.20/0.64 ! [VAR_V_65] : pred_attacker(name_new0x2Dname(VAR_V_65)) ).
% 0.20/0.64
% 0.20/0.64 fof(ax63,axiom,
% 0.20/0.64 ! [VAR_R1_85] :
% 0.20/0.64 ( pred_attacker(tuple_T_in_1(VAR_R1_85))
% 0.20/0.64 => pred_attacker(tuple_T_out_2(constr_h(constr_xor(name_k,VAR_R1_85)))) ) ).
% 0.20/0.64
% 0.20/0.64 fof(ax64,axiom,
% 0.20/0.64 ! [VAR_K_XOR_K1_10X305,VAR_R1_10X306] :
% 0.20/0.64 ( ( pred_attacker(tuple_T_in_3(VAR_K_XOR_K1_10X305))
% 0.20/0.64 & pred_attacker(tuple_T_in_1(VAR_R1_10X306)) )
% 0.20/0.64 => pred_attacker(tuple_T_out_4(name_objective)) ) ).
% 0.20/0.64
% 0.20/0.64 fof(co0,conjecture,
% 0.20/0.64 pred_attacker(name_objective) ).
% 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:82(EqnAxiom:16)
% 0.20/0.64 %VarNum:51(SingletonVarNum:27)
% 0.20/0.64 %MaxLitNum:3
% 0.20/0.64 %MaxfuncDepth:3
% 0.20/0.64 %SharedTerms:59
% 0.20/0.64 %goalClause: 68
% 0.20/0.64 %singleGoalClaCount:1
% 0.20/0.64 [17]P1(a1)
% 0.20/0.64 [18]P1(a2)
% 0.20/0.64 [19]P1(a3)
% 0.20/0.64 [20]P1(a4)
% 0.20/0.64 [21]P1(a5)
% 0.20/0.64 [22]P1(a6)
% 0.20/0.64 [23]P1(a7)
% 0.20/0.64 [24]P1(a10)
% 0.20/0.64 [25]P1(a11)
% 0.20/0.64 [32]~E(a2,a1)
% 0.20/0.64 [33]~E(a3,a1)
% 0.20/0.64 [34]~E(a3,a2)
% 0.20/0.64 [35]~E(a4,a1)
% 0.20/0.64 [36]~E(a4,a2)
% 0.20/0.64 [37]~E(a4,a3)
% 0.20/0.64 [38]~E(a5,a1)
% 0.20/0.64 [39]~E(a5,a2)
% 0.20/0.64 [40]~E(a5,a3)
% 0.20/0.64 [41]~E(a5,a4)
% 0.20/0.64 [42]~E(a1,a6)
% 0.20/0.64 [43]~E(a2,a6)
% 0.20/0.64 [44]~E(a3,a6)
% 0.20/0.64 [45]~E(a4,a6)
% 0.20/0.64 [46]~E(a5,a6)
% 0.20/0.64 [47]~E(a7,a1)
% 0.20/0.64 [48]~E(a7,a2)
% 0.20/0.64 [49]~E(a7,a3)
% 0.20/0.64 [50]~E(a7,a4)
% 0.20/0.64 [51]~E(a7,a5)
% 0.20/0.64 [52]~E(a7,a6)
% 0.20/0.64 [53]~E(a13,a1)
% 0.20/0.64 [54]~E(a13,a2)
% 0.20/0.64 [55]~E(a13,a3)
% 0.20/0.64 [56]~E(a13,a4)
% 0.20/0.64 [57]~E(a13,a5)
% 0.20/0.64 [58]~E(a13,a6)
% 0.20/0.64 [59]~E(a13,a7)
% 0.20/0.64 [60]~E(a14,a1)
% 0.20/0.64 [61]~E(a14,a2)
% 0.20/0.64 [62]~E(a14,a3)
% 0.20/0.64 [63]~E(a14,a4)
% 0.20/0.64 [64]~E(a14,a5)
% 0.20/0.64 [65]~E(a14,a6)
% 0.20/0.64 [66]~E(a14,a7)
% 0.20/0.64 [67]~E(a14,a13)
% 0.20/0.64 [68]~P1(a14)
% 0.20/0.64 [29]P2(x291,x291)
% 0.20/0.64 [26]P1(f12(x261))
% 0.20/0.64 [27]E(f8(x271,a6),x271)
% 0.20/0.64 [28]E(f8(x281,x281),a6)
% 0.20/0.64 [30]E(f8(x301,x302),f8(x302,x301))
% 0.20/0.64 [31]E(f8(f8(x311,x312),x313),f8(x311,f8(x312,x313)))
% 0.20/0.64 [69]~P1(x691)+P1(f9(x691))
% 0.20/0.64 [70]~P1(x701)+P1(f15(x701))
% 0.20/0.64 [71]~P1(x711)+P1(f16(x711))
% 0.20/0.64 [72]~P1(x721)+P1(f17(x721))
% 0.20/0.64 [73]~P1(x731)+P1(f18(x731))
% 0.20/0.64 [74]P1(x741)+~P1(f15(x741))
% 0.20/0.64 [75]P1(x751)+~P1(f16(x751))
% 0.20/0.64 [76]P1(x761)+~P1(f17(x761))
% 0.20/0.64 [77]P1(x771)+~P1(f18(x771))
% 0.20/0.64 [82]~P1(f18(x821))+P1(f16(f9(f8(a13,x821))))
% 0.20/0.64 [78]~P1(x782)+~P1(x781)+P3(x781,x782)
% 0.20/0.64 [79]~P3(x792,x791)+P1(x791)+~P1(x792)
% 0.20/0.64 [80]~P1(f17(x801))+~P1(f18(x802))+P1(f15(a14))
% 0.20/0.64 [81]~P1(x812)+~P1(x811)+P1(f8(x811,x812))
% 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(f12(x41),f12(x42))
% 0.20/0.64 [5]~E(x51,x52)+E(f8(x51,x53),f8(x52,x53))
% 0.20/0.64 [6]~E(x61,x62)+E(f8(x63,x61),f8(x63,x62))
% 0.20/0.64 [7]~E(x71,x72)+E(f18(x71),f18(x72))
% 0.20/0.64 [8]~E(x81,x82)+E(f16(x81),f16(x82))
% 0.20/0.64 [9]~E(x91,x92)+E(f9(x91),f9(x92))
% 0.20/0.64 [10]~E(x101,x102)+E(f17(x101),f17(x102))
% 0.20/0.64 [11]~E(x111,x112)+E(f15(x111),f15(x112))
% 0.20/0.64 [12]~P1(x121)+P1(x122)+~E(x121,x122)
% 0.20/0.64 [13]P3(x132,x133)+~E(x131,x132)+~P3(x131,x133)
% 0.20/0.64 [14]P3(x143,x142)+~E(x141,x142)+~P3(x143,x141)
% 0.20/0.64 [15]P2(x152,x153)+~E(x151,x152)+~P2(x151,x153)
% 0.20/0.64 [16]P2(x163,x162)+~E(x161,x162)+~P2(x163,x161)
% 0.20/0.64
% 0.20/0.64 %-------------------------------------------
% 0.20/0.64 cnf(83,plain,
% 0.20/0.64 (E(x831,f8(x831,a6))),
% 0.20/0.64 inference(scs_inference,[],[27,2])).
% 0.20/0.64 cnf(85,plain,
% 0.20/0.64 (P2(x851,x851)),
% 0.20/0.64 inference(rename_variables,[],[29])).
% 0.20/0.64 cnf(88,plain,
% 0.20/0.64 (E(f8(x881,a6),x881)),
% 0.20/0.64 inference(rename_variables,[],[27])).
% 0.20/0.64 cnf(90,plain,
% 0.20/0.64 (E(f8(x901,a6),x901)),
% 0.20/0.64 inference(rename_variables,[],[27])).
% 0.20/0.64 cnf(99,plain,
% 0.20/0.64 (~P1(f15(a14))),
% 0.20/0.65 inference(scs_inference,[],[68,29,85,17,32,27,88,2,16,15,12,3,79,77,76,75,74])).
% 0.20/0.65 cnf(101,plain,
% 0.20/0.65 (P1(f18(a1))),
% 0.20/0.65 inference(scs_inference,[],[68,29,85,17,32,27,88,2,16,15,12,3,79,77,76,75,74,73])).
% 0.20/0.65 cnf(103,plain,
% 0.20/0.65 (P1(f17(a1))),
% 0.20/0.65 inference(scs_inference,[],[68,29,85,17,32,27,88,2,16,15,12,3,79,77,76,75,74,73,72])).
% 0.20/0.65 cnf(119,plain,
% 0.20/0.65 (P1(f16(f9(f8(a13,a1))))),
% 0.20/0.65 inference(scs_inference,[],[68,29,85,17,32,27,88,90,2,16,15,12,3,79,77,76,75,74,73,72,71,70,69,11,10,9,8,7,6,5,4,82])).
% 0.20/0.65 cnf(121,plain,
% 0.20/0.65 (~P3(a1,f8(a14,a6))),
% 0.20/0.65 inference(scs_inference,[],[68,29,85,17,32,27,88,90,2,16,15,12,3,79,77,76,75,74,73,72,71,70,69,11,10,9,8,7,6,5,4,82,14])).
% 0.20/0.65 cnf(122,plain,
% 0.20/0.65 (~P3(x1221,a14)+~E(x1221,a1)),
% 0.20/0.65 inference(scs_inference,[],[68,29,85,17,32,27,88,90,2,16,15,12,3,79,77,76,75,74,73,72,71,70,69,11,10,9,8,7,6,5,4,82,14,13])).
% 0.20/0.65 cnf(139,plain,
% 0.20/0.65 (E(f8(x1391,x1392),f8(x1392,x1391))),
% 0.20/0.65 inference(rename_variables,[],[30])).
% 0.20/0.65 cnf(146,plain,
% 0.20/0.65 ($false),
% 0.20/0.65 inference(scs_inference,[],[68,18,19,33,30,139,27,83,119,99,101,103,121,122,75,78,81,2,14,13,3,79,80]),
% 0.20/0.65 ['proof']).
% 0.20/0.65 % SZS output end Proof
% 0.20/0.65 % Total time :0.000000s
%------------------------------------------------------------------------------