TSTP Solution File: GRP607-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP607-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n027.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:48:11 EDT 2022
% Result : Unsatisfiable 0.76s 1.46s
% Output : Refutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 2
% Syntax : Number of clauses : 55 ( 55 unt; 0 nHn; 3 RR)
% Number of literals : 55 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 136 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),C),B),
file('GRP607-1.p',unknown),
[] ).
cnf(2,plain,
equal(inverse(double_divide(A,B)),multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),2,2]),
[iquote('back_demod(1),demod([2,2])')] ).
cnf(4,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP607-1.p',unknown),
[] ).
cnf(5,plain,
equal(double_divide(multiply(multiply(double_divide(A,B),multiply(C,D)),A),B),double_divide(D,C)),
inference(para,[status(thm),theory(equality)],[2,3]),
[iquote('para(2,3)')] ).
cnf(6,plain,
equal(multiply(A,multiply(multiply(double_divide(B,A),inverse(C)),B)),inverse(C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2]),1]),
[iquote('para(3,2),flip(1)')] ).
cnf(7,plain,
equal(double_divide(multiply(multiply(A,inverse(B)),multiply(multiply(double_divide(C,D),inverse(A)),C)),D),B),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(10,plain,
equal(double_divide(multiply(multiply(A,multiply(B,C)),multiply(multiply(double_divide(D,E),inverse(A)),D)),E),double_divide(C,B)),
inference(para,[status(thm),theory(equality)],[3,5]),
[iquote('para(3,5)')] ).
cnf(12,plain,
equal(double_divide(multiply(inverse(A),B),C),double_divide(D,multiply(double_divide(D,double_divide(B,C)),inverse(A)))),
inference(para,[status(thm),theory(equality)],[6,5]),
[iquote('para(6,5)')] ).
cnf(15,plain,
equal(multiply(multiply(double_divide(A,double_divide(B,C)),inverse(D)),A),multiply(C,multiply(inverse(D),B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,2]),2]),
[iquote('para(12,2),demod([2])')] ).
cnf(22,plain,
equal(double_divide(inverse(A),multiply(A,inverse(B))),B),
inference(para,[status(thm),theory(equality)],[6,7]),
[iquote('para(6,7)')] ).
cnf(24,plain,
equal(multiply(multiply(A,inverse(B)),inverse(A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,2]),1]),
[iquote('para(22,2),flip(1)')] ).
cnf(26,plain,
equal(double_divide(multiply(multiply(A,inverse(B)),inverse(C)),multiply(C,inverse(A))),B),
inference(para,[status(thm),theory(equality)],[22,3]),
[iquote('para(22,3)')] ).
cnf(32,plain,
equal(double_divide(inverse(A),multiply(B,inverse(B))),A),
inference(para,[status(thm),theory(equality)],[24,26]),
[iquote('para(24,26)')] ).
cnf(33,plain,
equal(multiply(multiply(A,inverse(A)),inverse(B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,2]),1]),
[iquote('para(32,2),flip(1)')] ).
cnf(34,plain,
equal(double_divide(multiply(A,B),multiply(C,inverse(C))),double_divide(B,A)),
inference(para,[status(thm),theory(equality)],[2,32]),
[iquote('para(2,32)')] ).
cnf(36,plain,
equal(multiply(multiply(A,inverse(A)),multiply(B,C)),multiply(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[34,2]),2]),1]),
[iquote('para(34,2),demod([2]),flip(1)')] ).
cnf(46,plain,
equal(double_divide(inverse(A),multiply(A,multiply(B,C))),double_divide(C,B)),
inference(para,[status(thm),theory(equality)],[6,10]),
[iquote('para(6,10)')] ).
cnf(77,plain,
equal(multiply(multiply(double_divide(A,B),inverse(C)),A),multiply(inverse(C),inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,15]),36]),
[iquote('para(32,15),demod([36])')] ).
cnf(78,plain,
equal(multiply(inverse(A),inverse(B)),multiply(multiply(double_divide(C,B),inverse(A)),C)),
inference(flip,[status(thm),theory(equality)],[77]),
[iquote('flip(77)')] ).
cnf(82,plain,
equal(multiply(inverse(A),multiply(B,C)),multiply(B,multiply(inverse(A),C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,78]),15]),
[iquote('para(2,78),demod([15])')] ).
cnf(83,plain,
equal(multiply(A,multiply(inverse(B),C)),multiply(inverse(B),multiply(A,C))),
inference(flip,[status(thm),theory(equality)],[82]),
[iquote('flip(82)')] ).
cnf(92,plain,
equal(multiply(inverse(A),inverse(multiply(B,inverse(B)))),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,77]),24]),1]),
[iquote('para(32,77),demod([24]),flip(1)')] ).
cnf(93,plain,
equal(multiply(multiply(A,B),inverse(multiply(C,inverse(C)))),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,92]),2]),
[iquote('para(2,92),demod([2])')] ).
cnf(99,plain,
equal(double_divide(inverse(multiply(A,inverse(A))),inverse(B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[92,34]),32]),1]),
[iquote('para(92,34),demod([32]),flip(1)')] ).
cnf(100,plain,
equal(double_divide(multiply(A,inverse(B)),inverse(A)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[99,3]),93]),
[iquote('para(99,3),demod([93])')] ).
cnf(103,plain,
equal(double_divide(inverse(A),inverse(multiply(B,inverse(A)))),B),
inference(para,[status(thm),theory(equality)],[24,100]),
[iquote('para(24,100)')] ).
cnf(119,plain,
equal(double_divide(inverse(A),inverse(inverse(A))),multiply(B,inverse(B))),
inference(para,[status(thm),theory(equality)],[92,100]),
[iquote('para(92,100)')] ).
cnf(121,plain,
equal(inverse(multiply(A,inverse(A))),multiply(inverse(inverse(B)),inverse(B))),
inference(para,[status(thm),theory(equality)],[119,2]),
[iquote('para(119,2)')] ).
cnf(170,plain,
equal(double_divide(multiply(inverse(inverse(A)),inverse(A)),inverse(B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[121,22]),33]),
[iquote('para(121,22),demod([33])')] ).
cnf(173,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[170,100]),
[iquote('para(170,100)')] ).
cnf(186,plain,
equal(double_divide(A,multiply(inverse(A),inverse(B))),B),
inference(para,[status(thm),theory(equality)],[173,22]),
[iquote('para(173,22)')] ).
cnf(189,plain,
equal(double_divide(multiply(A,B),inverse(A)),inverse(B)),
inference(para,[status(thm),theory(equality)],[173,100]),
[iquote('para(173,100)')] ).
cnf(197,plain,
equal(double_divide(A,inverse(multiply(B,A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[173,103]),173]),
[iquote('para(173,103),demod([173])')] ).
cnf(205,plain,
equal(multiply(inverse(multiply(A,B)),B),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[197,2]),1]),
[iquote('para(197,2),flip(1)')] ).
cnf(237,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)],[189,2]),173]),1]),
[iquote('para(189,2),demod([173]),flip(1)')] ).
cnf(273,plain,
equal(inverse(multiply(A,B)),double_divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[237,189]),173]),1]),
[iquote('para(237,189),demod([173]),flip(1)')] ).
cnf(282,plain,
equal(multiply(double_divide(A,B),A),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[205]),273]),
[iquote('back_demod(205),demod([273])')] ).
cnf(288,plain,
equal(double_divide(A,double_divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[197]),273]),
[iquote('back_demod(197),demod([273])')] ).
cnf(327,plain,
equal(multiply(inverse(A),inverse(B)),double_divide(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[186,288]),1]),
[iquote('para(186,288),flip(1)')] ).
cnf(333,plain,
equal(multiply(multiply(double_divide(A,B),inverse(C)),A),double_divide(C,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[78]),327]),1]),
[iquote('back_demod(78),demod([327]),flip(1)')] ).
cnf(387,plain,
equal(multiply(A,multiply(inverse(B),C)),double_divide(B,double_divide(C,A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[15]),333]),1]),
[iquote('back_demod(15),demod([333]),flip(1)')] ).
cnf(404,plain,
equal(multiply(inverse(A),multiply(B,C)),double_divide(A,double_divide(C,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[83]),387]),1]),
[iquote('back_demod(83),demod([387]),flip(1)')] ).
cnf(409,plain,
equal(double_divide(A,double_divide(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[237]),404]),
[iquote('back_demod(237),demod([404])')] ).
cnf(417,plain,
equal(multiply(A,double_divide(B,A)),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[6]),333]),
[iquote('back_demod(6),demod([333])')] ).
cnf(428,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[409,282]),2]),
[iquote('para(409,282),demod([2])')] ).
cnf(1973,plain,
~ equal(multiply(c3,multiply(a3,b3)),multiply(a3,multiply(b3,c3))),
inference(para,[status(thm),theory(equality)],[428,4]),
[iquote('para(428,4)')] ).
cnf(2426,plain,
equal(multiply(double_divide(A,B),inverse(C)),double_divide(multiply(B,A),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[46,282]),273]),
[iquote('para(46,282),demod([273])')] ).
cnf(2604,plain,
equal(multiply(double_divide(multiply(A,B),C),B),double_divide(C,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[333]),2426]),
[iquote('back_demod(333),demod([2426])')] ).
cnf(2694,plain,
equal(multiply(A,B),double_divide(double_divide(multiply(C,B),A),C)),
inference(para,[status(thm),theory(equality)],[288,2604]),
[iquote('para(288,2604)')] ).
cnf(2695,plain,
equal(double_divide(double_divide(multiply(A,B),C),A),multiply(C,B)),
inference(flip,[status(thm),theory(equality)],[2694]),
[iquote('flip(2694)')] ).
cnf(3049,plain,
equal(multiply(A,multiply(B,C)),multiply(B,multiply(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2695,417]),2]),
[iquote('para(2695,417),demod([2])')] ).
cnf(3052,plain,
equal(multiply(A,multiply(B,C)),multiply(C,multiply(A,B))),
inference(para,[status(thm),theory(equality)],[428,3049]),
[iquote('para(428,3049)')] ).
cnf(3053,plain,
equal(multiply(A,multiply(B,C)),multiply(B,multiply(C,A))),
inference(flip,[status(thm),theory(equality)],[3052]),
[iquote('flip(3052)')] ).
cnf(3054,plain,
$false,
inference(conflict,[status(thm)],[3053,1973]),
[iquote('conflict(3053,1973)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GRP607-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.35 % Computer : n027.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 10:19:03 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.76/1.46 ----- EQP 0.9e, May 2009 -----
% 0.76/1.46 The job began on n027.cluster.edu, Tue Jun 14 10:19:04 2022
% 0.76/1.46 The command was "./eqp09e".
% 0.76/1.46
% 0.76/1.46 set(prolog_style_variables).
% 0.76/1.46 set(lrpo).
% 0.76/1.46 set(basic_paramod).
% 0.76/1.46 set(functional_subsume).
% 0.76/1.46 set(ordered_paramod).
% 0.76/1.46 set(prime_paramod).
% 0.76/1.46 set(para_pairs).
% 0.76/1.46 assign(pick_given_ratio,4).
% 0.76/1.46 clear(print_kept).
% 0.76/1.46 clear(print_new_demod).
% 0.76/1.46 clear(print_back_demod).
% 0.76/1.46 clear(print_given).
% 0.76/1.46 assign(max_mem,64000).
% 0.76/1.46 end_of_commands.
% 0.76/1.46
% 0.76/1.46 Usable:
% 0.76/1.46 end_of_list.
% 0.76/1.46
% 0.76/1.46 Sos:
% 0.76/1.46 0 (wt=-1) [] double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),C) = B.
% 0.76/1.46 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.76/1.46 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.76/1.46 end_of_list.
% 0.76/1.46
% 0.76/1.46 Demodulators:
% 0.76/1.46 end_of_list.
% 0.76/1.46
% 0.76/1.46 Passive:
% 0.76/1.46 end_of_list.
% 0.76/1.46
% 0.76/1.46 Starting to process input.
% 0.76/1.46
% 0.76/1.46 ** KEPT: 1 (wt=14) [] double_divide(inverse(double_divide(A,inverse(double_divide(inverse(B),double_divide(A,C))))),C) = B.
% 0.76/1.46 1 is a new demodulator.
% 0.76/1.46
% 0.76/1.46 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.76/1.46 2 is a new demodulator.
% 0.76/1.46 -> 2 back demodulating 1.
% 0.76/1.46
% 0.76/1.46 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B) = C.
% 0.76/1.46 3 is a new demodulator.
% 0.76/1.46
% 0.76/1.46 ** KEPT: 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.76/1.46 ---------------- PROOF FOUND ----------------
% 0.76/1.46 % SZS status Unsatisfiable
% 0.76/1.46
% 0.76/1.46
% 0.76/1.46 After processing input:
% 0.76/1.46
% 0.76/1.46 Usable:
% 0.76/1.46 end_of_list.
% 0.76/1.46
% 0.76/1.46 Sos:
% 0.76/1.46 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.76/1.46 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.76/1.46 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B) = C.
% 0.76/1.46 end_of_list.
% 0.76/1.46
% 0.76/1.46 Demodulators:
% 0.76/1.46 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.76/1.46 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(double_divide(A,B),inverse(C)),A),B) = C.
% 0.76/1.46 end_of_list.
% 0.76/1.46
% 0.76/1.46 Passive:
% 0.76/1.46 end_of_list.
% 0.76/1.46
% 0.76/1.46 UNIT CONFLICT from 3053 and 1973 at 0.17 seconds.
% 0.76/1.46
% 0.76/1.46 ---------------- PROOF ----------------
% 0.76/1.46 % SZS output start Refutation
% See solution above
% 0.76/1.46 ------------ end of proof -------------
% 0.76/1.46
% 0.76/1.46
% 0.76/1.46 ------------- memory usage ------------
% 0.76/1.46 Memory dynamically allocated (tp_alloc): 3906.
% 0.76/1.46 type (bytes each) gets frees in use avail bytes
% 0.76/1.46 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.76/1.46 term ( 16) 201975 146931 55044 24 1063.6 K
% 0.76/1.46 gen_ptr ( 8) 295387 68988 226399 54 1769.2 K
% 0.76/1.46 context ( 808) 155524 155522 2 3 3.9 K
% 0.76/1.46 trail ( 12) 22289 22289 0 10 0.1 K
% 0.76/1.46 bt_node ( 68) 54944 54941 3 21 1.6 K
% 0.76/1.46 ac_position (285432) 0 0 0 0 0.0 K
% 0.76/1.46 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.76/1.46 ac_match_free_vars_pos (4020)
% 0.76/1.46 0 0 0 0 0.0 K
% 0.76/1.46 discrim ( 12) 37667 22463 15204 0 178.2 K
% 0.76/1.46 flat ( 40) 454615 454615 0 40 1.6 K
% 0.76/1.46 discrim_pos ( 12) 8731 8731 0 1 0.0 K
% 0.76/1.46 fpa_head ( 12) 6704 0 6704 0 78.6 K
% 0.76/1.46 fpa_tree ( 28) 8198 8198 0 25 0.7 K
% 0.76/1.46 fpa_pos ( 36) 4378 4378 0 1 0.0 K
% 0.76/1.46 literal ( 12) 13703 10650 3053 1 35.8 K
% 0.76/1.46 clause ( 24) 13703 10650 3053 1 71.6 K
% 0.76/1.46 list ( 12) 1384 1328 56 9 0.8 K
% 0.76/1.46 list_pos ( 20) 13310 6067 7243 0 141.5 K
% 0.76/1.46 pair_index ( 40) 2 0 2 0 0.1 K
% 0.76/1.46
% 0.76/1.46 -------------- statistics -------------
% 0.76/1.46 Clauses input 3
% 0.76/1.46 Usable input 0
% 0.76/1.46 Sos input 3
% 0.76/1.46 Demodulators input 0
% 0.76/1.46 Passive input 0
% 0.76/1.46
% 0.76/1.46 Processed BS (before search) 4
% 0.76/1.46 Forward subsumed BS 0
% 0.76/1.46 Kept BS 4
% 0.76/1.46 New demodulators BS 3
% 0.76/1.46 Back demodulated BS 1
% 0.76/1.46
% 0.76/1.46 Clauses or pairs given 13517
% 0.76/1.46 Clauses generated 7953
% 0.76/1.46 Forward subsumed 4904
% 0.76/1.46 Deleted by weight 0
% 0.76/1.46 Deleted by variable count 0
% 0.76/1.46 Kept 3049
% 0.76/1.46 New demodulators 1322
% 0.76/1.46 Back demodulated 1263
% 0.76/1.46 Ordered paramod prunes 0
% 0.76/1.46 Basic paramod prunes 42452
% 0.76/1.46 Prime paramod prunes 604
% 0.76/1.46 Semantic prunes 0
% 0.76/1.46
% 0.76/1.46 Rewrite attmepts 70592
% 0.76/1.46 Rewrites 5487
% 0.76/1.46
% 0.76/1.46 FPA overloads 0
% 0.76/1.46 FPA underloads 0
% 0.76/1.46
% 0.76/1.46 Usable size 0
% 0.76/1.46 Sos size 1788
% 0.76/1.46 Demodulators size 615
% 0.76/1.46 Passive size 0
% 0.76/1.46 Disabled size 1264
% 0.76/1.46
% 0.76/1.46 Proofs found 1
% 0.76/1.46
% 0.76/1.46 ----------- times (seconds) ----------- Tue Jun 14 10:19:04 2022
% 0.76/1.46
% 0.76/1.46 user CPU time 0.17 (0 hr, 0 min, 0 sec)
% 0.76/1.46 system CPU time 0.18 (0 hr, 0 min, 0 sec)
% 0.76/1.46 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.76/1.46 input time 0.00
% 0.76/1.46 paramodulation time 0.02
% 0.76/1.46 demodulation time 0.02
% 0.76/1.46 orient time 0.02
% 0.76/1.46 weigh time 0.00
% 0.76/1.46 forward subsume time 0.01
% 0.76/1.46 back demod find time 0.01
% 0.76/1.46 conflict time 0.00
% 0.76/1.46 LRPO time 0.01
% 0.76/1.46 store clause time 0.04
% 0.76/1.46 disable clause time 0.01
% 0.76/1.46 prime paramod time 0.01
% 0.76/1.46 semantics time 0.00
% 0.76/1.46
% 0.76/1.46 EQP interrupted
%------------------------------------------------------------------------------