TSTP Solution File: GRP413-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP413-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n015.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:33 EDT 2022
% Result : Unsatisfiable 1.54s 1.95s
% Output : Refutation 1.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 31
% Number of leaves : 2
% Syntax : Number of clauses : 45 ( 45 unt; 0 nHn; 3 RR)
% Number of literals : 45 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 14 ( 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 : 155 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B))),C),
file('GRP413-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(multiply(inverse(b2),b2),a2),a2),
file('GRP413-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(A,inverse(multiply(multiply(multiply(inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)),multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)),inverse(multiply(inverse(C),D))),multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)))),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(4,plain,
equal(inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(inverse(multiply(B,inverse(C))),inverse(A))),D))),A)),multiply(B,inverse(multiply(multiply(multiply(inverse(C),C),inverse(D)),C)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),1]),
[iquote('para(1,1),flip(1)')] ).
cnf(6,plain,
equal(multiply(A,inverse(multiply(multiply(multiply(inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)),multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)),inverse(D)),multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)))),inverse(multiply(multiply(multiply(inverse(E),E),inverse(multiply(inverse(multiply(inverse(C),inverse(E))),D))),E))),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(10,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(C)),B)))),C),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(11,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(C,B)))),multiply(multiply(multiply(inverse(D),D),inverse(multiply(inverse(multiply(multiply(inverse(B),B),inverse(D))),C))),D)),
inference(para,[status(thm),theory(equality)],[1,10]),
[iquote('para(1,10)')] ).
cnf(12,plain,
equal(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(multiply(inverse(B),B),inverse(A))),C))),A),multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(multiply(C,B))))),
inference(flip,[status(thm),theory(equality)],[11]),
[iquote('flip(11)')] ).
cnf(20,plain,
equal(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(multiply(inverse(B),B),inverse(A))),multiply(multiply(inverse(B),B),inverse(C))))),A),C),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,11]),1]),
[iquote('para(10,11),flip(1)')] ).
cnf(38,plain,
equal(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(A))),multiply(B,inverse(multiply(C,A)))))),C),
inference(para,[status(thm),theory(equality)],[12,1]),
[iquote('para(12,1)')] ).
cnf(45,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(C,B)))),multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(multiply(C,B))))),
inference(para,[status(thm),theory(equality)],[38,10]),
[iquote('para(38,10)')] ).
cnf(67,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)],[20,45]),20]),
[iquote('para(20,45),demod([20])')] ).
cnf(76,plain,
equal(inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(inverse(B),inverse(A))),multiply(inverse(B),C)))),A)),C),
inference(para,[status(thm),theory(equality)],[6,3]),
[iquote('para(6,3)')] ).
cnf(99,plain,
equal(inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(inverse(B),inverse(A))),C))),A)),inverse(multiply(multiply(multiply(inverse(D),D),inverse(multiply(inverse(multiply(inverse(B),inverse(D))),C))),D))),
inference(para,[status(thm),theory(equality)],[6,6]),
[iquote('para(6,6)')] ).
cnf(117,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,C)),multiply(inverse(multiply(D,inverse(B))),multiply(D,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[76,67]),76]),
[iquote('para(76,67),demod([76])')] ).
cnf(121,plain,
equal(multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(C,inverse(B))),multiply(C,D)))),B))),multiply(A,D)),
inference(para,[status(thm),theory(equality)],[117,1]),
[iquote('para(117,1)')] ).
cnf(148,plain,
equal(inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(A))),multiply(B,C)))),A)),C),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[121,1]),1]),1]),
[iquote('para(121,1),demod([1]),flip(1)')] ).
cnf(157,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),C),B)))),multiply(multiply(multiply(inverse(D),D),inverse(multiply(inverse(multiply(E,inverse(D))),multiply(E,C)))),D)),
inference(para,[status(thm),theory(equality)],[148,10]),
[iquote('para(148,10)')] ).
cnf(366,plain,
equal(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(inverse(B),inverse(A))),C))),A),multiply(multiply(multiply(inverse(D),D),inverse(multiply(inverse(multiply(inverse(B),inverse(D))),C))),D)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[99,10]),10]),
[iquote('para(99,10),demod([10])')] ).
cnf(393,plain,
equal(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(A))),C))),A),multiply(multiply(multiply(inverse(D),D),inverse(multiply(inverse(multiply(B,inverse(D))),C))),D)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[148,366]),148]),
[iquote('para(148,366),demod([148])')] ).
cnf(471,plain,
equal(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(A))),multiply(B,inverse(C))))),A),C),
inference(para,[status(thm),theory(equality)],[157,10]),
[iquote('para(157,10)')] ).
cnf(472,plain,
equal(multiply(inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(A))),multiply(B,inverse(C))))),inverse(D))),C),multiply(inverse(multiply(E,inverse(D))),multiply(E,A))),
inference(para,[status(thm),theory(equality)],[471,117]),
[iquote('para(471,117)')] ).
cnf(473,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,C)),multiply(inverse(multiply(multiply(multiply(inverse(C),C),inverse(multiply(inverse(multiply(D,inverse(C))),multiply(D,inverse(E))))),inverse(B))),E)),
inference(flip,[status(thm),theory(equality)],[472]),
[iquote('flip(472)')] ).
cnf(552,plain,
equal(multiply(inverse(multiply(A,inverse(multiply(B,inverse(C))))),multiply(A,inverse(multiply(multiply(multiply(inverse(D),D),inverse(E)),multiply(B,inverse(C)))))),E),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[473,10]),471]),
[iquote('para(473,10),demod([471])')] ).
cnf(564,plain,
equal(multiply(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(B))),inverse(C)),multiply(multiply(inverse(D),D),inverse(C))),
inference(para,[status(thm),theory(equality)],[552,38]),
[iquote('para(552,38)')] ).
cnf(575,plain,
equal(multiply(inverse(A),A),multiply(inverse(multiply(B,inverse(C))),multiply(B,inverse(C)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[564,38]),38]),
[iquote('para(564,38),demod([38])')] ).
cnf(576,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(B))),multiply(inverse(C),C)),
inference(flip,[status(thm),theory(equality)],[575]),
[iquote('flip(575)')] ).
cnf(598,plain,
equal(multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(C),C))),B))),multiply(A,inverse(B))),
inference(para,[status(thm),theory(equality)],[576,1]),
[iquote('para(576,1)')] ).
cnf(635,plain,
equal(inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(B),B))),A)),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[598,1]),1]),1]),
[iquote('para(598,1),demod([1]),flip(1)')] ).
cnf(651,plain,
equal(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(B),B))),A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[635,10]),10]),1]),
[iquote('para(635,10),demod([10]),flip(1)')] ).
cnf(659,plain,
equal(multiply(inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(B),B))),inverse(C))),A),multiply(inverse(multiply(D,inverse(C))),multiply(D,A))),
inference(para,[status(thm),theory(equality)],[651,117]),
[iquote('para(651,117)')] ).
cnf(660,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,C)),multiply(inverse(multiply(multiply(multiply(inverse(C),C),inverse(multiply(inverse(D),D))),inverse(B))),C)),
inference(flip,[status(thm),theory(equality)],[659]),
[iquote('flip(659)')] ).
cnf(718,plain,
equal(multiply(multiply(inverse(A),A),inverse(B)),multiply(multiply(inverse(C),C),inverse(B))),
inference(para,[status(thm),theory(equality)],[564,564]),
[iquote('para(564,564)')] ).
cnf(728,plain,
equal(multiply(inverse(A),A),multiply(inverse(B),B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[718,38]),38]),
[iquote('para(718,38),demod([38])')] ).
cnf(730,plain,
equal(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(C))),multiply(B,inverse(multiply(D,C)))))),D),
inference(para,[status(thm),theory(equality)],[718,38]),
[iquote('para(718,38)')] ).
cnf(1053,plain,
equal(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(C))),D))),C),multiply(multiply(multiply(inverse(E),E),inverse(multiply(inverse(multiply(B,inverse(E))),D))),E)),
inference(para,[status(thm),theory(equality)],[728,393]),
[iquote('para(728,393)')] ).
cnf(1069,plain,
equal(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(B),B))),C),C),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[728,1053]),471]),
[iquote('para(728,1053),demod([471])')] ).
cnf(1076,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,C)),multiply(inverse(inverse(B)),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[660]),1069]),
[iquote('back_demod(660),demod([1069])')] ).
cnf(1188,plain,
equal(multiply(multiply(inverse(A),A),inverse(multiply(inverse(inverse(B)),inverse(multiply(C,B))))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[730]),1076]),
[iquote('back_demod(730),demod([1076])')] ).
cnf(1428,plain,
equal(multiply(multiply(inverse(A),A),inverse(multiply(inverse(inverse(B)),inverse(multiply(inverse(C),C))))),inverse(B)),
inference(para,[status(thm),theory(equality)],[728,1188]),
[iquote('para(728,1188)')] ).
cnf(1434,plain,
equal(multiply(multiply(inverse(A),A),inverse(multiply(inverse(B),B))),inverse(multiply(inverse(C),C))),
inference(para,[status(thm),theory(equality)],[728,1428]),
[iquote('para(728,1428)')] ).
cnf(1523,plain,
equal(multiply(multiply(inverse(A),A),inverse(multiply(inverse(inverse(inverse(multiply(inverse(B),B)))),inverse(inverse(multiply(inverse(C),C)))))),multiply(inverse(D),D)),
inference(para,[status(thm),theory(equality)],[1434,1188]),
[iquote('para(1434,1188)')] ).
cnf(1524,plain,
equal(multiply(inverse(A),A),multiply(multiply(inverse(B),B),inverse(multiply(inverse(inverse(inverse(multiply(inverse(C),C)))),inverse(inverse(multiply(inverse(D),D))))))),
inference(flip,[status(thm),theory(equality)],[1523]),
[iquote('flip(1523)')] ).
cnf(1750,plain,
~ equal(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(inverse(inverse(multiply(inverse(B),B)))),inverse(inverse(multiply(inverse(C),C)))))),a2),a2),
inference(para,[status(thm),theory(equality)],[1524,2]),
[iquote('para(1524,2)')] ).
cnf(1751,plain,
$false,
inference(conflict,[status(thm)],[1750,1069]),
[iquote('conflict(1750,1069)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP413-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n015.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 20:50:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.54/1.95 ----- EQP 0.9e, May 2009 -----
% 1.54/1.95 The job began on n015.cluster.edu, Mon Jun 13 20:50:09 2022
% 1.54/1.95 The command was "./eqp09e".
% 1.54/1.95
% 1.54/1.95 set(prolog_style_variables).
% 1.54/1.95 set(lrpo).
% 1.54/1.95 set(basic_paramod).
% 1.54/1.95 set(functional_subsume).
% 1.54/1.95 set(ordered_paramod).
% 1.54/1.95 set(prime_paramod).
% 1.54/1.95 set(para_pairs).
% 1.54/1.95 assign(pick_given_ratio,4).
% 1.54/1.95 clear(print_kept).
% 1.54/1.95 clear(print_new_demod).
% 1.54/1.95 clear(print_back_demod).
% 1.54/1.95 clear(print_given).
% 1.54/1.95 assign(max_mem,64000).
% 1.54/1.95 end_of_commands.
% 1.54/1.95
% 1.54/1.95 Usable:
% 1.54/1.95 end_of_list.
% 1.54/1.95
% 1.54/1.95 Sos:
% 1.54/1.95 0 (wt=-1) [] multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B))) = C.
% 1.54/1.95 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 1.54/1.95 end_of_list.
% 1.54/1.95
% 1.54/1.95 Demodulators:
% 1.54/1.95 end_of_list.
% 1.54/1.95
% 1.54/1.95 Passive:
% 1.54/1.95 end_of_list.
% 1.54/1.95
% 1.54/1.95 Starting to process input.
% 1.54/1.95
% 1.54/1.95 ** KEPT: 1 (wt=20) [] multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B))) = C.
% 1.54/1.95 1 is a new demodulator.
% 1.54/1.95
% 1.54/1.95 ** KEPT: 2 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 1.54/1.95 ---------------- PROOF FOUND ----------------
% 1.54/1.95 % SZS status Unsatisfiable
% 1.54/1.95
% 1.54/1.95
% 1.54/1.95 After processing input:
% 1.54/1.95
% 1.54/1.95 Usable:
% 1.54/1.95 end_of_list.
% 1.54/1.95
% 1.54/1.95 Sos:
% 1.54/1.95 2 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 1.54/1.95 1 (wt=20) [] multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B))) = C.
% 1.54/1.95 end_of_list.
% 1.54/1.95
% 1.54/1.95 Demodulators:
% 1.54/1.95 1 (wt=20) [] multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B))) = C.
% 1.54/1.95 end_of_list.
% 1.54/1.95
% 1.54/1.95 Passive:
% 1.54/1.95 end_of_list.
% 1.54/1.95
% 1.54/1.95 UNIT CONFLICT from 1750 and 1069 at 0.75 seconds.
% 1.54/1.95
% 1.54/1.95 ---------------- PROOF ----------------
% 1.54/1.95 % SZS output start Refutation
% See solution above
% 1.54/1.95 ------------ end of proof -------------
% 1.54/1.95
% 1.54/1.95
% 1.54/1.95 ------------- memory usage ------------
% 1.54/1.95 Memory dynamically allocated (tp_alloc): 36132.
% 1.54/1.95 type (bytes each) gets frees in use avail bytes
% 1.54/1.95 sym_ent ( 96) 55 0 55 0 5.2 K
% 1.54/1.95 term ( 16) 756737 377924 378813 561 7402.8 K
% 1.54/1.95 gen_ptr ( 8) 3181749 105099 3076650 44 24036.7 K
% 1.54/1.95 context ( 808) 495004 495002 2 3 3.9 K
% 1.54/1.95 trail ( 12) 57499 57499 0 14 0.2 K
% 1.54/1.95 bt_node ( 68) 50847 50843 4 521 34.9 K
% 1.54/1.95 ac_position (285432) 0 0 0 0 0.0 K
% 1.54/1.95 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.54/1.95 ac_match_free_vars_pos (4020)
% 1.54/1.95 0 0 0 0 0.0 K
% 1.54/1.95 discrim ( 12) 382443 70204 312239 0 3659.1 K
% 1.54/1.95 flat ( 40) 3985491 3985491 0 1595 62.3 K
% 1.54/1.95 discrim_pos ( 12) 3420 3420 0 1 0.0 K
% 1.54/1.95 fpa_head ( 12) 7870 0 7870 0 92.2 K
% 1.54/1.95 fpa_tree ( 28) 14621 14621 0 73 2.0 K
% 1.54/1.95 fpa_pos ( 36) 2494 2494 0 1 0.0 K
% 1.54/1.95 literal ( 12) 6563 4813 1750 1 20.5 K
% 1.54/1.95 clause ( 24) 6563 4813 1750 1 41.0 K
% 1.54/1.95 list ( 12) 803 747 56 6 0.7 K
% 1.54/1.95 list_pos ( 20) 7531 3262 4269 0 83.4 K
% 1.54/1.95 pair_index ( 40) 2 0 2 0 0.1 K
% 1.54/1.95
% 1.54/1.95 -------------- statistics -------------
% 1.54/1.95 Clauses input 2
% 1.54/1.95 Usable input 0
% 1.54/1.95 Sos input 2
% 1.54/1.95 Demodulators input 0
% 1.54/1.95 Passive input 0
% 1.54/1.95
% 1.54/1.95 Processed BS (before search) 2
% 1.54/1.95 Forward subsumed BS 0
% 1.54/1.95 Kept BS 2
% 1.54/1.95 New demodulators BS 1
% 1.54/1.95 Back demodulated BS 0
% 1.54/1.95
% 1.54/1.95 Clauses or pairs given 1983
% 1.54/1.95 Clauses generated 3557
% 1.54/1.95 Forward subsumed 1809
% 1.54/1.95 Deleted by weight 0
% 1.54/1.95 Deleted by variable count 0
% 1.54/1.95 Kept 1748
% 1.54/1.95 New demodulators 743
% 1.54/1.95 Back demodulated 711
% 1.54/1.95 Ordered paramod prunes 0
% 1.54/1.95 Basic paramod prunes 46993
% 1.54/1.95 Prime paramod prunes 38
% 1.54/1.95 Semantic prunes 0
% 1.54/1.95
% 1.54/1.95 Rewrite attmepts 385792
% 1.54/1.95 Rewrites 2212
% 1.54/1.95
% 1.54/1.95 FPA overloads 0
% 1.54/1.95 FPA underloads 0
% 1.54/1.95
% 1.54/1.95 Usable size 0
% 1.54/1.95 Sos size 1038
% 1.54/1.95 Demodulators size 444
% 1.54/1.95 Passive size 0
% 1.54/1.95 Disabled size 711
% 1.54/1.95
% 1.54/1.95 Proofs found 1
% 1.54/1.95
% 1.54/1.95 ----------- times (seconds) ----------- Mon Jun 13 20:50:10 2022
% 1.54/1.95
% 1.54/1.95 user CPU time 0.75 (0 hr, 0 min, 0 sec)
% 1.54/1.95 system CPU time 0.07 (0 hr, 0 min, 0 sec)
% 1.54/1.95 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.54/1.95 input time 0.00
% 1.54/1.95 paramodulation time 0.05
% 1.54/1.95 demodulation time 0.09
% 1.54/1.95 orient time 0.02
% 1.54/1.95 weigh time 0.01
% 1.54/1.95 forward subsume time 0.02
% 1.54/1.95 back demod find time 0.12
% 1.54/1.95 conflict time 0.00
% 1.54/1.95 LRPO time 0.01
% 1.54/1.95 store clause time 0.38
% 1.54/1.96 disable clause time 0.01
% 1.54/1.96 prime paramod time 0.03
% 1.54/1.96 semantics time 0.00
% 1.54/1.96
% 1.54/1.96 EQP interrupted
%------------------------------------------------------------------------------