TSTP Solution File: GRP002-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP002-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n008.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:44:09 EDT 2022
% Result : Unsatisfiable 0.68s 1.09s
% Output : Refutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 44 ( 44 unt; 0 nHn; 22 RR)
% Number of literals : 44 ( 0 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP002-2.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP002-2.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP002-2.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(A,identity),A),
file('GRP002-2.p',unknown),
[] ).
cnf(6,plain,
equal(multiply(A,multiply(A,A)),identity),
file('GRP002-2.p',unknown),
[] ).
cnf(7,plain,
equal(multiply(a,b),c),
file('GRP002-2.p',unknown),
[] ).
cnf(8,plain,
equal(multiply(c,inverse(a)),d),
file('GRP002-2.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(d,inverse(b)),h),
file('GRP002-2.p',unknown),
[] ).
cnf(10,plain,
equal(multiply(h,b),j),
file('GRP002-2.p',unknown),
[] ).
cnf(11,plain,
equal(multiply(j,inverse(h)),k),
file('GRP002-2.p',unknown),
[] ).
cnf(12,plain,
~ equal(multiply(k,inverse(b)),identity),
file('GRP002-2.p',unknown),
[] ).
cnf(14,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(17,plain,
equal(multiply(A,multiply(A,multiply(A,B))),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,3]),1,3]),1]),
[iquote('para(6,3),demod([1,3]),flip(1)')] ).
cnf(18,plain,
equal(multiply(A,multiply(B,multiply(A,multiply(B,multiply(A,B))))),identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,6]),3]),
[iquote('para(3,6),demod([3])')] ).
cnf(19,plain,
equal(multiply(c,A),multiply(a,multiply(b,A))),
inference(para,[status(thm),theory(equality)],[7,3]),
[iquote('para(7,3)')] ).
cnf(20,plain,
equal(multiply(a,multiply(b,inverse(a))),d),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),19]),
[iquote('back_demod(8),demod([19])')] ).
cnf(21,plain,
equal(multiply(d,multiply(inverse(b),A)),multiply(h,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,3]),1]),
[iquote('para(9,3),flip(1)')] ).
cnf(22,plain,
equal(multiply(j,A),multiply(h,multiply(b,A))),
inference(para,[status(thm),theory(equality)],[10,3]),
[iquote('para(10,3)')] ).
cnf(23,plain,
equal(multiply(h,multiply(b,inverse(h))),k),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[11]),22]),
[iquote('back_demod(11),demod([22])')] ).
cnf(26,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,multiply(B,C))),C),
inference(para,[status(thm),theory(equality)],[3,14]),
[iquote('para(3,14)')] ).
cnf(27,plain,
equal(inverse(A),multiply(A,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,14]),4]),
[iquote('para(6,14),demod([4])')] ).
cnf(28,plain,
equal(multiply(A,multiply(B,multiply(A,multiply(B,multiply(A,multiply(B,C)))))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[26]),27,3,3,3,3]),
[iquote('back_demod(26),demod([27,3,3,3,3])')] ).
cnf(30,plain,
equal(multiply(h,multiply(b,multiply(h,h))),k),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[23]),27]),
[iquote('back_demod(23),demod([27])')] ).
cnf(31,plain,
equal(multiply(h,A),multiply(d,multiply(b,multiply(b,A)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[21]),27,3]),1]),
[iquote('back_demod(21),demod([27,3]),flip(1)')] ).
cnf(32,plain,
equal(multiply(d,multiply(d,multiply(b,multiply(b,h)))),k),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[30]),31,31,17]),
[iquote('back_demod(30),demod([31,31,17])')] ).
cnf(35,plain,
equal(multiply(a,multiply(b,multiply(a,a))),d),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[20]),27]),
[iquote('back_demod(20),demod([27])')] ).
cnf(36,plain,
~ equal(multiply(k,multiply(b,b)),identity),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[12]),27]),
[iquote('back_demod(12),demod([27])')] ).
cnf(38,plain,
equal(multiply(A,multiply(B,multiply(C,multiply(A,multiply(B,multiply(C,multiply(A,multiply(B,C)))))))),identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,18]),3,3]),
[iquote('para(3,18),demod([3,3])')] ).
cnf(39,plain,
equal(multiply(a,multiply(b,multiply(a,multiply(b,c)))),identity),
inference(para,[status(thm),theory(equality)],[7,18]),
[iquote('para(7,18)')] ).
cnf(44,plain,
equal(multiply(b,multiply(a,a)),multiply(a,multiply(a,d))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,17]),1]),
[iquote('para(35,17),flip(1)')] ).
cnf(45,plain,
equal(multiply(A,multiply(B,multiply(A,multiply(B,multiply(A,C))))),multiply(B,multiply(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[28,17]),1]),
[iquote('para(28,17),flip(1)')] ).
cnf(47,plain,
equal(multiply(k,A),multiply(d,multiply(d,multiply(b,multiply(b,multiply(d,multiply(b,multiply(b,A)))))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,3]),3,3,3,31]),
[iquote('para(32,3),demod([3,3,3,31])')] ).
cnf(48,plain,
~ equal(multiply(d,multiply(d,multiply(b,multiply(b,multiply(d,b))))),identity),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[36]),47,6,4]),
[iquote('back_demod(36),demod([47,6,4])')] ).
cnf(52,plain,
equal(multiply(b,multiply(a,multiply(b,c))),multiply(a,a)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[39,17]),4]),1]),
[iquote('para(39,17),demod([4]),flip(1)')] ).
cnf(54,plain,
equal(multiply(A,multiply(a,multiply(b,multiply(A,multiply(a,multiply(b,multiply(A,c))))))),identity),
inference(para,[status(thm),theory(equality)],[7,38]),
[iquote('para(7,38)')] ).
cnf(57,plain,
equal(multiply(b,multiply(a,multiply(a,d))),multiply(a,multiply(b,c))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[52,17]),44]),
[iquote('para(52,17),demod([44])')] ).
cnf(61,plain,
equal(multiply(a,multiply(a,multiply(d,A))),multiply(b,multiply(a,multiply(a,A)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[44,3]),3,3,3]),
[iquote('para(44,3),demod([3,3,3])')] ).
cnf(94,plain,
equal(multiply(d,A),multiply(a,multiply(b,multiply(a,multiply(a,A))))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[61,17]),1]),
[iquote('para(61,17),flip(1)')] ).
cnf(104,plain,
~ equal(multiply(a,multiply(b,multiply(b,multiply(a,multiply(a,multiply(b,multiply(b,multiply(a,multiply(b,multiply(a,c)))))))))),identity),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[48]),94,7,94,94,17]),
[iquote('back_demod(48),demod([94,7,94,94,17])')] ).
cnf(109,plain,
equal(multiply(b,multiply(a,multiply(a,multiply(b,multiply(a,c))))),a),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[54,17]),4]),1]),
[iquote('para(54,17),demod([4]),flip(1)')] ).
cnf(110,plain,
equal(multiply(b,multiply(b,a)),multiply(a,multiply(a,multiply(b,multiply(a,c))))),
inference(para,[status(thm),theory(equality)],[109,17]),
[iquote('para(109,17)')] ).
cnf(125,plain,
equal(multiply(b,multiply(b,multiply(a,A))),multiply(a,multiply(a,multiply(b,multiply(a,multiply(a,multiply(b,A))))))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[110,3]),3,3,3,3,19,3]),1]),
[iquote('para(110,3),demod([3,3,3,3,19,3]),flip(1)')] ).
cnf(128,plain,
~ equal(identity,identity),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[104]),125,125,17,45,52,44,17,57,52,6]),
[iquote('back_demod(104),demod([125,125,17,45,52,44,17,57,52,6])')] ).
cnf(129,plain,
$false,
inference(conflict,[status(thm)],[128]),
[iquote('xx_conflict(128)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP002-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n008.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 06:59:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.68/1.09 ----- EQP 0.9e, May 2009 -----
% 0.68/1.09 The job began on n008.cluster.edu, Mon Jun 13 06:59:53 2022
% 0.68/1.09 The command was "./eqp09e".
% 0.68/1.09
% 0.68/1.09 set(prolog_style_variables).
% 0.68/1.09 set(lrpo).
% 0.68/1.09 set(basic_paramod).
% 0.68/1.09 set(functional_subsume).
% 0.68/1.09 set(ordered_paramod).
% 0.68/1.09 set(prime_paramod).
% 0.68/1.09 set(para_pairs).
% 0.68/1.09 assign(pick_given_ratio,4).
% 0.68/1.09 clear(print_kept).
% 0.68/1.09 clear(print_new_demod).
% 0.68/1.09 clear(print_back_demod).
% 0.68/1.09 clear(print_given).
% 0.68/1.09 assign(max_mem,64000).
% 0.68/1.09 end_of_commands.
% 0.68/1.09
% 0.68/1.09 Usable:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Sos:
% 0.68/1.09 0 (wt=-1) [] multiply(identity,A) = A.
% 0.68/1.09 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.68/1.09 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.68/1.09 0 (wt=-1) [] multiply(A,identity) = A.
% 0.68/1.09 0 (wt=-1) [] multiply(A,inverse(A)) = identity.
% 0.68/1.09 0 (wt=-1) [] multiply(A,multiply(A,A)) = identity.
% 0.68/1.09 0 (wt=-1) [] multiply(a,b) = c.
% 0.68/1.09 0 (wt=-1) [] multiply(c,inverse(a)) = d.
% 0.68/1.09 0 (wt=-1) [] multiply(d,inverse(b)) = h.
% 0.68/1.09 0 (wt=-1) [] multiply(h,b) = j.
% 0.68/1.09 0 (wt=-1) [] multiply(j,inverse(h)) = k.
% 0.68/1.09 0 (wt=-1) [] -(multiply(k,inverse(b)) = identity).
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Demodulators:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Passive:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Starting to process input.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.68/1.09 1 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.68/1.09 2 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.68/1.09 3 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 4 (wt=5) [] multiply(A,identity) = A.
% 0.68/1.09 4 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 5 (wt=6) [] multiply(A,inverse(A)) = identity.
% 0.68/1.09 5 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 6 (wt=7) [] multiply(A,multiply(A,A)) = identity.
% 0.68/1.09 6 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 7 (wt=5) [] multiply(a,b) = c.
% 0.68/1.09 7 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 8 (wt=6) [] multiply(c,inverse(a)) = d.
% 0.68/1.09 8 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 9 (wt=6) [] multiply(d,inverse(b)) = h.
% 0.68/1.09 9 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 10 (wt=5) [] multiply(h,b) = j.
% 0.68/1.09 10 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 11 (wt=6) [] multiply(j,inverse(h)) = k.
% 0.68/1.09 11 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 12 (wt=6) [] -(multiply(k,inverse(b)) = identity).
% 0.68/1.09 ---------------- PROOF FOUND ----------------
% 0.68/1.09 % SZS status Unsatisfiable
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 After processing input:
% 0.68/1.09
% 0.68/1.09 Usable:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Sos:
% 0.68/1.09 1 (wt=5) [] multiply(identity,A) = A.
% 0.68/1.09 4 (wt=5) [] multiply(A,identity) = A.
% 0.68/1.09 7 (wt=5) [] multiply(a,b) = c.
% 0.68/1.09 10 (wt=5) [] multiply(h,b) = j.
% 0.68/1.09 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.68/1.09 5 (wt=6) [] multiply(A,inverse(A)) = identity.
% 0.68/1.09 8 (wt=6) [] multiply(c,inverse(a)) = d.
% 0.68/1.09 9 (wt=6) [] multiply(d,inverse(b)) = h.
% 0.68/1.09 11 (wt=6) [] multiply(j,inverse(h)) = k.
% 0.68/1.09 12 (wt=6) [] -(multiply(k,inverse(b)) = identity).
% 0.68/1.09 6 (wt=7) [] multiply(A,multiply(A,A)) = identity.
% 0.68/1.09 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Demodulators:
% 0.68/1.09 1 (wt=5) [] multiply(identity,A) = A.
% 0.68/1.09 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.68/1.09 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.68/1.09 4 (wt=5) [] multiply(A,identity) = A.
% 0.68/1.09 5 (wt=6) [] multiply(A,inverse(A)) = identity.
% 0.68/1.09 6 (wt=7) [] multiply(A,multiply(A,A)) = identity.
% 0.68/1.09 7 (wt=5) [] multiply(a,b) = c.
% 0.68/1.09 8 (wt=6) [] multiply(c,inverse(a)) = d.
% 0.68/1.09 9 (wt=6) [] multiply(d,inverse(b)) = h.
% 0.68/1.09 10 (wt=5) [] multiply(h,b) = j.
% 0.68/1.09 11 (wt=6) [] multiply(j,inverse(h)) = k.
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Passive:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 UNIT CONFLICT from 128 and x=x at 0.01 seconds.
% 0.68/1.09
% 0.68/1.09 ---------------- PROOF ----------------
% 0.68/1.09 % SZS output start Refutation
% See solution above
% 0.68/1.09 ------------ end of proof -------------
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 ------------- memory usage ------------
% 0.68/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.68/1.09 type (bytes each) gets frees in use avail bytes
% 0.68/1.09 sym_ent ( 96) 61 0 61 0 5.7 K
% 0.68/1.09 term ( 16) 15352 13400 1952 50 38.6 K
% 0.68/1.09 gen_ptr ( 8) 12668 3458 9210 43 72.3 K
% 0.68/1.09 context ( 808) 15331 15329 2 11 10.3 K
% 0.68/1.09 trail ( 12) 592 592 0 5 0.1 K
% 0.68/1.09 bt_node ( 68) 8562 8559 3 8 0.7 K
% 0.68/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.68/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.68/1.09 ac_match_free_vars_pos (4020)
% 0.68/1.09 0 0 0 0 0.0 K
% 0.68/1.09 discrim ( 12) 1645 732 913 64 11.4 K
% 0.68/1.09 flat ( 40) 29885 29885 0 29 1.1 K
% 0.68/1.09 discrim_pos ( 12) 1026 1026 0 1 0.0 K
% 0.68/1.09 fpa_head ( 12) 345 0 345 0 4.0 K
% 0.68/1.09 fpa_tree ( 28) 733 733 0 47 1.3 K
% 0.68/1.09 fpa_pos ( 36) 228 228 0 1 0.0 K
% 0.68/1.09 literal ( 12) 528 400 128 0 1.5 K
% 0.68/1.09 clause ( 24) 528 400 128 0 3.0 K
% 0.68/1.09 list ( 12) 160 103 57 2 0.7 K
% 0.68/1.09 list_pos ( 20) 628 329 299 7 6.0 K
% 0.68/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.68/1.09
% 0.68/1.09 -------------- statistics -------------
% 0.68/1.09 Clauses input 12
% 0.68/1.09 Usable input 0
% 0.68/1.09 Sos input 12
% 0.68/1.09 Demodulators input 0
% 0.68/1.09 Passive input 0
% 0.68/1.09
% 0.68/1.09 Processed BS (before search) 12
% 0.68/1.09 Forward subsumed BS 0
% 0.68/1.09 Kept BS 12
% 0.68/1.09 New demodulators BS 11
% 0.68/1.09 Back demodulated BS 0
% 0.68/1.09
% 0.68/1.09 Clauses or pairs given 838
% 0.68/1.09 Clauses generated 369
% 0.68/1.09 Forward subsumed 253
% 0.68/1.09 Deleted by weight 0
% 0.68/1.09 Deleted by variable count 0
% 0.68/1.09 Kept 116
% 0.68/1.09 New demodulators 90
% 0.68/1.09 Back demodulated 64
% 0.68/1.09 Ordered paramod prunes 0
% 0.68/1.09 Basic paramod prunes 2554
% 0.68/1.09 Prime paramod prunes 130
% 0.68/1.09 Semantic prunes 0
% 0.68/1.09
% 0.68/1.09 Rewrite attmepts 5566
% 0.68/1.09 Rewrites 881
% 0.68/1.09
% 0.68/1.09 FPA overloads 0
% 0.68/1.09 FPA underloads 0
% 0.68/1.09
% 0.68/1.09 Usable size 0
% 0.68/1.09 Sos size 63
% 0.68/1.09 Demodulators size 41
% 0.68/1.09 Passive size 0
% 0.68/1.09 Disabled size 64
% 0.68/1.09
% 0.68/1.09 Proofs found 1
% 0.68/1.09
% 0.68/1.09 ----------- times (seconds) ----------- Mon Jun 13 06:59:53 2022
% 0.68/1.09
% 0.68/1.09 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.68/1.09 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.68/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.68/1.09 input time 0.00
% 0.68/1.09 paramodulation time 0.00
% 0.68/1.09 demodulation time 0.00
% 0.68/1.09 orient time 0.00
% 0.68/1.09 weigh time 0.00
% 0.68/1.09 forward subsume time 0.00
% 0.68/1.09 back demod find time 0.00
% 0.68/1.09 conflict time 0.00
% 0.68/1.09 LRPO time 0.00
% 0.68/1.09 store clause time 0.00
% 0.68/1.09 disable clause time 0.00
% 0.68/1.09 prime paramod time 0.00
% 0.68/1.09 semantics time 0.00
% 0.68/1.09
% 0.68/1.09 EQP interrupted
%------------------------------------------------------------------------------