TSTP Solution File: RNG025-6 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG025-6 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n024.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 : Mon Jul 18 20:25:32 EDT 2022
% Result : Unsatisfiable 0.77s 1.32s
% Output : Refutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of clauses : 39 ( 39 unt; 0 nHn; 2 RR)
% Number of literals : 39 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 93 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG025-6.p',unknown),
[] ).
cnf(2,plain,
equal(add(A,additive_identity),A),
file('RNG025-6.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(A,additive_identity),additive_identity),
file('RNG025-6.p',unknown),
[] ).
cnf(5,plain,
equal(add(additive_inverse(A),A),additive_identity),
file('RNG025-6.p',unknown),
[] ).
cnf(6,plain,
equal(add(A,additive_inverse(A)),additive_identity),
file('RNG025-6.p',unknown),
[] ).
cnf(7,plain,
equal(additive_inverse(additive_inverse(A)),A),
file('RNG025-6.p',unknown),
[] ).
cnf(8,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('RNG025-6.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('RNG025-6.p',unknown),
[] ).
cnf(10,plain,
equal(add(A,B),add(B,A)),
file('RNG025-6.p',unknown),
[] ).
cnf(11,plain,
equal(add(add(A,B),C),add(A,add(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(12,plain,
equal(multiply(multiply(A,B),B),multiply(A,multiply(B,B))),
file('RNG025-6.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(multiply(A,A),B),multiply(A,multiply(A,B))),
file('RNG025-6.p',unknown),
[] ).
cnf(14,plain,
equal(add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))),associator(A,B,C)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(16,plain,
~ equal(associator(x,y,x),additive_identity),
file('RNG025-6.p',unknown),
[] ).
cnf(18,plain,
equal(add(multiply(A,additive_inverse(B)),multiply(A,B)),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,8]),4]),1]),
[iquote('para(5,8),demod([4]),flip(1)')] ).
cnf(24,plain,
equal(add(additive_inverse(A),add(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,11]),1]),1]),
[iquote('para(5,11),demod([1]),flip(1)')] ).
cnf(27,plain,
equal(add(A,add(B,C)),add(C,add(A,B))),
inference(para,[status(thm),theory(equality)],[11,10]),
[iquote('para(11,10)')] ).
cnf(30,plain,
equal(add(additive_inverse(A),add(B,A)),B),
inference(para,[status(thm),theory(equality)],[10,24]),
[iquote('para(10,24)')] ).
cnf(34,plain,
equal(add(additive_inverse(add(A,B)),B),additive_inverse(A)),
inference(para,[status(thm),theory(equality)],[24,30]),
[iquote('para(24,30)')] ).
cnf(46,plain,
equal(add(multiply(multiply(A,B),C),add(multiply(multiply(A,D),C),additive_inverse(add(multiply(A,multiply(B,C)),multiply(A,multiply(D,C)))))),associator(A,add(B,D),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,14]),9,9,8,11]),
[iquote('para(8,14),demod([9,9,8,11])')] ).
cnf(47,plain,
equal(add(multiply(multiply(A,B),C),add(multiply(multiply(A,B),D),additive_inverse(add(multiply(A,multiply(B,C)),multiply(A,multiply(B,D)))))),associator(A,B,add(C,D))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,14]),8,8,11]),
[iquote('para(8,14),demod([8,8,11])')] ).
cnf(51,plain,
equal(add(multiply(multiply(A,B),C),add(additive_inverse(multiply(A,multiply(B,C))),D)),add(associator(A,B,C),D)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,11]),1]),
[iquote('para(14,11),flip(1)')] ).
cnf(53,plain,
equal(associator(A,B,B),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,14]),6]),1]),
[iquote('para(12,14),demod([6]),flip(1)')] ).
cnf(57,plain,
equal(associator(A,A,B),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,14]),6]),1]),
[iquote('para(13,14),demod([6]),flip(1)')] ).
cnf(73,plain,
equal(add(multiply(A,multiply(B,additive_inverse(C))),multiply(A,multiply(B,C))),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[18,8]),4]),1]),
[iquote('para(18,8),demod([4]),flip(1)')] ).
cnf(101,plain,
equal(additive_inverse(add(A,B)),add(additive_inverse(B),additive_inverse(A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[34,30]),1]),
[iquote('para(34,30),flip(1)')] ).
cnf(107,plain,
equal(add(multiply(multiply(A,B),C),add(associator(A,B,D),additive_inverse(multiply(A,multiply(B,C))))),associator(A,B,add(C,D))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[47]),101,51]),
[iquote('back_demod(47),demod([101,51])')] ).
cnf(108,plain,
equal(add(multiply(multiply(A,B),C),add(associator(A,D,C),additive_inverse(multiply(A,multiply(B,C))))),associator(A,add(B,D),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[46]),101,51]),
[iquote('back_demod(46),demod([101,51])')] ).
cnf(119,plain,
equal(additive_inverse(multiply(A,additive_inverse(B))),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[18,24]),2]),
[iquote('para(18,24),demod([2])')] ).
cnf(120,plain,
equal(additive_inverse(multiply(A,B)),multiply(A,additive_inverse(B))),
inference(para,[status(thm),theory(equality)],[7,119]),
[iquote('para(7,119)')] ).
cnf(121,plain,
equal(add(multiply(multiply(A,B),C),add(associator(A,D,C),multiply(A,multiply(B,additive_inverse(C))))),associator(A,add(B,D),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[108]),120,120]),
[iquote('back_demod(108),demod([120,120])')] ).
cnf(122,plain,
equal(add(multiply(multiply(A,B),C),add(associator(A,B,D),multiply(A,multiply(B,additive_inverse(C))))),associator(A,B,add(C,D))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[107]),120,120]),
[iquote('back_demod(107),demod([120,120])')] ).
cnf(151,plain,
equal(add(multiply(multiply(A,B),C),multiply(A,multiply(B,additive_inverse(C)))),associator(A,B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14]),120,120]),
[iquote('back_demod(14),demod([120,120])')] ).
cnf(426,plain,
equal(add(multiply(A,multiply(B,C)),add(D,multiply(A,multiply(B,additive_inverse(C))))),D),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[73,27]),2]),1]),
[iquote('para(73,27),demod([2]),flip(1)')] ).
cnf(944,plain,
equal(associator(A,add(B,A),C),associator(A,B,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[57,121]),1,151]),1]),
[iquote('para(57,121),demod([1,151]),flip(1)')] ).
cnf(949,plain,
equal(associator(A,B,add(B,A)),additive_identity),
inference(para,[status(thm),theory(equality)],[944,53]),
[iquote('para(944,53)')] ).
cnf(964,plain,
equal(associator(A,B,add(B,C)),associator(A,B,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,122]),426]),1]),
[iquote('para(12,122),demod([426]),flip(1)')] ).
cnf(965,plain,
equal(associator(A,B,A),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[949]),964]),
[iquote('back_demod(949),demod([964])')] ).
cnf(966,plain,
$false,
inference(conflict,[status(thm)],[965,16]),
[iquote('conflict(965,16)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : RNG025-6 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.14 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n024.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 : Mon May 30 17:02:21 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.77/1.32 ----- EQP 0.9e, May 2009 -----
% 0.77/1.32 The job began on n024.cluster.edu, Mon May 30 17:02:22 2022
% 0.77/1.32 The command was "./eqp09e".
% 0.77/1.32
% 0.77/1.32 set(prolog_style_variables).
% 0.77/1.32 set(lrpo).
% 0.77/1.32 set(basic_paramod).
% 0.77/1.32 set(functional_subsume).
% 0.77/1.32 set(ordered_paramod).
% 0.77/1.32 set(prime_paramod).
% 0.77/1.32 set(para_pairs).
% 0.77/1.32 assign(pick_given_ratio,4).
% 0.77/1.32 clear(print_kept).
% 0.77/1.32 clear(print_new_demod).
% 0.77/1.32 clear(print_back_demod).
% 0.77/1.32 clear(print_given).
% 0.77/1.32 assign(max_mem,64000).
% 0.77/1.32 end_of_commands.
% 0.77/1.32
% 0.77/1.32 Usable:
% 0.77/1.32 end_of_list.
% 0.77/1.32
% 0.77/1.32 Sos:
% 0.77/1.32 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.77/1.32 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.77/1.32 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.77/1.32 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.77/1.32 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.77/1.32 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 0.77/1.32 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.77/1.32 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.77/1.32 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.77/1.32 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.77/1.32 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.77/1.32 0 (wt=-1) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.77/1.32 0 (wt=-1) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.77/1.32 0 (wt=-1) [] associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))).
% 0.77/1.32 0 (wt=-1) [] commutator(A,B) = add(multiply(B,A),additive_inverse(multiply(A,B))).
% 0.77/1.32 0 (wt=-1) [] -(associator(x,y,x) = additive_identity).
% 0.77/1.32 end_of_list.
% 0.77/1.32
% 0.77/1.32 Demodulators:
% 0.77/1.32 end_of_list.
% 0.77/1.32
% 0.77/1.32 Passive:
% 0.77/1.32 end_of_list.
% 0.77/1.32
% 0.77/1.32 Starting to process input.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.77/1.32 1 is a new demodulator.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 0.77/1.32 2 is a new demodulator.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.77/1.32 3 is a new demodulator.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.77/1.32 4 is a new demodulator.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.77/1.32 5 is a new demodulator.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.77/1.32 6 is a new demodulator.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.77/1.32 7 is a new demodulator.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.77/1.32 8 is a new demodulator.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.77/1.32 9 is a new demodulator.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 10 (wt=7) [] add(A,B) = add(B,A).
% 0.77/1.32 clause forward subsumed: 0 (wt=7) [flip(10)] add(B,A) = add(A,B).
% 0.77/1.32
% 0.77/1.32 ** KEPT: 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.77/1.32 11 is a new demodulator.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.77/1.32 12 is a new demodulator.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.77/1.32 13 is a new demodulator.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.77/1.32 14 is a new demodulator.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.77/1.32 15 is a new demodulator.
% 0.77/1.32
% 0.77/1.32 ** KEPT: 16 (wt=6) [] -(associator(x,y,x) = additive_identity).
% 0.77/1.32 ---------------- PROOF FOUND ----------------
% 0.77/1.32 % SZS status Unsatisfiable
% 0.77/1.32
% 0.77/1.32
% 0.77/1.32 After processing input:
% 0.77/1.32
% 0.77/1.32 Usable:
% 0.77/1.32 end_of_list.
% 0.77/1.32
% 0.77/1.32 Sos:
% 0.77/1.32 1 (wt=5) [] add(additive_identity,A) = A.
% 0.77/1.32 2 (wt=5) [] add(A,additive_identity) = A.
% 0.77/1.32 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.77/1.32 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.77/1.32 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.77/1.32 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.77/1.32 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.77/1.32 16 (wt=6) [] -(associator(x,y,x) = additive_identity).
% 0.77/1.32 10 (wt=7) [] add(A,B) = add(B,A).
% 0.77/1.32 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.77/1.32 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.77/1.32 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.77/1.32 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.77/1.32 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.77/1.32 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.77/1.32 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.77/1.32 end_of_list.
% 0.77/1.32
% 0.77/1.32 Demodulators:
% 0.77/1.32 1 (wt=5) [] add(additive_identity,A) = A.
% 0.77/1.32 2 (wt=5) [] add(A,additive_identity) = A.
% 0.77/1.32 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.77/1.32 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.77/1.32 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.77/1.32 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.77/1.32 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.77/1.32 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.77/1.32 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.77/1.32 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.77/1.32 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.77/1.32 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.77/1.32 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.77/1.32 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.77/1.32 end_of_list.
% 0.77/1.32
% 0.77/1.32 Passive:
% 0.77/1.32 end_of_list.
% 0.77/1.32
% 0.77/1.32 UNIT CONFLICT from 965 and 16 at 0.10 seconds.
% 0.77/1.32
% 0.77/1.32 ---------------- PROOF ----------------
% 0.77/1.32 % SZS output start Refutation
% See solution above
% 0.77/1.32 ------------ end of proof -------------
% 0.77/1.32
% 0.77/1.32
% 0.77/1.32 ------------- memory usage ------------
% 0.77/1.32 Memory dynamically allocated (tp_alloc): 2441.
% 0.77/1.32 type (bytes each) gets frees in use avail bytes
% 0.77/1.32 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.77/1.32 term ( 16) 218999 186789 32210 34 626.0 K
% 0.77/1.32 gen_ptr ( 8) 187768 26516 161252 38 1260.1 K
% 0.77/1.32 context ( 808) 147783 147781 2 6 6.3 K
% 0.77/1.32 trail ( 12) 3764 3764 0 5 0.1 K
% 0.77/1.32 bt_node ( 68) 54415 54410 5 18 1.5 K
% 0.77/1.32 ac_position (285432) 0 0 0 0 0.0 K
% 0.77/1.32 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.77/1.32 ac_match_free_vars_pos (4020)
% 0.77/1.32 0 0 0 0 0.0 K
% 0.77/1.32 discrim ( 12) 25355 2593 22762 3 266.8 K
% 0.77/1.32 flat ( 40) 495771 495771 0 107 4.2 K
% 0.77/1.32 discrim_pos ( 12) 11297 11297 0 1 0.0 K
% 0.77/1.32 fpa_head ( 12) 2776 0 2776 0 32.5 K
% 0.77/1.32 fpa_tree ( 28) 2775 2775 0 19 0.5 K
% 0.77/1.32 fpa_pos ( 36) 1485 1485 0 1 0.0 K
% 0.77/1.32 literal ( 12) 6879 5914 965 1 11.3 K
% 0.77/1.32 clause ( 24) 6879 5914 965 1 22.6 K
% 0.77/1.32 list ( 12) 579 522 57 2 0.7 K
% 0.77/1.32 list_pos ( 20) 3679 599 3080 4 60.2 K
% 0.77/1.32 pair_index ( 40) 2 0 2 0 0.1 K
% 0.77/1.32
% 0.77/1.32 -------------- statistics -------------
% 0.77/1.32 Clauses input 16
% 0.77/1.32 Usable input 0
% 0.77/1.32 Sos input 16
% 0.77/1.32 Demodulators input 0
% 0.77/1.32 Passive input 0
% 0.77/1.32
% 0.77/1.32 Processed BS (before search) 17
% 0.77/1.32 Forward subsumed BS 1
% 0.77/1.32 Kept BS 16
% 0.77/1.32 New demodulators BS 14
% 0.77/1.32 Back demodulated BS 0
% 0.77/1.32
% 0.77/1.32 Clauses or pairs given 8140
% 0.77/1.32 Clauses generated 3893
% 0.77/1.32 Forward subsumed 2944
% 0.77/1.32 Deleted by weight 0
% 0.77/1.32 Deleted by variable count 0
% 0.77/1.32 Kept 949
% 0.77/1.32 New demodulators 506
% 0.77/1.32 Back demodulated 124
% 0.77/1.32 Ordered paramod prunes 0
% 0.77/1.32 Basic paramod prunes 18398
% 0.77/1.32 Prime paramod prunes 285
% 0.77/1.32 Semantic prunes 0
% 0.77/1.32
% 0.77/1.32 Rewrite attmepts 75206
% 0.77/1.32 Rewrites 9927
% 0.77/1.32
% 0.77/1.32 FPA overloads 0
% 0.77/1.32 FPA underloads 0
% 0.77/1.32
% 0.77/1.32 Usable size 0
% 0.77/1.32 Sos size 840
% 0.77/1.32 Demodulators size 436
% 0.77/1.32 Passive size 0
% 0.77/1.32 Disabled size 124
% 0.77/1.32
% 0.77/1.32 Proofs found 1
% 0.77/1.32
% 0.77/1.32 ----------- times (seconds) ----------- Mon May 30 17:02:22 2022
% 0.77/1.32
% 0.77/1.32 user CPU time 0.10 (0 hr, 0 min, 0 sec)
% 0.77/1.32 system CPU time 0.11 (0 hr, 0 min, 0 sec)
% 0.77/1.32 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.77/1.32 input time 0.00
% 0.77/1.32 paramodulation time 0.02
% 0.77/1.32 demodulation time 0.02
% 0.77/1.32 orient time 0.01
% 0.77/1.32 weigh time 0.00
% 0.77/1.32 forward subsume time 0.01
% 0.77/1.32 back demod find time 0.00
% 0.77/1.32 conflict time 0.00
% 0.77/1.32 LRPO time 0.01
% 0.77/1.32 store clause time 0.01
% 0.77/1.32 disable clause time 0.00
% 0.77/1.32 prime paramod time 0.01
% 0.77/1.32 semantics time 0.00
% 0.77/1.32
% 0.77/1.32 EQP interrupted
%------------------------------------------------------------------------------