TSTP Solution File: REL023-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : REL023-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n029.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 : Mon Jul 18 19:15:36 EDT 2022
% Result : Unsatisfiable 1.04s 1.42s
% Output : Refutation 1.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 6 RR)
% Number of literals : 35 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 48 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(join(A,B),join(B,A)),
file('REL023-1.p',unknown),
[] ).
cnf(2,plain,
equal(join(join(A,B),C),join(A,join(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))),A),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(4,plain,
equal(complement(join(complement(A),complement(B))),meet(A,B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(join(meet(A,B),complement(join(complement(A),B))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),4]),
[iquote('back_demod(3),demod([4])')] ).
cnf(7,plain,
equal(composition(A,one),A),
file('REL023-1.p',unknown),
[] ).
cnf(8,plain,
equal(join(composition(A,B),composition(C,B)),composition(join(A,C),B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(9,plain,
equal(converse(converse(A)),A),
file('REL023-1.p',unknown),
[] ).
cnf(11,plain,
equal(converse(composition(A,B)),composition(converse(B),converse(A))),
file('REL023-1.p',unknown),
[] ).
cnf(12,plain,
equal(join(composition(converse(A),complement(composition(A,B))),complement(B)),complement(B)),
file('REL023-1.p',unknown),
[] ).
cnf(13,plain,
equal(join(A,complement(A)),top),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(14,plain,
equal(meet(A,complement(A)),zero),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(15,plain,
~ equal(composition(join(meet(sk1,converse(sk2)),sk1),meet(sk2,sk3)),composition(sk1,meet(sk2,sk3))),
inference(demod,[status(thm),theory(equality)],[8]),
[iquote('demod([8])')] ).
cnf(20,plain,
equal(meet(A,B),meet(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,4]),4]),
[iquote('para(1,4),demod([4])')] ).
cnf(21,plain,
equal(meet(complement(A),A),zero),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,20]),1]),
[iquote('para(14,20),flip(1)')] ).
cnf(24,plain,
equal(join(complement(join(complement(A),B)),meet(A,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,1]),1]),
[iquote('para(5,1),flip(1)')] ).
cnf(28,plain,
equal(join(meet(A,complement(B)),meet(A,B)),A),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(29,plain,
equal(composition(converse(one),converse(A)),converse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,11]),1]),
[iquote('para(7,11),flip(1)')] ).
cnf(30,plain,
equal(composition(converse(one),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,29]),9]),
[iquote('para(9,29),demod([9])')] ).
cnf(31,plain,
equal(converse(one),one),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[30,7]),1]),
[iquote('para(30,7),flip(1)')] ).
cnf(32,plain,
equal(composition(one,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[30]),31]),
[iquote('back_demod(30),demod([31])')] ).
cnf(35,plain,
equal(complement(top),zero),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,4]),14]),
[iquote('para(13,4),demod([14])')] ).
cnf(63,plain,
equal(join(meet(A,complement(complement(A))),zero),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,5]),35]),
[iquote('para(13,5),demod([35])')] ).
cnf(70,plain,
~ equal(composition(join(sk1,meet(sk1,converse(sk2))),meet(sk2,sk3)),composition(sk1,meet(sk2,sk3))),
inference(para,[status(thm),theory(equality)],[1,15]),
[iquote('para(1,15)')] ).
cnf(133,plain,
equal(join(meet(complement(complement(A)),A),zero),A),
inference(para,[status(thm),theory(equality)],[20,63]),
[iquote('para(20,63)')] ).
cnf(134,plain,
equal(join(complement(join(complement(A),B)),join(meet(A,B),C)),join(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[24,2]),1]),
[iquote('para(24,2),flip(1)')] ).
cnf(137,plain,
equal(join(zero,meet(complement(complement(A)),A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[133,1]),1]),
[iquote('para(133,1),flip(1)')] ).
cnf(138,plain,
equal(complement(complement(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,28]),137]),1]),
[iquote('para(21,28),demod([137]),flip(1)')] ).
cnf(172,plain,
equal(complement(join(complement(A),B)),meet(A,complement(B))),
inference(para,[status(thm),theory(equality)],[138,4]),
[iquote('para(138,4)')] ).
cnf(174,plain,
equal(join(meet(A,complement(B)),join(meet(A,B),C)),join(A,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[134]),172]),
[iquote('back_demod(134),demod([172])')] ).
cnf(201,plain,
equal(join(complement(A),complement(A)),complement(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31,12]),32,32]),
[iquote('para(31,12),demod([32,32])')] ).
cnf(215,plain,
equal(join(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[138,201]),138,138]),
[iquote('para(138,201),demod([138,138])')] ).
cnf(1982,plain,
equal(join(A,meet(A,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[215,174]),28]),1]),
[iquote('para(215,174),demod([28]),flip(1)')] ).
cnf(1984,plain,
~ equal(composition(sk1,meet(sk2,sk3)),composition(sk1,meet(sk2,sk3))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[70]),1982]),
[iquote('back_demod(70),demod([1982])')] ).
cnf(1985,plain,
$false,
inference(conflict,[status(thm)],[1984]),
[iquote('xx_conflict(1984)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : REL023-1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.09 % Command : tptp2X_and_run_eqp %s
% 0.09/0.29 % Computer : n029.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Fri Jul 8 14:12:44 EDT 2022
% 0.09/0.29 % CPUTime :
% 1.04/1.42 ----- EQP 0.9e, May 2009 -----
% 1.04/1.42 The job began on n029.cluster.edu, Fri Jul 8 14:12:45 2022
% 1.04/1.42 The command was "./eqp09e".
% 1.04/1.42
% 1.04/1.42 set(prolog_style_variables).
% 1.04/1.42 set(lrpo).
% 1.04/1.42 set(basic_paramod).
% 1.04/1.42 set(functional_subsume).
% 1.04/1.42 set(ordered_paramod).
% 1.04/1.42 set(prime_paramod).
% 1.04/1.42 set(para_pairs).
% 1.04/1.42 assign(pick_given_ratio,4).
% 1.04/1.42 clear(print_kept).
% 1.04/1.42 clear(print_new_demod).
% 1.04/1.42 clear(print_back_demod).
% 1.04/1.42 clear(print_given).
% 1.04/1.42 assign(max_mem,64000).
% 1.04/1.42 end_of_commands.
% 1.04/1.42
% 1.04/1.42 Usable:
% 1.04/1.42 end_of_list.
% 1.04/1.42
% 1.04/1.42 Sos:
% 1.04/1.42 0 (wt=-1) [] join(A,B) = join(B,A).
% 1.04/1.42 0 (wt=-1) [] join(A,join(B,C)) = join(join(A,B),C).
% 1.04/1.42 0 (wt=-1) [] A = join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))).
% 1.04/1.42 0 (wt=-1) [] meet(A,B) = complement(join(complement(A),complement(B))).
% 1.04/1.42 0 (wt=-1) [] composition(A,composition(B,C)) = composition(composition(A,B),C).
% 1.04/1.42 0 (wt=-1) [] composition(A,one) = A.
% 1.04/1.42 0 (wt=-1) [] composition(join(A,B),C) = join(composition(A,C),composition(B,C)).
% 1.04/1.42 0 (wt=-1) [] converse(converse(A)) = A.
% 1.04/1.42 0 (wt=-1) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 1.04/1.42 0 (wt=-1) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 1.04/1.42 0 (wt=-1) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 1.04/1.42 0 (wt=-1) [] top = join(A,complement(A)).
% 1.04/1.42 0 (wt=-1) [] zero = meet(A,complement(A)).
% 1.04/1.42 0 (wt=-1) [] -(join(composition(meet(sk1,converse(sk2)),meet(sk2,sk3)),composition(sk1,meet(sk2,sk3))) = composition(sk1,meet(sk2,sk3))).
% 1.04/1.42 end_of_list.
% 1.04/1.42
% 1.04/1.42 Demodulators:
% 1.04/1.42 end_of_list.
% 1.04/1.42
% 1.04/1.42 Passive:
% 1.04/1.42 end_of_list.
% 1.04/1.42
% 1.04/1.42 Starting to process input.
% 1.04/1.42
% 1.04/1.42 ** KEPT: 1 (wt=7) [] join(A,B) = join(B,A).
% 1.04/1.42 clause forward subsumed: 0 (wt=7) [flip(1)] join(B,A) = join(A,B).
% 1.04/1.42
% 1.04/1.42 ** KEPT: 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 1.04/1.42 2 is a new demodulator.
% 1.04/1.42
% 1.04/1.42 ** KEPT: 3 (wt=14) [flip(1)] join(complement(join(complement(A),complement(B))),complement(join(complement(A),B))) = A.
% 1.04/1.42 3 is a new demodulator.
% 1.04/1.42
% 1.04/1.42 ** KEPT: 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 1.04/1.42 4 is a new demodulator.
% 1.04/1.42 -> 4 back demodulating 3.
% 1.04/1.42
% 1.04/1.42 ** KEPT: 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 1.04/1.42 5 is a new demodulator.
% 1.04/1.42
% 1.04/1.42 ** KEPT: 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 1.04/1.42 6 is a new demodulator.
% 1.04/1.42
% 1.04/1.42 ** KEPT: 7 (wt=5) [] composition(A,one) = A.
% 1.04/1.42 7 is a new demodulator.
% 1.04/1.42
% 1.04/1.42 ** KEPT: 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 1.04/1.42 8 is a new demodulator.
% 1.04/1.42
% 1.04/1.42 ** KEPT: 9 (wt=5) [] converse(converse(A)) = A.
% 1.04/1.42 9 is a new demodulator.
% 1.04/1.42
% 1.04/1.42 ** KEPT: 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 1.04/1.42 10 is a new demodulator.
% 1.04/1.42
% 1.04/1.42 ** KEPT: 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 1.04/1.42 11 is a new demodulator.
% 1.04/1.42
% 1.04/1.42 ** KEPT: 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 1.04/1.42 12 is a new demodulator.
% 1.04/1.42
% 1.04/1.42 ** KEPT: 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 1.04/1.42 13 is a new demodulator.
% 1.04/1.42
% 1.04/1.42 ** KEPT: 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 1.04/1.42 14 is a new demodulator.
% 1.04/1.42
% 1.04/1.42 ** KEPT: 15 (wt=16) [demod([8])] -(composition(join(meet(sk1,converse(sk2)),sk1),meet(sk2,sk3)) = composition(sk1,meet(sk2,sk3))).
% 1.04/1.42 ---------------- PROOF FOUND ----------------
% 1.04/1.42 % SZS status Unsatisfiable
% 1.04/1.42
% 1.04/1.42
% 1.04/1.42 After processing input:
% 1.04/1.42
% 1.04/1.42 Usable:
% 1.04/1.42 end_of_list.
% 1.04/1.42
% 1.04/1.42 Sos:
% 1.04/1.42 7 (wt=5) [] composition(A,one) = A.
% 1.04/1.42 9 (wt=5) [] converse(converse(A)) = A.
% 1.04/1.42 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 1.04/1.42 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 1.04/1.42 1 (wt=7) [] join(A,B) = join(B,A).
% 1.04/1.42 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 1.04/1.42 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 1.04/1.42 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 1.04/1.42 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 1.04/1.42 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 1.04/1.42 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 1.04/1.42 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 1.04/1.42 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 1.04/1.42 15 (wt=16) [demod([8])] -(composition(join(meet(sk1,converse(sk2)),sk1),meet(sk2,sk3)) = composition(sk1,meet(sk2,sk3))).
% 1.04/1.42 end_of_list.
% 1.04/1.42
% 1.04/1.42 Demodulators:
% 1.04/1.42 2 (wt=11) [flip(1)] join(join(A,B),C) = join(A,join(B,C)).
% 1.04/1.42 4 (wt=10) [flip(1)] complement(join(complement(A),complement(B))) = meet(A,B).
% 1.04/1.42 5 (wt=11) [back_demod(3),demod([4])] join(meet(A,B),complement(join(complement(A),B))) = A.
% 1.04/1.42 6 (wt=11) [flip(1)] composition(composition(A,B),C) = composition(A,composition(B,C)).
% 1.04/1.42 7 (wt=5) [] composition(A,one) = A.
% 1.04/1.42 8 (wt=13) [flip(1)] join(composition(A,B),composition(C,B)) = composition(join(A,C),B).
% 1.04/1.42 9 (wt=5) [] converse(converse(A)) = A.
% 1.04/1.42 10 (wt=10) [] converse(join(A,B)) = join(converse(A),converse(B)).
% 1.04/1.42 11 (wt=10) [] converse(composition(A,B)) = composition(converse(B),converse(A)).
% 1.04/1.42 12 (wt=13) [] join(composition(converse(A),complement(composition(A,B))),complement(B)) = complement(B).
% 1.04/1.42 13 (wt=6) [flip(1)] join(A,complement(A)) = top.
% 1.04/1.42 14 (wt=6) [flip(1)] meet(A,complement(A)) = zero.
% 1.04/1.42 end_of_list.
% 1.04/1.42
% 1.04/1.42 Passive:
% 1.04/1.42 end_of_list.
% 1.04/1.42
% 1.04/1.42 UNIT CONFLICT from 1984 and x=x at 0.16 seconds.
% 1.04/1.42
% 1.04/1.42 ---------------- PROOF ----------------
% 1.04/1.42 % SZS output start Refutation
% See solution above
% 1.04/1.42 ------------ end of proof -------------
% 1.04/1.42
% 1.04/1.42
% 1.04/1.42 ------------- memory usage ------------
% 1.04/1.42 Memory dynamically allocated (tp_alloc): 2929.
% 1.04/1.42 type (bytes each) gets frees in use avail bytes
% 1.04/1.42 sym_ent ( 96) 62 0 62 0 5.8 K
% 1.04/1.42 term ( 16) 211189 173149 38040 20 735.6 K
% 1.04/1.42 gen_ptr ( 8) 208506 45051 163455 34 1277.3 K
% 1.04/1.42 context ( 808) 273355 273353 2 4 4.7 K
% 1.04/1.42 trail ( 12) 20128 20128 0 6 0.1 K
% 1.04/1.42 bt_node ( 68) 123476 123473 3 19 1.5 K
% 1.04/1.42 ac_position (285432) 0 0 0 0 0.0 K
% 1.04/1.42 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.04/1.42 ac_match_free_vars_pos (4020)
% 1.04/1.42 0 0 0 0 0.0 K
% 1.04/1.42 discrim ( 12) 26733 3847 22886 54 268.8 K
% 1.04/1.42 flat ( 40) 402645 402645 0 45 1.8 K
% 1.04/1.42 discrim_pos ( 12) 13070 13070 0 1 0.0 K
% 1.04/1.42 fpa_head ( 12) 6212 0 6212 0 72.8 K
% 1.04/1.42 fpa_tree ( 28) 5809 5809 0 21 0.6 K
% 1.04/1.42 fpa_pos ( 36) 3136 3136 0 1 0.0 K
% 1.04/1.42 literal ( 12) 11652 9668 1984 0 23.2 K
% 1.04/1.42 clause ( 24) 11652 9668 1984 0 46.5 K
% 1.04/1.42 list ( 12) 1212 1155 57 3 0.7 K
% 1.04/1.42 list_pos ( 20) 7848 1775 6073 23 119.1 K
% 1.04/1.42 pair_index ( 40) 2 0 2 0 0.1 K
% 1.04/1.42
% 1.04/1.42 -------------- statistics -------------
% 1.04/1.42 Clauses input 14
% 1.04/1.42 Usable input 0
% 1.04/1.42 Sos input 14
% 1.04/1.42 Demodulators input 0
% 1.04/1.42 Passive input 0
% 1.04/1.42
% 1.04/1.42 Processed BS (before search) 16
% 1.04/1.42 Forward subsumed BS 1
% 1.04/1.42 Kept BS 15
% 1.04/1.42 New demodulators BS 13
% 1.04/1.42 Back demodulated BS 1
% 1.04/1.42
% 1.04/1.42 Clauses or pairs given 22595
% 1.04/1.42 Clauses generated 7920
% 1.04/1.42 Forward subsumed 5951
% 1.04/1.42 Deleted by weight 0
% 1.04/1.42 Deleted by variable count 0
% 1.04/1.42 Kept 1969
% 1.04/1.42 New demodulators 1140
% 1.04/1.42 Back demodulated 362
% 1.04/1.42 Ordered paramod prunes 0
% 1.04/1.42 Basic paramod prunes 69775
% 1.04/1.42 Prime paramod prunes 643
% 1.04/1.42 Semantic prunes 0
% 1.04/1.42
% 1.04/1.42 Rewrite attmepts 83173
% 1.04/1.42 Rewrites 10886
% 1.04/1.42
% 1.04/1.42 FPA overloads 0
% 1.04/1.42 FPA underloads 0
% 1.04/1.42
% 1.04/1.42 Usable size 0
% 1.04/1.42 Sos size 1620
% 1.04/1.42 Demodulators size 850
% 1.04/1.42 Passive size 0
% 1.04/1.42 Disabled size 363
% 1.04/1.42
% 1.04/1.42 Proofs found 1
% 1.04/1.42
% 1.04/1.42 ----------- times (seconds) ----------- Fri Jul 8 14:12:46 2022
% 1.04/1.42
% 1.04/1.42 user CPU time 0.16 (0 hr, 0 min, 0 sec)
% 1.04/1.42 system CPU time 0.24 (0 hr, 0 min, 0 sec)
% 1.04/1.42 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.04/1.42 input time 0.00
% 1.04/1.42 paramodulation time 0.05
% 1.04/1.42 demodulation time 0.01
% 1.04/1.42 orient time 0.02
% 1.04/1.42 weigh time 0.00
% 1.04/1.42 forward subsume time 0.01
% 1.04/1.42 back demod find time 0.00
% 1.04/1.42 conflict time 0.00
% 1.04/1.42 LRPO time 0.01
% 1.04/1.42 store clause time 0.01
% 1.04/1.42 disable clause time 0.00
% 1.04/1.42 prime paramod time 0.01
% 1.04/1.42 semantics time 0.00
% 1.04/1.42
% 1.04/1.42 EQP interrupted
%------------------------------------------------------------------------------