TSTP Solution File: RNG021-7 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG021-7 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n017.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:31 EDT 2022
% Result : Unsatisfiable 0.47s 1.16s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 2 RR)
% Number of literals : 24 ( 0 equ; 1 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 : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(additive_identity,A),A),
file('RNG021-7.p',unknown),
[] ).
cnf(5,plain,
equal(add(additive_inverse(A),A),additive_identity),
file('RNG021-7.p',unknown),
[] ).
cnf(7,plain,
equal(additive_inverse(additive_inverse(A)),A),
file('RNG021-7.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(add(A,B),C),add(multiply(A,C),multiply(B,C))),
file('RNG021-7.p',unknown),
[] ).
cnf(10,plain,
equal(add(A,B),add(B,A)),
file('RNG021-7.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(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(17,plain,
equal(additive_inverse(multiply(A,B)),multiply(additive_inverse(A),B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(19,plain,
equal(add(multiply(multiply(A,B),C),multiply(additive_inverse(A),multiply(B,C))),associator(A,B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14]),17]),
[iquote('back_demod(14),demod([17])')] ).
cnf(24,plain,
~ equal(add(associator(u,x,y),associator(v,x,y)),associator(add(u,v),x,y)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(32,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(35,plain,
equal(add(additive_inverse(A),add(B,A)),B),
inference(para,[status(thm),theory(equality)],[10,32]),
[iquote('para(10,32)')] ).
cnf(36,plain,
equal(add(A,add(B,additive_inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,32]),11]),
[iquote('para(10,32),demod([11])')] ).
cnf(40,plain,
equal(add(additive_inverse(add(A,B)),B),additive_inverse(A)),
inference(para,[status(thm),theory(equality)],[32,35]),
[iquote('para(32,35)')] ).
cnf(56,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)],[40,35]),1]),
[iquote('para(40,35),flip(1)')] ).
cnf(58,plain,
equal(add(multiply(A,B),add(C,multiply(additive_inverse(A),B))),C),
inference(para,[status(thm),theory(equality)],[17,36]),
[iquote('para(17,36)')] ).
cnf(89,plain,
equal(add(multiply(multiply(A,B),C),add(multiply(multiply(D,B),C),add(multiply(additive_inverse(D),multiply(B,C)),multiply(additive_inverse(A),multiply(B,C))))),associator(add(A,D),B,C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,19]),9,56,9,11]),
[iquote('para(9,19),demod([9,56,9,11])')] ).
cnf(91,plain,
equal(add(multiply(multiply(A,B),C),add(multiply(additive_inverse(A),multiply(B,C)),D)),add(associator(A,B,C),D)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,11]),1]),
[iquote('para(19,11),flip(1)')] ).
cnf(92,plain,
equal(add(multiply(multiply(A,B),C),add(associator(D,B,C),multiply(additive_inverse(A),multiply(B,C)))),associator(add(A,D),B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[89]),91]),
[iquote('back_demod(89),demod([91])')] ).
cnf(254,plain,
equal(multiply(multiply(A,B),C),add(multiply(A,multiply(B,C)),associator(A,B,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,35]),17,7]),1]),
[iquote('para(19,35),demod([17,7]),flip(1)')] ).
cnf(280,plain,
equal(add(multiply(A,multiply(B,C)),add(associator(A,B,C),add(associator(D,B,C),multiply(additive_inverse(A),multiply(B,C))))),associator(add(A,D),B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[92]),254,11]),
[iquote('back_demod(92),demod([254,11])')] ).
cnf(367,plain,
equal(add(multiply(A,B),add(C,add(D,multiply(additive_inverse(A),B)))),add(C,D)),
inference(para,[status(thm),theory(equality)],[11,58]),
[iquote('para(11,58)')] ).
cnf(370,plain,
equal(add(associator(A,B,C),associator(D,B,C)),associator(add(A,D),B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[280]),367]),
[iquote('back_demod(280),demod([367])')] ).
cnf(371,plain,
$false,
inference(conflict,[status(thm)],[370,24]),
[iquote('conflict(370,24)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : RNG021-7 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n017.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 14:30:25 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.47/1.10 ----- EQP 0.9e, May 2009 -----
% 0.47/1.10 The job began on n017.cluster.edu, Mon May 30 14:30:26 2022
% 0.47/1.10 The command was "./eqp09e".
% 0.47/1.10
% 0.47/1.10 set(prolog_style_variables).
% 0.47/1.10 set(lrpo).
% 0.47/1.10 set(basic_paramod).
% 0.47/1.10 set(functional_subsume).
% 0.47/1.10 set(ordered_paramod).
% 0.47/1.10 set(prime_paramod).
% 0.47/1.10 set(para_pairs).
% 0.47/1.10 assign(pick_given_ratio,4).
% 0.47/1.10 clear(print_kept).
% 0.47/1.10 clear(print_new_demod).
% 0.47/1.10 clear(print_back_demod).
% 0.47/1.10 clear(print_given).
% 0.47/1.10 assign(max_mem,64000).
% 0.47/1.10 end_of_commands.
% 0.47/1.10
% 0.47/1.10 Usable:
% 0.47/1.10 end_of_list.
% 0.47/1.10
% 0.47/1.10 Sos:
% 0.47/1.10 0 (wt=-1) [] add(additive_identity,A) = A.
% 0.47/1.10 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.47/1.10 0 (wt=-1) [] multiply(additive_identity,A) = additive_identity.
% 0.47/1.10 0 (wt=-1) [] multiply(A,additive_identity) = additive_identity.
% 0.47/1.10 0 (wt=-1) [] add(additive_inverse(A),A) = additive_identity.
% 0.47/1.10 0 (wt=-1) [] add(A,additive_inverse(A)) = additive_identity.
% 0.47/1.10 0 (wt=-1) [] additive_inverse(additive_inverse(A)) = A.
% 0.47/1.10 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.47/1.10 0 (wt=-1) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.47/1.10 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.47/1.10 0 (wt=-1) [] add(A,add(B,C)) = add(add(A,B),C).
% 0.47/1.10 0 (wt=-1) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.47/1.10 0 (wt=-1) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.47/1.10 0 (wt=-1) [] associator(A,B,C) = add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))).
% 0.47/1.10 0 (wt=-1) [] commutator(A,B) = add(multiply(B,A),additive_inverse(multiply(A,B))).
% 0.47/1.10 0 (wt=-1) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.47/1.10 0 (wt=-1) [] multiply(additive_inverse(A),B) = additive_inverse(multiply(A,B)).
% 0.47/1.10 0 (wt=-1) [] multiply(A,additive_inverse(B)) = additive_inverse(multiply(A,B)).
% 0.47/1.10 0 (wt=-1) [] multiply(A,add(B,additive_inverse(C))) = add(multiply(A,B),additive_inverse(multiply(A,C))).
% 0.47/1.10 0 (wt=-1) [] multiply(add(A,additive_inverse(B)),C) = add(multiply(A,C),additive_inverse(multiply(B,C))).
% 0.47/1.10 0 (wt=-1) [] multiply(additive_inverse(A),add(B,C)) = add(additive_inverse(multiply(A,B)),additive_inverse(multiply(A,C))).
% 0.47/1.10 0 (wt=-1) [] multiply(add(A,B),additive_inverse(C)) = add(additive_inverse(multiply(A,C)),additive_inverse(multiply(B,C))).
% 0.47/1.10 0 (wt=-1) [] -(associator(add(u,v),x,y) = add(associator(u,x,y),associator(v,x,y))).
% 0.47/1.10 end_of_list.
% 0.47/1.10
% 0.47/1.10 Demodulators:
% 0.47/1.10 end_of_list.
% 0.47/1.10
% 0.47/1.10 Passive:
% 0.47/1.10 end_of_list.
% 0.47/1.10
% 0.47/1.10 Starting to process input.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 1 (wt=5) [] add(additive_identity,A) = A.
% 0.47/1.10 1 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 2 (wt=5) [] add(A,additive_identity) = A.
% 0.47/1.10 2 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.47/1.10 3 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.47/1.10 4 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.47/1.10 5 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.47/1.10 6 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.47/1.10 7 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.47/1.10 8 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.47/1.10 9 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 10 (wt=7) [] add(A,B) = add(B,A).
% 0.47/1.10 clause forward subsumed: 0 (wt=7) [flip(10)] add(B,A) = add(A,B).
% 0.47/1.10
% 0.47/1.10 ** KEPT: 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.47/1.10 11 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.47/1.10 12 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.47/1.10 13 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 14 (wt=17) [flip(1)] add(multiply(multiply(A,B),C),additive_inverse(multiply(A,multiply(B,C)))) = associator(A,B,C).
% 0.47/1.10 14 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 15 (wt=12) [flip(1)] add(multiply(A,B),additive_inverse(multiply(B,A))) = commutator(B,A).
% 0.47/1.10 15 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.47/1.10 16 is a new demodulator.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 0.47/1.10 17 is a new demodulator.
% 0.47/1.10 -> 17 back demodulating 15.
% 0.47/1.10
% 0.47/1.10 ** KEPT: 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 0.47/1.16 18 is a new demodulator.
% 0.47/1.16 -> 17 back demodulating 14.
% 0.47/1.16
% 0.47/1.16 ** KEPT: 19 (wt=17) [back_demod(14),demod([17])] add(multiply(multiply(A,B),C),multiply(additive_inverse(A),multiply(B,C))) = associator(A,B,C).
% 0.47/1.16 19 is a new demodulator.
% 0.47/1.16
% 0.47/1.16 ** KEPT: 20 (wt=9) [demod([17])] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 0.47/1.16
% 0.47/1.16 ** KEPT: 21 (wt=9) [flip(20)] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 0.47/1.16 clause forward subsumed: 0 (wt=9) [flip(21)] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 0.47/1.16 clause forward subsumed: 0 (wt=17) [demod([8,17])] add(multiply(A,B),multiply(A,additive_inverse(C))) = add(multiply(A,B),multiply(additive_inverse(A),C)).
% 0.47/1.16 clause forward subsumed: 0 (wt=17) [demod([9,17])] add(multiply(A,C),multiply(additive_inverse(B),C)) = add(multiply(A,C),multiply(additive_inverse(B),C)).
% 0.47/1.16 clause forward subsumed: 0 (wt=19) [demod([8,17,17])] add(multiply(additive_inverse(A),B),multiply(additive_inverse(A),C)) = add(multiply(additive_inverse(A),B),multiply(additive_inverse(A),C)).
% 0.47/1.16
% 0.47/1.16 ** KEPT: 22 (wt=19) [demod([9,17,17])] add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))) = add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)).
% 0.47/1.16
% 0.47/1.16 ** KEPT: 23 (wt=19) [flip(22)] add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)) = add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))).
% 0.47/1.16 clause forward subsumed: 0 (wt=19) [flip(23)] add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))) = add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)).
% 0.47/1.16
% 0.47/1.16 ** KEPT: 24 (wt=16) [flip(1)] -(add(associator(u,x,y),associator(v,x,y)) = associator(add(u,v),x,y)).
% 0.47/1.16 ---------------- PROOF FOUND ----------------
% 0.47/1.16 % SZS status Unsatisfiable
% 0.47/1.16
% 0.47/1.16
% 0.47/1.16 After processing input:
% 0.47/1.16
% 0.47/1.16 Usable:
% 0.47/1.16 end_of_list.
% 0.47/1.16
% 0.47/1.16 Sos:
% 0.47/1.16 1 (wt=5) [] add(additive_identity,A) = A.
% 0.47/1.16 2 (wt=5) [] add(A,additive_identity) = A.
% 0.47/1.16 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.47/1.16 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.47/1.17 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.47/1.17 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.47/1.17 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.47/1.17 10 (wt=7) [] add(A,B) = add(B,A).
% 0.47/1.17 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.47/1.17 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 0.47/1.17 20 (wt=9) [demod([17])] multiply(A,additive_inverse(B)) = multiply(additive_inverse(A),B).
% 0.47/1.17 21 (wt=9) [flip(20)] multiply(additive_inverse(A),B) = multiply(A,additive_inverse(B)).
% 0.47/1.17 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.47/1.17 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.47/1.17 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.47/1.17 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 0.47/1.17 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.47/1.17 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.47/1.17 24 (wt=16) [flip(1)] -(add(associator(u,x,y),associator(v,x,y)) = associator(add(u,v),x,y)).
% 0.47/1.17 19 (wt=17) [back_demod(14),demod([17])] add(multiply(multiply(A,B),C),multiply(additive_inverse(A),multiply(B,C))) = associator(A,B,C).
% 0.47/1.17 22 (wt=19) [demod([9,17,17])] add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))) = add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)).
% 0.47/1.17 23 (wt=19) [flip(22)] add(multiply(additive_inverse(A),B),multiply(additive_inverse(C),B)) = add(multiply(A,additive_inverse(B)),multiply(C,additive_inverse(B))).
% 0.47/1.17 end_of_list.
% 0.47/1.17
% 0.47/1.17 Demodulators:
% 0.47/1.17 1 (wt=5) [] add(additive_identity,A) = A.
% 0.47/1.17 2 (wt=5) [] add(A,additive_identity) = A.
% 0.47/1.17 3 (wt=5) [] multiply(additive_identity,A) = additive_identity.
% 0.47/1.17 4 (wt=5) [] multiply(A,additive_identity) = additive_identity.
% 0.47/1.17 5 (wt=6) [] add(additive_inverse(A),A) = additive_identity.
% 0.47/1.17 6 (wt=6) [] add(A,additive_inverse(A)) = additive_identity.
% 0.47/1.17 7 (wt=5) [] additive_inverse(additive_inverse(A)) = A.
% 0.47/1.17 8 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.47/1.17 9 (wt=13) [] multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)).
% 0.47/1.17 11 (wt=11) [flip(1)] add(add(A,B),C) = add(A,add(B,C)).
% 0.47/1.17 12 (wt=11) [] multiply(multiply(A,B),B) = multiply(A,multiply(B,B)).
% 0.47/1.17 13 (wt=11) [] multiply(multiply(A,A),B) = multiply(A,multiply(A,B)).
% 0.47/1.17 16 (wt=9) [] multiply(additive_inverse(A),additive_inverse(B)) = multiply(A,B).
% 0.47/1.17 17 (wt=9) [flip(1)] additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B).
% 0.47/1.17 18 (wt=12) [back_demod(15),demod([17])] add(multiply(A,B),multiply(additive_inverse(B),A)) = commutator(B,A).
% 0.47/1.17 19 (wt=17) [back_demod(14),demod([17])] add(multiply(multiply(A,B),C),multiply(additive_inverse(A),multiply(B,C))) = associator(A,B,C).
% 0.47/1.17 end_of_list.
% 0.47/1.17
% 0.47/1.17 Passive:
% 0.47/1.17 end_of_list.
% 0.47/1.17
% 0.47/1.17 UNIT CONFLICT from 370 and 24 at 0.02 seconds.
% 0.47/1.17
% 0.47/1.17 ---------------- PROOF ----------------
% 0.47/1.17 % SZS output start Refutation
% See solution above
% 0.47/1.17 ------------ end of proof -------------
% 0.47/1.17
% 0.47/1.17
% 0.47/1.17 ------------- memory usage ------------
% 0.47/1.17 Memory dynamically allocated (tp_alloc): 976.
% 0.47/1.17 type (bytes each) gets frees in use avail bytes
% 0.47/1.17 sym_ent ( 96) 61 0 61 0 5.7 K
% 0.47/1.17 term ( 16) 38379 30287 8092 35 157.3 K
% 0.47/1.17 gen_ptr ( 8) 41718 8083 33635 27 263.0 K
% 0.47/1.17 context ( 808) 30544 30542 2 6 6.3 K
% 0.47/1.17 trail ( 12) 2141 2141 0 4 0.0 K
% 0.47/1.17 bt_node ( 68) 10808 10805 3 12 1.0 K
% 0.47/1.17 ac_position (285432) 0 0 0 0 0.0 K
% 0.47/1.17 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.47/1.17 ac_match_free_vars_pos (4020)
% 0.47/1.17 0 0 0 0 0.0 K
% 0.47/1.17 discrim ( 12) 6403 1811 4592 141 55.5 K
% 0.47/1.17 flat ( 40) 69455 69455 0 57 2.2 K
% 0.47/1.17 discrim_pos ( 12) 2115 2115 0 1 0.0 K
% 0.47/1.17 fpa_head ( 12) 1717 0 1717 0 20.1 K
% 0.47/1.17 fpa_tree ( 28) 845 845 0 19 0.5 K
% 0.47/1.17 fpa_pos ( 36) 558 558 0 1 0.0 K
% 0.47/1.17 literal ( 12) 1897 1527 370 1 4.3 K
% 0.47/1.17 clause ( 24) 1897 1527 370 1 8.7 K
% 0.47/1.17 list ( 12) 247 190 57 3 0.7 K
% 0.47/1.17 list_pos ( 20) 1519 491 1028 8 20.2 K
% 0.47/1.17 pair_index ( 40) 2 0 2 0 0.1 K
% 0.47/1.17
% 0.47/1.17 -------------- statistics -------------
% 0.47/1.17 Clauses input 23
% 0.47/1.17 Usable input 0
% 0.47/1.17 Sos input 23
% 0.47/1.17 Demodulators input 0
% 0.47/1.17 Passive input 0
% 0.47/1.17
% 0.47/1.17 Processed BS (before search) 30
% 0.47/1.17 Forward subsumed BS 6
% 0.47/1.17 Kept BS 24
% 0.47/1.17 New demodulators BS 18
% 0.47/1.17 Back demodulated BS 2
% 0.47/1.17
% 0.47/1.17 Clauses or pairs given 2405
% 0.47/1.17 Clauses generated 1123
% 0.47/1.17 Forward subsumed 777
% 0.47/1.17 Deleted by weight 0
% 0.47/1.17 Deleted by variable count 0
% 0.47/1.17 Kept 346
% 0.47/1.17 New demodulators 170
% 0.47/1.17 Back demodulated 96
% 0.47/1.17 Ordered paramod prunes 0
% 0.47/1.17 Basic paramod prunes 3156
% 0.47/1.17 Prime paramod prunes 72
% 0.47/1.17 Semantic prunes 0
% 0.47/1.17
% 0.47/1.17 Rewrite attmepts 13322
% 0.47/1.17 Rewrites 1783
% 0.47/1.17
% 0.47/1.17 FPA overloads 0
% 0.47/1.17 FPA underloads 0
% 0.47/1.17
% 0.47/1.17 Usable size 0
% 0.47/1.17 Sos size 271
% 0.47/1.17 Demodulators size 116
% 0.47/1.17 Passive size 0
% 0.47/1.17 Disabled size 98
% 0.47/1.17
% 0.47/1.17 Proofs found 1
% 0.47/1.17
% 0.47/1.17 ----------- times (seconds) ----------- Mon May 30 14:30:26 2022
% 0.47/1.17
% 0.47/1.17 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.47/1.17 system CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.47/1.17 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.47/1.17 input time 0.00
% 0.47/1.17 paramodulation time 0.00
% 0.47/1.17 demodulation time 0.00
% 0.47/1.17 orient time 0.00
% 0.47/1.17 weigh time 0.00
% 0.47/1.17 forward subsume time 0.00
% 0.47/1.17 back demod find time 0.00
% 0.47/1.17 conflict time 0.00
% 0.47/1.17 LRPO time 0.00
% 0.47/1.17 store clause time 0.00
% 0.47/1.17 disable clause time 0.00
% 0.47/1.17 prime paramod time 0.00
% 0.47/1.17 semantics time 0.00
% 0.47/1.17
% 0.47/1.17 EQP interrupted
%------------------------------------------------------------------------------