TSTP Solution File: BOO017-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO017-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n026.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 : Thu Jul 14 23:37:08 EDT 2022
% Result : Unsatisfiable 0.69s 1.15s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 6 RR)
% Number of literals : 34 ( 0 equ; 4 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 50 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('BOO017-2.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO017-2.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(add(A,B),add(A,C)),add(A,multiply(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('BOO017-2.p',unknown),
[] ).
cnf(6,plain,
equal(add(multiply(A,add(A,B)),multiply(C,add(A,B))),add(A,multiply(C,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),5]),
[iquote('back_demod(4),demod([5])')] ).
cnf(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('BOO017-2.p',unknown),
[] ).
cnf(10,plain,
equal(add(add(multiply(A,A),multiply(A,B)),add(multiply(C,A),multiply(C,B))),add(A,multiply(C,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[6]),8,8]),
[iquote('back_demod(6),demod([8,8])')] ).
cnf(11,plain,
equal(add(A,inverse(A)),multiplicative_identity),
file('BOO017-2.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,inverse(A)),additive_identity),
file('BOO017-2.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(inverse(A),A),additive_identity),
file('BOO017-2.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(A,multiplicative_identity),A),
file('BOO017-2.p',unknown),
[] ).
cnf(16,plain,
equal(multiply(multiplicative_identity,A),A),
file('BOO017-2.p',unknown),
[] ).
cnf(17,plain,
equal(add(A,additive_identity),A),
file('BOO017-2.p',unknown),
[] ).
cnf(18,plain,
equal(add(additive_identity,A),A),
file('BOO017-2.p',unknown),
[] ).
cnf(19,plain,
equal(add(x,y),z),
file('BOO017-2.p',unknown),
[] ).
cnf(20,plain,
~ equal(multiply(x,z),x),
file('BOO017-2.p',unknown),
[] ).
cnf(21,plain,
equal(add(multiply(A,B),multiply(C,B)),add(multiply(B,A),multiply(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,2]),8]),
[iquote('para(5,2),demod([8])')] ).
cnf(56,plain,
equal(add(multiply(A,B),multiply(inverse(A),B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,5]),16]),1]),
[iquote('para(11,5),demod([16]),flip(1)')] ).
cnf(57,plain,
equal(add(multiply(A,B),multiply(A,inverse(B))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,8]),15]),1]),
[iquote('para(11,8),demod([15]),flip(1)')] ).
cnf(66,plain,
equal(add(A,multiply(B,inverse(A))),add(multiply(A,A),B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,10]),17,57]),1]),
[iquote('para(13,10),demod([17,57]),flip(1)')] ).
cnf(92,plain,
equal(multiply(A,z),add(multiply(A,x),multiply(A,y))),
inference(para,[status(thm),theory(equality)],[19,8]),
[iquote('para(19,8)')] ).
cnf(93,plain,
~ equal(add(multiply(x,x),multiply(x,y)),x),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[20]),92]),
[iquote('back_demod(20),demod([92])')] ).
cnf(94,plain,
equal(add(multiply(A,B),multiply(A,C)),add(multiply(C,A),multiply(B,A))),
inference(para,[status(thm),theory(equality)],[21,1]),
[iquote('para(21,1)')] ).
cnf(117,plain,
equal(multiply(A,inverse(inverse(A))),inverse(inverse(A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,56]),17]),
[iquote('para(13,56),demod([17])')] ).
cnf(122,plain,
equal(multiply(inverse(inverse(A)),A),inverse(inverse(A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[117,2]),1]),
[iquote('para(117,2),flip(1)')] ).
cnf(123,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,56]),122,18]),
[iquote('para(14,56),demod([122,18])')] ).
cnf(124,plain,
equal(multiply(A,A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[122]),123,123]),
[iquote('back_demod(122),demod([123,123])')] ).
cnf(135,plain,
~ equal(add(x,multiply(x,y)),x),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[93]),124]),
[iquote('back_demod(93),demod([124])')] ).
cnf(145,plain,
equal(add(A,multiply(B,inverse(A))),add(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[66]),124]),
[iquote('back_demod(66),demod([124])')] ).
cnf(240,plain,
equal(add(A,multiplicative_identity),multiplicative_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,145]),11]),1]),
[iquote('para(16,145),demod([11]),flip(1)')] ).
cnf(331,plain,
equal(add(A,multiply(A,B)),add(multiply(B,A),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,94]),16]),
[iquote('para(15,94),demod([16])')] ).
cnf(397,plain,
~ equal(add(multiply(y,x),x),x),
inference(para,[status(thm),theory(equality)],[331,135]),
[iquote('para(331,135)')] ).
cnf(515,plain,
equal(add(multiply(A,B),B),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[240,5]),16,16]),1]),
[iquote('para(240,5),demod([16,16]),flip(1)')] ).
cnf(516,plain,
$false,
inference(conflict,[status(thm)],[515,397]),
[iquote('conflict(515,397)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : BOO017-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.11 % Command : tptp2X_and_run_eqp %s
% 0.11/0.32 % Computer : n026.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Wed Jun 1 20:39:12 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.69/1.15 ----- EQP 0.9e, May 2009 -----
% 0.69/1.15 The job began on n026.cluster.edu, Wed Jun 1 20:39:12 2022
% 0.69/1.15 The command was "./eqp09e".
% 0.69/1.15
% 0.69/1.15 set(prolog_style_variables).
% 0.69/1.15 set(lrpo).
% 0.69/1.15 set(basic_paramod).
% 0.69/1.15 set(functional_subsume).
% 0.69/1.15 set(ordered_paramod).
% 0.69/1.15 set(prime_paramod).
% 0.69/1.15 set(para_pairs).
% 0.69/1.15 assign(pick_given_ratio,4).
% 0.69/1.15 clear(print_kept).
% 0.69/1.15 clear(print_new_demod).
% 0.69/1.15 clear(print_back_demod).
% 0.69/1.15 clear(print_given).
% 0.69/1.15 assign(max_mem,64000).
% 0.69/1.15 end_of_commands.
% 0.69/1.15
% 0.69/1.15 Usable:
% 0.69/1.15 end_of_list.
% 0.69/1.15
% 0.69/1.15 Sos:
% 0.69/1.15 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.69/1.15 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 0.69/1.15 0 (wt=-1) [] add(multiply(A,B),C) = multiply(add(A,C),add(B,C)).
% 0.69/1.15 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 0.69/1.15 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.69/1.15 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.69/1.15 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 0.69/1.15 0 (wt=-1) [] add(inverse(A),A) = multiplicative_identity.
% 0.69/1.15 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 0.69/1.15 0 (wt=-1) [] multiply(inverse(A),A) = additive_identity.
% 0.69/1.15 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 0.69/1.15 0 (wt=-1) [] multiply(multiplicative_identity,A) = A.
% 0.69/1.15 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.69/1.15 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.69/1.15 0 (wt=-1) [] add(x,y) = z.
% 0.69/1.15 0 (wt=-1) [] -(multiply(x,z) = x).
% 0.69/1.15 end_of_list.
% 0.69/1.15
% 0.69/1.15 Demodulators:
% 0.69/1.15 end_of_list.
% 0.69/1.15
% 0.69/1.15 Passive:
% 0.69/1.15 end_of_list.
% 0.69/1.15
% 0.69/1.15 Starting to process input.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.69/1.15 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.69/1.15
% 0.69/1.15 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.69/1.15 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 0.69/1.15
% 0.69/1.15 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(C,B)) = add(multiply(A,C),B).
% 0.69/1.15 3 is a new demodulator.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 4 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 0.69/1.15 4 is a new demodulator.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.69/1.15 5 is a new demodulator.
% 0.69/1.15 -> 5 back demodulating 4.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 6 (wt=17) [back_demod(4),demod([5])] add(multiply(A,add(A,B)),multiply(C,add(A,B))) = add(A,multiply(C,B)).
% 0.69/1.15 6 is a new demodulator.
% 0.69/1.15 -> 5 back demodulating 3.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 7 (wt=17) [back_demod(3),demod([5])] add(multiply(A,add(B,C)),multiply(C,add(B,C))) = add(multiply(A,B),C).
% 0.69/1.15 7 is a new demodulator.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.69/1.15 8 is a new demodulator.
% 0.69/1.15 -> 8 back demodulating 7.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 9 (wt=21) [back_demod(7),demod([8,8])] add(add(multiply(A,B),multiply(A,C)),add(multiply(C,B),multiply(C,C))) = add(multiply(A,B),C).
% 0.69/1.15 9 is a new demodulator.
% 0.69/1.15 -> 8 back demodulating 6.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 10 (wt=21) [back_demod(6),demod([8,8])] add(add(multiply(A,A),multiply(A,B)),add(multiply(C,A),multiply(C,B))) = add(A,multiply(C,B)).
% 0.69/1.15 10 is a new demodulator.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.69/1.15 11 is a new demodulator.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.69/1.15 12 is a new demodulator.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.69/1.15 13 is a new demodulator.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.69/1.15 14 is a new demodulator.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.69/1.15 15 is a new demodulator.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.69/1.15 16 is a new demodulator.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 17 (wt=5) [] add(A,additive_identity) = A.
% 0.69/1.15 17 is a new demodulator.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 18 (wt=5) [] add(additive_identity,A) = A.
% 0.69/1.15 18 is a new demodulator.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 19 (wt=5) [] add(x,y) = z.
% 0.69/1.15 19 is a new demodulator.
% 0.69/1.15
% 0.69/1.15 ** KEPT: 20 (wt=5) [] -(multiply(x,z) = x).
% 0.69/1.15 ---------------- PROOF FOUND ----------------
% 0.69/1.15 % SZS status Unsatisfiable
% 0.69/1.15
% 0.69/1.15
% 0.69/1.15 After processing input:
% 0.69/1.15
% 0.69/1.15 Usable:
% 0.69/1.15 end_of_list.
% 0.69/1.15
% 0.69/1.15 Sos:
% 0.69/1.15 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.69/1.15 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.69/1.15 17 (wt=5) [] add(A,additive_identity) = A.
% 0.69/1.15 18 (wt=5) [] add(additive_identity,A) = A.
% 0.69/1.15 19 (wt=5) [] add(x,y) = z.
% 0.69/1.15 20 (wt=5) [] -(multiply(x,z) = x).
% 0.69/1.15 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.69/1.15 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.69/1.15 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.69/1.15 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.69/1.15 1 (wt=7) [] add(A,B) = add(B,A).
% 0.69/1.15 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.69/1.15 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.69/1.15 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.69/1.15 9 (wt=21) [back_demod(7),demod([8,8])] add(add(multiply(A,B),multiply(A,C)),add(multiply(C,B),multiply(C,C))) = add(multiply(A,B),C).
% 0.69/1.15 10 (wt=21) [back_demod(6),demod([8,8])] add(add(multiply(A,A),multiply(A,B)),add(multiply(C,A),multiply(C,B))) = add(A,multiply(C,B)).
% 0.69/1.15 end_of_list.
% 0.69/1.15
% 0.69/1.15 Demodulators:
% 0.69/1.15 5 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.69/1.15 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.69/1.15 9 (wt=21) [back_demod(7),demod([8,8])] add(add(multiply(A,B),multiply(A,C)),add(multiply(C,B),multiply(C,C))) = add(multiply(A,B),C).
% 0.69/1.15 10 (wt=21) [back_demod(6),demod([8,8])] add(add(multiply(A,A),multiply(A,B)),add(multiply(C,A),multiply(C,B))) = add(A,multiply(C,B)).
% 0.69/1.15 11 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.69/1.15 12 (wt=6) [] add(inverse(A),A) = multiplicative_identity.
% 0.69/1.15 13 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.69/1.15 14 (wt=6) [] multiply(inverse(A),A) = additive_identity.
% 0.69/1.15 15 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.69/1.15 16 (wt=5) [] multiply(multiplicative_identity,A) = A.
% 0.69/1.15 17 (wt=5) [] add(A,additive_identity) = A.
% 0.69/1.15 18 (wt=5) [] add(additive_identity,A) = A.
% 0.69/1.15 19 (wt=5) [] add(x,y) = z.
% 0.69/1.15 end_of_list.
% 0.69/1.15
% 0.69/1.15 Passive:
% 0.69/1.15 end_of_list.
% 0.69/1.15
% 0.69/1.15 UNIT CONFLICT from 515 and 397 at 0.04 seconds.
% 0.69/1.15
% 0.69/1.15 ---------------- PROOF ----------------
% 0.69/1.15 % SZS output start Refutation
% See solution above
% 0.69/1.15 ------------ end of proof -------------
% 0.69/1.15
% 0.69/1.15
% 0.69/1.15 ------------- memory usage ------------
% 0.69/1.15 Memory dynamically allocated (tp_alloc): 976.
% 0.69/1.15 type (bytes each) gets frees in use avail bytes
% 0.69/1.15 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.69/1.15 term ( 16) 48193 36748 11445 40 222.3 K
% 0.69/1.15 gen_ptr ( 8) 54544 10113 44431 35 347.4 K
% 0.69/1.15 context ( 808) 43496 43494 2 3 3.9 K
% 0.69/1.15 trail ( 12) 6869 6869 0 4 0.0 K
% 0.69/1.15 bt_node ( 68) 17823 17820 3 12 1.0 K
% 0.69/1.15 ac_position (285432) 0 0 0 0 0.0 K
% 0.69/1.15 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.69/1.15 ac_match_free_vars_pos (4020)
% 0.69/1.15 0 0 0 0 0.0 K
% 0.69/1.15 discrim ( 12) 7870 1791 6079 103 72.4 K
% 0.69/1.15 flat ( 40) 102978 102978 0 47 1.8 K
% 0.69/1.15 discrim_pos ( 12) 2929 2929 0 1 0.0 K
% 0.69/1.15 fpa_head ( 12) 1190 0 1190 0 13.9 K
% 0.69/1.15 fpa_tree ( 28) 1281 1281 0 17 0.5 K
% 0.69/1.15 fpa_pos ( 36) 746 746 0 1 0.0 K
% 0.69/1.15 literal ( 12) 2739 2224 515 1 6.0 K
% 0.69/1.15 clause ( 24) 2739 2224 515 1 12.1 K
% 0.69/1.15 list ( 12) 290 234 56 4 0.7 K
% 0.69/1.15 list_pos ( 20) 2007 524 1483 12 29.2 K
% 0.69/1.15 pair_index ( 40) 2 0 2 0 0.1 K
% 0.69/1.15
% 0.69/1.15 -------------- statistics -------------
% 0.69/1.15 Clauses input 16
% 0.69/1.15 Usable input 0
% 0.69/1.15 Sos input 16
% 0.69/1.15 Demodulators input 0
% 0.69/1.15 Passive input 0
% 0.69/1.15
% 0.69/1.15 Processed BS (before search) 22
% 0.69/1.15 Forward subsumed BS 2
% 0.69/1.15 Kept BS 20
% 0.69/1.15 New demodulators BS 17
% 0.69/1.15 Back demodulated BS 4
% 0.69/1.15
% 0.69/1.15 Clauses or pairs given 2977
% 0.69/1.15 Clauses generated 1590
% 0.69/1.15 Forward subsumed 1095
% 0.69/1.15 Deleted by weight 0
% 0.69/1.15 Deleted by variable count 0
% 0.69/1.15 Kept 495
% 0.69/1.15 New demodulators 214
% 0.69/1.15 Back demodulated 104
% 0.69/1.15 Ordered paramod prunes 0
% 0.69/1.15 Basic paramod prunes 7625
% 0.69/1.15 Prime paramod prunes 109
% 0.69/1.15 Semantic prunes 0
% 0.69/1.15
% 0.69/1.15 Rewrite attmepts 19573
% 0.69/1.15 Rewrites 2314
% 0.69/1.15
% 0.69/1.15 FPA overloads 0
% 0.69/1.15 FPA underloads 0
% 0.69/1.15
% 0.69/1.15 Usable size 0
% 0.69/1.15 Sos size 406
% 0.69/1.15 Demodulators size 157
% 0.69/1.15 Passive size 0
% 0.69/1.15 Disabled size 108
% 0.69/1.15
% 0.69/1.15 Proofs found 1
% 0.69/1.15
% 0.69/1.15 ----------- times (seconds) ----------- Wed Jun 1 20:39:12 2022
% 0.69/1.15
% 0.69/1.15 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.69/1.15 system CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.69/1.15 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.69/1.15 input time 0.00
% 0.69/1.15 paramodulation time 0.02
% 0.69/1.15 demodulation time 0.00
% 0.69/1.15 orient time 0.01
% 0.69/1.15 weigh time 0.00
% 0.69/1.15 forward subsume time 0.00
% 0.69/1.15 back demod find time 0.00
% 0.69/1.15 conflict time 0.00
% 0.69/1.15 LRPO time 0.00
% 0.69/1.15 store clause time 0.00
% 0.69/1.15 disable clause time 0.00
% 0.69/1.15 prime paramod time 0.00
% 0.69/1.15 semantics time 0.00
% 0.69/1.15
% 0.69/1.15 EQP interrupted
%------------------------------------------------------------------------------