TSTP Solution File: GRP605-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP605-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n015.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 : 600s
% DateTime : Sat Jul 16 08:48:10 EDT 2022
% Result : Unsatisfiable 0.61s 1.04s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 1
% Syntax : Number of clauses : 52 ( 52 unt; 0 nHn; 3 RR)
% Number of literals : 52 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 119 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),C),B),
file('GRP605-1.p',unknown),
[] ).
cnf(2,plain,
equal(inverse(double_divide(A,B)),multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),2,2]),
[iquote('back_demod(1),demod([2,2])')] ).
cnf(4,plain,
~ equal(multiply(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(double_divide(multiply(multiply(double_divide(A,B),multiply(C,D)),A),B),double_divide(D,C)),
inference(para,[status(thm),theory(equality)],[2,3]),
[iquote('para(2,3)')] ).
cnf(6,plain,
equal(multiply(A,multiply(multiply(double_divide(B,A),inverse(C)),B)),inverse(C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2]),1]),
[iquote('para(3,2),flip(1)')] ).
cnf(7,plain,
equal(double_divide(multiply(multiply(A,inverse(B)),multiply(multiply(double_divide(C,D),inverse(A)),C)),D),B),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(13,plain,
equal(double_divide(multiply(inverse(A),B),C),double_divide(D,multiply(double_divide(D,double_divide(B,C)),inverse(A)))),
inference(para,[status(thm),theory(equality)],[6,5]),
[iquote('para(6,5)')] ).
cnf(15,plain,
equal(multiply(multiply(double_divide(A,double_divide(B,C)),inverse(D)),A),multiply(C,multiply(inverse(D),B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,2]),2]),
[iquote('para(13,2),demod([2])')] ).
cnf(21,plain,
equal(double_divide(inverse(A),multiply(A,inverse(B))),B),
inference(para,[status(thm),theory(equality)],[6,7]),
[iquote('para(6,7)')] ).
cnf(22,plain,
equal(multiply(multiply(A,inverse(B)),inverse(A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,2]),1]),
[iquote('para(21,2),flip(1)')] ).
cnf(25,plain,
equal(double_divide(multiply(multiply(A,inverse(B)),inverse(C)),multiply(C,inverse(A))),B),
inference(para,[status(thm),theory(equality)],[21,3]),
[iquote('para(21,3)')] ).
cnf(32,plain,
equal(double_divide(inverse(A),multiply(B,inverse(B))),A),
inference(para,[status(thm),theory(equality)],[22,25]),
[iquote('para(22,25)')] ).
cnf(33,plain,
equal(multiply(multiply(A,inverse(A)),inverse(B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,2]),1]),
[iquote('para(32,2),flip(1)')] ).
cnf(34,plain,
equal(double_divide(multiply(A,B),multiply(C,inverse(C))),double_divide(B,A)),
inference(para,[status(thm),theory(equality)],[2,32]),
[iquote('para(2,32)')] ).
cnf(36,plain,
equal(multiply(multiply(A,inverse(A)),multiply(B,C)),multiply(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[34,2]),2]),1]),
[iquote('para(34,2),demod([2]),flip(1)')] ).
cnf(80,plain,
equal(multiply(multiply(double_divide(A,B),inverse(C)),A),multiply(inverse(C),inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,15]),36]),
[iquote('para(32,15),demod([36])')] ).
cnf(81,plain,
equal(multiply(inverse(A),inverse(B)),multiply(multiply(double_divide(C,B),inverse(A)),C)),
inference(flip,[status(thm),theory(equality)],[80]),
[iquote('flip(80)')] ).
cnf(85,plain,
equal(multiply(inverse(A),multiply(B,C)),multiply(B,multiply(inverse(A),C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,81]),15]),
[iquote('para(2,81),demod([15])')] ).
cnf(86,plain,
equal(multiply(A,multiply(inverse(B),C)),multiply(inverse(B),multiply(A,C))),
inference(flip,[status(thm),theory(equality)],[85]),
[iquote('flip(85)')] ).
cnf(95,plain,
equal(multiply(inverse(A),inverse(multiply(B,inverse(B)))),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,80]),22]),1]),
[iquote('para(32,80),demod([22]),flip(1)')] ).
cnf(96,plain,
equal(multiply(multiply(A,B),inverse(multiply(C,inverse(C)))),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,95]),2]),
[iquote('para(2,95),demod([2])')] ).
cnf(98,plain,
equal(double_divide(inverse(multiply(A,inverse(A))),inverse(B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[95,34]),32]),1]),
[iquote('para(95,34),demod([32]),flip(1)')] ).
cnf(99,plain,
equal(double_divide(multiply(A,inverse(B)),inverse(A)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[98,3]),96]),
[iquote('para(98,3),demod([96])')] ).
cnf(103,plain,
equal(double_divide(inverse(A),inverse(multiply(B,inverse(A)))),B),
inference(para,[status(thm),theory(equality)],[22,99]),
[iquote('para(22,99)')] ).
cnf(124,plain,
equal(double_divide(inverse(A),inverse(inverse(A))),multiply(B,inverse(B))),
inference(para,[status(thm),theory(equality)],[95,99]),
[iquote('para(95,99)')] ).
cnf(125,plain,
equal(multiply(A,inverse(A)),double_divide(inverse(B),inverse(inverse(B)))),
inference(flip,[status(thm),theory(equality)],[124]),
[iquote('flip(124)')] ).
cnf(126,plain,
equal(inverse(multiply(A,inverse(A))),multiply(inverse(inverse(B)),inverse(B))),
inference(para,[status(thm),theory(equality)],[124,2]),
[iquote('para(124,2)')] ).
cnf(160,plain,
equal(double_divide(inverse(A),inverse(inverse(A))),inverse(multiply(B,inverse(B)))),
inference(para,[status(thm),theory(equality)],[125,33]),
[iquote('para(125,33)')] ).
cnf(162,plain,
equal(inverse(inverse(multiply(A,inverse(A)))),multiply(inverse(inverse(B)),inverse(B))),
inference(para,[status(thm),theory(equality)],[160,2]),
[iquote('para(160,2)')] ).
cnf(163,plain,
equal(multiply(inverse(inverse(A)),inverse(A)),inverse(inverse(multiply(B,inverse(B))))),
inference(flip,[status(thm),theory(equality)],[162]),
[iquote('flip(162)')] ).
cnf(170,plain,
equal(double_divide(multiply(inverse(inverse(A)),inverse(A)),inverse(B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[126,21]),33]),
[iquote('para(126,21),demod([33])')] ).
cnf(174,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[170,99]),
[iquote('para(170,99)')] ).
cnf(178,plain,
equal(multiply(A,inverse(A)),multiply(B,inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[163]),174,174]),
[iquote('back_demod(163),demod([174,174])')] ).
cnf(187,plain,
equal(double_divide(A,multiply(inverse(A),inverse(B))),B),
inference(para,[status(thm),theory(equality)],[174,21]),
[iquote('para(174,21)')] ).
cnf(190,plain,
equal(double_divide(multiply(A,B),inverse(A)),inverse(B)),
inference(para,[status(thm),theory(equality)],[174,99]),
[iquote('para(174,99)')] ).
cnf(203,plain,
equal(double_divide(A,inverse(multiply(B,A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[174,103]),174]),
[iquote('para(174,103),demod([174])')] ).
cnf(211,plain,
equal(multiply(inverse(multiply(A,B)),B),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[203,2]),1]),
[iquote('para(203,2),flip(1)')] ).
cnf(243,plain,
equal(multiply(inverse(A),multiply(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[190,2]),174]),1]),
[iquote('para(190,2),demod([174]),flip(1)')] ).
cnf(279,plain,
equal(inverse(multiply(A,B)),double_divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[243,190]),174]),1]),
[iquote('para(243,190),demod([174]),flip(1)')] ).
cnf(289,plain,
equal(multiply(double_divide(A,B),A),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[211]),279]),
[iquote('back_demod(211),demod([279])')] ).
cnf(296,plain,
equal(double_divide(A,double_divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[203]),279]),
[iquote('back_demod(203),demod([279])')] ).
cnf(329,plain,
equal(multiply(inverse(A),inverse(B)),double_divide(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[187,296]),1]),
[iquote('para(187,296),flip(1)')] ).
cnf(335,plain,
equal(multiply(multiply(double_divide(A,B),inverse(C)),A),double_divide(C,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[81]),329]),1]),
[iquote('back_demod(81),demod([329]),flip(1)')] ).
cnf(387,plain,
equal(multiply(A,multiply(inverse(B),C)),double_divide(B,double_divide(C,A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[15]),335]),1]),
[iquote('back_demod(15),demod([335]),flip(1)')] ).
cnf(404,plain,
equal(multiply(inverse(A),multiply(B,C)),double_divide(A,double_divide(C,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[86]),387]),1]),
[iquote('back_demod(86),demod([387]),flip(1)')] ).
cnf(410,plain,
equal(double_divide(A,double_divide(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[243]),404]),
[iquote('back_demod(243),demod([404])')] ).
cnf(429,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[410,289]),2]),
[iquote('para(410,289),demod([2])')] ).
cnf(514,plain,
~ equal(multiply(b1,inverse(b1)),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[429,4]),
[iquote('para(429,4)')] ).
cnf(516,plain,
equal(multiply(inverse(A),A),multiply(B,inverse(B))),
inference(para,[status(thm),theory(equality)],[429,178]),
[iquote('para(429,178)')] ).
cnf(517,plain,
equal(multiply(A,inverse(A)),multiply(inverse(B),B)),
inference(flip,[status(thm),theory(equality)],[516]),
[iquote('flip(516)')] ).
cnf(518,plain,
$false,
inference(conflict,[status(thm)],[517,514]),
[iquote('conflict(517,514)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : GRP605-1 : TPTP v8.1.0. Released v2.6.0.
% 0.09/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.32 % Computer : n015.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Mon Jun 13 07:39:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.61/1.04 ----- EQP 0.9e, May 2009 -----
% 0.61/1.04 The job began on n015.cluster.edu, Mon Jun 13 07:39:53 2022
% 0.61/1.04 The command was "./eqp09e".
% 0.61/1.04
% 0.61/1.04 set(prolog_style_variables).
% 0.61/1.04 set(lrpo).
% 0.61/1.04 set(basic_paramod).
% 0.61/1.04 set(functional_subsume).
% 0.61/1.04 set(ordered_paramod).
% 0.61/1.04 set(prime_paramod).
% 0.61/1.04 set(para_pairs).
% 0.61/1.04 assign(pick_given_ratio,4).
% 0.61/1.04 clear(print_kept).
% 0.61/1.04 clear(print_new_demod).
% 0.61/1.04 clear(print_back_demod).
% 0.61/1.04 clear(print_given).
% 0.61/1.04 assign(max_mem,64000).
% 0.61/1.04 end_of_commands.
% 0.61/1.04
% 0.61/1.04 Usable:
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 Sos:
% 0.61/1.04 0 (wt=-1) [] double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),C) = B.
% 0.61/1.04 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.61/1.04 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 Demodulators:
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 Passive:
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 Starting to process input.
% 0.61/1.04
% 0.61/1.04 ** KEPT: 1 (wt=14) [] double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),C) = B.
% 0.61/1.04 1 is a new demodulator.
% 0.61/1.04
% 0.61/1.04 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.61/1.04 2 is a new demodulator.
% 0.61/1.04 -> 2 back demodulating 1.
% 0.61/1.04
% 0.61/1.04 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B) = C.
% 0.61/1.04 3 is a new demodulator.
% 0.61/1.04
% 0.61/1.04 ** KEPT: 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.61/1.04 ---------------- PROOF FOUND ----------------
% 0.61/1.04 % SZS status Unsatisfiable
% 0.61/1.04
% 0.61/1.04
% 0.61/1.04 After processing input:
% 0.61/1.04
% 0.61/1.04 Usable:
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 Sos:
% 0.61/1.04 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.61/1.04 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.61/1.04 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B) = C.
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 Demodulators:
% 0.61/1.04 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.61/1.04 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B) = C.
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 Passive:
% 0.61/1.04 end_of_list.
% 0.61/1.04
% 0.61/1.04 UNIT CONFLICT from 517 and 514 at 0.02 seconds.
% 0.61/1.04
% 0.61/1.04 ---------------- PROOF ----------------
% 0.61/1.04 % SZS output start Refutation
% See solution above
% 0.61/1.05 ------------ end of proof -------------
% 0.61/1.05
% 0.61/1.05
% 0.61/1.05 ------------- memory usage ------------
% 0.61/1.05 Memory dynamically allocated (tp_alloc): 976.
% 0.61/1.05 type (bytes each) gets frees in use avail bytes
% 0.61/1.05 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.61/1.05 term ( 16) 29353 20162 9191 21 177.9 K
% 0.61/1.05 gen_ptr ( 8) 47527 8528 38999 51 305.1 K
% 0.61/1.05 context ( 808) 22713 22711 2 3 3.9 K
% 0.61/1.05 trail ( 12) 2950 2950 0 9 0.1 K
% 0.61/1.05 bt_node ( 68) 7871 7868 3 20 1.5 K
% 0.61/1.05 ac_position (285432) 0 0 0 0 0.0 K
% 0.61/1.05 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.61/1.05 ac_match_free_vars_pos (4020)
% 0.61/1.05 0 0 0 0 0.0 K
% 0.61/1.05 discrim ( 12) 6639 2602 4037 0 47.3 K
% 0.61/1.05 flat ( 40) 65891 65891 0 37 1.4 K
% 0.61/1.05 discrim_pos ( 12) 981 981 0 1 0.0 K
% 0.61/1.05 fpa_head ( 12) 1855 0 1855 0 21.7 K
% 0.61/1.05 fpa_tree ( 28) 1360 1360 0 13 0.4 K
% 0.61/1.05 fpa_pos ( 36) 769 769 0 1 0.0 K
% 0.61/1.05 literal ( 12) 1962 1445 517 1 6.1 K
% 0.61/1.05 clause ( 24) 1962 1445 517 1 12.1 K
% 0.61/1.05 list ( 12) 311 255 56 5 0.7 K
% 0.61/1.05 list_pos ( 20) 2200 893 1307 0 25.5 K
% 0.61/1.05 pair_index ( 40) 2 0 2 0 0.1 K
% 0.61/1.05
% 0.61/1.05 -------------- statistics -------------
% 0.61/1.05 Clauses input 3
% 0.61/1.05 Usable input 0
% 0.61/1.05 Sos input 3
% 0.61/1.05 Demodulators input 0
% 0.61/1.05 Passive input 0
% 0.61/1.05
% 0.61/1.05 Processed BS (before search) 4
% 0.61/1.05 Forward subsumed BS 0
% 0.61/1.05 Kept BS 4
% 0.61/1.05 New demodulators BS 3
% 0.61/1.05 Back demodulated BS 1
% 0.61/1.05
% 0.61/1.05 Clauses or pairs given 1509
% 0.61/1.05 Clauses generated 1132
% 0.61/1.05 Forward subsumed 619
% 0.61/1.05 Deleted by weight 0
% 0.61/1.05 Deleted by variable count 0
% 0.61/1.05 Kept 513
% 0.61/1.05 New demodulators 249
% 0.61/1.05 Back demodulated 194
% 0.61/1.05 Ordered paramod prunes 0
% 0.61/1.05 Basic paramod prunes 5701
% 0.61/1.05 Prime paramod prunes 38
% 0.61/1.05 Semantic prunes 0
% 0.61/1.05
% 0.61/1.05 Rewrite attmepts 10483
% 0.61/1.05 Rewrites 636
% 0.61/1.05
% 0.61/1.05 FPA overloads 0
% 0.61/1.05 FPA underloads 0
% 0.61/1.05
% 0.61/1.05 Usable size 0
% 0.61/1.05 Sos size 321
% 0.61/1.05 Demodulators size 149
% 0.61/1.05 Passive size 0
% 0.61/1.05 Disabled size 195
% 0.61/1.05
% 0.61/1.05 Proofs found 1
% 0.61/1.05
% 0.61/1.05 ----------- times (seconds) ----------- Mon Jun 13 07:39:53 2022
% 0.61/1.05
% 0.61/1.05 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.61/1.05 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.61/1.05 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.61/1.05 input time 0.00
% 0.61/1.05 paramodulation time 0.00
% 0.61/1.05 demodulation time 0.01
% 0.61/1.05 orient time 0.00
% 0.61/1.05 weigh time 0.00
% 0.61/1.05 forward subsume time 0.00
% 0.61/1.05 back demod find time 0.00
% 0.61/1.05 conflict time 0.00
% 0.61/1.05 LRPO time 0.00
% 0.61/1.05 store clause time 0.01
% 0.61/1.05 disable clause time 0.00
% 0.61/1.05 prime paramod time 0.00
% 0.61/1.05 semantics time 0.00
% 0.61/1.05
% 0.61/1.05 EQP interrupted
%------------------------------------------------------------------------------