TSTP Solution File: GRP193-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP193-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n032.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:45:53 EDT 2022
% Result : Unsatisfiable 0.84s 1.26s
% Output : Refutation 0.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 9 RR)
% Number of literals : 22 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 27 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP193-1.p',unknown),
[] ).
cnf(4,plain,
equal(greatest_lower_bound(A,B),greatest_lower_bound(B,A)),
file('GRP193-1.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP193-1.p',unknown),
[] ).
cnf(6,plain,
equal(greatest_lower_bound(greatest_lower_bound(A,B),C),greatest_lower_bound(A,greatest_lower_bound(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(7,plain,
equal(least_upper_bound(least_upper_bound(A,B),C),least_upper_bound(A,least_upper_bound(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(10,plain,
equal(least_upper_bound(A,greatest_lower_bound(A,B)),A),
file('GRP193-1.p',unknown),
[] ).
cnf(11,plain,
equal(greatest_lower_bound(A,least_upper_bound(A,B)),A),
file('GRP193-1.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,greatest_lower_bound(B,C)),greatest_lower_bound(multiply(A,B),multiply(A,C))),
file('GRP193-1.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(greatest_lower_bound(A,B),C),greatest_lower_bound(multiply(A,C),multiply(B,C))),
file('GRP193-1.p',unknown),
[] ).
cnf(17,plain,
equal(least_upper_bound(identity,b),b),
file('GRP193-1.p',unknown),
[] ).
cnf(19,plain,
equal(greatest_lower_bound(a,b),identity),
file('GRP193-1.p',unknown),
[] ).
cnf(20,plain,
equal(least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)),greatest_lower_bound(a,c)),
inference(demod,[status(thm),theory(equality)],[19,13,1,1,19,13,1,1]),
[iquote('demod([19,13,1,1,19,13,1,1])')] ).
cnf(21,plain,
~ equal(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)),
file('GRP193-1.p',unknown),
[] ).
cnf(29,plain,
equal(greatest_lower_bound(identity,b),identity),
inference(para,[status(thm),theory(equality)],[17,11]),
[iquote('para(17,11)')] ).
cnf(40,plain,
equal(least_upper_bound(A,greatest_lower_bound(B,A)),A),
inference(para,[status(thm),theory(equality)],[4,10]),
[iquote('para(4,10)')] ).
cnf(51,plain,
equal(greatest_lower_bound(b,identity),identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,4]),1]),
[iquote('para(29,4),flip(1)')] ).
cnf(57,plain,
equal(least_upper_bound(greatest_lower_bound(A,B),B),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[40,5]),1]),
[iquote('para(40,5),flip(1)')] ).
cnf(85,plain,
equal(least_upper_bound(greatest_lower_bound(a,multiply(b,c)),least_upper_bound(greatest_lower_bound(a,c),A)),least_upper_bound(greatest_lower_bound(a,c),A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,7]),1]),
[iquote('para(20,7),flip(1)')] ).
cnf(282,plain,
equal(greatest_lower_bound(multiply(b,A),A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[51,15]),1,1]),1]),
[iquote('para(51,15),demod([1,1]),flip(1)')] ).
cnf(553,plain,
equal(least_upper_bound(greatest_lower_bound(a,multiply(b,c)),c),c),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[57,85]),57]),
[iquote('para(57,85),demod([57])')] ).
cnf(1906,plain,
equal(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[553,11]),6,282]),1]),
[iquote('para(553,11),demod([6,282]),flip(1)')] ).
cnf(1907,plain,
$false,
inference(conflict,[status(thm)],[1906,21]),
[iquote('conflict(1906,21)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : GRP193-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.10 % Command : tptp2X_and_run_eqp %s
% 0.08/0.29 % Computer : n032.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 600
% 0.08/0.29 % DateTime : Mon Jun 13 06:00:11 EDT 2022
% 0.08/0.29 % CPUTime :
% 0.54/0.93 ----- EQP 0.9e, May 2009 -----
% 0.54/0.93 The job began on n032.cluster.edu, Mon Jun 13 06:00:12 2022
% 0.54/0.93 The command was "./eqp09e".
% 0.54/0.93
% 0.54/0.93 set(prolog_style_variables).
% 0.54/0.93 set(lrpo).
% 0.54/0.93 set(basic_paramod).
% 0.54/0.93 set(functional_subsume).
% 0.54/0.93 set(ordered_paramod).
% 0.54/0.93 set(prime_paramod).
% 0.54/0.93 set(para_pairs).
% 0.54/0.93 assign(pick_given_ratio,4).
% 0.54/0.93 clear(print_kept).
% 0.54/0.93 clear(print_new_demod).
% 0.54/0.93 clear(print_back_demod).
% 0.54/0.93 clear(print_given).
% 0.54/0.93 assign(max_mem,64000).
% 0.54/0.93 end_of_commands.
% 0.54/0.93
% 0.54/0.93 Usable:
% 0.54/0.93 end_of_list.
% 0.54/0.93
% 0.54/0.93 Sos:
% 0.54/0.93 0 (wt=-1) [] multiply(identity,A) = A.
% 0.54/0.93 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.54/0.93 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.54/0.93 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.54/0.93 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.54/0.93 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.54/0.93 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.54/0.93 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.54/0.93 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.54/0.93 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.54/0.93 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.54/0.93 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.54/0.93 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.54/0.93 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.54/0.93 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.54/0.93 0 (wt=-1) [] least_upper_bound(identity,a) = a.
% 0.54/0.93 0 (wt=-1) [] least_upper_bound(identity,b) = b.
% 0.54/0.93 0 (wt=-1) [] least_upper_bound(identity,c) = c.
% 0.54/0.93 0 (wt=-1) [] greatest_lower_bound(a,b) = identity.
% 0.54/0.93 0 (wt=-1) [] least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)).
% 0.54/0.93 0 (wt=-1) [] -(greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c)).
% 0.54/0.93 end_of_list.
% 0.54/0.93
% 0.54/0.93 Demodulators:
% 0.54/0.93 end_of_list.
% 0.54/0.93
% 0.54/0.93 Passive:
% 0.54/0.93 end_of_list.
% 0.54/0.93
% 0.54/0.93 Starting to process input.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.54/0.93 1 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.54/0.93 2 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.54/0.93 3 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.54/0.93 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.54/0.93
% 0.54/0.93 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.54/0.93 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.54/0.93
% 0.54/0.93 ** KEPT: 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.54/0.93 6 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.54/0.93 7 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.54/0.93 8 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.54/0.93 9 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.54/0.93 10 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.54/0.93 11 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.54/0.93 12 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.54/0.93 13 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.54/0.93 14 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.54/0.93 15 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 16 (wt=5) [] least_upper_bound(identity,a) = a.
% 0.54/0.93 16 is a new demodulator.
% 0.54/0.93
% 0.54/0.93 ** KEPT: 17 (wt=5) [] least_upper_bound(identity,b) = b.
% 0.54/0.93 17 is a new demodulator.
% 0.84/1.26
% 0.84/1.26 ** KEPT: 18 (wt=5) [] least_upper_bound(identity,c) = c.
% 0.84/1.26 18 is a new demodulator.
% 0.84/1.26
% 0.84/1.26 ** KEPT: 19 (wt=5) [] greatest_lower_bound(a,b) = identity.
% 0.84/1.26 19 is a new demodulator.
% 0.84/1.26
% 0.84/1.26 ** KEPT: 20 (wt=13) [demod([19,13,1,1,19,13,1,1])] least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)) = greatest_lower_bound(a,c).
% 0.84/1.26 20 is a new demodulator.
% 0.84/1.26
% 0.84/1.26 ** KEPT: 21 (wt=9) [] -(greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c)).
% 0.84/1.26 ---------------- PROOF FOUND ----------------
% 0.84/1.26 % SZS status Unsatisfiable
% 0.84/1.26
% 0.84/1.26
% 0.84/1.26 After processing input:
% 0.84/1.26
% 0.84/1.26 Usable:
% 0.84/1.26 end_of_list.
% 0.84/1.26
% 0.84/1.26 Sos:
% 0.84/1.26 1 (wt=5) [] multiply(identity,A) = A.
% 0.84/1.26 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.84/1.26 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.84/1.26 16 (wt=5) [] least_upper_bound(identity,a) = a.
% 0.84/1.26 17 (wt=5) [] least_upper_bound(identity,b) = b.
% 0.84/1.26 18 (wt=5) [] least_upper_bound(identity,c) = c.
% 0.84/1.26 19 (wt=5) [] greatest_lower_bound(a,b) = identity.
% 0.84/1.26 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.84/1.26 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.84/1.26 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.84/1.26 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.84/1.26 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.84/1.26 21 (wt=9) [] -(greatest_lower_bound(a,multiply(b,c)) = greatest_lower_bound(a,c)).
% 0.84/1.26 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.84/1.26 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.84/1.26 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.84/1.26 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.84/1.26 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.84/1.26 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.84/1.26 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.84/1.26 20 (wt=13) [demod([19,13,1,1,19,13,1,1])] least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)) = greatest_lower_bound(a,c).
% 0.84/1.26 end_of_list.
% 0.84/1.26
% 0.84/1.26 Demodulators:
% 0.84/1.26 1 (wt=5) [] multiply(identity,A) = A.
% 0.84/1.26 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.84/1.26 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.84/1.26 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.84/1.26 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.84/1.26 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.84/1.26 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.84/1.26 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.84/1.26 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.84/1.26 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.84/1.26 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.84/1.26 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.84/1.26 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.84/1.26 16 (wt=5) [] least_upper_bound(identity,a) = a.
% 0.84/1.26 17 (wt=5) [] least_upper_bound(identity,b) = b.
% 0.84/1.26 18 (wt=5) [] least_upper_bound(identity,c) = c.
% 0.84/1.26 19 (wt=5) [] greatest_lower_bound(a,b) = identity.
% 0.84/1.26 20 (wt=13) [demod([19,13,1,1,19,13,1,1])] least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c)) = greatest_lower_bound(a,c).
% 0.84/1.26 end_of_list.
% 0.84/1.26
% 0.84/1.26 Passive:
% 0.84/1.26 end_of_list.
% 0.84/1.26
% 0.84/1.26 UNIT CONFLICT from 1906 and 21 at 0.12 seconds.
% 0.84/1.26
% 0.84/1.26 ---------------- PROOF ----------------
% 0.84/1.26 % SZS output start Refutation
% See solution above
% 0.84/1.26 ------------ end of proof -------------
% 0.84/1.26
% 0.84/1.26
% 0.84/1.26 ------------- memory usage ------------
% 0.84/1.26 Memory dynamically allocated (tp_alloc): 2441.
% 0.84/1.26 type (bytes each) gets frees in use avail bytes
% 0.84/1.26 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.84/1.26 term ( 16) 183184 149408 33776 27 652.8 K
% 0.84/1.26 gen_ptr ( 8) 171010 31623 139387 21 1089.1 K
% 0.84/1.26 context ( 808) 287003 287001 2 5 5.5 K
% 0.84/1.26 trail ( 12) 9436 9436 0 5 0.1 K
% 0.84/1.26 bt_node ( 68) 152827 152824 3 14 1.1 K
% 0.84/1.26 ac_position (285432) 0 0 0 0 0.0 K
% 0.84/1.26 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.84/1.26 ac_match_free_vars_pos (4020)
% 0.84/1.26 0 0 0 0 0.0 K
% 0.84/1.26 discrim ( 12) 23560 952 22608 0 264.9 K
% 0.84/1.26 flat ( 40) 360283 360283 0 91 3.6 K
% 0.84/1.26 discrim_pos ( 12) 10365 10365 0 1 0.0 K
% 0.84/1.26 fpa_head ( 12) 4645 0 4645 0 54.4 K
% 0.84/1.26 fpa_tree ( 28) 5286 5286 0 39 1.1 K
% 0.84/1.26 fpa_pos ( 36) 3052 3052 0 1 0.0 K
% 0.84/1.26 literal ( 12) 10925 9019 1906 1 22.3 K
% 0.84/1.26 clause ( 24) 10925 9019 1906 1 44.7 K
% 0.84/1.26 list ( 12) 1205 1149 56 3 0.7 K
% 0.84/1.26 list_pos ( 20) 7072 452 6620 0 129.3 K
% 0.84/1.26 pair_index ( 40) 2 0 2 0 0.1 K
% 0.84/1.26
% 0.84/1.26 -------------- statistics -------------
% 0.84/1.26 Clauses input 21
% 0.84/1.26 Usable input 0
% 0.84/1.26 Sos input 21
% 0.84/1.26 Demodulators input 0
% 0.84/1.26 Passive input 0
% 0.84/1.26
% 0.84/1.26 Processed BS (before search) 23
% 0.84/1.26 Forward subsumed BS 2
% 0.84/1.26 Kept BS 21
% 0.84/1.26 New demodulators BS 18
% 0.84/1.26 Back demodulated BS 0
% 0.84/1.26
% 0.84/1.26 Clauses or pairs given 33448
% 0.84/1.26 Clauses generated 6893
% 0.84/1.26 Forward subsumed 5008
% 0.84/1.26 Deleted by weight 0
% 0.84/1.26 Deleted by variable count 0
% 0.84/1.26 Kept 1885
% 0.84/1.26 New demodulators 1128
% 0.84/1.26 Back demodulated 95
% 0.84/1.26 Ordered paramod prunes 0
% 0.84/1.26 Basic paramod prunes 138901
% 0.84/1.26 Prime paramod prunes 310
% 0.84/1.26 Semantic prunes 0
% 0.84/1.26
% 0.84/1.26 Rewrite attmepts 73523
% 0.84/1.26 Rewrites 8242
% 0.84/1.26
% 0.84/1.26 FPA overloads 0
% 0.84/1.26 FPA underloads 0
% 0.84/1.26
% 0.84/1.26 Usable size 0
% 0.84/1.26 Sos size 1810
% 0.84/1.26 Demodulators size 1095
% 0.84/1.26 Passive size 0
% 0.84/1.26 Disabled size 95
% 0.84/1.26
% 0.84/1.26 Proofs found 1
% 0.84/1.26
% 0.84/1.26 ----------- times (seconds) ----------- Mon Jun 13 06:00:12 2022
% 0.84/1.26
% 0.84/1.26 user CPU time 0.12 (0 hr, 0 min, 0 sec)
% 0.84/1.26 system CPU time 0.20 (0 hr, 0 min, 0 sec)
% 0.84/1.26 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.84/1.26 input time 0.00
% 0.84/1.26 paramodulation time 0.03
% 0.84/1.26 demodulation time 0.01
% 0.84/1.26 orient time 0.01
% 0.84/1.26 weigh time 0.00
% 0.84/1.26 forward subsume time 0.01
% 0.84/1.26 back demod find time 0.00
% 0.84/1.26 conflict time 0.00
% 0.84/1.26 LRPO time 0.01
% 0.84/1.26 store clause time 0.01
% 0.84/1.26 disable clause time 0.00
% 0.84/1.26 prime paramod time 0.00
% 0.84/1.26 semantics time 0.00
% 0.84/1.26
% 0.84/1.26 EQP interrupted
%------------------------------------------------------------------------------