TSTP Solution File: GRP185-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP185-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n028.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:50 EDT 2022
% Result : Unsatisfiable 0.77s 1.18s
% Output : Refutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 3 RR)
% Number of literals : 18 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 35 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP185-4.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP185-4.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP185-4.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP185-4.p',unknown),
[] ).
cnf(7,plain,
equal(least_upper_bound(least_upper_bound(A,B),C),least_upper_bound(A,least_upper_bound(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(11,plain,
equal(greatest_lower_bound(A,least_upper_bound(A,B)),A),
file('GRP185-4.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP185-4.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP185-4.p',unknown),
[] ).
cnf(17,plain,
equal(inverse(inverse(A)),A),
file('GRP185-4.p',unknown),
[] ).
cnf(19,plain,
~ equal(greatest_lower_bound(least_upper_bound(multiply(a,b),identity),least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(multiply(a,identity),identity)))),least_upper_bound(multiply(a,b),identity)),
inference(demod,[status(thm),theory(equality)],[12,14,1,14,1,7]),
[iquote('demod([12,14,1,14,1,7])')] ).
cnf(21,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(30,plain,
equal(least_upper_bound(A,least_upper_bound(B,C)),least_upper_bound(C,least_upper_bound(A,B))),
inference(para,[status(thm),theory(equality)],[7,5]),
[iquote('para(7,5)')] ).
cnf(31,plain,
equal(least_upper_bound(A,least_upper_bound(B,C)),least_upper_bound(B,least_upper_bound(C,A))),
inference(flip,[status(thm),theory(equality)],[30]),
[iquote('flip(30)')] ).
cnf(43,plain,
equal(greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(A,least_upper_bound(B,C))),least_upper_bound(A,B)),
inference(para,[status(thm),theory(equality)],[7,11]),
[iquote('para(7,11)')] ).
cnf(44,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,21]),17]),
[iquote('para(2,21),demod([17])')] ).
cnf(45,plain,
~ equal(greatest_lower_bound(least_upper_bound(multiply(a,b),identity),least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(a,identity)))),least_upper_bound(multiply(a,b),identity)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[19]),44]),
[iquote('back_demod(19),demod([44])')] ).
cnf(222,plain,
equal(greatest_lower_bound(least_upper_bound(A,B),least_upper_bound(A,least_upper_bound(C,least_upper_bound(D,B)))),least_upper_bound(A,B)),
inference(para,[status(thm),theory(equality)],[31,43]),
[iquote('para(31,43)')] ).
cnf(223,plain,
$false,
inference(conflict,[status(thm)],[222,45]),
[iquote('conflict(222,45)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP185-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.35 % Computer : n028.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 13:42:54 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.74/1.13 ----- EQP 0.9e, May 2009 -----
% 0.74/1.13 The job began on n028.cluster.edu, Tue Jun 14 13:42:55 2022
% 0.74/1.13 The command was "./eqp09e".
% 0.74/1.13
% 0.74/1.13 set(prolog_style_variables).
% 0.74/1.13 set(lrpo).
% 0.74/1.13 set(basic_paramod).
% 0.74/1.13 set(functional_subsume).
% 0.74/1.13 set(ordered_paramod).
% 0.74/1.13 set(prime_paramod).
% 0.74/1.13 set(para_pairs).
% 0.74/1.13 assign(pick_given_ratio,4).
% 0.74/1.13 clear(print_kept).
% 0.74/1.13 clear(print_new_demod).
% 0.74/1.13 clear(print_back_demod).
% 0.74/1.13 clear(print_given).
% 0.74/1.13 assign(max_mem,64000).
% 0.74/1.13 end_of_commands.
% 0.74/1.13
% 0.74/1.13 Usable:
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Sos:
% 0.74/1.13 0 (wt=-1) [] multiply(identity,A) = A.
% 0.74/1.13 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.74/1.13 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.74/1.13 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.74/1.13 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.74/1.13 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.74/1.13 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.74/1.13 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.74/1.13 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.74/1.13 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.74/1.13 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.74/1.13 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.74/1.13 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.74/1.13 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.74/1.13 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.74/1.13 0 (wt=-1) [] inverse(identity) = identity.
% 0.74/1.13 0 (wt=-1) [] inverse(inverse(A)) = A.
% 0.74/1.13 0 (wt=-1) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.74/1.13 0 (wt=-1) [] -(greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) = least_upper_bound(multiply(a,b),identity)).
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Demodulators:
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Passive:
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Starting to process input.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.74/1.13 1 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.74/1.13 2 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.74/1.13 3 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.74/1.13 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.74/1.13
% 0.74/1.13 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.74/1.13 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.74/1.13
% 0.74/1.13 ** 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.74/1.13 6 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** 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.74/1.13 7 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.74/1.13 8 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.74/1.13 9 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.74/1.13 10 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.74/1.13 11 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.74/1.13 12 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.74/1.13 13 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.74/1.13 14 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.74/1.13 15 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 16 (wt=4) [] inverse(identity) = identity.
% 0.74/1.13 16 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.74/1.13 17 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.74/1.13 18 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 19 (wt=23) [demod([12,14,1,14,1,7])] -(greatest_lower_bound(least_upper_bound(multiply(a,b),identity),least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(multiply(a,identity),identity)))) = least_upper_bound(multiply(a,b),identity)).
% 0.77/1.18 ---------------- PROOF FOUND ----------------
% 0.77/1.18 % SZS status Unsatisfiable
% 0.77/1.18
% 0.77/1.18
% 0.77/1.18 After processing input:
% 0.77/1.18
% 0.77/1.18 Usable:
% 0.77/1.18 end_of_list.
% 0.77/1.18
% 0.77/1.18 Sos:
% 0.77/1.18 16 (wt=4) [] inverse(identity) = identity.
% 0.77/1.18 1 (wt=5) [] multiply(identity,A) = A.
% 0.77/1.18 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.77/1.18 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.77/1.18 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.77/1.18 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.77/1.18 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.77/1.18 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.77/1.18 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.77/1.18 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.77/1.18 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.77/1.18 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.77/1.18 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.77/1.18 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.77/1.18 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.77/1.18 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.77/1.18 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.77/1.18 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.77/1.18 19 (wt=23) [demod([12,14,1,14,1,7])] -(greatest_lower_bound(least_upper_bound(multiply(a,b),identity),least_upper_bound(multiply(a,b),least_upper_bound(b,least_upper_bound(multiply(a,identity),identity)))) = least_upper_bound(multiply(a,b),identity)).
% 0.77/1.18 end_of_list.
% 0.77/1.18
% 0.77/1.18 Demodulators:
% 0.77/1.18 1 (wt=5) [] multiply(identity,A) = A.
% 0.77/1.18 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.77/1.18 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.77/1.18 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.77/1.18 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.77/1.18 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.77/1.18 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.77/1.18 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.77/1.18 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.77/1.18 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.77/1.18 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.77/1.18 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.77/1.18 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.77/1.18 16 (wt=4) [] inverse(identity) = identity.
% 0.77/1.18 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.77/1.18 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.77/1.18 end_of_list.
% 0.77/1.18
% 0.77/1.18 Passive:
% 0.77/1.18 end_of_list.
% 0.77/1.18
% 0.77/1.18 UNIT CONFLICT from 222 and 45 at 0.02 seconds.
% 0.77/1.18
% 0.77/1.18 ---------------- PROOF ----------------
% 0.77/1.18 % SZS output start Refutation
% See solution above
% 0.77/1.18 ------------ end of proof -------------
% 0.77/1.18
% 0.77/1.18
% 0.77/1.18 ------------- memory usage ------------
% 0.77/1.18 Memory dynamically allocated (tp_alloc): 488.
% 0.77/1.18 type (bytes each) gets frees in use avail bytes
% 0.77/1.18 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.77/1.18 term ( 16) 27127 24155 2972 25 57.7 K
% 0.77/1.18 gen_ptr ( 8) 16096 5690 10406 17 81.4 K
% 0.77/1.18 context ( 808) 21271 21269 2 5 5.5 K
% 0.77/1.18 trail ( 12) 1302 1302 0 4 0.0 K
% 0.77/1.18 bt_node ( 68) 9188 9185 3 6 0.6 K
% 0.77/1.18 ac_position (285432) 0 0 0 0 0.0 K
% 0.77/1.18 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.77/1.18 ac_match_free_vars_pos (4020)
% 0.77/1.18 0 0 0 0 0.0 K
% 0.77/1.18 discrim ( 12) 2191 68 2123 0 24.9 K
% 0.77/1.18 flat ( 40) 37712 37712 0 17 0.7 K
% 0.77/1.18 discrim_pos ( 12) 1616 1616 0 1 0.0 K
% 0.77/1.18 fpa_head ( 12) 884 0 884 0 10.4 K
% 0.77/1.18 fpa_tree ( 28) 439 439 0 25 0.7 K
% 0.77/1.18 fpa_pos ( 36) 399 399 0 1 0.0 K
% 0.77/1.18 literal ( 12) 1552 1330 222 1 2.6 K
% 0.77/1.18 clause ( 24) 1552 1330 222 1 5.2 K
% 0.77/1.18 list ( 12) 236 180 56 3 0.7 K
% 0.77/1.18 list_pos ( 20) 875 52 823 0 16.1 K
% 0.77/1.18 pair_index ( 40) 2 0 2 0 0.1 K
% 0.77/1.18
% 0.77/1.18 -------------- statistics -------------
% 0.77/1.18 Clauses input 19
% 0.77/1.18 Usable input 0
% 0.77/1.18 Sos input 19
% 0.77/1.18 Demodulators input 0
% 0.77/1.18 Passive input 0
% 0.77/1.18
% 0.77/1.18 Processed BS (before search) 21
% 0.77/1.18 Forward subsumed BS 2
% 0.77/1.18 Kept BS 19
% 0.77/1.18 New demodulators BS 16
% 0.77/1.18 Back demodulated BS 0
% 0.77/1.18
% 0.77/1.18 Clauses or pairs given 2250
% 0.77/1.18 Clauses generated 1071
% 0.77/1.18 Forward subsumed 868
% 0.77/1.18 Deleted by weight 0
% 0.77/1.18 Deleted by variable count 0
% 0.77/1.18 Kept 203
% 0.77/1.18 New demodulators 161
% 0.77/1.18 Back demodulated 8
% 0.77/1.18 Ordered paramod prunes 0
% 0.77/1.18 Basic paramod prunes 3095
% 0.77/1.18 Prime paramod prunes 34
% 0.77/1.18 Semantic prunes 0
% 0.77/1.18
% 0.77/1.18 Rewrite attmepts 7361
% 0.77/1.18 Rewrites 1412
% 0.77/1.18
% 0.77/1.18 FPA overloads 0
% 0.77/1.18 FPA underloads 0
% 0.77/1.18
% 0.77/1.18 Usable size 0
% 0.77/1.18 Sos size 213
% 0.77/1.18 Demodulators size 176
% 0.77/1.18 Passive size 0
% 0.77/1.18 Disabled size 8
% 0.77/1.18
% 0.77/1.18 Proofs found 1
% 0.77/1.18
% 0.77/1.18 ----------- times (seconds) ----------- Tue Jun 14 13:42:55 2022
% 0.77/1.18
% 0.77/1.18 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.77/1.18 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.77/1.18 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.77/1.18 input time 0.00
% 0.77/1.18 paramodulation time 0.01
% 0.77/1.18 demodulation time 0.00
% 0.77/1.18 orient time 0.00
% 0.77/1.18 weigh time 0.00
% 0.77/1.18 forward subsume time 0.00
% 0.77/1.18 back demod find time 0.00
% 0.77/1.18 conflict time 0.00
% 0.77/1.18 LRPO time 0.00
% 0.77/1.18 store clause time 0.00
% 0.77/1.18 disable clause time 0.00
% 0.77/1.18 prime paramod time 0.00
% 0.77/1.18 semantics time 0.00
% 0.77/1.18
% 0.77/1.18 EQP interrupted
%------------------------------------------------------------------------------