TSTP Solution File: GRP184-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP184-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n009.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:48 EDT 2022
% Result : Unsatisfiable 0.79s 1.17s
% Output : Refutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 4 RR)
% Number of literals : 22 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP184-2.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP184-2.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP184-2.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP184-2.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,greatest_lower_bound(B,C)),greatest_lower_bound(multiply(A,B),multiply(A,C))),
file('GRP184-2.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP184-2.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(greatest_lower_bound(A,B),C),greatest_lower_bound(multiply(A,C),multiply(B,C))),
file('GRP184-2.p',unknown),
[] ).
cnf(17,plain,
equal(inverse(inverse(A)),A),
file('GRP184-2.p',unknown),
[] ).
cnf(18,plain,
equal(inverse(multiply(A,B)),multiply(inverse(B),inverse(A))),
file('GRP184-2.p',unknown),
[] ).
cnf(19,plain,
~ equal(least_upper_bound(multiply(inverse(greatest_lower_bound(a,identity)),a),multiply(inverse(greatest_lower_bound(a,identity)),identity)),least_upper_bound(multiply(a,inverse(greatest_lower_bound(a,identity))),inverse(greatest_lower_bound(a,identity)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14,1,12]),1]),
[iquote('demod([14,1,12]),flip(1)')] ).
cnf(20,plain,
equal(multiply(A,inverse(A)),identity),
inference(para,[status(thm),theory(equality)],[17,2]),
[iquote('para(17,2)')] ).
cnf(21,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(44,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,21]),17]),
[iquote('para(2,21),demod([17])')] ).
cnf(45,plain,
~ equal(least_upper_bound(multiply(inverse(greatest_lower_bound(a,identity)),a),inverse(greatest_lower_bound(a,identity))),least_upper_bound(multiply(a,inverse(greatest_lower_bound(a,identity))),inverse(greatest_lower_bound(a,identity)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[19]),44]),
[iquote('back_demod(19),demod([44])')] ).
cnf(55,plain,
equal(inverse(greatest_lower_bound(multiply(A,B),multiply(A,C))),multiply(inverse(greatest_lower_bound(B,C)),inverse(A))),
inference(para,[status(thm),theory(equality)],[13,18]),
[iquote('para(13,18)')] ).
cnf(58,plain,
equal(inverse(greatest_lower_bound(multiply(A,B),multiply(C,B))),multiply(inverse(B),inverse(greatest_lower_bound(A,C)))),
inference(para,[status(thm),theory(equality)],[15,18]),
[iquote('para(15,18)')] ).
cnf(444,plain,
equal(inverse(greatest_lower_bound(identity,multiply(inverse(A),B))),multiply(inverse(greatest_lower_bound(A,B)),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,55]),17]),
[iquote('para(2,55),demod([17])')] ).
cnf(501,plain,
equal(inverse(greatest_lower_bound(identity,inverse(A))),multiply(inverse(greatest_lower_bound(A,identity)),A)),
inference(para,[status(thm),theory(equality)],[44,444]),
[iquote('para(44,444)')] ).
cnf(526,plain,
equal(inverse(greatest_lower_bound(identity,multiply(A,inverse(B)))),multiply(B,inverse(greatest_lower_bound(B,A)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,58]),17]),
[iquote('para(20,58),demod([17])')] ).
cnf(528,plain,
equal(multiply(inverse(greatest_lower_bound(A,identity)),A),multiply(A,inverse(greatest_lower_bound(A,identity)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,526]),501]),
[iquote('para(1,526),demod([501])')] ).
cnf(534,plain,
~ equal(least_upper_bound(multiply(a,inverse(greatest_lower_bound(a,identity))),inverse(greatest_lower_bound(a,identity))),least_upper_bound(multiply(a,inverse(greatest_lower_bound(a,identity))),inverse(greatest_lower_bound(a,identity)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[45]),528]),
[iquote('back_demod(45),demod([528])')] ).
cnf(535,plain,
$false,
inference(conflict,[status(thm)],[534]),
[iquote('xx_conflict(534)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP184-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n009.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 09:00:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.40/1.05 ----- EQP 0.9e, May 2009 -----
% 0.40/1.05 The job began on n009.cluster.edu, Mon Jun 13 09:00:53 2022
% 0.40/1.05 The command was "./eqp09e".
% 0.40/1.05
% 0.40/1.05 set(prolog_style_variables).
% 0.40/1.05 set(lrpo).
% 0.40/1.05 set(basic_paramod).
% 0.40/1.05 set(functional_subsume).
% 0.40/1.05 set(ordered_paramod).
% 0.40/1.05 set(prime_paramod).
% 0.40/1.05 set(para_pairs).
% 0.40/1.05 assign(pick_given_ratio,4).
% 0.40/1.05 clear(print_kept).
% 0.40/1.05 clear(print_new_demod).
% 0.40/1.05 clear(print_back_demod).
% 0.40/1.05 clear(print_given).
% 0.40/1.05 assign(max_mem,64000).
% 0.40/1.05 end_of_commands.
% 0.40/1.05
% 0.40/1.05 Usable:
% 0.40/1.05 end_of_list.
% 0.40/1.05
% 0.40/1.05 Sos:
% 0.40/1.05 0 (wt=-1) [] multiply(identity,A) = A.
% 0.40/1.05 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.40/1.05 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.40/1.05 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.40/1.05 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.40/1.05 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.40/1.05 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.40/1.05 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.40/1.05 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.40/1.05 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.40/1.05 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.40/1.05 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.40/1.05 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.40/1.05 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.40/1.05 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.40/1.05 0 (wt=-1) [] inverse(identity) = identity.
% 0.40/1.05 0 (wt=-1) [] inverse(inverse(A)) = A.
% 0.40/1.05 0 (wt=-1) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.40/1.05 0 (wt=-1) [] -(multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) = multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity))).
% 0.40/1.05 end_of_list.
% 0.40/1.05
% 0.40/1.05 Demodulators:
% 0.40/1.05 end_of_list.
% 0.40/1.05
% 0.40/1.05 Passive:
% 0.40/1.05 end_of_list.
% 0.40/1.05
% 0.40/1.05 Starting to process input.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.40/1.05 1 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.40/1.05 2 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.40/1.05 3 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.40/1.05 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.40/1.05
% 0.40/1.05 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.40/1.05 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.40/1.05
% 0.40/1.05 ** 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.40/1.05 6 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** 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.40/1.05 7 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.40/1.05 8 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.40/1.05 9 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.40/1.05 10 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.40/1.05 11 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.40/1.05 12 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.40/1.05 13 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.40/1.05 14 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.40/1.05 15 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 16 (wt=4) [] inverse(identity) = identity.
% 0.40/1.05 16 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.40/1.05 17 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.40/1.05 18 is a new demodulator.
% 0.40/1.05
% 0.40/1.05 ** KEPT: 19 (wt=25) [demod([14,1,12]),flip(1)] -(least_upper_bound(multiply(inverse(greatest_lower_bound(a,identity)),a),multiply(inverse(greatest_lower_bound(a,identity)),identity)) = least_upper_bound(multiply(a,inverse(greatest_lower_bound(a,identity))),inverse(greatest_lower_bound(a,identity)))).
% 0.79/1.17 ---------------- PROOF FOUND ----------------
% 0.79/1.17 % SZS status Unsatisfiable
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 After processing input:
% 0.79/1.17
% 0.79/1.17 Usable:
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Sos:
% 0.79/1.17 16 (wt=4) [] inverse(identity) = identity.
% 0.79/1.17 1 (wt=5) [] multiply(identity,A) = A.
% 0.79/1.17 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.79/1.17 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.79/1.17 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.79/1.17 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.79/1.17 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.79/1.17 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.79/1.17 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.79/1.17 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.79/1.17 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.79/1.17 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.79/1.17 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.79/1.17 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.79/1.17 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.79/1.17 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.79/1.17 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.79/1.17 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.79/1.17 19 (wt=25) [demod([14,1,12]),flip(1)] -(least_upper_bound(multiply(inverse(greatest_lower_bound(a,identity)),a),multiply(inverse(greatest_lower_bound(a,identity)),identity)) = least_upper_bound(multiply(a,inverse(greatest_lower_bound(a,identity))),inverse(greatest_lower_bound(a,identity)))).
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Demodulators:
% 0.79/1.17 1 (wt=5) [] multiply(identity,A) = A.
% 0.79/1.17 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.79/1.17 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.79/1.17 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.79/1.17 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.79/1.17 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.79/1.17 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.79/1.17 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.79/1.17 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.79/1.17 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.79/1.17 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.79/1.17 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.79/1.17 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.79/1.17 16 (wt=4) [] inverse(identity) = identity.
% 0.79/1.17 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.79/1.17 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 Passive:
% 0.79/1.17 end_of_list.
% 0.79/1.17
% 0.79/1.17 UNIT CONFLICT from 534 and x=x at 0.05 seconds.
% 0.79/1.17
% 0.79/1.17 ---------------- PROOF ----------------
% 0.79/1.17 % SZS output start Refutation
% See solution above
% 0.79/1.17 ------------ end of proof -------------
% 0.79/1.17
% 0.79/1.17
% 0.79/1.17 ------------- memory usage ------------
% 0.79/1.17 Memory dynamically allocated (tp_alloc): 976.
% 0.79/1.17 type (bytes each) gets frees in use avail bytes
% 0.79/1.17 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.79/1.17 term ( 16) 65314 55838 9476 26 183.5 K
% 0.79/1.17 gen_ptr ( 8) 48989 12034 36955 21 288.9 K
% 0.79/1.17 context ( 808) 54654 54652 2 5 5.5 K
% 0.79/1.17 trail ( 12) 3108 3108 0 5 0.1 K
% 0.79/1.17 bt_node ( 68) 22651 22648 3 12 1.0 K
% 0.79/1.17 ac_position (285432) 0 0 0 0 0.0 K
% 0.79/1.17 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.79/1.17 ac_match_free_vars_pos (4020)
% 0.79/1.17 0 0 0 0 0.0 K
% 0.79/1.17 discrim ( 12) 8073 226 7847 18 92.2 K
% 0.79/1.17 flat ( 40) 104431 104431 0 35 1.4 K
% 0.79/1.17 discrim_pos ( 12) 3721 3721 0 1 0.0 K
% 0.79/1.17 fpa_head ( 12) 2533 0 2533 0 29.7 K
% 0.79/1.17 fpa_tree ( 28) 1484 1484 0 17 0.5 K
% 0.79/1.17 fpa_pos ( 36) 961 961 0 1 0.0 K
% 0.79/1.17 literal ( 12) 3298 2764 534 0 6.3 K
% 0.79/1.17 clause ( 24) 3298 2764 534 0 12.5 K
% 0.79/1.17 list ( 12) 487 430 57 2 0.7 K
% 0.79/1.17 list_pos ( 20) 2090 116 1974 3 38.6 K
% 0.79/1.17 pair_index ( 40) 2 0 2 0 0.1 K
% 0.79/1.17
% 0.79/1.17 -------------- statistics -------------
% 0.79/1.17 Clauses input 19
% 0.79/1.17 Usable input 0
% 0.79/1.17 Sos input 19
% 0.79/1.17 Demodulators input 0
% 0.79/1.17 Passive input 0
% 0.79/1.17
% 0.79/1.17 Processed BS (before search) 21
% 0.79/1.17 Forward subsumed BS 2
% 0.79/1.17 Kept BS 19
% 0.79/1.17 New demodulators BS 16
% 0.79/1.17 Back demodulated BS 0
% 0.79/1.17
% 0.79/1.17 Clauses or pairs given 4833
% 0.79/1.17 Clauses generated 2309
% 0.79/1.17 Forward subsumed 1794
% 0.79/1.17 Deleted by weight 0
% 0.79/1.17 Deleted by variable count 0
% 0.79/1.17 Kept 515
% 0.79/1.17 New demodulators 412
% 0.79/1.17 Back demodulated 22
% 0.79/1.17 Ordered paramod prunes 0
% 0.79/1.17 Basic paramod prunes 10204
% 0.79/1.17 Prime paramod prunes 74
% 0.79/1.17 Semantic prunes 0
% 0.79/1.17
% 0.79/1.17 Rewrite attmepts 20463
% 0.79/1.17 Rewrites 3320
% 0.79/1.17
% 0.79/1.17 FPA overloads 0
% 0.79/1.17 FPA underloads 0
% 0.79/1.17
% 0.79/1.17 Usable size 0
% 0.79/1.17 Sos size 511
% 0.79/1.17 Demodulators size 419
% 0.79/1.17 Passive size 0
% 0.79/1.17 Disabled size 22
% 0.79/1.17
% 0.79/1.17 Proofs found 1
% 0.79/1.17
% 0.79/1.17 ----------- times (seconds) ----------- Mon Jun 13 09:00:53 2022
% 0.79/1.17
% 0.79/1.17 user CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.79/1.17 system CPU time 0.07 (0 hr, 0 min, 0 sec)
% 0.79/1.17 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.79/1.17 input time 0.00
% 0.79/1.17 paramodulation time 0.01
% 0.79/1.17 demodulation time 0.01
% 0.79/1.17 orient time 0.00
% 0.79/1.17 weigh time 0.00
% 0.79/1.17 forward subsume time 0.00
% 0.79/1.17 back demod find time 0.00
% 0.79/1.17 conflict time 0.00
% 0.79/1.17 LRPO time 0.00
% 0.79/1.17 store clause time 0.00
% 0.79/1.17 disable clause time 0.00
% 0.79/1.17 prime paramod time 0.00
% 0.79/1.17 semantics time 0.00
% 0.79/1.17
% 0.79/1.17 EQP interrupted
%------------------------------------------------------------------------------