TSTP Solution File: LDA002-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LDA002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n018.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 : Sun Jul 17 16:43:18 EDT 2022
% Result : Unsatisfiable 1.05s 1.43s
% Output : Refutation 1.05s
% Verified :
% SZS Type : ERROR: Analysing output (Cycle in a tree)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(f(f(A,B),f(A,C)),f(A,f(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(2,plain,
equal(f(n1,n1),n2),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(f(n2,n1),n3),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(4,plain,
equal(f(n2,n2),u),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(f(u,n1),u1),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(6,plain,
equal(f(u,n2),u2),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(7,plain,
equal(f(u,n3),u3),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(f(u,u),uu),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(9,plain,
equal(f(f(n3,n2),u2),a),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(10,plain,
equal(f(u1,u3),b),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(11,plain,
equal(f(uu,uu),v),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(12,plain,
~ equal(f(b,v),f(a,v)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(15,plain,
equal(f(n2,f(n1,A)),f(n1,f(n1,A))),
inference(para,[status(thm),theory(equality)],[2,1]),
[iquote('para(2,1)')] ).
cnf(16,plain,
equal(f(f(n1,A),n2),f(n1,f(A,n1))),
inference(para,[status(thm),theory(equality)],[2,1]),
[iquote('para(2,1)')] ).
cnf(17,plain,
equal(f(n3,f(n2,A)),f(n1,f(n1,A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,1]),15]),
[iquote('para(3,1),demod([15])')] ).
cnf(19,plain,
equal(f(u,f(n2,A)),f(n2,f(n2,A))),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(21,plain,
equal(f(u1,f(u,A)),f(u,f(n1,A))),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(23,plain,
equal(f(u2,f(u,A)),f(n2,f(n2,A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,1]),19]),
[iquote('para(6,1),demod([19])')] ).
cnf(24,plain,
equal(f(f(u,A),u2),f(u,f(A,n2))),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(27,plain,
equal(f(uu,f(u,A)),f(u,f(u,A))),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(28,plain,
equal(f(f(u,A),uu),f(u,f(A,u))),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(30,plain,
equal(f(f(f(n3,n2),A),a),f(f(n3,n2),f(A,u2))),
inference(para,[status(thm),theory(equality)],[9,1]),
[iquote('para(9,1)')] ).
cnf(33,plain,
equal(f(v,f(uu,A)),f(uu,f(uu,A))),
inference(para,[status(thm),theory(equality)],[11,1]),
[iquote('para(11,1)')] ).
cnf(34,plain,
equal(f(f(uu,A),v),f(uu,f(A,uu))),
inference(para,[status(thm),theory(equality)],[11,1]),
[iquote('para(11,1)')] ).
cnf(35,plain,
equal(f(n1,n2),u),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,15]),4,2]),1]),
[iquote('para(2,15),demod([4,2]),flip(1)')] ).
cnf(44,plain,
equal(f(n2,u),f(n1,u)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,15]),35]),
[iquote('para(35,15),demod([35])')] ).
cnf(52,plain,
equal(f(n1,n3),u2),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,16]),6,3]),1]),
[iquote('para(35,16),demod([6,3]),flip(1)')] ).
cnf(64,plain,
equal(f(n3,u),f(n1,u)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,17]),35]),
[iquote('para(4,17),demod([35])')] ).
cnf(82,plain,
equal(f(n1,u),uu),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,19]),8,4,44]),1]),
[iquote('para(4,19),demod([8,4,44]),flip(1)')] ).
cnf(83,plain,
equal(f(n3,u),uu),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[64]),82]),
[iquote('back_demod(64),demod([82])')] ).
cnf(84,plain,
equal(f(n2,u),uu),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[44]),82]),
[iquote('back_demod(44),demod([82])')] ).
cnf(98,plain,
equal(f(u,u2),b),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,21]),10,52]),1]),
[iquote('para(7,21),demod([10,52]),flip(1)')] ).
cnf(117,plain,
equal(f(u2,u2),uu),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,23]),4,84]),
[iquote('para(6,23),demod([4,84])')] ).
cnf(120,plain,
equal(f(u2,uu),f(n2,uu)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,23]),84]),
[iquote('para(8,23),demod([84])')] ).
cnf(128,plain,
equal(f(uu,u2),b),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,24]),6,98]),
[iquote('para(8,24),demod([6,98])')] ).
cnf(143,plain,
equal(f(u,uu),v),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,27]),11,8]),1]),
[iquote('para(8,27),demod([11,8]),flip(1)')] ).
cnf(154,plain,
equal(f(n2,uu),v),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,28]),120,84,143]),
[iquote('para(6,28),demod([120,84,143])')] ).
cnf(155,plain,
equal(f(u2,uu),v),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[120]),154]),
[iquote('back_demod(120),demod([154])')] ).
cnf(160,plain,
equal(f(v,v),f(uu,v)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,33]),11]),
[iquote('para(11,33),demod([11])')] ).
cnf(169,plain,
equal(f(f(n3,n2),uu),f(a,a)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,30]),117]),1]),
[iquote('para(9,30),demod([117]),flip(1)')] ).
cnf(182,plain,
equal(f(n1,uu),v),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[82,15]),154,82]),1]),
[iquote('para(82,15),demod([154,82]),flip(1)')] ).
cnf(192,plain,
equal(f(n3,uu),v),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[84,17]),82,182]),
[iquote('para(84,17),demod([82,182])')] ).
cnf(418,plain,
equal(f(uu,v),f(b,v)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[128,34]),155]),1]),
[iquote('para(128,34),demod([155]),flip(1)')] ).
cnf(419,plain,
equal(f(v,v),f(b,v)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[160]),418]),
[iquote('back_demod(160),demod([418])')] ).
cnf(1610,plain,
equal(f(f(n3,A),uu),f(n3,f(A,u))),
inference(para,[status(thm),theory(equality)],[83,1]),
[iquote('para(83,1)')] ).
cnf(1612,plain,
equal(f(a,a),v),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[169]),1610,84,192]),1]),
[iquote('back_demod(169),demod([1610,84,192]),flip(1)')] ).
cnf(2039,plain,
equal(f(v,f(a,A)),f(a,f(a,A))),
inference(para,[status(thm),theory(equality)],[1612,1]),
[iquote('para(1612,1)')] ).
cnf(2043,plain,
equal(f(b,v),f(a,v)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1612,2039]),419,1612]),
[iquote('para(1612,2039),demod([419,1612])')] ).
cnf(2044,plain,
$false,
inference(conflict,[status(thm)],[2043,12]),
[iquote('conflict(2043,12)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LDA002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon May 30 02:58:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.05/1.43 ----- EQP 0.9e, May 2009 -----
% 1.05/1.43 The job began on n018.cluster.edu, Mon May 30 02:58:12 2022
% 1.05/1.43 The command was "./eqp09e".
% 1.05/1.43
% 1.05/1.43 set(prolog_style_variables).
% 1.05/1.43 set(lrpo).
% 1.05/1.43 set(basic_paramod).
% 1.05/1.43 set(functional_subsume).
% 1.05/1.43 set(ordered_paramod).
% 1.05/1.43 set(prime_paramod).
% 1.05/1.43 set(para_pairs).
% 1.05/1.43 assign(pick_given_ratio,4).
% 1.05/1.43 clear(print_kept).
% 1.05/1.43 clear(print_new_demod).
% 1.05/1.43 clear(print_back_demod).
% 1.05/1.43 clear(print_given).
% 1.05/1.43 assign(max_mem,64000).
% 1.05/1.43 end_of_commands.
% 1.05/1.43
% 1.05/1.43 Usable:
% 1.05/1.43 end_of_list.
% 1.05/1.43
% 1.05/1.43 Sos:
% 1.05/1.43 0 (wt=-1) [] f(A,f(B,C)) = f(f(A,B),f(A,C)).
% 1.05/1.43 0 (wt=-1) [] n2 = f(n1,n1).
% 1.05/1.43 0 (wt=-1) [] n3 = f(n2,n1).
% 1.05/1.43 0 (wt=-1) [] u = f(n2,n2).
% 1.05/1.43 0 (wt=-1) [] u1 = f(u,n1).
% 1.05/1.43 0 (wt=-1) [] u2 = f(u,n2).
% 1.05/1.43 0 (wt=-1) [] u3 = f(u,n3).
% 1.05/1.43 0 (wt=-1) [] uu = f(u,u).
% 1.05/1.43 0 (wt=-1) [] a = f(f(n3,n2),u2).
% 1.05/1.43 0 (wt=-1) [] b = f(u1,u3).
% 1.05/1.43 0 (wt=-1) [] v = f(uu,uu).
% 1.05/1.43 0 (wt=-1) [] -(f(a,v) = f(b,v)).
% 1.05/1.43 end_of_list.
% 1.05/1.43
% 1.05/1.43 Demodulators:
% 1.05/1.43 end_of_list.
% 1.05/1.43
% 1.05/1.43 Passive:
% 1.05/1.43 end_of_list.
% 1.05/1.43
% 1.05/1.43 Starting to process input.
% 1.05/1.43
% 1.05/1.43 ** KEPT: 1 (wt=13) [flip(1)] f(f(A,B),f(A,C)) = f(A,f(B,C)).
% 1.05/1.43 1 is a new demodulator.
% 1.05/1.43
% 1.05/1.43 ** KEPT: 2 (wt=5) [flip(1)] f(n1,n1) = n2.
% 1.05/1.43 2 is a new demodulator.
% 1.05/1.43
% 1.05/1.43 ** KEPT: 3 (wt=5) [flip(1)] f(n2,n1) = n3.
% 1.05/1.43 3 is a new demodulator.
% 1.05/1.43
% 1.05/1.43 ** KEPT: 4 (wt=5) [flip(1)] f(n2,n2) = u.
% 1.05/1.43 4 is a new demodulator.
% 1.05/1.43
% 1.05/1.43 ** KEPT: 5 (wt=5) [flip(1)] f(u,n1) = u1.
% 1.05/1.43 5 is a new demodulator.
% 1.05/1.43
% 1.05/1.43 ** KEPT: 6 (wt=5) [flip(1)] f(u,n2) = u2.
% 1.05/1.43 6 is a new demodulator.
% 1.05/1.43
% 1.05/1.43 ** KEPT: 7 (wt=5) [flip(1)] f(u,n3) = u3.
% 1.05/1.43 7 is a new demodulator.
% 1.05/1.43
% 1.05/1.43 ** KEPT: 8 (wt=5) [flip(1)] f(u,u) = uu.
% 1.05/1.43 8 is a new demodulator.
% 1.05/1.43
% 1.05/1.43 ** KEPT: 9 (wt=7) [flip(1)] f(f(n3,n2),u2) = a.
% 1.05/1.43 9 is a new demodulator.
% 1.05/1.43
% 1.05/1.43 ** KEPT: 10 (wt=5) [flip(1)] f(u1,u3) = b.
% 1.05/1.43 10 is a new demodulator.
% 1.05/1.43
% 1.05/1.43 ** KEPT: 11 (wt=5) [flip(1)] f(uu,uu) = v.
% 1.05/1.43 11 is a new demodulator.
% 1.05/1.43
% 1.05/1.43 ** KEPT: 12 (wt=7) [flip(1)] -(f(b,v) = f(a,v)).
% 1.05/1.43 ---------------- PROOF FOUND ----------------
% 1.05/1.43 % SZS status Unsatisfiable
% 1.05/1.43
% 1.05/1.43
% 1.05/1.43 After processing input:
% 1.05/1.43
% 1.05/1.43 Usable:
% 1.05/1.43 end_of_list.
% 1.05/1.43
% 1.05/1.43 Sos:
% 1.05/1.43 2 (wt=5) [flip(1)] f(n1,n1) = n2.
% 1.05/1.43 3 (wt=5) [flip(1)] f(n2,n1) = n3.
% 1.05/1.43 4 (wt=5) [flip(1)] f(n2,n2) = u.
% 1.05/1.43 5 (wt=5) [flip(1)] f(u,n1) = u1.
% 1.05/1.43 6 (wt=5) [flip(1)] f(u,n2) = u2.
% 1.05/1.43 7 (wt=5) [flip(1)] f(u,n3) = u3.
% 1.05/1.43 8 (wt=5) [flip(1)] f(u,u) = uu.
% 1.05/1.43 10 (wt=5) [flip(1)] f(u1,u3) = b.
% 1.05/1.43 11 (wt=5) [flip(1)] f(uu,uu) = v.
% 1.05/1.43 9 (wt=7) [flip(1)] f(f(n3,n2),u2) = a.
% 1.05/1.43 12 (wt=7) [flip(1)] -(f(b,v) = f(a,v)).
% 1.05/1.43 1 (wt=13) [flip(1)] f(f(A,B),f(A,C)) = f(A,f(B,C)).
% 1.05/1.43 end_of_list.
% 1.05/1.43
% 1.05/1.43 Demodulators:
% 1.05/1.43 1 (wt=13) [flip(1)] f(f(A,B),f(A,C)) = f(A,f(B,C)).
% 1.05/1.43 2 (wt=5) [flip(1)] f(n1,n1) = n2.
% 1.05/1.43 3 (wt=5) [flip(1)] f(n2,n1) = n3.
% 1.05/1.43 4 (wt=5) [flip(1)] f(n2,n2) = u.
% 1.05/1.43 5 (wt=5) [flip(1)] f(u,n1) = u1.
% 1.05/1.43 6 (wt=5) [flip(1)] f(u,n2) = u2.
% 1.05/1.43 7 (wt=5) [flip(1)] f(u,n3) = u3.
% 1.05/1.43 8 (wt=5) [flip(1)] f(u,u) = uu.
% 1.05/1.43 9 (wt=7) [flip(1)] f(f(n3,n2),u2) = a.
% 1.05/1.43 10 (wt=5) [flip(1)] f(u1,u3) = b.
% 1.05/1.43 11 (wt=5) [flip(1)] f(uu,uu) = v.
% 1.05/1.43 end_of_list.
% 1.05/1.43
% 1.05/1.43 Passive:
% 1.05/1.43 end_of_list.
% 1.05/1.43
% 1.05/1.43 UNIT CONFLICT from 2043 and 12 at 0.24 seconds.
% 1.05/1.43
% 1.05/1.43 ---------------- PROOF ----------------
% 1.05/1.43 % SZS output start Refutation
% See solution above
% 1.05/1.43 ------------ end of proof -------------
% 1.05/1.43
% 1.05/1.43
% 1.05/1.43 ------------- memory usage ------------
% 1.05/1.43 Memory dynamically allocated (tp_alloc): 6835.
% 1.05/1.43 type (bytes each) gets frees in use avail bytes
% 1.05/1.43 sym_ent ( 96) 63 0 63 0 5.9 K
% 1.05/1.43 term ( 16) 363940 278383 85557 16 1663.4 K
% 1.05/1.43 gen_ptr ( 8) 468180 31279 436901 48 3413.7 K
% 1.05/1.43 context ( 808) 347199 347197 2 6 6.3 K
% 1.05/1.43 trail ( 12) 5889 5889 0 9 0.1 K
% 1.05/1.43 bt_node ( 68) 154922 154919 3 20 1.5 K
% 1.05/1.43 ac_position (285432) 0 0 0 0 0.0 K
% 1.05/1.43 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.05/1.43 ac_match_free_vars_pos (4020)
% 1.05/1.43 0 0 0 0 0.0 K
% 1.05/1.43 discrim ( 12) 81148 4705 76443 0 895.8 K
% 1.05/1.43 flat ( 40) 941694 941694 0 131 5.1 K
% 1.05/1.43 discrim_pos ( 12) 12182 12182 0 1 0.0 K
% 1.05/1.43 fpa_head ( 12) 3793 0 3793 0 44.4 K
% 1.05/1.43 fpa_tree ( 28) 10575 10575 0 27 0.7 K
% 1.05/1.43 fpa_pos ( 36) 3570 3570 0 1 0.0 K
% 1.05/1.43 literal ( 12) 7614 5571 2043 1 24.0 K
% 1.05/1.43 clause ( 24) 7614 5571 2043 1 47.9 K
% 1.05/1.43 list ( 12) 1586 1530 56 3 0.7 K
% 1.05/1.43 list_pos ( 20) 8171 1240 6931 0 135.4 K
% 1.05/1.43 pair_index ( 40) 2 0 2 0 0.1 K
% 1.05/1.43
% 1.05/1.43 -------------- statistics -------------
% 1.05/1.43 Clauses input 12
% 1.05/1.43 Usable input 0
% 1.05/1.43 Sos input 12
% 1.05/1.43 Demodulators input 0
% 1.05/1.43 Passive input 0
% 1.05/1.43
% 1.05/1.43 Processed BS (before search) 12
% 1.05/1.43 Forward subsumed BS 0
% 1.05/1.43 Kept BS 12
% 1.05/1.43 New demodulators BS 11
% 1.05/1.43 Back demodulated BS 0
% 1.05/1.43
% 1.05/1.43 Clauses or pairs given 13831
% 1.05/1.43 Clauses generated 4966
% 1.05/1.43 Forward subsumed 2935
% 1.05/1.43 Deleted by weight 0
% 1.05/1.43 Deleted by variable count 0
% 1.05/1.43 Kept 2031
% 1.05/1.43 New demodulators 1516
% 1.05/1.43 Back demodulated 252
% 1.05/1.43 Ordered paramod prunes 0
% 1.05/1.43 Basic paramod prunes 21487
% 1.05/1.43 Prime paramod prunes 19
% 1.05/1.43 Semantic prunes 0
% 1.05/1.43
% 1.05/1.43 Rewrite attmepts 171494
% 1.05/1.43 Rewrites 11763
% 1.05/1.43
% 1.05/1.43 FPA overloads 0
% 1.05/1.43 FPA underloads 0
% 1.05/1.43
% 1.05/1.43 Usable size 0
% 1.05/1.43 Sos size 1790
% 1.05/1.43 Demodulators size 1309
% 1.05/1.43 Passive size 0
% 1.05/1.43 Disabled size 252
% 1.05/1.43
% 1.05/1.43 Proofs found 1
% 1.05/1.43
% 1.05/1.43 ----------- times (seconds) ----------- Mon May 30 02:58:12 2022
% 1.05/1.43
% 1.05/1.43 user CPU time 0.24 (0 hr, 0 min, 0 sec)
% 1.05/1.43 system CPU time 0.14 (0 hr, 0 min, 0 sec)
% 1.05/1.43 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 1.05/1.43 input time 0.00
% 1.05/1.43 paramodulation time 0.04
% 1.05/1.43 demodulation time 0.06
% 1.05/1.43 orient time 0.02
% 1.05/1.43 weigh time 0.00
% 1.05/1.43 forward subsume time 0.01
% 1.05/1.43 back demod find time 0.02
% 1.05/1.43 conflict time 0.00
% 1.05/1.43 LRPO time 0.01
% 1.05/1.43 store clause time 0.06
% 1.05/1.43 disable clause time 0.00
% 1.05/1.43 prime paramod time 0.00
% 1.05/1.43 semantics time 0.00
% 1.05/1.43
% 1.05/1.43 EQP interrupted
%------------------------------------------------------------------------------