TSTP Solution File: GRP410-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP410-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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:46:32 EDT 2022
% Result : Unsatisfiable 0.86s 1.31s
% Output : Refutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 2
% Syntax : Number of clauses : 40 ( 40 unt; 0 nHn; 4 RR)
% Number of literals : 40 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 3 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 150 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))),B),
file('GRP410-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(multiply(inverse(b2),b2),a2),a2),
file('GRP410-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(inverse(multiply(inverse(C),C))))),inverse(multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C))))),multiply(inverse(multiply(D,inverse(multiply(B,C)))),multiply(D,inverse(C)))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(4,plain,
equal(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),multiply(multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(inverse(multiply(inverse(C),C))))),inverse(multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C)))))),
inference(flip,[status(thm),theory(equality)],[3]),
[iquote('flip(3)')] ).
cnf(11,plain,
equal(multiply(inverse(multiply(A,inverse(multiply(multiply(B,inverse(multiply(inverse(C),C))),C)))),multiply(A,inverse(C))),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(14,plain,
equal(multiply(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(C,inverse(D))))),inverse(multiply(inverse(multiply(C,inverse(D))),multiply(C,inverse(D))))),inverse(multiply(C,inverse(multiply(multiply(B,inverse(multiply(inverse(D),D))),D))))),
inference(para,[status(thm),theory(equality)],[11,1]),
[iquote('para(11,1)')] ).
cnf(15,plain,
equal(inverse(multiply(A,inverse(multiply(multiply(B,inverse(multiply(inverse(C),C))),C)))),multiply(multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(multiply(A,inverse(C))))),inverse(multiply(inverse(multiply(A,inverse(C))),multiply(A,inverse(C)))))),
inference(flip,[status(thm),theory(equality)],[14]),
[iquote('flip(14)')] ).
cnf(27,plain,
equal(multiply(multiply(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(inverse(multiply(inverse(C),C))))),inverse(multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C))))),inverse(multiply(inverse(C),C))),B),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(32,plain,
equal(multiply(multiply(multiply(inverse(A),multiply(multiply(inverse(multiply(B,inverse(multiply(A,C)))),multiply(B,inverse(C))),inverse(inverse(multiply(inverse(D),D))))),inverse(multiply(inverse(inverse(multiply(inverse(D),D))),inverse(multiply(inverse(D),D))))),inverse(multiply(inverse(D),D))),multiply(inverse(C),C)),
inference(para,[status(thm),theory(equality)],[1,27]),
[iquote('para(1,27)')] ).
cnf(63,plain,
equal(inverse(multiply(A,inverse(multiply(multiply(multiply(B,multiply(A,inverse(C))),inverse(multiply(inverse(C),C))),C)))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,14]),1]),
[iquote('para(1,14),flip(1)')] ).
cnf(93,plain,
equal(multiply(multiply(multiply(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(C,inverse(D))))),inverse(multiply(inverse(multiply(C,inverse(D))),multiply(C,inverse(D))))),multiply(C,inverse(D))),inverse(multiply(inverse(D),D))),multiply(B,inverse(multiply(inverse(D),D)))),
inference(para,[status(thm),theory(equality)],[15,1]),
[iquote('para(15,1)')] ).
cnf(158,plain,
equal(multiply(multiply(multiply(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))),C),inverse(multiply(inverse(multiply(inverse(D),D)),multiply(inverse(D),D)))),multiply(B,inverse(multiply(inverse(multiply(inverse(D),D)),multiply(inverse(D),D))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,93]),1,1,1]),
[iquote('para(1,93),demod([1,1,1])')] ).
cnf(162,plain,
equal(multiply(multiply(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))),C),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[158,1]),1]),1]),
[iquote('para(158,1),demod([1]),flip(1)')] ).
cnf(165,plain,
equal(multiply(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))),multiply(multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(C))),inverse(multiply(inverse(C),C)))),
inference(para,[status(thm),theory(equality)],[162,1]),
[iquote('para(162,1)')] ).
cnf(169,plain,
equal(multiply(multiply(inverse(A),multiply(multiply(inverse(multiply(B,inverse(multiply(A,C)))),multiply(B,inverse(C))),inverse(D))),inverse(multiply(inverse(D),D))),multiply(multiply(inverse(multiply(E,inverse(multiply(inverse(C),C)))),multiply(E,inverse(D))),inverse(multiply(inverse(D),D)))),
inference(para,[status(thm),theory(equality)],[1,165]),
[iquote('para(1,165)')] ).
cnf(170,plain,
equal(multiply(multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))),multiply(multiply(inverse(D),multiply(multiply(inverse(multiply(E,inverse(multiply(D,B)))),multiply(E,inverse(B))),inverse(C))),inverse(multiply(inverse(C),C)))),
inference(flip,[status(thm),theory(equality)],[169]),
[iquote('flip(169)')] ).
cnf(173,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C))),multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(C)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[165,1]),1]),
[iquote('para(165,1),demod([1])')] ).
cnf(183,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,inverse(C))),multiply(inverse(multiply(D,B)),multiply(D,inverse(C)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[63,173]),63]),
[iquote('para(63,173),demod([63])')] ).
cnf(201,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,C)),multiply(inverse(multiply(D,B)),multiply(D,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[63,183]),63]),
[iquote('para(63,183),demod([63])')] ).
cnf(215,plain,
equal(multiply(inverse(A),multiply(inverse(multiply(B,inverse(multiply(multiply(A,inverse(multiply(inverse(C),C))),C)))),D)),multiply(inverse(multiply(E,multiply(B,inverse(C)))),multiply(E,D))),
inference(para,[status(thm),theory(equality)],[11,201]),
[iquote('para(11,201)')] ).
cnf(523,plain,
equal(multiply(inverse(A),A),multiply(inverse(multiply(B,multiply(C,inverse(D)))),multiply(B,multiply(C,inverse(D))))),
inference(para,[status(thm),theory(equality)],[11,215]),
[iquote('para(11,215)')] ).
cnf(524,plain,
equal(multiply(inverse(multiply(A,multiply(B,inverse(C)))),multiply(A,multiply(B,inverse(C)))),multiply(inverse(D),D)),
inference(flip,[status(thm),theory(equality)],[523]),
[iquote('flip(523)')] ).
cnf(531,plain,
equal(multiply(inverse(multiply(inverse(A),A)),multiply(inverse(multiply(B,multiply(C,inverse(D)))),E)),multiply(inverse(multiply(F,multiply(B,multiply(C,inverse(D))))),multiply(F,E))),
inference(para,[status(thm),theory(equality)],[524,201]),
[iquote('para(524,201)')] ).
cnf(535,plain,
equal(multiply(multiply(inverse(multiply(A,inverse(multiply(inverse(multiply(B,multiply(C,inverse(D)))),multiply(B,multiply(C,inverse(D))))))),multiply(A,inverse(E))),inverse(multiply(inverse(E),E))),inverse(E)),
inference(para,[status(thm),theory(equality)],[523,1]),
[iquote('para(523,1)')] ).
cnf(630,plain,
equal(multiply(inverse(multiply(inverse(A),A)),multiply(inverse(B),B)),multiply(inverse(multiply(C,multiply(D,multiply(E,inverse(F))))),multiply(C,multiply(D,multiply(E,inverse(F)))))),
inference(para,[status(thm),theory(equality)],[524,531]),
[iquote('para(524,531)')] ).
cnf(631,plain,
equal(multiply(inverse(multiply(A,multiply(B,multiply(C,inverse(D))))),multiply(A,multiply(B,multiply(C,inverse(D))))),multiply(inverse(multiply(inverse(E),E)),multiply(inverse(F),F))),
inference(flip,[status(thm),theory(equality)],[630]),
[iquote('flip(630)')] ).
cnf(690,plain,
equal(multiply(inverse(multiply(inverse(A),A)),multiply(inverse(B),B)),multiply(inverse(multiply(C,multiply(D,inverse(E)))),multiply(C,multiply(D,inverse(E))))),
inference(para,[status(thm),theory(equality)],[631,523]),
[iquote('para(631,523)')] ).
cnf(714,plain,
equal(inverse(multiply(inverse(A),A)),inverse(multiply(inverse(B),B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[690,1]),535]),
[iquote('para(690,1),demod([535])')] ).
cnf(735,plain,
equal(multiply(multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))),inverse(C)),
inference(para,[status(thm),theory(equality)],[714,1]),
[iquote('para(714,1)')] ).
cnf(736,plain,
equal(multiply(multiply(inverse(A),multiply(multiply(inverse(multiply(B,inverse(multiply(A,C)))),multiply(B,inverse(C))),inverse(D))),inverse(multiply(inverse(D),D))),inverse(D)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[170]),735]),1]),
[iquote('back_demod(170),demod([735]),flip(1)')] ).
cnf(762,plain,
equal(multiply(inverse(inverse(multiply(inverse(A),A))),inverse(multiply(inverse(A),A))),multiply(inverse(B),B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[32]),736]),
[iquote('back_demod(32),demod([736])')] ).
cnf(769,plain,
equal(multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(D),D))),B),
inference(para,[status(thm),theory(equality)],[714,1]),
[iquote('para(714,1)')] ).
cnf(802,plain,
equal(multiply(multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(C))),inverse(multiply(inverse(D),D))),inverse(C)),
inference(para,[status(thm),theory(equality)],[714,769]),
[iquote('para(714,769)')] ).
cnf(915,plain,
equal(multiply(inverse(A),A),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[762,762]),
[iquote('para(762,762)')] ).
cnf(927,plain,
equal(multiply(multiply(inverse(A),A),inverse(multiply(inverse(B),B))),inverse(multiply(inverse(C),C))),
inference(para,[status(thm),theory(equality)],[915,802]),
[iquote('para(915,802)')] ).
cnf(1129,plain,
equal(multiply(multiply(inverse(multiply(A,inverse(inverse(multiply(inverse(B),B))))),multiply(A,inverse(inverse(multiply(inverse(C),C))))),inverse(multiply(inverse(D),D))),multiply(inverse(E),E)),
inference(para,[status(thm),theory(equality)],[927,769]),
[iquote('para(927,769)')] ).
cnf(1130,plain,
equal(multiply(inverse(A),A),multiply(multiply(inverse(multiply(B,inverse(inverse(multiply(inverse(C),C))))),multiply(B,inverse(inverse(multiply(inverse(D),D))))),inverse(multiply(inverse(E),E)))),
inference(flip,[status(thm),theory(equality)],[1129]),
[iquote('flip(1129)')] ).
cnf(1309,plain,
~ equal(multiply(multiply(multiply(inverse(multiply(A,inverse(inverse(multiply(inverse(B),B))))),multiply(A,inverse(inverse(multiply(inverse(C),C))))),inverse(multiply(inverse(D),D))),a2),a2),
inference(para,[status(thm),theory(equality)],[1130,2]),
[iquote('para(1130,2)')] ).
cnf(1314,plain,
~ equal(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(B),B))),a2),a2),
inference(para,[status(thm),theory(equality)],[915,1309]),
[iquote('para(915,1309)')] ).
cnf(1315,plain,
$false,
inference(conflict,[status(thm)],[1314,162]),
[iquote('conflict(1314,162)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP410-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n021.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 Jun 13 04:56:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.86/1.31 ----- EQP 0.9e, May 2009 -----
% 0.86/1.31 The job began on n021.cluster.edu, Mon Jun 13 04:56:27 2022
% 0.86/1.31 The command was "./eqp09e".
% 0.86/1.31
% 0.86/1.31 set(prolog_style_variables).
% 0.86/1.31 set(lrpo).
% 0.86/1.31 set(basic_paramod).
% 0.86/1.31 set(functional_subsume).
% 0.86/1.31 set(ordered_paramod).
% 0.86/1.31 set(prime_paramod).
% 0.86/1.31 set(para_pairs).
% 0.86/1.31 assign(pick_given_ratio,4).
% 0.86/1.31 clear(print_kept).
% 0.86/1.31 clear(print_new_demod).
% 0.86/1.31 clear(print_back_demod).
% 0.86/1.31 clear(print_given).
% 0.86/1.31 assign(max_mem,64000).
% 0.86/1.31 end_of_commands.
% 0.86/1.31
% 0.86/1.31 Usable:
% 0.86/1.31 end_of_list.
% 0.86/1.31
% 0.86/1.31 Sos:
% 0.86/1.31 0 (wt=-1) [] multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))) = B.
% 0.86/1.31 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.86/1.31 end_of_list.
% 0.86/1.31
% 0.86/1.31 Demodulators:
% 0.86/1.31 end_of_list.
% 0.86/1.31
% 0.86/1.31 Passive:
% 0.86/1.31 end_of_list.
% 0.86/1.31
% 0.86/1.31 Starting to process input.
% 0.86/1.31
% 0.86/1.31 ** KEPT: 1 (wt=20) [] multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))) = B.
% 0.86/1.31 1 is a new demodulator.
% 0.86/1.31
% 0.86/1.31 ** KEPT: 2 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.86/1.31 ---------------- PROOF FOUND ----------------
% 0.86/1.31 % SZS status Unsatisfiable
% 0.86/1.31
% 0.86/1.31
% 0.86/1.31 After processing input:
% 0.86/1.31
% 0.86/1.31 Usable:
% 0.86/1.31 end_of_list.
% 0.86/1.31
% 0.86/1.31 Sos:
% 0.86/1.31 2 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.86/1.31 1 (wt=20) [] multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))) = B.
% 0.86/1.31 end_of_list.
% 0.86/1.31
% 0.86/1.31 Demodulators:
% 0.86/1.31 1 (wt=20) [] multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))) = B.
% 0.86/1.31 end_of_list.
% 0.86/1.31
% 0.86/1.31 Passive:
% 0.86/1.31 end_of_list.
% 0.86/1.31
% 0.86/1.31 UNIT CONFLICT from 1314 and 162 at 0.20 seconds.
% 0.86/1.31
% 0.86/1.31 ---------------- PROOF ----------------
% 0.86/1.31 % SZS output start Refutation
% See solution above
% 0.86/1.31 ------------ end of proof -------------
% 0.86/1.31
% 0.86/1.31
% 0.86/1.31 ------------- memory usage ------------
% 0.86/1.31 Memory dynamically allocated (tp_alloc): 7324.
% 0.86/1.31 type (bytes each) gets frees in use avail bytes
% 0.86/1.31 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.86/1.31 term ( 16) 191469 110848 80621 47 1570.4 K
% 0.86/1.31 gen_ptr ( 8) 553039 20638 532401 39 4159.7 K
% 0.86/1.31 context ( 808) 151798 151796 2 2 3.2 K
% 0.86/1.31 trail ( 12) 3722 3722 0 8 0.1 K
% 0.86/1.31 bt_node ( 68) 38866 38855 11 61 4.8 K
% 0.86/1.31 ac_position (285432) 0 0 0 0 0.0 K
% 0.86/1.31 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.86/1.31 ac_match_free_vars_pos (4020)
% 0.86/1.31 0 0 0 0 0.0 K
% 0.86/1.31 discrim ( 12) 65799 8942 56857 0 666.3 K
% 0.86/1.31 flat ( 40) 634079 634079 0 201 7.9 K
% 0.86/1.31 discrim_pos ( 12) 1964 1964 0 1 0.0 K
% 0.86/1.31 fpa_head ( 12) 7573 0 7573 0 88.7 K
% 0.86/1.31 fpa_tree ( 28) 8011 8011 0 39 1.1 K
% 0.86/1.31 fpa_pos ( 36) 1594 1594 0 1 0.0 K
% 0.86/1.31 literal ( 12) 5648 4334 1314 0 15.4 K
% 0.86/1.31 clause ( 24) 5648 4334 1314 0 30.8 K
% 0.86/1.31 list ( 12) 339 283 56 4 0.7 K
% 0.86/1.31 list_pos ( 20) 4564 743 3821 0 74.6 K
% 0.86/1.31 pair_index ( 40) 2 0 2 0 0.1 K
% 0.86/1.31
% 0.86/1.31 -------------- statistics -------------
% 0.86/1.31 Clauses input 2
% 0.86/1.31 Usable input 0
% 0.86/1.31 Sos input 2
% 0.86/1.31 Demodulators input 0
% 0.86/1.31 Passive input 0
% 0.86/1.31
% 0.86/1.31 Processed BS (before search) 2
% 0.86/1.31 Forward subsumed BS 0
% 0.86/1.31 Kept BS 2
% 0.86/1.31 New demodulators BS 1
% 0.86/1.31 Back demodulated BS 0
% 0.86/1.31
% 0.86/1.31 Clauses or pairs given 2453
% 0.86/1.31 Clauses generated 2979
% 0.86/1.31 Forward subsumed 1667
% 0.86/1.31 Deleted by weight 0
% 0.86/1.31 Deleted by variable count 0
% 0.86/1.31 Kept 1312
% 0.86/1.31 New demodulators 279
% 0.86/1.31 Back demodulated 164
% 0.86/1.31 Ordered paramod prunes 0
% 0.86/1.31 Basic paramod prunes 23016
% 0.86/1.31 Prime paramod prunes 6
% 0.86/1.31 Semantic prunes 0
% 0.86/1.31
% 0.86/1.31 Rewrite attmepts 103707
% 0.86/1.31 Rewrites 511
% 0.86/1.31
% 0.86/1.31 FPA overloads 0
% 0.86/1.31 FPA underloads 0
% 0.86/1.31
% 0.86/1.31 Usable size 0
% 0.86/1.31 Sos size 1149
% 0.86/1.31 Demodulators size 210
% 0.86/1.31 Passive size 0
% 0.86/1.31 Disabled size 164
% 0.86/1.31
% 0.86/1.31 Proofs found 1
% 0.86/1.31
% 0.86/1.31 ----------- times (seconds) ----------- Mon Jun 13 04:56:27 2022
% 0.86/1.31
% 0.86/1.31 user CPU time 0.20 (0 hr, 0 min, 0 sec)
% 0.86/1.31 system CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.86/1.31 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.86/1.31 input time 0.00
% 0.86/1.31 paramodulation time 0.02
% 0.86/1.31 demodulation time 0.02
% 0.86/1.31 orient time 0.02
% 0.86/1.31 weigh time 0.01
% 0.86/1.31 forward subsume time 0.01
% 0.86/1.31 back demod find time 0.01
% 0.86/1.31 conflict time 0.00
% 0.86/1.31 LRPO time 0.01
% 0.86/1.31 store clause time 0.08
% 0.86/1.31 disable clause time 0.00
% 0.86/1.31 prime paramod time 0.01
% 0.86/1.31 semantics time 0.00
% 0.86/1.31
% 0.86/1.32 EQP interrupted
%------------------------------------------------------------------------------