TSTP Solution File: BOO008-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO008-4 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n029.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:05 EDT 2022
% Result : Unsatisfiable 2.10s 2.53s
% Output : Refutation 2.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 7
% Syntax : Number of clauses : 55 ( 55 unt; 0 nHn; 2 RR)
% Number of literals : 55 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 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 : 129 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('BOO008-4.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO008-4.p',unknown),
[] ).
cnf(3,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(4,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('BOO008-4.p',unknown),
[] ).
cnf(5,plain,
equal(add(multiply(add(A,B),A),multiply(add(A,B),C)),add(A,multiply(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),4]),
[iquote('back_demod(3),demod([4])')] ).
cnf(6,plain,
equal(add(A,additive_identity),A),
file('BOO008-4.p',unknown),
[] ).
cnf(7,plain,
equal(multiply(A,multiplicative_identity),A),
file('BOO008-4.p',unknown),
[] ).
cnf(8,plain,
equal(add(A,inverse(A)),multiplicative_identity),
file('BOO008-4.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(A,inverse(A)),additive_identity),
file('BOO008-4.p',unknown),
[] ).
cnf(10,plain,
~ equal(add(add(a,b),c),add(a,add(b,c))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(11,plain,
equal(add(additive_identity,A),A),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(13,plain,
equal(add(multiply(A,B),multiply(A,C)),multiply(add(B,C),A)),
inference(para,[status(thm),theory(equality)],[4,2]),
[iquote('para(4,2)')] ).
cnf(15,plain,
equal(multiply(multiplicative_identity,A),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,2]),1]),
[iquote('para(7,2),flip(1)')] ).
cnf(24,plain,
equal(add(add(multiply(add(add(A,B),C),A),multiply(add(add(A,B),C),B)),multiply(add(add(A,B),C),D)),add(add(A,B),multiply(C,D))),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(25,plain,
equal(add(multiply(add(A,B),A),add(multiply(add(A,B),C),multiply(add(A,B),D))),add(A,add(multiply(B,C),multiply(B,D)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,5]),4]),
[iquote('para(4,5),demod([4])')] ).
cnf(28,plain,
equal(add(multiply(A,A),multiply(A,B)),add(A,multiply(additive_identity,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,5]),6]),
[iquote('para(6,5),demod([6])')] ).
cnf(29,plain,
equal(add(A,multiply(additive_identity,B)),add(multiply(A,A),multiply(A,B))),
inference(flip,[status(thm),theory(equality)],[28]),
[iquote('flip(28)')] ).
cnf(33,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)],[8,4]),7]),1]),
[iquote('para(8,4),demod([7]),flip(1)')] ).
cnf(34,plain,
equal(multiply(inverse(A),A),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,2]),1]),
[iquote('para(9,2),flip(1)')] ).
cnf(35,plain,
equal(add(A,multiply(inverse(A),B)),add(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,5]),15,8,15]),1]),
[iquote('para(8,5),demod([15,8,15]),flip(1)')] ).
cnf(46,plain,
equal(add(multiply(A,B),multiply(B,C)),multiply(add(A,C),B)),
inference(para,[status(thm),theory(equality)],[2,13]),
[iquote('para(2,13)')] ).
cnf(59,plain,
equal(add(A,multiply(A,B)),multiply(add(multiplicative_identity,B),A)),
inference(para,[status(thm),theory(equality)],[7,13]),
[iquote('para(7,13)')] ).
cnf(60,plain,
equal(multiply(add(multiplicative_identity,A),B),add(B,multiply(B,A))),
inference(flip,[status(thm),theory(equality)],[59]),
[iquote('flip(59)')] ).
cnf(61,plain,
equal(add(multiply(A,B),A),multiply(add(B,multiplicative_identity),A)),
inference(para,[status(thm),theory(equality)],[7,13]),
[iquote('para(7,13)')] ).
cnf(62,plain,
equal(multiply(add(A,multiplicative_identity),B),add(multiply(B,A),B)),
inference(flip,[status(thm),theory(equality)],[61]),
[iquote('flip(61)')] ).
cnf(63,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)],[7,35]),8]),1]),
[iquote('para(7,35),demod([8]),flip(1)')] ).
cnf(64,plain,
equal(add(multiply(A,B),A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[62]),63,15]),1]),
[iquote('back_demod(62),demod([63,15]),flip(1)')] ).
cnf(67,plain,
equal(add(multiplicative_identity,A),multiplicative_identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[63,1]),1]),
[iquote('para(63,1),flip(1)')] ).
cnf(68,plain,
equal(add(A,multiply(A,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[60]),67,15]),1]),
[iquote('back_demod(60),demod([67,15]),flip(1)')] ).
cnf(70,plain,
equal(multiply(additive_identity,A),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[64,6]),1]),
[iquote('para(64,6),flip(1)')] ).
cnf(71,plain,
equal(add(multiply(A,A),multiply(A,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[29]),70,6]),1]),
[iquote('back_demod(29),demod([70,6]),flip(1)')] ).
cnf(73,plain,
equal(add(A,A),A),
inference(para,[status(thm),theory(equality)],[7,64]),
[iquote('para(7,64)')] ).
cnf(83,plain,
equal(add(multiply(A,B),B),B),
inference(para,[status(thm),theory(equality)],[2,64]),
[iquote('para(2,64)')] ).
cnf(84,plain,
equal(add(A,multiply(B,A)),A),
inference(para,[status(thm),theory(equality)],[2,68]),
[iquote('para(2,68)')] ).
cnf(95,plain,
equal(multiply(A,A),A),
inference(para,[status(thm),theory(equality)],[73,71]),
[iquote('para(73,71)')] ).
cnf(183,plain,
equal(add(multiply(A,B),multiply(B,inverse(A))),B),
inference(para,[status(thm),theory(equality)],[2,33]),
[iquote('para(2,33)')] ).
cnf(184,plain,
equal(add(multiply(A,B),multiply(inverse(B),A)),A),
inference(para,[status(thm),theory(equality)],[2,33]),
[iquote('para(2,33)')] ).
cnf(191,plain,
equal(add(add(multiply(add(add(A,add(B,C)),D),A),add(multiply(add(add(A,add(B,C)),D),B),multiply(add(add(A,add(B,C)),D),C))),multiply(add(add(A,add(B,C)),D),E)),add(add(A,add(B,C)),multiply(D,E))),
inference(para,[status(thm),theory(equality)],[4,24]),
[iquote('para(4,24)')] ).
cnf(212,plain,
equal(add(multiply(add(A,B),A),add(multiply(add(A,B),C),add(multiply(add(A,B),D),multiply(add(A,B),E)))),add(A,add(multiply(B,C),add(multiply(B,D),multiply(B,E))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,25]),4]),
[iquote('para(4,25),demod([4])')] ).
cnf(216,plain,
equal(add(A,add(multiply(A,B),multiply(A,C))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,25]),95,6,6,70,70,73,6]),
[iquote('para(6,25),demod([95,6,6,70,70,73,6])')] ).
cnf(217,plain,
equal(add(A,add(multiply(inverse(A),B),multiply(inverse(A),C))),add(A,add(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,25]),15,8,15,8,15]),1]),
[iquote('para(8,25),demod([15,8,15,8,15]),flip(1)')] ).
cnf(220,plain,
equal(add(multiply(A,B),multiply(inverse(A),B)),B),
inference(para,[status(thm),theory(equality)],[2,183]),
[iquote('para(2,183)')] ).
cnf(279,plain,
equal(add(A,add(multiply(B,A),multiply(A,C))),A),
inference(para,[status(thm),theory(equality)],[2,216]),
[iquote('para(2,216)')] ).
cnf(300,plain,
equal(add(A,add(multiply(B,A),multiply(C,A))),A),
inference(para,[status(thm),theory(equality)],[2,279]),
[iquote('para(2,279)')] ).
cnf(326,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,46]),1]),
[iquote('para(2,46),flip(1)')] ).
cnf(387,plain,
equal(add(A,add(add(multiply(A,B),multiply(C,B)),add(add(multiply(A,D),multiply(C,D)),add(multiply(A,E),multiply(C,E))))),add(A,add(multiply(C,B),add(multiply(C,D),multiply(C,E))))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[212]),326,95,84,326,326,326]),
[iquote('back_demod(212),demod([326,95,84,326,326,326])')] ).
cnf(403,plain,
equal(add(add(A,add(B,C)),add(add(multiply(A,D),add(multiply(B,D),multiply(C,D))),multiply(E,D))),add(add(A,add(B,C)),multiply(E,D))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[191]),326,326,95,326,300,84,326,326,326,95,84,83,84,326,326,326,95,83,83,84,326,326,326]),
[iquote('back_demod(191),demod([326,326,95,326,300,84,326,326,326,95,84,83,84,326,326,326,95,83,83,84,326,326,326])')] ).
cnf(2191,plain,
equal(add(A,add(B,add(A,C))),add(A,add(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[184,387]),220,220,34,11,217]),
[iquote('para(184,387),demod([220,220,34,11,217])')] ).
cnf(2967,plain,
equal(add(add(A,add(B,C)),multiply(D,B)),add(add(A,add(B,C)),B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[95,403]),84,83,84]),1]),
[iquote('para(95,403),demod([84,83,84]),flip(1)')] ).
cnf(5412,plain,
equal(add(add(A,add(B,C)),B),add(B,add(A,C))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2191,1]),1]),
[iquote('para(2191,1),flip(1)')] ).
cnf(5413,plain,
equal(add(add(A,add(B,C)),multiply(D,B)),add(B,add(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[2967]),5412]),
[iquote('back_demod(2967),demod([5412])')] ).
cnf(5854,plain,
equal(add(A,add(B,C)),add(B,add(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[70,5413]),6]),
[iquote('para(70,5413),demod([6])')] ).
cnf(5855,plain,
equal(add(A,add(B,C)),add(add(A,C),B)),
inference(para,[status(thm),theory(equality)],[5854,1]),
[iquote('para(5854,1)')] ).
cnf(5874,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,5855]),1]),
[iquote('para(1,5855),flip(1)')] ).
cnf(5875,plain,
$false,
inference(conflict,[status(thm)],[5874,10]),
[iquote('conflict(5874,10)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : BOO008-4 : TPTP v8.1.0. Released v1.1.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 1 16:37:30 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.10/2.53 ----- EQP 0.9e, May 2009 -----
% 2.10/2.53 The job began on n029.cluster.edu, Wed Jun 1 16:37:31 2022
% 2.10/2.53 The command was "./eqp09e".
% 2.10/2.53
% 2.10/2.53 set(prolog_style_variables).
% 2.10/2.53 set(lrpo).
% 2.10/2.53 set(basic_paramod).
% 2.10/2.53 set(functional_subsume).
% 2.10/2.53 set(ordered_paramod).
% 2.10/2.53 set(prime_paramod).
% 2.10/2.53 set(para_pairs).
% 2.10/2.53 assign(pick_given_ratio,4).
% 2.10/2.53 clear(print_kept).
% 2.10/2.53 clear(print_new_demod).
% 2.10/2.53 clear(print_back_demod).
% 2.10/2.53 clear(print_given).
% 2.10/2.53 assign(max_mem,64000).
% 2.10/2.53 end_of_commands.
% 2.10/2.53
% 2.10/2.53 Usable:
% 2.10/2.53 end_of_list.
% 2.10/2.53
% 2.10/2.53 Sos:
% 2.10/2.53 0 (wt=-1) [] add(A,B) = add(B,A).
% 2.10/2.53 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 2.10/2.53 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 2.10/2.53 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 2.10/2.53 0 (wt=-1) [] add(A,additive_identity) = A.
% 2.10/2.53 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 2.10/2.53 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 2.10/2.53 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 2.10/2.53 0 (wt=-1) [] -(add(a,add(b,c)) = add(add(a,b),c)).
% 2.10/2.53 end_of_list.
% 2.10/2.53
% 2.10/2.53 Demodulators:
% 2.10/2.53 end_of_list.
% 2.10/2.53
% 2.10/2.53 Passive:
% 2.10/2.53 end_of_list.
% 2.10/2.53
% 2.10/2.53 Starting to process input.
% 2.10/2.53
% 2.10/2.53 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 2.10/2.53 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 2.10/2.53
% 2.10/2.53 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 2.10/2.53 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 2.10/2.53
% 2.10/2.53 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 2.10/2.53 3 is a new demodulator.
% 2.10/2.53
% 2.10/2.53 ** KEPT: 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 2.10/2.53 4 is a new demodulator.
% 2.10/2.53 -> 4 back demodulating 3.
% 2.10/2.53
% 2.10/2.53 ** KEPT: 5 (wt=17) [back_demod(3),demod([4])] add(multiply(add(A,B),A),multiply(add(A,B),C)) = add(A,multiply(B,C)).
% 2.10/2.53 5 is a new demodulator.
% 2.10/2.53
% 2.10/2.53 ** KEPT: 6 (wt=5) [] add(A,additive_identity) = A.
% 2.10/2.53 6 is a new demodulator.
% 2.10/2.53
% 2.10/2.53 ** KEPT: 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 2.10/2.53 7 is a new demodulator.
% 2.10/2.53
% 2.10/2.53 ** KEPT: 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 2.10/2.53 8 is a new demodulator.
% 2.10/2.53
% 2.10/2.53 ** KEPT: 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 2.10/2.53 9 is a new demodulator.
% 2.10/2.53
% 2.10/2.53 ** KEPT: 10 (wt=11) [flip(1)] -(add(add(a,b),c) = add(a,add(b,c))).
% 2.10/2.53 ---------------- PROOF FOUND ----------------
% 2.10/2.53 % SZS status Unsatisfiable
% 2.10/2.53
% 2.10/2.53
% 2.10/2.53 After processing input:
% 2.10/2.53
% 2.10/2.53 Usable:
% 2.10/2.53 end_of_list.
% 2.10/2.53
% 2.10/2.53 Sos:
% 2.10/2.53 6 (wt=5) [] add(A,additive_identity) = A.
% 2.10/2.53 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 2.10/2.53 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 2.10/2.53 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 2.10/2.53 1 (wt=7) [] add(A,B) = add(B,A).
% 2.10/2.53 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 2.10/2.53 10 (wt=11) [flip(1)] -(add(add(a,b),c) = add(a,add(b,c))).
% 2.10/2.53 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 2.10/2.53 5 (wt=17) [back_demod(3),demod([4])] add(multiply(add(A,B),A),multiply(add(A,B),C)) = add(A,multiply(B,C)).
% 2.10/2.53 end_of_list.
% 2.10/2.53
% 2.10/2.53 Demodulators:
% 2.10/2.53 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 2.10/2.53 5 (wt=17) [back_demod(3),demod([4])] add(multiply(add(A,B),A),multiply(add(A,B),C)) = add(A,multiply(B,C)).
% 2.10/2.53 6 (wt=5) [] add(A,additive_identity) = A.
% 2.10/2.53 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 2.10/2.53 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 2.10/2.53 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 2.10/2.53 end_of_list.
% 2.10/2.53
% 2.10/2.53 Passive:
% 2.10/2.53 end_of_list.
% 2.10/2.53
% 2.10/2.53 UNIT CONFLICT from 5874 and 10 at 1.09 seconds.
% 2.10/2.53
% 2.10/2.53 ---------------- PROOF ----------------
% 2.10/2.53 % SZS output start Refutation
% See solution above
% 2.10/2.53 ------------ end of proof -------------
% 2.10/2.53
% 2.10/2.53
% 2.10/2.53 ------------- memory usage ------------
% 2.10/2.53 Memory dynamically allocated (tp_alloc): 14648.
% 2.10/2.53 type (bytes each) gets frees in use avail bytes
% 2.10/2.53 sym_ent ( 96) 59 0 59 0 5.5 K
% 2.10/2.53 term ( 16) 1101106 890135 210971 51 4098.6 K
% 2.10/2.53 gen_ptr ( 8) 1253143 237653 1015490 54 7933.9 K
% 2.10/2.53 context ( 808) 881992 881990 2 5 5.5 K
% 2.10/2.53 trail ( 12) 589956 589956 0 9 0.1 K
% 2.10/2.53 bt_node ( 68) 395089 395086 3 46 3.3 K
% 2.10/2.53 ac_position (285432) 0 0 0 0 0.0 K
% 2.10/2.53 ac_match_pos (14044) 0 0 0 0 0.0 K
% 2.10/2.53 ac_match_free_vars_pos (4020)
% 2.10/2.53 0 0 0 0 0.0 K
% 2.10/2.53 discrim ( 12) 161778 40936 120842 0 1416.1 K
% 2.10/2.53 flat ( 40) 2558043 2558043 0 147 5.7 K
% 2.10/2.53 discrim_pos ( 12) 70464 70464 0 1 0.0 K
% 2.10/2.53 fpa_head ( 12) 9494 0 9494 0 111.3 K
% 2.10/2.53 fpa_tree ( 28) 25979 25979 0 49 1.3 K
% 2.10/2.53 fpa_pos ( 36) 9105 9105 0 1 0.0 K
% 2.10/2.53 literal ( 12) 41022 35148 5874 1 68.8 K
% 2.10/2.53 clause ( 24) 41022 35148 5874 1 137.7 K
% 2.10/2.53 list ( 12) 3290 3234 56 5 0.7 K
% 2.10/2.53 list_pos ( 20) 23791 6630 17161 0 335.2 K
% 2.10/2.53 pair_index ( 40) 2 0 2 0 0.1 K
% 2.10/2.53
% 2.10/2.53 -------------- statistics -------------
% 2.10/2.53 Clauses input 9
% 2.10/2.53 Usable input 0
% 2.10/2.53 Sos input 9
% 2.10/2.53 Demodulators input 0
% 2.10/2.53 Passive input 0
% 2.10/2.53
% 2.10/2.53 Processed BS (before search) 12
% 2.10/2.53 Forward subsumed BS 2
% 2.10/2.53 Kept BS 10
% 2.10/2.54 New demodulators BS 7
% 2.10/2.54 Back demodulated BS 1
% 2.10/2.54
% 2.10/2.54 Clauses or pairs given 53447
% 2.10/2.54 Clauses generated 28200
% 2.10/2.54 Forward subsumed 22336
% 2.10/2.54 Deleted by weight 0
% 2.10/2.54 Deleted by variable count 0
% 2.10/2.54 Kept 5864
% 2.10/2.54 New demodulators 3224
% 2.10/2.54 Back demodulated 1447
% 2.10/2.54 Ordered paramod prunes 0
% 2.10/2.54 Basic paramod prunes 184449
% 2.10/2.54 Prime paramod prunes 2419
% 2.10/2.54 Semantic prunes 0
% 2.10/2.54
% 2.10/2.54 Rewrite attmepts 417792
% 2.10/2.54 Rewrites 64339
% 2.10/2.54
% 2.10/2.54 FPA overloads 0
% 2.10/2.54 FPA underloads 0
% 2.10/2.54
% 2.10/2.54 Usable size 0
% 2.10/2.54 Sos size 4425
% 2.10/2.54 Demodulators size 2438
% 2.10/2.54 Passive size 0
% 2.10/2.54 Disabled size 1448
% 2.10/2.54
% 2.10/2.54 Proofs found 1
% 2.10/2.54
% 2.10/2.54 ----------- times (seconds) ----------- Wed Jun 1 16:37:33 2022
% 2.10/2.54
% 2.10/2.54 user CPU time 1.09 (0 hr, 0 min, 1 sec)
% 2.10/2.54 system CPU time 0.45 (0 hr, 0 min, 0 sec)
% 2.10/2.54 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.10/2.54 input time 0.00
% 2.10/2.54 paramodulation time 0.15
% 2.10/2.54 demodulation time 0.14
% 2.10/2.54 orient time 0.04
% 2.10/2.54 weigh time 0.01
% 2.10/2.54 forward subsume time 0.03
% 2.10/2.54 back demod find time 0.31
% 2.10/2.54 conflict time 0.00
% 2.10/2.54 LRPO time 0.02
% 2.10/2.54 store clause time 0.20
% 2.10/2.54 disable clause time 0.05
% 2.10/2.54 prime paramod time 0.04
% 2.10/2.54 semantics time 0.00
% 2.10/2.54
% 2.10/2.54 EQP interrupted
%------------------------------------------------------------------------------