TSTP Solution File: KLE169-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : KLE169-10 : TPTP v8.1.0. Released v7.5.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 : Sun Jul 17 01:52:35 EDT 2022
% Result : Unsatisfiable 2.03s 2.43s
% Output : Refutation 2.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 4 RR)
% Number of literals : 27 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-4 aty)
% Number of variables : 51 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ifeq3(A,A,B,C),B),
file('KLE169-10.p',unknown),
[] ).
cnf(2,plain,
equal(ifeq2(A,A,B,C),B),
file('KLE169-10.p',unknown),
[] ).
cnf(4,plain,
equal(addition(A,B),addition(B,A)),
file('KLE169-10.p',unknown),
[] ).
cnf(5,plain,
equal(addition(addition(A,B),C),addition(A,addition(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(7,plain,
equal(addition(A,A),A),
file('KLE169-10.p',unknown),
[] ).
cnf(8,plain,
equal(multiplication(multiplication(A,B),C),multiplication(A,multiplication(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(10,plain,
equal(multiplication(one,A),A),
file('KLE169-10.p',unknown),
[] ).
cnf(11,plain,
equal(multiplication(A,addition(B,C)),addition(multiplication(A,B),multiplication(A,C))),
file('KLE169-10.p',unknown),
[] ).
cnf(12,plain,
equal(multiplication(addition(A,B),C),addition(multiplication(A,C),multiplication(B,C))),
file('KLE169-10.p',unknown),
[] ).
cnf(15,plain,
equal(ifeq2(leq(A,B),true,addition(A,B),B),B),
file('KLE169-10.p',unknown),
[] ).
cnf(16,plain,
equal(ifeq3(addition(A,B),B,leq(A,B),true),true),
file('KLE169-10.p',unknown),
[] ).
cnf(17,plain,
equal(leq(addition(one,multiplication(A,star(A))),star(A)),true),
file('KLE169-10.p',unknown),
[] ).
cnf(21,plain,
equal(addition(a,b),sigma),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(22,plain,
~ equal(leq(multiplication(a,multiplication(b,a)),multiplication(star(sigma),multiplication(a,multiplication(sigma,a)))),true),
file('KLE169-10.p',unknown),
[] ).
cnf(24,plain,
equal(addition(A,addition(B,C)),addition(C,addition(A,B))),
inference(para,[status(thm),theory(equality)],[5,4]),
[iquote('para(5,4)')] ).
cnf(25,plain,
equal(addition(A,addition(B,C)),addition(B,addition(C,A))),
inference(flip,[status(thm),theory(equality)],[24]),
[iquote('flip(24)')] ).
cnf(28,plain,
equal(addition(A,addition(A,B)),addition(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,5]),1]),
[iquote('para(7,5),flip(1)')] ).
cnf(57,plain,
equal(addition(one,addition(multiplication(A,star(A)),star(A))),star(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,15]),5,2]),
[iquote('para(17,15),demod([5,2])')] ).
cnf(95,plain,
equal(multiplication(sigma,A),addition(multiplication(a,A),multiplication(b,A))),
inference(para,[status(thm),theory(equality)],[21,12]),
[iquote('para(21,12)')] ).
cnf(96,plain,
~ equal(leq(multiplication(a,multiplication(b,a)),addition(multiplication(star(sigma),multiplication(a,multiplication(a,a))),multiplication(star(sigma),multiplication(a,multiplication(b,a))))),true),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[22]),95,11,11]),
[iquote('back_demod(22),demod([95,11,11])')] ).
cnf(133,plain,
equal(leq(A,addition(A,B)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[28,16]),1]),
[iquote('para(28,16),demod([1])')] ).
cnf(326,plain,
equal(addition(A,addition(multiplication(B,multiplication(star(B),A)),multiplication(star(B),A))),multiplication(star(B),A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[57,12]),10,12,8]),1]),
[iquote('para(57,12),demod([10,12,8]),flip(1)')] ).
cnf(359,plain,
equal(leq(A,addition(B,addition(C,A))),true),
inference(para,[status(thm),theory(equality)],[25,133]),
[iquote('para(25,133)')] ).
cnf(5792,plain,
equal(addition(A,multiplication(star(B),A)),multiplication(star(B),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[326,28]),326]),
[iquote('para(326,28),demod([326])')] ).
cnf(5813,plain,
equal(addition(multiplication(star(A),B),B),multiplication(star(A),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5792,4]),1]),
[iquote('para(5792,4),flip(1)')] ).
cnf(5995,plain,
equal(leq(A,addition(B,multiplication(star(C),A))),true),
inference(para,[status(thm),theory(equality)],[5813,359]),
[iquote('para(5813,359)')] ).
cnf(5996,plain,
$false,
inference(conflict,[status(thm)],[5995,96]),
[iquote('conflict(5995,96)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KLE169-10 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 08:43:11 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.70/1.11 ----- EQP 0.9e, May 2009 -----
% 0.70/1.11 The job began on n015.cluster.edu, Thu Jun 16 08:43:11 2022
% 0.70/1.11 The command was "./eqp09e".
% 0.70/1.11
% 0.70/1.11 set(prolog_style_variables).
% 0.70/1.11 set(lrpo).
% 0.70/1.11 set(basic_paramod).
% 0.70/1.11 set(functional_subsume).
% 0.70/1.11 set(ordered_paramod).
% 0.70/1.11 set(prime_paramod).
% 0.70/1.11 set(para_pairs).
% 0.70/1.11 assign(pick_given_ratio,4).
% 0.70/1.11 clear(print_kept).
% 0.70/1.11 clear(print_new_demod).
% 0.70/1.11 clear(print_back_demod).
% 0.70/1.11 clear(print_given).
% 0.70/1.11 assign(max_mem,64000).
% 0.70/1.11 end_of_commands.
% 0.70/1.11
% 0.70/1.11 Usable:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Sos:
% 0.70/1.11 0 (wt=-1) [] ifeq3(A,A,B,C) = B.
% 0.70/1.11 0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 0.70/1.11 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.70/1.11 0 (wt=-1) [] addition(A,B) = addition(B,A).
% 0.70/1.11 0 (wt=-1) [] addition(A,addition(B,C)) = addition(addition(A,B),C).
% 0.70/1.11 0 (wt=-1) [] addition(A,zero) = A.
% 0.70/1.11 0 (wt=-1) [] addition(A,A) = A.
% 0.70/1.11 0 (wt=-1) [] multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C).
% 0.70/1.11 0 (wt=-1) [] multiplication(A,one) = A.
% 0.70/1.11 0 (wt=-1) [] multiplication(one,A) = A.
% 0.70/1.11 0 (wt=-1) [] multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)).
% 0.70/1.11 0 (wt=-1) [] multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)).
% 0.70/1.11 0 (wt=-1) [] multiplication(A,zero) = zero.
% 0.70/1.11 0 (wt=-1) [] multiplication(zero,A) = zero.
% 0.70/1.11 0 (wt=-1) [] ifeq2(leq(A,B),true,addition(A,B),B) = B.
% 0.70/1.11 0 (wt=-1) [] ifeq3(addition(A,B),B,leq(A,B),true) = true.
% 0.70/1.11 0 (wt=-1) [] leq(addition(one,multiplication(A,star(A))),star(A)) = true.
% 0.70/1.11 0 (wt=-1) [] leq(addition(one,multiplication(star(A),A)),star(A)) = true.
% 0.70/1.11 0 (wt=-1) [] ifeq(leq(addition(multiplication(A,B),C),B),true,leq(multiplication(star(A),C),B),true) = true.
% 0.70/1.11 0 (wt=-1) [] ifeq(leq(addition(multiplication(A,B),C),A),true,leq(multiplication(C,star(B)),A),true) = true.
% 0.70/1.11 0 (wt=-1) [] sigma = addition(a,b).
% 0.70/1.11 0 (wt=-1) [] -(leq(multiplication(a,multiplication(b,a)),multiplication(star(sigma),multiplication(a,multiplication(sigma,a)))) = true).
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Demodulators:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Passive:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Starting to process input.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 1 (wt=7) [] ifeq3(A,A,B,C) = B.
% 0.70/1.11 1 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 2 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.70/1.11 2 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 3 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.70/1.11 3 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 4 (wt=7) [] addition(A,B) = addition(B,A).
% 0.70/1.11 clause forward subsumed: 0 (wt=7) [flip(4)] addition(B,A) = addition(A,B).
% 0.70/1.11
% 0.70/1.11 ** KEPT: 5 (wt=11) [flip(1)] addition(addition(A,B),C) = addition(A,addition(B,C)).
% 0.70/1.11 5 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 6 (wt=5) [] addition(A,zero) = A.
% 0.70/1.11 6 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 7 (wt=5) [] addition(A,A) = A.
% 0.70/1.11 7 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 8 (wt=11) [flip(1)] multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)).
% 0.70/1.11 8 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 9 (wt=5) [] multiplication(A,one) = A.
% 0.70/1.11 9 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 10 (wt=5) [] multiplication(one,A) = A.
% 0.70/1.11 10 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 11 (wt=13) [] multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)).
% 0.70/1.11 11 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 12 (wt=13) [] multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)).
% 0.70/1.11 12 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 13 (wt=5) [] multiplication(A,zero) = zero.
% 0.70/1.11 13 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 14 (wt=5) [] multiplication(zero,A) = zero.
% 0.70/1.11 14 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 15 (wt=11) [] ifeq2(leq(A,B),true,addition(A,B),B) = B.
% 0.70/1.11 15 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 16 (wt=11) [] ifeq3(addition(A,B),B,leq(A,B),true) = true.
% 0.70/1.11 16 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 17 (wt=11) [] leq(addition(one,multiplication(A,star(A))),star(A)) = true.
% 0.70/1.11 17 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 18 (wt=11) [] leq(addition(one,multiplication(star(A),A)),star(A)) = true.
% 0.70/1.11 18 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 19 (wt=18) [] ifeq(leq(addition(multiplication(A,B),C),B),true,leq(multiplication(star(A),C),B),true) = true.
% 0.70/1.11 19 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 20 (wt=18) [] ifeq(leq(addition(multiplication(A,B),C),A),true,leq(multiplication(C,star(B)),A),true) = true.
% 0.70/1.11 20 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 21 (wt=5) [flip(1)] addition(a,b) = sigma.
% 0.70/1.11 21 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 22 (wt=16) [] -(leq(multiplication(a,multiplication(b,a)),multiplication(star(sigma),multiplication(a,multiplication(sigma,a)))) = true).
% 2.03/2.43 ---------------- PROOF FOUND ----------------
% 2.03/2.43 % SZS status Unsatisfiable
% 2.03/2.43
% 2.03/2.43
% 2.03/2.43 After processing input:
% 2.03/2.43
% 2.03/2.43 Usable:
% 2.03/2.43 end_of_list.
% 2.03/2.43
% 2.03/2.43 Sos:
% 2.03/2.43 6 (wt=5) [] addition(A,zero) = A.
% 2.03/2.43 7 (wt=5) [] addition(A,A) = A.
% 2.03/2.43 9 (wt=5) [] multiplication(A,one) = A.
% 2.03/2.43 10 (wt=5) [] multiplication(one,A) = A.
% 2.03/2.43 13 (wt=5) [] multiplication(A,zero) = zero.
% 2.03/2.43 14 (wt=5) [] multiplication(zero,A) = zero.
% 2.03/2.43 21 (wt=5) [flip(1)] addition(a,b) = sigma.
% 2.03/2.43 1 (wt=7) [] ifeq3(A,A,B,C) = B.
% 2.03/2.43 2 (wt=7) [] ifeq2(A,A,B,C) = B.
% 2.03/2.43 3 (wt=7) [] ifeq(A,A,B,C) = B.
% 2.03/2.43 4 (wt=7) [] addition(A,B) = addition(B,A).
% 2.03/2.43 5 (wt=11) [flip(1)] addition(addition(A,B),C) = addition(A,addition(B,C)).
% 2.03/2.43 8 (wt=11) [flip(1)] multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)).
% 2.03/2.43 15 (wt=11) [] ifeq2(leq(A,B),true,addition(A,B),B) = B.
% 2.03/2.43 16 (wt=11) [] ifeq3(addition(A,B),B,leq(A,B),true) = true.
% 2.03/2.43 17 (wt=11) [] leq(addition(one,multiplication(A,star(A))),star(A)) = true.
% 2.03/2.43 18 (wt=11) [] leq(addition(one,multiplication(star(A),A)),star(A)) = true.
% 2.03/2.43 11 (wt=13) [] multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)).
% 2.03/2.43 12 (wt=13) [] multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)).
% 2.03/2.43 22 (wt=16) [] -(leq(multiplication(a,multiplication(b,a)),multiplication(star(sigma),multiplication(a,multiplication(sigma,a)))) = true).
% 2.03/2.43 19 (wt=18) [] ifeq(leq(addition(multiplication(A,B),C),B),true,leq(multiplication(star(A),C),B),true) = true.
% 2.03/2.43 20 (wt=18) [] ifeq(leq(addition(multiplication(A,B),C),A),true,leq(multiplication(C,star(B)),A),true) = true.
% 2.03/2.43 end_of_list.
% 2.03/2.43
% 2.03/2.43 Demodulators:
% 2.03/2.43 1 (wt=7) [] ifeq3(A,A,B,C) = B.
% 2.03/2.43 2 (wt=7) [] ifeq2(A,A,B,C) = B.
% 2.03/2.43 3 (wt=7) [] ifeq(A,A,B,C) = B.
% 2.03/2.43 5 (wt=11) [flip(1)] addition(addition(A,B),C) = addition(A,addition(B,C)).
% 2.03/2.43 6 (wt=5) [] addition(A,zero) = A.
% 2.03/2.43 7 (wt=5) [] addition(A,A) = A.
% 2.03/2.43 8 (wt=11) [flip(1)] multiplication(multiplication(A,B),C) = multiplication(A,multiplication(B,C)).
% 2.03/2.43 9 (wt=5) [] multiplication(A,one) = A.
% 2.03/2.43 10 (wt=5) [] multiplication(one,A) = A.
% 2.03/2.43 11 (wt=13) [] multiplication(A,addition(B,C)) = addition(multiplication(A,B),multiplication(A,C)).
% 2.03/2.43 12 (wt=13) [] multiplication(addition(A,B),C) = addition(multiplication(A,C),multiplication(B,C)).
% 2.03/2.43 13 (wt=5) [] multiplication(A,zero) = zero.
% 2.03/2.43 14 (wt=5) [] multiplication(zero,A) = zero.
% 2.03/2.43 15 (wt=11) [] ifeq2(leq(A,B),true,addition(A,B),B) = B.
% 2.03/2.43 16 (wt=11) [] ifeq3(addition(A,B),B,leq(A,B),true) = true.
% 2.03/2.43 17 (wt=11) [] leq(addition(one,multiplication(A,star(A))),star(A)) = true.
% 2.03/2.43 18 (wt=11) [] leq(addition(one,multiplication(star(A),A)),star(A)) = true.
% 2.03/2.43 19 (wt=18) [] ifeq(leq(addition(multiplication(A,B),C),B),true,leq(multiplication(star(A),C),B),true) = true.
% 2.03/2.43 20 (wt=18) [] ifeq(leq(addition(multiplication(A,B),C),A),true,leq(multiplication(C,star(B)),A),true) = true.
% 2.03/2.43 21 (wt=5) [flip(1)] addition(a,b) = sigma.
% 2.03/2.43 end_of_list.
% 2.03/2.43
% 2.03/2.43 Passive:
% 2.03/2.43 end_of_list.
% 2.03/2.43
% 2.03/2.43 UNIT CONFLICT from 5995 and 96 at 0.60 seconds.
% 2.03/2.43
% 2.03/2.43 ---------------- PROOF ----------------
% 2.03/2.43 % SZS output start Refutation
% See solution above
% 2.03/2.43 ------------ end of proof -------------
% 2.03/2.43
% 2.03/2.43
% 2.03/2.43 ------------- memory usage ------------
% 2.03/2.43 Memory dynamically allocated (tp_alloc): 9765.
% 2.03/2.43 type (bytes each) gets frees in use avail bytes
% 2.03/2.43 sym_ent ( 96) 64 0 64 0 6.0 K
% 2.03/2.43 term ( 16) 736864 604410 132454 29 2564.1 K
% 2.03/2.43 gen_ptr ( 8) 736698 142079 594619 26 4645.7 K
% 2.03/2.43 context ( 808) 2038346 2038344 2 5 5.5 K
% 2.03/2.43 trail ( 12) 134264 134264 0 6 0.1 K
% 2.03/2.43 bt_node ( 68) 1174855 1174852 3 32 2.3 K
% 2.03/2.43 ac_position (285432) 0 0 0 0 0.0 K
% 2.03/2.43 ac_match_pos (14044) 0 0 0 0 0.0 K
% 2.03/2.43 ac_match_free_vars_pos (4020)
% 2.03/2.43 0 0 0 0 0.0 K
% 2.03/2.43 discrim ( 12) 107774 4580 103194 0 1209.3 K
% 2.03/2.43 flat ( 40) 1493463 1493463 0 45 1.8 K
% 2.03/2.43 discrim_pos ( 12) 46951 46951 0 1 0.0 K
% 2.03/2.43 fpa_head ( 12) 6991 0 6991 0 81.9 K
% 2.03/2.43 fpa_tree ( 28) 48341 48341 0 31 0.8 K
% 2.03/2.43 fpa_pos ( 36) 11025 11025 0 1 0.0 K
% 2.03/2.43 literal ( 12) 36427 30432 5995 1 70.3 K
% 2.03/2.43 clause ( 24) 36427 30432 5995 1 140.5 K
% 2.03/2.43 list ( 12) 5089 5033 56 4 0.7 K
% 2.03/2.43 list_pos ( 20) 23710 1652 22058 0 430.8 K
% 2.03/2.43 pair_index ( 40) 2 0 2 0 0.1 K
% 2.03/2.43
% 2.03/2.43 -------------- statistics -------------
% 2.03/2.43 Clauses input 22
% 2.03/2.43 Usable input 0
% 2.03/2.43 Sos input 22
% 2.03/2.43 Demodulators input 0
% 2.03/2.43 Passive input 0
% 2.03/2.43
% 2.03/2.43 Processed BS (before search) 23
% 2.03/2.43 Forward subsumed BS 1
% 2.03/2.43 Kept BS 22
% 2.03/2.43 New demodulators BS 20
% 2.03/2.43 Back demodulated BS 0
% 2.03/2.43
% 2.03/2.43 Clauses or pairs given 151959
% 2.03/2.43 Clauses generated 26308
% 2.03/2.43 Forward subsumed 20335
% 2.03/2.43 Deleted by weight 0
% 2.03/2.43 Deleted by variable count 0
% 2.03/2.43 Kept 5973
% 2.03/2.43 New demodulators 5010
% 2.03/2.43 Back demodulated 337
% 2.03/2.43 Ordered paramod prunes 0
% 2.03/2.43 Basic paramod prunes 810798
% 2.03/2.43 Prime paramod prunes 809
% 2.03/2.43 Semantic prunes 0
% 2.03/2.43
% 2.03/2.43 Rewrite attmepts 360737
% 2.03/2.43 Rewrites 42420
% 2.03/2.43
% 2.03/2.43 FPA overloads 0
% 2.03/2.43 FPA underloads 0
% 2.03/2.43
% 2.03/2.43 Usable size 0
% 2.03/2.43 Sos size 5657
% 2.03/2.43 Demodulators size 4750
% 2.03/2.43 Passive size 0
% 2.03/2.43 Disabled size 337
% 2.03/2.43
% 2.03/2.43 Proofs found 1
% 2.03/2.43
% 2.03/2.43 ----------- times (seconds) ----------- Thu Jun 16 08:43:13 2022
% 2.03/2.43
% 2.03/2.43 user CPU time 0.60 (0 hr, 0 min, 0 sec)
% 2.03/2.43 system CPU time 0.72 (0 hr, 0 min, 0 sec)
% 2.03/2.43 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.03/2.43 input time 0.00
% 2.03/2.43 paramodulation time 0.15
% 2.03/2.43 demodulation time 0.04
% 2.03/2.43 orient time 0.03
% 2.03/2.43 weigh time 0.01
% 2.03/2.43 forward subsume time 0.02
% 2.03/2.43 back demod find time 0.02
% 2.03/2.43 conflict time 0.01
% 2.03/2.43 LRPO time 0.01
% 2.03/2.43 store clause time 0.15
% 2.03/2.43 disable clause time 0.01
% 2.03/2.43 prime paramod time 0.02
% 2.03/2.43 semantics time 0.00
% 2.03/2.43
% 2.03/2.43 EQP interrupted
%------------------------------------------------------------------------------