TSTP Solution File: RNG006-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : RNG006-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n027.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:29 EDT 2022
% Result : Unsatisfiable 14.90s 15.26s
% Output : Refutation 14.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of clauses : 55 ( 55 unt; 0 nHn; 22 RR)
% Number of literals : 55 ( 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 : 16 ( 16 usr; 9 con; 0-4 aty)
% Number of variables : 84 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ifeq2(A,A,B,C),B),
file('RNG006-10.p',unknown),
[] ).
cnf(2,plain,
equal(ifeq(A,A,B,C),B),
file('RNG006-10.p',unknown),
[] ).
cnf(3,plain,
equal(sum(additive_identity,A,A),true),
file('RNG006-10.p',unknown),
[] ).
cnf(4,plain,
equal(sum(A,additive_identity,A),true),
file('RNG006-10.p',unknown),
[] ).
cnf(5,plain,
equal(product(A,B,multiply(A,B)),true),
file('RNG006-10.p',unknown),
[] ).
cnf(6,plain,
equal(sum(A,B,add(A,B)),true),
file('RNG006-10.p',unknown),
[] ).
cnf(7,plain,
equal(sum(additive_inverse(A),A,additive_identity),true),
file('RNG006-10.p',unknown),
[] ).
cnf(9,plain,
equal(ifeq(sum(A,B,C),true,ifeq(sum(D,B,E),true,ifeq(sum(F,D,A),true,sum(F,E,C),true),true),true),true),
file('RNG006-10.p',unknown),
[] ).
cnf(11,plain,
equal(ifeq(sum(A,B,C),true,sum(B,A,C),true),true),
file('RNG006-10.p',unknown),
[] ).
cnf(14,plain,
equal(ifeq(product(A,B,C),true,ifeq(product(A,D,E),true,ifeq(product(A,F,G),true,ifeq(sum(F,D,B),true,sum(G,E,C),true),true),true),true),true),
file('RNG006-10.p',unknown),
[] ).
cnf(18,plain,
equal(ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C),C),
file('RNG006-10.p',unknown),
[] ).
cnf(19,plain,
equal(ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C),C),
file('RNG006-10.p',unknown),
[] ).
cnf(20,plain,
equal(sum(b,additive_inverse(c),bS_Ic),true),
file('RNG006-10.p',unknown),
[] ).
cnf(21,plain,
equal(product(a,b,aPb),true),
file('RNG006-10.p',unknown),
[] ).
cnf(22,plain,
equal(product(a,c,aPc),true),
file('RNG006-10.p',unknown),
[] ).
cnf(23,plain,
equal(sum(aPb,additive_inverse(aPc),aPb_S_IaPc),true),
file('RNG006-10.p',unknown),
[] ).
cnf(24,plain,
~ equal(product(a,bS_Ic,aPb_S_IaPc),true),
file('RNG006-10.p',unknown),
[] ).
cnf(25,plain,
equal(ifeq(sum(A,B,C),true,ifeq(sum(D,A,additive_identity),true,sum(D,C,B),true),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,9]),2]),
[iquote('para(3,9),demod([2])')] ).
cnf(51,plain,
equal(sum(A,B,add(B,A)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,11]),2]),
[iquote('para(6,11),demod([2])')] ).
cnf(83,plain,
equal(ifeq2(sum(A,additive_identity,B),true,B,A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,18]),1]),
[iquote('para(4,18),demod([1])')] ).
cnf(89,plain,
equal(ifeq(product(A,B,C),true,ifeq(product(A,D,E),true,ifeq(sum(D,B,F),true,sum(E,C,multiply(A,F)),true),true),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,14]),2]),
[iquote('para(5,14),demod([2])')] ).
cnf(98,plain,
equal(ifeq2(product(a,b,A),true,A,aPb),aPb),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,19]),1]),
[iquote('para(21,19),demod([1])')] ).
cnf(108,plain,
equal(multiply(a,b),aPb),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,98]),1]),
[iquote('para(5,98),demod([1])')] ).
cnf(146,plain,
equal(ifeq2(sum(additive_inverse(A),A,B),true,B,additive_identity),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,18]),1]),
[iquote('para(7,18),demod([1])')] ).
cnf(149,plain,
equal(ifeq2(sum(A,B,C),true,add(A,B),C),C),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,18]),1]),
[iquote('para(6,18),demod([1])')] ).
cnf(154,plain,
equal(add(additive_inverse(A),A),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,146]),1]),
[iquote('para(6,146),demod([1])')] ).
cnf(172,plain,
equal(ifeq2(sum(b,additive_inverse(c),A),true,A,bS_Ic),bS_Ic),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,18]),1]),
[iquote('para(20,18),demod([1])')] ).
cnf(240,plain,
equal(ifeq(sum(A,additive_inverse(B),additive_identity),true,sum(A,additive_identity,B),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,25]),2]),
[iquote('para(7,25),demod([2])')] ).
cnf(241,plain,
equal(ifeq(sum(A,B,C),true,sum(additive_inverse(A),C,B),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,25]),2]),
[iquote('para(7,25),demod([2])')] ).
cnf(246,plain,
equal(add(additive_inverse(c),b),bS_Ic),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[51,172]),1]),
[iquote('para(51,172),demod([1])')] ).
cnf(293,plain,
equal(add(A,B),add(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[51,149]),1]),
[iquote('para(51,149),demod([1])')] ).
cnf(408,plain,
equal(sum(additive_inverse(additive_inverse(A)),additive_identity,A),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,240]),2]),
[iquote('para(7,240),demod([2])')] ).
cnf(411,plain,
equal(additive_inverse(additive_inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[408,83]),1]),1]),
[iquote('para(408,83),demod([1]),flip(1)')] ).
cnf(418,plain,
equal(sum(additive_inverse(b),bS_Ic,additive_inverse(c)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,241]),2]),
[iquote('para(20,241),demod([2])')] ).
cnf(427,plain,
equal(additive_inverse(c),add(additive_inverse(b),bS_Ic)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[418,149]),1]),1]),
[iquote('para(418,149),demod([1]),flip(1)')] ).
cnf(495,plain,
equal(add(add(additive_inverse(b),bS_Ic),b),bS_Ic),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[246]),427]),
[iquote('back_demod(246),demod([427])')] ).
cnf(517,plain,
equal(add(add(additive_inverse(b),bS_Ic),c),additive_identity),
inference(para,[status(thm),theory(equality)],[427,154]),
[iquote('para(427,154)')] ).
cnf(885,plain,
equal(sum(additive_inverse(aPb),aPb_S_IaPc,additive_inverse(aPc)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,241]),2]),
[iquote('para(23,241),demod([2])')] ).
cnf(888,plain,
equal(additive_inverse(aPc),add(additive_inverse(aPb),aPb_S_IaPc)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[885,149]),1]),1]),
[iquote('para(885,149),demod([1]),flip(1)')] ).
cnf(1171,plain,
equal(ifeq(product(A,B,C),true,ifeq(sum(B,D,E),true,sum(C,multiply(A,D),multiply(A,E)),true),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,89]),2]),
[iquote('para(5,89),demod([2])')] ).
cnf(1444,plain,
equal(sum(additive_inverse(A),add(A,B),B),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,241]),2]),
[iquote('para(6,241),demod([2])')] ).
cnf(1456,plain,
equal(sum(additive_inverse(add(additive_inverse(b),bS_Ic)),bS_Ic,b),true),
inference(para,[status(thm),theory(equality)],[495,1444]),
[iquote('para(495,1444)')] ).
cnf(1457,plain,
equal(sum(additive_inverse(add(additive_inverse(b),bS_Ic)),additive_identity,c),true),
inference(para,[status(thm),theory(equality)],[517,1444]),
[iquote('para(517,1444)')] ).
cnf(1507,plain,
equal(additive_inverse(add(additive_inverse(b),bS_Ic)),c),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1457,83]),1]),1]),
[iquote('para(1457,83),demod([1]),flip(1)')] ).
cnf(1508,plain,
equal(sum(c,bS_Ic,b),true),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1456]),1507]),
[iquote('back_demod(1456),demod([1507])')] ).
cnf(1821,plain,
equal(add(additive_inverse(A),add(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1444,149]),1]),
[iquote('para(1444,149),demod([1])')] ).
cnf(1823,plain,
equal(add(A,add(additive_inverse(A),B)),B),
inference(para,[status(thm),theory(equality)],[411,1821]),
[iquote('para(411,1821)')] ).
cnf(1846,plain,
equal(add(add(additive_inverse(A),B),A),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1823,293]),1]),
[iquote('para(1823,293),flip(1)')] ).
cnf(27036,plain,
equal(ifeq(sum(c,A,B),true,sum(aPc,multiply(a,A),multiply(a,B)),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,1171]),2]),
[iquote('para(22,1171),demod([2])')] ).
cnf(27115,plain,
equal(ifeq(sum(c,A,b),true,sum(aPc,multiply(a,A),aPb),true),true),
inference(para,[status(thm),theory(equality)],[108,27036]),
[iquote('para(108,27036)')] ).
cnf(27121,plain,
equal(sum(aPc,multiply(a,bS_Ic),aPb),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1508,27115]),2]),
[iquote('para(1508,27115),demod([2])')] ).
cnf(27122,plain,
equal(add(aPc,multiply(a,bS_Ic)),aPb),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27121,149]),1]),
[iquote('para(27121,149),demod([1])')] ).
cnf(27125,plain,
equal(multiply(a,bS_Ic),aPb_S_IaPc),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27122,1821]),888,1846]),1]),
[iquote('para(27122,1821),demod([888,1846]),flip(1)')] ).
cnf(27126,plain,
equal(product(a,bS_Ic,aPb_S_IaPc),true),
inference(para,[status(thm),theory(equality)],[27125,5]),
[iquote('para(27125,5)')] ).
cnf(27127,plain,
$false,
inference(conflict,[status(thm)],[27126,24]),
[iquote('conflict(27126,24)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : RNG006-10 : TPTP v8.1.0. Released v7.3.0.
% 0.06/0.13 % Command : tptp2X_and_run_eqp %s
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon May 30 08:41:46 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.45/1.09 ----- EQP 0.9e, May 2009 -----
% 0.45/1.09 The job began on n027.cluster.edu, Mon May 30 08:41:47 2022
% 0.45/1.09 The command was "./eqp09e".
% 0.45/1.09
% 0.45/1.09 set(prolog_style_variables).
% 0.45/1.09 set(lrpo).
% 0.45/1.09 set(basic_paramod).
% 0.45/1.09 set(functional_subsume).
% 0.45/1.09 set(ordered_paramod).
% 0.45/1.09 set(prime_paramod).
% 0.45/1.09 set(para_pairs).
% 0.45/1.09 assign(pick_given_ratio,4).
% 0.45/1.09 clear(print_kept).
% 0.45/1.09 clear(print_new_demod).
% 0.45/1.09 clear(print_back_demod).
% 0.45/1.09 clear(print_given).
% 0.45/1.09 assign(max_mem,64000).
% 0.45/1.09 end_of_commands.
% 0.45/1.09
% 0.45/1.09 Usable:
% 0.45/1.09 end_of_list.
% 0.45/1.09
% 0.45/1.09 Sos:
% 0.45/1.09 0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 0.45/1.09 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.45/1.09 0 (wt=-1) [] sum(additive_identity,A,A) = true.
% 0.45/1.09 0 (wt=-1) [] sum(A,additive_identity,A) = true.
% 0.45/1.09 0 (wt=-1) [] product(A,B,multiply(A,B)) = true.
% 0.45/1.09 0 (wt=-1) [] sum(A,B,add(A,B)) = true.
% 0.45/1.09 0 (wt=-1) [] sum(additive_inverse(A),A,additive_identity) = true.
% 0.45/1.09 0 (wt=-1) [] sum(A,additive_inverse(A),additive_identity) = true.
% 0.45/1.09 0 (wt=-1) [] ifeq(sum(A,B,C),true,ifeq(sum(D,B,E),true,ifeq(sum(F,D,A),true,sum(F,E,C),true),true),true) = true.
% 0.45/1.09 0 (wt=-1) [] ifeq(sum(A,B,C),true,ifeq(sum(D,C,E),true,ifeq(sum(D,A,F),true,sum(F,B,E),true),true),true) = true.
% 0.45/1.09 0 (wt=-1) [] ifeq(sum(A,B,C),true,sum(B,A,C),true) = true.
% 0.45/1.09 0 (wt=-1) [] ifeq(product(A,B,C),true,ifeq(product(D,B,E),true,ifeq(product(F,D,A),true,product(F,E,C),true),true),true) = true.
% 0.45/1.09 0 (wt=-1) [] ifeq(product(A,B,C),true,ifeq(product(D,C,E),true,ifeq(product(D,A,F),true,product(F,B,E),true),true),true) = true.
% 0.45/1.09 0 (wt=-1) [] ifeq(product(A,B,C),true,ifeq(product(A,D,E),true,ifeq(product(A,F,G),true,ifeq(sum(F,D,B),true,sum(G,E,C),true),true),true),true) = true.
% 0.45/1.09 0 (wt=-1) [] ifeq(product(A,B,C),true,ifeq(product(A,D,E),true,ifeq(sum(E,C,F),true,ifeq(sum(D,B,G),true,product(A,G,F),true),true),true),true) = true.
% 0.45/1.09 0 (wt=-1) [] ifeq(product(A,B,C),true,ifeq(product(D,B,E),true,ifeq(product(F,B,G),true,ifeq(sum(F,D,A),true,sum(G,E,C),true),true),true),true) = true.
% 0.45/1.09 0 (wt=-1) [] ifeq(product(A,B,C),true,ifeq(product(D,B,E),true,ifeq(sum(E,C,F),true,ifeq(sum(D,A,G),true,product(G,B,F),true),true),true),true) = true.
% 0.45/1.09 0 (wt=-1) [] ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C) = C.
% 0.45/1.09 0 (wt=-1) [] ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C) = C.
% 0.45/1.09 0 (wt=-1) [] sum(b,additive_inverse(c),bS_Ic) = true.
% 0.45/1.09 0 (wt=-1) [] product(a,b,aPb) = true.
% 0.45/1.09 0 (wt=-1) [] product(a,c,aPc) = true.
% 0.45/1.09 0 (wt=-1) [] sum(aPb,additive_inverse(aPc),aPb_S_IaPc) = true.
% 0.45/1.09 0 (wt=-1) [] -(product(a,bS_Ic,aPb_S_IaPc) = true).
% 0.45/1.09 end_of_list.
% 0.45/1.09
% 0.45/1.09 Demodulators:
% 0.45/1.09 end_of_list.
% 0.45/1.09
% 0.45/1.09 Passive:
% 0.45/1.09 end_of_list.
% 0.45/1.09
% 0.45/1.09 Starting to process input.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.45/1.09 1 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.45/1.09 2 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 3 (wt=6) [] sum(additive_identity,A,A) = true.
% 0.45/1.09 3 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 4 (wt=6) [] sum(A,additive_identity,A) = true.
% 0.45/1.09 4 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 5 (wt=8) [] product(A,B,multiply(A,B)) = true.
% 0.45/1.09 5 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 6 (wt=8) [] sum(A,B,add(A,B)) = true.
% 0.45/1.09 6 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 7 (wt=7) [] sum(additive_inverse(A),A,additive_identity) = true.
% 0.45/1.09 7 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 8 (wt=7) [] sum(A,additive_inverse(A),additive_identity) = true.
% 0.45/1.09 8 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 9 (wt=27) [] ifeq(sum(A,B,C),true,ifeq(sum(D,B,E),true,ifeq(sum(F,D,A),true,sum(F,E,C),true),true),true) = true.
% 0.45/1.09 9 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 10 (wt=27) [] ifeq(sum(A,B,C),true,ifeq(sum(D,C,E),true,ifeq(sum(D,A,F),true,sum(F,B,E),true),true),true) = true.
% 0.45/1.09 10 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 11 (wt=13) [] ifeq(sum(A,B,C),true,sum(B,A,C),true) = true.
% 0.45/1.09 11 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 12 (wt=27) [] ifeq(product(A,B,C),true,ifeq(product(D,B,E),true,ifeq(product(F,D,A),true,product(F,E,C),true),true),true) = true.
% 0.45/1.09 12 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 13 (wt=27) [] ifeq(product(A,B,C),true,ifeq(product(D,C,E),true,ifeq(product(D,A,F),true,product(F,B,E),true),true),true) = true.
% 0.45/1.09 13 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 14 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(A,D,E),true,ifeq(product(A,F,G),true,ifeq(sum(F,D,B),true,sum(G,E,C),true),true),true),true) = true.
% 0.45/1.09 14 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 15 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(A,D,E),true,ifeq(sum(E,C,F),true,ifeq(sum(D,B,G),true,product(A,G,F),true),true),true),true) = true.
% 14.90/15.26 15 is a new demodulator.
% 14.90/15.26
% 14.90/15.26 ** KEPT: 16 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(D,B,E),true,ifeq(product(F,B,G),true,ifeq(sum(F,D,A),true,sum(G,E,C),true),true),true),true) = true.
% 14.90/15.26 16 is a new demodulator.
% 14.90/15.26
% 14.90/15.26 ** KEPT: 17 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(D,B,E),true,ifeq(sum(E,C,F),true,ifeq(sum(D,A,G),true,product(G,B,F),true),true),true),true) = true.
% 14.90/15.26 17 is a new demodulator.
% 14.90/15.26
% 14.90/15.26 ** KEPT: 18 (wt=17) [] ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C) = C.
% 14.90/15.26 18 is a new demodulator.
% 14.90/15.26
% 14.90/15.26 ** KEPT: 19 (wt=17) [] ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C) = C.
% 14.90/15.26 19 is a new demodulator.
% 14.90/15.26
% 14.90/15.26 ** KEPT: 20 (wt=7) [] sum(b,additive_inverse(c),bS_Ic) = true.
% 14.90/15.26 20 is a new demodulator.
% 14.90/15.26
% 14.90/15.26 ** KEPT: 21 (wt=6) [] product(a,b,aPb) = true.
% 14.90/15.26 21 is a new demodulator.
% 14.90/15.26
% 14.90/15.26 ** KEPT: 22 (wt=6) [] product(a,c,aPc) = true.
% 14.90/15.26 22 is a new demodulator.
% 14.90/15.26
% 14.90/15.26 ** KEPT: 23 (wt=7) [] sum(aPb,additive_inverse(aPc),aPb_S_IaPc) = true.
% 14.90/15.26 23 is a new demodulator.
% 14.90/15.26
% 14.90/15.26 ** KEPT: 24 (wt=6) [] -(product(a,bS_Ic,aPb_S_IaPc) = true).
% 14.90/15.26 ---------------- PROOF FOUND ----------------
% 14.90/15.26 % SZS status Unsatisfiable
% 14.90/15.26
% 14.90/15.26
% 14.90/15.26 After processing input:
% 14.90/15.26
% 14.90/15.26 Usable:
% 14.90/15.26 end_of_list.
% 14.90/15.26
% 14.90/15.26 Sos:
% 14.90/15.26 3 (wt=6) [] sum(additive_identity,A,A) = true.
% 14.90/15.26 4 (wt=6) [] sum(A,additive_identity,A) = true.
% 14.90/15.26 21 (wt=6) [] product(a,b,aPb) = true.
% 14.90/15.26 22 (wt=6) [] product(a,c,aPc) = true.
% 14.90/15.26 24 (wt=6) [] -(product(a,bS_Ic,aPb_S_IaPc) = true).
% 14.90/15.26 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 14.90/15.26 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 14.90/15.26 7 (wt=7) [] sum(additive_inverse(A),A,additive_identity) = true.
% 14.90/15.26 8 (wt=7) [] sum(A,additive_inverse(A),additive_identity) = true.
% 14.90/15.26 20 (wt=7) [] sum(b,additive_inverse(c),bS_Ic) = true.
% 14.90/15.26 23 (wt=7) [] sum(aPb,additive_inverse(aPc),aPb_S_IaPc) = true.
% 14.90/15.26 5 (wt=8) [] product(A,B,multiply(A,B)) = true.
% 14.90/15.26 6 (wt=8) [] sum(A,B,add(A,B)) = true.
% 14.90/15.26 11 (wt=13) [] ifeq(sum(A,B,C),true,sum(B,A,C),true) = true.
% 14.90/15.26 18 (wt=17) [] ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C) = C.
% 14.90/15.26 19 (wt=17) [] ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C) = C.
% 14.90/15.26 9 (wt=27) [] ifeq(sum(A,B,C),true,ifeq(sum(D,B,E),true,ifeq(sum(F,D,A),true,sum(F,E,C),true),true),true) = true.
% 14.90/15.26 10 (wt=27) [] ifeq(sum(A,B,C),true,ifeq(sum(D,C,E),true,ifeq(sum(D,A,F),true,sum(F,B,E),true),true),true) = true.
% 14.90/15.26 12 (wt=27) [] ifeq(product(A,B,C),true,ifeq(product(D,B,E),true,ifeq(product(F,D,A),true,product(F,E,C),true),true),true) = true.
% 14.90/15.26 13 (wt=27) [] ifeq(product(A,B,C),true,ifeq(product(D,C,E),true,ifeq(product(D,A,F),true,product(F,B,E),true),true),true) = true.
% 14.90/15.26 14 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(A,D,E),true,ifeq(product(A,F,G),true,ifeq(sum(F,D,B),true,sum(G,E,C),true),true),true),true) = true.
% 14.90/15.26 15 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(A,D,E),true,ifeq(sum(E,C,F),true,ifeq(sum(D,B,G),true,product(A,G,F),true),true),true),true) = true.
% 14.90/15.26 16 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(D,B,E),true,ifeq(product(F,B,G),true,ifeq(sum(F,D,A),true,sum(G,E,C),true),true),true),true) = true.
% 14.90/15.26 17 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(D,B,E),true,ifeq(sum(E,C,F),true,ifeq(sum(D,A,G),true,product(G,B,F),true),true),true),true) = true.
% 14.90/15.26 end_of_list.
% 14.90/15.26
% 14.90/15.26 Demodulators:
% 14.90/15.26 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 14.90/15.26 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 14.90/15.26 3 (wt=6) [] sum(additive_identity,A,A) = true.
% 14.90/15.26 4 (wt=6) [] sum(A,additive_identity,A) = true.
% 14.90/15.26 5 (wt=8) [] product(A,B,multiply(A,B)) = true.
% 14.90/15.26 6 (wt=8) [] sum(A,B,add(A,B)) = true.
% 14.90/15.26 7 (wt=7) [] sum(additive_inverse(A),A,additive_identity) = true.
% 14.90/15.26 8 (wt=7) [] sum(A,additive_inverse(A),additive_identity) = true.
% 14.90/15.26 9 (wt=27) [] ifeq(sum(A,B,C),true,ifeq(sum(D,B,E),true,ifeq(sum(F,D,A),true,sum(F,E,C),true),true),true) = true.
% 14.90/15.26 10 (wt=27) [] ifeq(sum(A,B,C),true,ifeq(sum(D,C,E),true,ifeq(sum(D,A,F),true,sum(F,B,E),true),true),true) = true.
% 14.90/15.26 11 (wt=13) [] ifeq(sum(A,B,C),true,sum(B,A,C),true) = true.
% 14.90/15.26 12 (wt=27) [] ifeq(product(A,B,C),true,ifeq(product(D,B,E),true,ifeq(product(F,D,A),true,product(F,E,C),true),true),true) = true.
% 14.90/15.26 13 (wt=27) [] ifeq(product(A,B,C),true,ifeq(product(D,C,E),true,ifeq(product(D,A,F),true,product(F,B,E),true),true),true) = true.
% 14.90/15.26 14 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(A,D,E),true,ifeq(product(A,F,G),true,ifeq(sum(F,D,B),true,sum(G,E,C),true),true),true),true) = true.
% 14.90/15.26 15 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(A,D,E),true,ifeq(sum(E,C,F),true,ifeq(sum(D,B,G),true,product(A,G,F),true),true),true),true) = true.
% 14.90/15.26 16 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(D,B,E),true,ifeq(product(F,B,G),true,ifeq(sum(F,D,A),true,sum(G,E,C),true),true),true),true) = true.
% 14.90/15.26 17 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(D,B,E),true,ifeq(sum(E,C,F),true,ifeq(sum(D,A,G),true,product(G,B,F),true),true),true),true) = true.
% 14.90/15.26 18 (wt=17) [] ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C) = C.
% 14.90/15.26 19 (wt=17) [] ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C) = C.
% 14.90/15.26 20 (wt=7) [] sum(b,additive_inverse(c),bS_Ic) = true.
% 14.90/15.26 21 (wt=6) [] product(a,b,aPb) = true.
% 14.90/15.26 22 (wt=6) [] product(a,c,aPc) = true.
% 14.90/15.26 23 (wt=7) [] sum(aPb,additive_inverse(aPc),aPb_S_IaPc) = true.
% 14.90/15.26 end_of_list.
% 14.90/15.26
% 14.90/15.26 Passive:
% 14.90/15.26 end_of_list.
% 14.90/15.26
% 14.90/15.26 UNIT CONFLICT from 27126 and 24 at 9.66 seconds.
% 14.90/15.26
% 14.90/15.26 ---------------- PROOF ----------------
% 14.90/15.26 % SZS output start Refutation
% See solution above
% 14.90/15.26 ------------ end of proof -------------
% 14.90/15.26
% 14.90/15.26
% 14.90/15.26 ------------- memory usage ------------
% 14.90/15.26 Memory dynamically allocated (tp_alloc): 33691.
% 14.90/15.26 type (bytes each) gets frees in use avail bytes
% 14.90/15.26 sym_ent ( 96) 77 0 77 0 7.2 K
% 14.90/15.26 term ( 16) 2706268 2220479 485789 38 9382.8 K
% 14.90/15.26 gen_ptr ( 8) 2910565 826105 2084460 54 16285.3 K
% 14.90/15.26 context ( 808) 23302711 23302709 2 6 6.3 K
% 14.90/15.26 trail ( 12) 78001 78001 0 7 0.1 K
% 14.90/15.26 bt_node ( 68) 17221669 17221666 3 29 2.1 K
% 14.90/15.26 ac_position (285432) 0 0 0 0 0.0 K
% 14.90/15.26 ac_match_pos (14044) 0 0 0 0 0.0 K
% 14.90/15.26 ac_match_free_vars_pos (4020)
% 14.90/15.26 0 0 0 0 0.0 K
% 14.90/15.26 discrim ( 12) 400303 143671 256632 36 3007.8 K
% 14.90/15.26 flat ( 40) 5793005 5793005 0 44 1.7 K
% 14.90/15.26 discrim_pos ( 12) 179297 179297 0 1 0.0 K
% 14.90/15.26 fpa_head ( 12) 10601 0 10601 0 124.2 K
% 14.90/15.26 fpa_tree ( 28) 311530 311530 0 41 1.1 K
% 14.90/15.26 fpa_pos ( 36) 53937 53937 0 1 0.0 K
% 14.90/15.26 literal ( 12) 126996 99870 27126 1 317.9 K
% 14.90/15.26 clause ( 24) 126996 99870 27126 1 635.8 K
% 14.90/15.26 list ( 12) 26870 26814 56 3 0.7 K
% 14.90/15.26 list_pos ( 20) 126534 45616 80918 16 1580.7 K
% 14.90/15.26 pair_index ( 40) 2 0 2 0 0.1 K
% 14.90/15.26
% 14.90/15.26 -------------- statistics -------------
% 14.90/15.26 Clauses input 24
% 14.90/15.26 Usable input 0
% 14.90/15.26 Sos input 24
% 14.90/15.26 Demodulators input 0
% 14.90/15.26 Passive input 0
% 14.90/15.26
% 14.90/15.26 Processed BS (before search) 24
% 14.90/15.26 Forward subsumed BS 0
% 14.90/15.26 Kept BS 24
% 14.90/15.26 New demodulators BS 23
% 14.90/15.26 Back demodulated BS 0
% 14.90/15.26
% 14.90/15.26 Clauses or pairs given 1422936
% 14.90/15.26 Clauses generated 96395
% 14.90/15.26 Forward subsumed 69293
% 14.90/15.26 Deleted by weight 0
% 14.90/15.26 Deleted by variable count 0
% 14.90/15.26 Kept 27102
% 14.90/15.26 New demodulators 26788
% 14.90/15.26 Back demodulated 9162
% 14.90/15.26 Ordered paramod prunes 0
% 14.90/15.26 Basic paramod prunes 9749666
% 14.90/15.26 Prime paramod prunes 16511
% 14.90/15.26 Semantic prunes 0
% 14.90/15.26
% 14.90/15.26 Rewrite attmepts 1495210
% 14.90/15.26 Rewrites 159882
% 14.90/15.26
% 14.90/15.26 FPA overloads 0
% 14.90/15.26 FPA underloads 0
% 14.90/15.26
% 14.90/15.26 Usable size 0
% 14.90/15.26 Sos size 17963
% 14.90/15.26 Demodulators size 17867
% 14.90/15.26 Passive size 0
% 14.90/15.26 Disabled size 9162
% 14.90/15.26
% 14.90/15.26 Proofs found 1
% 14.90/15.26
% 14.90/15.26 ----------- times (seconds) ----------- Mon May 30 08:42:01 2022
% 14.90/15.26
% 14.90/15.26 user CPU time 9.66 (0 hr, 0 min, 9 sec)
% 14.90/15.26 system CPU time 4.51 (0 hr, 0 min, 4 sec)
% 14.90/15.26 wall-clock time 14 (0 hr, 0 min, 14 sec)
% 14.90/15.26 input time 0.00
% 14.90/15.26 paramodulation time 1.55
% 14.90/15.26 demodulation time 0.28
% 14.90/15.26 orient time 0.14
% 14.90/15.26 weigh time 0.02
% 14.90/15.26 forward subsume time 0.08
% 14.90/15.26 back demod find time 1.25
% 14.90/15.26 conflict time 0.02
% 14.90/15.26 LRPO time 0.06
% 14.90/15.26 store clause time 3.24
% 14.90/15.26 disable clause time 1.67
% 14.90/15.26 prime paramod time 0.11
% 14.90/15.26 semantics time 0.00
% 14.90/15.26
% 14.90/15.26 EQP interrupted
%------------------------------------------------------------------------------