TSTP Solution File: GRP169-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP169-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %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 : 600s
% DateTime : Sat Jul 16 08:45:39 EDT 2022
% Result : Unsatisfiable 0.83s 1.28s
% Output : Refutation 0.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 7 RR)
% Number of literals : 27 ( 0 equ; 1 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 37 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP169-2.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP169-2.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP169-2.p',unknown),
[] ).
cnf(4,plain,
equal(greatest_lower_bound(A,B),greatest_lower_bound(B,A)),
file('GRP169-2.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP169-2.p',unknown),
[] ).
cnf(10,plain,
equal(least_upper_bound(A,greatest_lower_bound(A,B)),A),
file('GRP169-2.p',unknown),
[] ).
cnf(11,plain,
equal(greatest_lower_bound(A,least_upper_bound(A,B)),A),
file('GRP169-2.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP169-2.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP169-2.p',unknown),
[] ).
cnf(16,plain,
equal(greatest_lower_bound(inverse(a),inverse(b)),inverse(a)),
file('GRP169-2.p',unknown),
[] ).
cnf(17,plain,
~ equal(greatest_lower_bound(a,b),b),
file('GRP169-2.p',unknown),
[] ).
cnf(18,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)],[2,3]),1]),1]),
[iquote('para(2,3),demod([1]),flip(1)')] ).
cnf(20,plain,
equal(least_upper_bound(A,greatest_lower_bound(B,A)),A),
inference(para,[status(thm),theory(equality)],[4,10]),
[iquote('para(4,10)')] ).
cnf(26,plain,
equal(greatest_lower_bound(A,least_upper_bound(B,A)),A),
inference(para,[status(thm),theory(equality)],[5,11]),
[iquote('para(5,11)')] ).
cnf(41,plain,
equal(multiply(inverse(inverse(A)),identity),A),
inference(para,[status(thm),theory(equality)],[2,18]),
[iquote('para(2,18)')] ).
cnf(48,plain,
equal(least_upper_bound(inverse(b),inverse(a)),inverse(b)),
inference(para,[status(thm),theory(equality)],[16,20]),
[iquote('para(16,20)')] ).
cnf(52,plain,
equal(multiply(inverse(inverse(A)),B),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[18,18]),
[iquote('para(18,18)')] ).
cnf(53,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[41]),52]),
[iquote('back_demod(41),demod([52])')] ).
cnf(54,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[52,53]),53]),1]),
[iquote('para(52,53),demod([53]),flip(1)')] ).
cnf(56,plain,
equal(multiply(A,inverse(A)),identity),
inference(para,[status(thm),theory(equality)],[54,2]),
[iquote('para(54,2)')] ).
cnf(63,plain,
equal(least_upper_bound(multiply(inverse(least_upper_bound(A,B)),multiply(A,C)),multiply(inverse(least_upper_bound(A,B)),multiply(B,C))),C),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,18]),12]),
[iquote('para(14,18),demod([12])')] ).
cnf(95,plain,
equal(multiply(A,multiply(inverse(A),B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[56,3]),1]),1]),
[iquote('para(56,3),demod([1]),flip(1)')] ).
cnf(448,plain,
equal(least_upper_bound(A,multiply(b,multiply(inverse(a),A))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[48,63]),54,95,48,54]),
[iquote('para(48,63),demod([54,95,48,54])')] ).
cnf(470,plain,
equal(least_upper_bound(a,b),a),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,448]),53]),
[iquote('para(2,448),demod([53])')] ).
cnf(480,plain,
equal(greatest_lower_bound(b,a),b),
inference(para,[status(thm),theory(equality)],[470,26]),
[iquote('para(470,26)')] ).
cnf(490,plain,
equal(greatest_lower_bound(a,b),b),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[480,4]),1]),
[iquote('para(480,4),flip(1)')] ).
cnf(491,plain,
$false,
inference(conflict,[status(thm)],[490,17]),
[iquote('conflict(490,17)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP169-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.13 % Command : tptp2X_and_run_eqp %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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 12:02:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.83/1.28 ----- EQP 0.9e, May 2009 -----
% 0.83/1.28 The job began on n020.cluster.edu, Mon Jun 13 12:02:51 2022
% 0.83/1.28 The command was "./eqp09e".
% 0.83/1.28
% 0.83/1.28 set(prolog_style_variables).
% 0.83/1.28 set(lrpo).
% 0.83/1.28 set(basic_paramod).
% 0.83/1.28 set(functional_subsume).
% 0.83/1.28 set(ordered_paramod).
% 0.83/1.28 set(prime_paramod).
% 0.83/1.28 set(para_pairs).
% 0.83/1.28 assign(pick_given_ratio,4).
% 0.83/1.28 clear(print_kept).
% 0.83/1.28 clear(print_new_demod).
% 0.83/1.28 clear(print_back_demod).
% 0.83/1.28 clear(print_given).
% 0.83/1.28 assign(max_mem,64000).
% 0.83/1.28 end_of_commands.
% 0.83/1.28
% 0.83/1.28 Usable:
% 0.83/1.28 end_of_list.
% 0.83/1.28
% 0.83/1.28 Sos:
% 0.83/1.28 0 (wt=-1) [] multiply(identity,A) = A.
% 0.83/1.28 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.83/1.28 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.83/1.28 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.83/1.28 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.83/1.28 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.83/1.28 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.83/1.28 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.83/1.28 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.83/1.28 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.83/1.28 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.83/1.28 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.83/1.28 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.83/1.28 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.83/1.28 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.83/1.28 0 (wt=-1) [] greatest_lower_bound(inverse(a),inverse(b)) = inverse(a).
% 0.83/1.28 0 (wt=-1) [] -(greatest_lower_bound(a,b) = b).
% 0.83/1.28 end_of_list.
% 0.83/1.28
% 0.83/1.28 Demodulators:
% 0.83/1.28 end_of_list.
% 0.83/1.28
% 0.83/1.28 Passive:
% 0.83/1.28 end_of_list.
% 0.83/1.28
% 0.83/1.28 Starting to process input.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.83/1.28 1 is a new demodulator.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.83/1.28 2 is a new demodulator.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.83/1.28 3 is a new demodulator.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.83/1.28 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.83/1.28
% 0.83/1.28 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.83/1.28 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.83/1.28
% 0.83/1.28 ** KEPT: 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.83/1.28 6 is a new demodulator.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.83/1.28 7 is a new demodulator.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.83/1.28 8 is a new demodulator.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.83/1.28 9 is a new demodulator.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.83/1.28 10 is a new demodulator.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.83/1.28 11 is a new demodulator.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.83/1.28 12 is a new demodulator.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.83/1.28 13 is a new demodulator.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.83/1.28 14 is a new demodulator.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.83/1.28 15 is a new demodulator.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 16 (wt=8) [] greatest_lower_bound(inverse(a),inverse(b)) = inverse(a).
% 0.83/1.28 16 is a new demodulator.
% 0.83/1.28
% 0.83/1.28 ** KEPT: 17 (wt=5) [] -(greatest_lower_bound(a,b) = b).
% 0.83/1.28 ---------------- PROOF FOUND ----------------
% 0.83/1.28 % SZS status Unsatisfiable
% 0.83/1.28
% 0.83/1.28
% 0.83/1.28 After processing input:
% 0.83/1.28
% 0.83/1.28 Usable:
% 0.83/1.28 end_of_list.
% 0.83/1.28
% 0.83/1.28 Sos:
% 0.83/1.28 1 (wt=5) [] multiply(identity,A) = A.
% 0.83/1.28 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.83/1.28 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.83/1.28 17 (wt=5) [] -(greatest_lower_bound(a,b) = b).
% 0.83/1.28 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.83/1.28 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.83/1.28 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.83/1.28 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.83/1.28 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.83/1.28 16 (wt=8) [] greatest_lower_bound(inverse(a),inverse(b)) = inverse(a).
% 0.83/1.28 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.83/1.28 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.83/1.28 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.83/1.28 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.83/1.28 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.83/1.28 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.83/1.28 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.83/1.28 end_of_list.
% 0.83/1.28
% 0.83/1.28 Demodulators:
% 0.83/1.28 1 (wt=5) [] multiply(identity,A) = A.
% 0.83/1.28 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.83/1.28 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.83/1.28 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.83/1.28 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.83/1.28 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.83/1.28 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.83/1.28 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.83/1.28 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.83/1.28 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.83/1.28 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.83/1.28 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.83/1.28 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.83/1.28 16 (wt=8) [] greatest_lower_bound(inverse(a),inverse(b)) = inverse(a).
% 0.83/1.28 end_of_list.
% 0.83/1.28
% 0.83/1.28 Passive:
% 0.83/1.28 end_of_list.
% 0.83/1.28
% 0.83/1.28 UNIT CONFLICT from 490 and 17 at 0.04 seconds.
% 0.83/1.28
% 0.83/1.28 ---------------- PROOF ----------------
% 0.83/1.28 % SZS output start Refutation
% See solution above
% 0.83/1.28 ------------ end of proof -------------
% 0.83/1.28
% 0.83/1.28
% 0.83/1.28 ------------- memory usage ------------
% 0.83/1.28 Memory dynamically allocated (tp_alloc): 976.
% 0.83/1.28 type (bytes each) gets frees in use avail bytes
% 0.83/1.28 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.83/1.28 term ( 16) 58129 49162 8967 31 173.8 K
% 0.83/1.28 gen_ptr ( 8) 47159 10354 36805 26 287.7 K
% 0.83/1.28 context ( 808) 55107 55105 2 5 5.5 K
% 0.83/1.28 trail ( 12) 2749 2749 0 5 0.1 K
% 0.83/1.28 bt_node ( 68) 22834 22831 3 14 1.1 K
% 0.83/1.28 ac_position (285432) 0 0 0 0 0.0 K
% 0.83/1.28 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.83/1.28 ac_match_free_vars_pos (4020)
% 0.83/1.28 0 0 0 0 0.0 K
% 0.83/1.28 discrim ( 12) 8529 372 8157 0 95.6 K
% 0.83/1.28 flat ( 40) 94527 94527 0 91 3.6 K
% 0.83/1.28 discrim_pos ( 12) 3130 3130 0 1 0.0 K
% 0.83/1.28 fpa_head ( 12) 2587 0 2587 0 30.3 K
% 0.83/1.28 fpa_tree ( 28) 1782 1782 0 39 1.1 K
% 0.83/1.28 fpa_pos ( 36) 918 918 0 1 0.0 K
% 0.83/1.28 literal ( 12) 2775 2285 490 1 5.8 K
% 0.83/1.28 clause ( 24) 2775 2285 490 1 11.5 K
% 0.83/1.28 list ( 12) 487 431 56 3 0.7 K
% 0.83/1.28 list_pos ( 20) 1960 131 1829 0 35.7 K
% 0.83/1.28 pair_index ( 40) 2 0 2 0 0.1 K
% 0.83/1.28
% 0.83/1.28 -------------- statistics -------------
% 0.83/1.28 Clauses input 17
% 0.83/1.28 Usable input 0
% 0.83/1.28 Sos input 17
% 0.83/1.28 Demodulators input 0
% 0.83/1.28 Passive input 0
% 0.83/1.28
% 0.83/1.28 Processed BS (before search) 19
% 0.83/1.28 Forward subsumed BS 2
% 0.83/1.28 Kept BS 17
% 0.83/1.28 New demodulators BS 14
% 0.83/1.28 Back demodulated BS 0
% 0.83/1.28
% 0.83/1.28 Clauses or pairs given 5068
% 0.83/1.28 Clauses generated 1962
% 0.83/1.28 Forward subsumed 1489
% 0.83/1.28 Deleted by weight 0
% 0.83/1.28 Deleted by variable count 0
% 0.83/1.28 Kept 473
% 0.83/1.28 New demodulators 414
% 0.83/1.28 Back demodulated 24
% 0.83/1.28 Ordered paramod prunes 0
% 0.83/1.28 Basic paramod prunes 15353
% 0.83/1.28 Prime paramod prunes 58
% 0.83/1.28 Semantic prunes 0
% 0.83/1.28
% 0.83/1.28 Rewrite attmepts 20069
% 0.83/1.28 Rewrites 2862
% 0.83/1.28
% 0.83/1.28 FPA overloads 0
% 0.83/1.28 FPA underloads 0
% 0.83/1.28
% 0.83/1.28 Usable size 0
% 0.83/1.28 Sos size 465
% 0.83/1.28 Demodulators size 410
% 0.83/1.28 Passive size 0
% 0.83/1.28 Disabled size 24
% 0.83/1.28
% 0.83/1.28 Proofs found 1
% 0.83/1.28
% 0.83/1.28 ----------- times (seconds) ----------- Mon Jun 13 12:02:51 2022
% 0.83/1.28
% 0.83/1.28 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.83/1.28 system CPU time 0.08 (0 hr, 0 min, 0 sec)
% 0.83/1.28 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.83/1.28 input time 0.00
% 0.83/1.28 paramodulation time 0.01
% 0.83/1.28 demodulation time 0.00
% 0.83/1.28 orient time 0.00
% 0.83/1.28 weigh time 0.00
% 0.83/1.28 forward subsume time 0.00
% 0.83/1.28 back demod find time 0.00
% 0.83/1.28 conflict time 0.00
% 0.83/1.28 LRPO time 0.00
% 0.83/1.28 store clause time 0.01
% 0.83/1.28 disable clause time 0.00
% 0.83/1.28 prime paramod time 0.00
% 0.83/1.28 semantics time 0.00
% 0.83/1.28
% 0.83/1.28 EQP interrupted
%------------------------------------------------------------------------------