TSTP Solution File: BOO017-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO017-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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 1.92s 2.33s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 5 RR)
% Number of literals : 25 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-4 aty)
% Number of variables : 57 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ifeq2(A,A,B,C),B),
file('BOO017-10.p',unknown),
[] ).
cnf(2,plain,
equal(ifeq(A,A,B,C),B),
file('BOO017-10.p',unknown),
[] ).
cnf(4,plain,
equal(product(A,B,multiply(A,B)),true),
file('BOO017-10.p',unknown),
[] ).
cnf(6,plain,
equal(ifeq(product(A,B,C),true,product(B,A,C),true),true),
file('BOO017-10.p',unknown),
[] ).
cnf(7,plain,
equal(sum(additive_identity,A,A),true),
file('BOO017-10.p',unknown),
[] ).
cnf(8,plain,
equal(sum(A,additive_identity,A),true),
file('BOO017-10.p',unknown),
[] ).
cnf(12,plain,
equal(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),
file('BOO017-10.p',unknown),
[] ).
cnf(15,plain,
equal(ifeq(product(A,B,C),true,ifeq(sum(D,C,E),true,ifeq(sum(D,B,F),true,ifeq(sum(D,A,G),true,product(G,F,E),true),true),true),true),true),
file('BOO017-10.p',unknown),
[] ).
cnf(22,plain,
equal(product(A,inverse(A),additive_identity),true),
file('BOO017-10.p',unknown),
[] ).
cnf(24,plain,
equal(ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C),C),
file('BOO017-10.p',unknown),
[] ).
cnf(25,plain,
equal(sum(x,y,z),true),
file('BOO017-10.p',unknown),
[] ).
cnf(26,plain,
~ equal(product(x,z,x),true),
file('BOO017-10.p',unknown),
[] ).
cnf(28,plain,
equal(product(A,B,multiply(B,A)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,6]),2]),
[iquote('para(4,6),demod([2])')] ).
cnf(54,plain,
equal(ifeq(product(A,B,C),true,ifeq(product(A,D,additive_identity),true,ifeq(sum(D,B,E),true,product(A,E,C),true),true),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,12]),2]),
[iquote('para(7,12),demod([2])')] ).
cnf(109,plain,
equal(ifeq(product(A,B,additive_identity),true,ifeq(sum(C,B,D),true,ifeq(sum(C,A,E),true,product(E,D,C),true),true),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,15]),2]),
[iquote('para(8,15),demod([2])')] ).
cnf(264,plain,
equal(ifeq2(product(A,inverse(A),B),true,B,additive_identity),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,24]),1]),
[iquote('para(22,24),demod([1])')] ).
cnf(752,plain,
equal(ifeq(product(A,additive_identity,B),true,ifeq(product(A,C,additive_identity),true,product(A,C,B),true),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,54]),2]),
[iquote('para(8,54),demod([2])')] ).
cnf(1587,plain,
equal(ifeq(product(additive_identity,A,additive_identity),true,ifeq(sum(B,A,C),true,product(B,C,B),true),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,109]),2]),
[iquote('para(8,109),demod([2])')] ).
cnf(2931,plain,
equal(ifeq(product(additive_identity,y,additive_identity),true,product(x,z,x),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[25,1587]),2]),
[iquote('para(25,1587),demod([2])')] ).
cnf(3231,plain,
equal(ifeq(product(A,additive_identity,B),true,product(A,inverse(A),B),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,752]),2]),
[iquote('para(22,752),demod([2])')] ).
cnf(3232,plain,
equal(product(A,inverse(A),multiply(A,additive_identity)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,3231]),2]),
[iquote('para(4,3231),demod([2])')] ).
cnf(3234,plain,
equal(multiply(A,additive_identity),additive_identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3232,264]),1]),
[iquote('para(3232,264),demod([1])')] ).
cnf(3249,plain,
equal(product(additive_identity,A,additive_identity),true),
inference(para,[status(thm),theory(equality)],[3234,28]),
[iquote('para(3234,28)')] ).
cnf(3251,plain,
equal(product(x,z,x),true),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[2931]),3249,2]),
[iquote('back_demod(2931),demod([3249,2])')] ).
cnf(3252,plain,
$false,
inference(conflict,[status(thm)],[3251,26]),
[iquote('conflict(3251,26)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : BOO017-10 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 1 21:28:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.14 ----- EQP 0.9e, May 2009 -----
% 0.43/1.14 The job began on n019.cluster.edu, Wed Jun 1 21:28:41 2022
% 0.43/1.14 The command was "./eqp09e".
% 0.43/1.14
% 0.43/1.14 set(prolog_style_variables).
% 0.43/1.14 set(lrpo).
% 0.43/1.14 set(basic_paramod).
% 0.43/1.14 set(functional_subsume).
% 0.43/1.14 set(ordered_paramod).
% 0.43/1.14 set(prime_paramod).
% 0.43/1.14 set(para_pairs).
% 0.43/1.14 assign(pick_given_ratio,4).
% 0.43/1.14 clear(print_kept).
% 0.43/1.14 clear(print_new_demod).
% 0.43/1.14 clear(print_back_demod).
% 0.43/1.14 clear(print_given).
% 0.43/1.14 assign(max_mem,64000).
% 0.43/1.14 end_of_commands.
% 0.43/1.14
% 0.43/1.14 Usable:
% 0.43/1.14 end_of_list.
% 0.43/1.14
% 0.43/1.14 Sos:
% 0.43/1.14 0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 0.43/1.14 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.43/1.14 0 (wt=-1) [] sum(A,B,add(A,B)) = true.
% 0.43/1.14 0 (wt=-1) [] product(A,B,multiply(A,B)) = true.
% 0.43/1.14 0 (wt=-1) [] ifeq(sum(A,B,C),true,sum(B,A,C),true) = true.
% 0.43/1.14 0 (wt=-1) [] ifeq(product(A,B,C),true,product(B,A,C),true) = true.
% 0.43/1.14 0 (wt=-1) [] sum(additive_identity,A,A) = true.
% 0.43/1.14 0 (wt=-1) [] sum(A,additive_identity,A) = true.
% 0.43/1.14 0 (wt=-1) [] product(multiplicative_identity,A,A) = true.
% 0.43/1.14 0 (wt=-1) [] product(A,multiplicative_identity,A) = true.
% 0.43/1.14 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.43/1.14 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.43/1.14 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.43/1.14 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.43/1.14 0 (wt=-1) [] ifeq(product(A,B,C),true,ifeq(sum(D,C,E),true,ifeq(sum(D,B,F),true,ifeq(sum(D,A,G),true,product(G,F,E),true),true),true),true) = true.
% 0.43/1.14 0 (wt=-1) [] ifeq(product(A,B,C),true,ifeq(product(D,E,F),true,ifeq(sum(G,E,B),true,ifeq(sum(G,D,A),true,sum(G,F,C),true),true),true),true) = true.
% 0.43/1.14 0 (wt=-1) [] ifeq(product(A,B,C),true,ifeq(sum(C,D,E),true,ifeq(sum(B,D,F),true,ifeq(sum(A,D,G),true,product(G,F,E),true),true),true),true) = true.
% 0.43/1.14 0 (wt=-1) [] ifeq(product(A,B,C),true,ifeq(product(D,E,F),true,ifeq(sum(E,G,B),true,ifeq(sum(D,G,A),true,sum(F,G,C),true),true),true),true) = true.
% 0.43/1.14 0 (wt=-1) [] sum(inverse(A),A,multiplicative_identity) = true.
% 0.43/1.14 0 (wt=-1) [] sum(A,inverse(A),multiplicative_identity) = true.
% 0.43/1.14 0 (wt=-1) [] product(inverse(A),A,additive_identity) = true.
% 0.43/1.14 0 (wt=-1) [] product(A,inverse(A),additive_identity) = true.
% 0.43/1.14 0 (wt=-1) [] ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C) = C.
% 0.43/1.14 0 (wt=-1) [] ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C) = C.
% 0.43/1.14 0 (wt=-1) [] sum(x,y,z) = true.
% 0.43/1.14 0 (wt=-1) [] -(product(x,z,x) = true).
% 0.43/1.14 end_of_list.
% 0.43/1.14
% 0.43/1.14 Demodulators:
% 0.43/1.14 end_of_list.
% 0.43/1.14
% 0.43/1.14 Passive:
% 0.43/1.14 end_of_list.
% 0.43/1.14
% 0.43/1.14 Starting to process input.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.43/1.14 1 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.43/1.14 2 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 3 (wt=8) [] sum(A,B,add(A,B)) = true.
% 0.43/1.14 3 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 4 (wt=8) [] product(A,B,multiply(A,B)) = true.
% 0.43/1.14 4 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 5 (wt=13) [] ifeq(sum(A,B,C),true,sum(B,A,C),true) = true.
% 0.43/1.14 5 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 6 (wt=13) [] ifeq(product(A,B,C),true,product(B,A,C),true) = true.
% 0.43/1.14 6 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 7 (wt=6) [] sum(additive_identity,A,A) = true.
% 0.43/1.14 7 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 8 (wt=6) [] sum(A,additive_identity,A) = true.
% 0.43/1.14 8 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 9 (wt=6) [] product(multiplicative_identity,A,A) = true.
% 0.43/1.14 9 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 10 (wt=6) [] product(A,multiplicative_identity,A) = true.
% 0.43/1.14 10 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 11 (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.43/1.14 11 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 12 (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.
% 0.43/1.14 12 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 13 (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.
% 0.43/1.14 13 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 14 (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.
% 0.43/1.14 14 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 15 (wt=34) [] ifeq(product(A,B,C),true,ifeq(sum(D,C,E),true,ifeq(sum(D,B,F),true,ifeq(sum(D,A,G),true,product(G,F,E),true),true),true),true) = true.
% 0.43/1.14 15 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 16 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(D,E,F),true,ifeq(sum(G,E,B),true,ifeq(sum(G,D,A),true,sum(G,F,C),true),true),true),true) = true.
% 0.43/1.14 16 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 17 (wt=34) [] ifeq(product(A,B,C),true,ifeq(sum(C,D,E),true,ifeq(sum(B,D,F),true,ifeq(sum(A,D,G),true,product(G,F,E),true),true),true),true) = true.
% 0.43/1.14 17 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 18 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(D,E,F),true,ifeq(sum(E,G,B),true,ifeq(sum(D,G,A),true,sum(F,G,C),true),true),true),true) = true.
% 0.43/1.14 18 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 19 (wt=7) [] sum(inverse(A),A,multiplicative_identity) = true.
% 0.43/1.14 19 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 20 (wt=7) [] sum(A,inverse(A),multiplicative_identity) = true.
% 0.43/1.14 20 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 21 (wt=7) [] product(inverse(A),A,additive_identity) = true.
% 0.43/1.14 21 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 22 (wt=7) [] product(A,inverse(A),additive_identity) = true.
% 0.43/1.14 22 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 23 (wt=17) [] ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C) = C.
% 0.43/1.14 23 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 24 (wt=17) [] ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C) = C.
% 0.43/1.14 24 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 25 (wt=6) [] sum(x,y,z) = true.
% 0.43/1.14 25 is a new demodulator.
% 0.43/1.14
% 0.43/1.14 ** KEPT: 26 (wt=6) [] -(product(x,z,x) = true).
% 0.43/1.14
% 0.43/1.14 After processing input:
% 0.43/1.14
% 0.43/1.14 Usable:
% 0.43/1.14 end_of_list.
% 0.43/1.14
% 0.43/1.14 Sos:
% 0.43/1.14 7 (wt=6) [] sum(additive_identity,A,A) = true.
% 0.43/1.14 8 (wt=6) [] sum(A,additive_identity,A) = true.
% 0.43/1.14 9 (wt=6) [] product(multiplicative_identity,A,A) = true.
% 0.43/1.14 10 (wt=6) [] product(A,multiplicative_identity,A) = true.
% 0.43/1.14 25 (wt=6) [] sum(x,y,z) = true.
% 0.43/1.14 26 (wt=6) [] -(product(x,z,x) = true).
% 0.43/1.14 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.43/1.14 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.43/1.14 19 (wt=7) [] sum(inverse(A),A,multiplicative_identity) = true.
% 0.43/1.14 20 (wt=7) [] sum(A,inverse(A),multiplicative_identity) = true.
% 0.43/1.14 21 (wt=7) [] product(inverse(A),A,additive_identity) = true.
% 0.43/1.14 22 (wt=7) [] product(A,inverse(A),additive_identity) = true.
% 0.43/1.14 3 (wt=8) [] sum(A,B,add(A,B)) = true.
% 0.43/1.14 4 (wt=8) [] product(A,B,multiply(A,B)) = true.
% 0.43/1.14 5 (wt=13) [] ifeq(sum(A,B,C),true,sum(B,A,C),true) = true.
% 0.43/1.14 6 (wt=13) [] ifeq(product(A,B,C),true,product(B,A,C),true) = true.
% 0.43/1.14 23 (wt=17) [] ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C) = C.
% 0.43/1.14 24 (wt=17) [] ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C) = C.
% 0.43/1.14 11 (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.43/1.14 12 (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.
% 0.43/1.14 13 (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.
% 0.43/1.14 14 (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.
% 0.43/1.14 15 (wt=34) [] ifeq(product(A,B,C),true,ifeq(sum(D,C,E),true,ifeq(sum(D,B,F),true,ifeq(sum(D,A,G),true,product(G,F,E),true),true),true),true) = true.
% 0.43/1.14 16 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(D,E,F),true,ifeq(sum(G,E,B),true,ifeq(sum(G,D,A),true,sum(G,F,C),true),true),true),true) = true.
% 0.43/1.14 17 (wt=34) [] ifeq(product(A,B,C),true,ifeq(sum(C,D,E),true,ifeq(sum(B,D,F),true,ifeq(sum(A,D,G),true,product(G,F,E),true),true),true),true) = true.
% 0.43/1.14 18 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(D,E,F),true,ifeq(sum(E,G,B),true,ifeq(sum(D,G,A),true,sum(F,G,C),true),true),true),true) = true.
% 0.43/1.14 end_of_list.
% 0.43/1.14
% 0.43/1.14 Demodulators:
% 0.43/1.14 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.43/1.14 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.43/1.14 3 (wt=8) [] sum(A,B,add(A,B)) = true.
% 0.43/1.14 4 (wt=8) [] product(A,B,multiply(A,B)) = true.
% 0.43/1.14 5 (wt=13) [] ifeq(sum(A,B,C),true,sum(B,A,C),true) = true.
% 0.43/1.14 6 (wt=13) [] ifeq(product(A,B,C),true,product(B,A,C),true) = true.
% 1.92/2.33 7 (wt=6) [] sum(additive_identity,A,A) = true.
% 1.92/2.33 8 (wt=6) [] sum(A,additive_identity,A) = true.
% 1.92/2.33 9 (wt=6) [] product(multiplicative_identity,A,A) = true.
% 1.92/2.33 10 (wt=6) [] product(A,multiplicative_identity,A) = true.
% 1.92/2.33 11 (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.
% 1.92/2.33 12 (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.
% 1.92/2.33 13 (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.
% 1.92/2.33 14 (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.
% 1.92/2.33 15 (wt=34) [] ifeq(product(A,B,C),true,ifeq(sum(D,C,E),true,ifeq(sum(D,B,F),true,ifeq(sum(D,A,G),true,product(G,F,E),true),true),true),true) = true.
% 1.92/2.33 16 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(D,E,F),true,ifeq(sum(G,E,B),true,ifeq(sum(G,D,A),true,sum(G,F,C),true),true),true),true) = true.
% 1.92/2.33 17 (wt=34) [] ifeq(product(A,B,C),true,ifeq(sum(C,D,E),true,ifeq(sum(B,D,F),true,ifeq(sum(A,D,G),true,product(G,F,E),true),true),true),true) = true.
% 1.92/2.33 18 (wt=34) [] ifeq(product(A,B,C),true,ifeq(product(D,E,F),true,ifeq(sum(E,G,B),true,ifeq(sum(D,G,A),true,sum(F,G,C),true),true),true),true) = true.
% 1.92/2.33 19 (wt=7) [] sum(inverse(A),A,multiplicative_identity) = true.
% 1.92/2.33 20 (wt=7) [] sum(A,inverse(A),multiplicative_identity) = true.
% 1.92/2.33 21 (wt=7) [] product(inverse(A),A,addi---------------- PROOF FOUND ----------------
% 1.92/2.33 % SZS status Unsatisfiable
% 1.92/2.33
% 1.92/2.33 tive_identity) = true.
% 1.92/2.33 22 (wt=7) [] product(A,inverse(A),additive_identity) = true.
% 1.92/2.33 23 (wt=17) [] ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C) = C.
% 1.92/2.33 24 (wt=17) [] ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C) = C.
% 1.92/2.33 25 (wt=6) [] sum(x,y,z) = true.
% 1.92/2.33 end_of_list.
% 1.92/2.33
% 1.92/2.33 Passive:
% 1.92/2.33 end_of_list.
% 1.92/2.33
% 1.92/2.33 UNIT CONFLICT from 3251 and 26 at 0.62 seconds.
% 1.92/2.33
% 1.92/2.33 ---------------- PROOF ----------------
% 1.92/2.33 % SZS output start Refutation
% See solution above
% 1.92/2.33 ------------ end of proof -------------
% 1.92/2.33
% 1.92/2.33
% 1.92/2.33 ------------- memory usage ------------
% 1.92/2.33 Memory dynamically allocated (tp_alloc): 5371.
% 1.92/2.33 type (bytes each) gets frees in use avail bytes
% 1.92/2.33 sym_ent ( 96) 73 0 73 0 6.8 K
% 1.92/2.33 term ( 16) 373696 304063 69633 37 1348.0 K
% 1.92/2.33 gen_ptr ( 8) 396063 116764 279299 24 2182.2 K
% 1.92/2.33 context ( 808) 3829827 3829825 2 2 3.2 K
% 1.92/2.33 trail ( 12) 45874 45874 0 7 0.1 K
% 1.92/2.33 bt_node ( 68) 2952211 2952208 3 29 2.1 K
% 1.92/2.33 ac_position (285432) 0 0 0 0 0.0 K
% 1.92/2.33 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.92/2.33 ac_match_free_vars_pos (4020)
% 1.92/2.33 0 0 0 0 0.0 K
% 1.92/2.33 discrim ( 12) 64671 26617 38054 17917 655.9 K
% 1.92/2.33 flat ( 40) 650584 650584 0 33 1.3 K
% 1.92/2.33 discrim_pos ( 12) 21064 21064 0 1 0.0 K
% 1.92/2.33 fpa_head ( 12) 2182 0 2182 0 25.6 K
% 1.92/2.33 fpa_tree ( 28) 49712 49712 0 25 0.7 K
% 1.92/2.33 fpa_pos ( 36) 6498 6498 0 1 0.0 K
% 1.92/2.33 literal ( 12) 16511 13260 3251 1 38.1 K
% 1.92/2.33 clause ( 24) 16511 13260 3251 1 76.2 K
% 1.92/2.33 list ( 12) 3306 3249 57 4 0.7 K
% 1.92/2.33 list_pos ( 20) 15656 6451 9205 1717 213.3 K
% 1.92/2.33 pair_index ( 40) 2 0 2 0 0.1 K
% 1.92/2.33
% 1.92/2.33 -------------- statistics -------------
% 1.92/2.33 Clauses input 26
% 1.92/2.33 Usable input 0
% 1.92/2.33 Sos input 26
% 1.92/2.33 Demodulators input 0
% 1.92/2.33 Passive input 0
% 1.92/2.33
% 1.92/2.33 Processed BS (before search) 26
% 1.92/2.33 Forward subsumed BS 0
% 1.92/2.33 Kept BS 26
% 1.92/2.33 New demodulators BS 25
% 1.92/2.33 Back demodulated BS 0
% 1.92/2.33
% 1.92/2.33 Clauses or pairs given 140451
% 1.92/2.33 Clauses generated 13223
% 1.92/2.33 Forward subsumed 9998
% 1.92/2.33 Deleted by weight 0
% 1.92/2.33 Deleted by variable count 0
% 1.92/2.33 Kept 3225
% 1.92/2.33 New demodulators 3222
% 1.92/2.33 Back demodulated 1265
% 1.92/2.33 Ordered paramod prunes 0
% 1.92/2.33 Basic paramod prunes 329759
% 1.92/2.33 Prime paramod prunes 1862
% 1.92/2.33 Semantic prunes 0
% 1.92/2.33
% 1.92/2.33 Rewrite attmepts 191209
% 1.92/2.33 Rewrites 19190
% 1.92/2.33
% 1.92/2.33 FPA overloads 0
% 1.92/2.33 FPA underloads 0
% 1.92/2.33
% 1.92/2.33 Usable size 0
% 1.92/2.33 Sos size 1985
% 1.92/2.33 Demodulators size 1982
% 1.92/2.33 Passive size 0
% 1.92/2.33 Disabled size 1265
% 1.92/2.33
% 1.92/2.33 Proofs found 1
% 1.92/2.33
% 1.92/2.33 ----------- times (seconds) ----------- Wed Jun 1 21:28:42 2022
% 1.92/2.33
% 1.92/2.33 user CPU time 0.62 (0 hr, 0 min, 0 sec)
% 1.92/2.33 system CPU time 0.56 (0 hr, 0 min, 0 sec)
% 1.92/2.33 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.92/2.33 input time 0.00
% 1.92/2.33 paramodulation time 0.20
% 1.92/2.33 demodulation time 0.03
% 1.92/2.33 orient time 0.02
% 1.92/2.33 weigh time 0.00
% 1.92/2.33 forward subsume time 0.01
% 1.92/2.33 back demod find time 0.13
% 1.92/2.33 conflict time 0.00
% 1.92/2.33 LRPO time 0.01
% 1.92/2.33 store clause time 0.05
% 1.92/2.33 disable clause time 0.02
% 1.92/2.33 prime paramod time 0.01
% 1.92/2.33 semantics time 0.00
% 1.92/2.33
% 1.92/2.33 EQP interrupted
%------------------------------------------------------------------------------