TSTP Solution File: BOO004-10 by EQP---0.9e

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : EQP---0.9e
% Problem  : BOO004-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_eqp %s

% Computer : n021.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:03 EDT 2022

% Result   : Unsatisfiable 0.71s 1.37s
% Output   : Refutation 0.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   31 (  31 unt;   0 nHn;   5 RR)
%            Number of literals    :   31 (   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    :   10 (  10 usr;   4 con; 0-4 aty)
%            Number of variables   :   71 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,plain,
    equal(ifeq2(A,A,B,C),B),
    file('BOO004-10.p',unknown),
    [] ).

cnf(2,plain,
    equal(ifeq(A,A,B,C),B),
    file('BOO004-10.p',unknown),
    [] ).

cnf(3,plain,
    equal(sum(A,B,add(A,B)),true),
    file('BOO004-10.p',unknown),
    [] ).

cnf(5,plain,
    equal(ifeq(sum(A,B,C),true,sum(B,A,C),true),true),
    file('BOO004-10.p',unknown),
    [] ).

cnf(7,plain,
    equal(sum(additive_identity,A,A),true),
    file('BOO004-10.p',unknown),
    [] ).

cnf(8,plain,
    equal(sum(A,additive_identity,A),true),
    file('BOO004-10.p',unknown),
    [] ).

cnf(10,plain,
    equal(product(A,multiplicative_identity,A),true),
    file('BOO004-10.p',unknown),
    [] ).

cnf(11,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('BOO004-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('BOO004-10.p',unknown),
    [] ).

cnf(20,plain,
    equal(sum(A,inverse(A),multiplicative_identity),true),
    file('BOO004-10.p',unknown),
    [] ).

cnf(21,plain,
    equal(product(inverse(A),A,additive_identity),true),
    file('BOO004-10.p',unknown),
    [] ).

cnf(23,plain,
    equal(ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C),C),
    file('BOO004-10.p',unknown),
    [] ).

cnf(24,plain,
    equal(ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C),C),
    file('BOO004-10.p',unknown),
    [] ).

cnf(25,plain,
    ~ equal(sum(x,x,x),true),
    file('BOO004-10.p',unknown),
    [] ).

cnf(26,plain,
    equal(sum(A,B,add(B,A)),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,5]),2]),
    [iquote('para(3,5),demod([2])')] ).

cnf(33,plain,
    equal(ifeq2(sum(additive_identity,A,B),true,B,A),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,23]),1]),
    [iquote('para(7,23),demod([1])')] ).

cnf(40,plain,
    equal(inverse(additive_identity),multiplicative_identity),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,33]),1]),1]),
    [iquote('para(20,33),demod([1]),flip(1)')] ).

cnf(44,plain,
    equal(ifeq(product(A,B,C),true,ifeq(product(A,D,E),true,ifeq(sum(D,B,multiplicative_identity),true,sum(E,C,A),true),true),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,11]),2]),
    [iquote('para(10,11),demod([2])')] ).

cnf(60,plain,
    equal(add(A,additive_identity),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,33]),1]),
    [iquote('para(26,33),demod([1])')] ).

cnf(100,plain,
    equal(ifeq(product(A,B,C),true,ifeq(sum(D,B,E),true,ifeq(sum(D,A,F),true,product(F,E,add(D,C)),true),true),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,15]),2]),
    [iquote('para(3,15),demod([2])')] ).

cnf(133,plain,
    equal(ifeq2(product(A,multiplicative_identity,B),true,B,A),A),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,24]),1]),
    [iquote('para(10,24),demod([1])')] ).

cnf(513,plain,
    equal(ifeq(product(A,B,C),true,ifeq(sum(B,multiplicative_identity,multiplicative_identity),true,sum(C,A,A),true),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,44]),2]),
    [iquote('para(10,44),demod([2])')] ).

cnf(961,plain,
    equal(ifeq(sum(multiplicative_identity,multiplicative_identity,multiplicative_identity),true,sum(A,A,A),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,513]),2]),
    [iquote('para(10,513),demod([2])')] ).

cnf(1257,plain,
    equal(ifeq(sum(A,B,C),true,ifeq(sum(A,inverse(B),D),true,product(D,C,A),true),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,100]),60,2]),
    [iquote('para(21,100),demod([60,2])')] ).

cnf(1262,plain,
    equal(ifeq(sum(A,additive_identity,B),true,ifeq(sum(A,multiplicative_identity,C),true,product(C,B,A),true),true),true),
    inference(para,[status(thm),theory(equality)],[40,1257]),
    [iquote('para(40,1257)')] ).

cnf(1396,plain,
    equal(ifeq(sum(A,multiplicative_identity,B),true,product(B,A,A),true),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,1262]),2]),
    [iquote('para(8,1262),demod([2])')] ).

cnf(1397,plain,
    equal(product(add(A,multiplicative_identity),A,A),true),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,1396]),2]),
    [iquote('para(3,1396),demod([2])')] ).

cnf(1399,plain,
    equal(add(multiplicative_identity,multiplicative_identity),multiplicative_identity),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1397,133]),1]),1]),
    [iquote('para(1397,133),demod([1]),flip(1)')] ).

cnf(1400,plain,
    equal(sum(multiplicative_identity,multiplicative_identity,multiplicative_identity),true),
    inference(para,[status(thm),theory(equality)],[1399,3]),
    [iquote('para(1399,3)')] ).

cnf(1401,plain,
    equal(sum(A,A,A),true),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[961]),1400,2]),
    [iquote('back_demod(961),demod([1400,2])')] ).

cnf(1402,plain,
    $false,
    inference(conflict,[status(thm)],[1401,25]),
    [iquote('conflict(1401,25)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : BOO004-10 : TPTP v8.1.0. Released v7.5.0.
% 0.06/0.12  % Command  : tptp2X_and_run_eqp %s
% 0.12/0.33  % Computer : n021.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jun  1 23:14:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.41/1.07  ----- EQP 0.9e, May 2009 -----
% 0.41/1.07  The job began on n021.cluster.edu, Wed Jun  1 23:14:47 2022
% 0.41/1.07  The command was "./eqp09e".
% 0.41/1.07  
% 0.41/1.07  set(prolog_style_variables).
% 0.41/1.07  set(lrpo).
% 0.41/1.07  set(basic_paramod).
% 0.41/1.07  set(functional_subsume).
% 0.41/1.07  set(ordered_paramod).
% 0.41/1.07  set(prime_paramod).
% 0.41/1.07  set(para_pairs).
% 0.41/1.07  assign(pick_given_ratio,4).
% 0.41/1.07  clear(print_kept).
% 0.41/1.07  clear(print_new_demod).
% 0.41/1.07  clear(print_back_demod).
% 0.41/1.07  clear(print_given).
% 0.41/1.07  assign(max_mem,64000).
% 0.41/1.07  end_of_commands.
% 0.41/1.07  
% 0.41/1.07  Usable:
% 0.41/1.07  end_of_list.
% 0.41/1.07  
% 0.41/1.07  Sos:
% 0.41/1.07  0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 0.41/1.07  0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.41/1.07  0 (wt=-1) [] sum(A,B,add(A,B)) = true.
% 0.41/1.07  0 (wt=-1) [] product(A,B,multiply(A,B)) = true.
% 0.41/1.07  0 (wt=-1) [] ifeq(sum(A,B,C),true,sum(B,A,C),true) = true.
% 0.41/1.07  0 (wt=-1) [] ifeq(product(A,B,C),true,product(B,A,C),true) = true.
% 0.41/1.07  0 (wt=-1) [] sum(additive_identity,A,A) = true.
% 0.41/1.07  0 (wt=-1) [] sum(A,additive_identity,A) = true.
% 0.41/1.07  0 (wt=-1) [] product(multiplicative_identity,A,A) = true.
% 0.41/1.07  0 (wt=-1) [] product(A,multiplicative_identity,A) = true.
% 0.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  0 (wt=-1) [] sum(inverse(A),A,multiplicative_identity) = true.
% 0.41/1.07  0 (wt=-1) [] sum(A,inverse(A),multiplicative_identity) = true.
% 0.41/1.07  0 (wt=-1) [] product(inverse(A),A,additive_identity) = true.
% 0.41/1.07  0 (wt=-1) [] product(A,inverse(A),additive_identity) = true.
% 0.41/1.07  0 (wt=-1) [] ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C) = C.
% 0.41/1.07  0 (wt=-1) [] ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C) = C.
% 0.41/1.07  0 (wt=-1) [] -(sum(x,x,x) = true).
% 0.41/1.07  end_of_list.
% 0.41/1.07  
% 0.41/1.07  Demodulators:
% 0.41/1.07  end_of_list.
% 0.41/1.07  
% 0.41/1.07  Passive:
% 0.41/1.07  end_of_list.
% 0.41/1.07  
% 0.41/1.07  Starting to process input.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.41/1.07  1 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.41/1.07  2 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 3 (wt=8) [] sum(A,B,add(A,B)) = true.
% 0.41/1.07  3 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 4 (wt=8) [] product(A,B,multiply(A,B)) = true.
% 0.41/1.07  4 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 5 (wt=13) [] ifeq(sum(A,B,C),true,sum(B,A,C),true) = true.
% 0.41/1.07  5 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 6 (wt=13) [] ifeq(product(A,B,C),true,product(B,A,C),true) = true.
% 0.41/1.07  6 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 7 (wt=6) [] sum(additive_identity,A,A) = true.
% 0.41/1.07  7 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 8 (wt=6) [] sum(A,additive_identity,A) = true.
% 0.41/1.07  8 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 9 (wt=6) [] product(multiplicative_identity,A,A) = true.
% 0.41/1.07  9 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 10 (wt=6) [] product(A,multiplicative_identity,A) = true.
% 0.41/1.07  10 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** 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.41/1.07  11 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** 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.41/1.07  12 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** 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.41/1.07  13 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** 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.41/1.07  14 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** 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.41/1.07  15 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** 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.41/1.07  16 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** 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.41/1.07  17 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** 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.41/1.07  18 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 19 (wt=7) [] sum(inverse(A),A,multiplicative_identity) = true.
% 0.41/1.07  19 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 20 (wt=7) [] sum(A,inverse(A),multiplicative_identity) = true.
% 0.41/1.07  20 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 21 (wt=7) [] product(inverse(A),A,additive_identity) = true.
% 0.41/1.07  21 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 22 (wt=7) [] product(A,inverse(A),additive_identity) = true.
% 0.41/1.07  22 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 23 (wt=17) [] ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C) = C.
% 0.41/1.07  23 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 24 (wt=17) [] ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C) = C.
% 0.41/1.07  24 is a new demodulator.
% 0.41/1.07  
% 0.41/1.07  ** KEPT: 25 (wt=6) [] -(sum(x,x,x) = true).
% 0.41/1.07  
% 0.41/1.07  After processing input:
% 0.41/1.07  
% 0.41/1.07  Usable:
% 0.41/1.07  end_of_list.
% 0.41/1.07  
% 0.41/1.07  Sos:
% 0.41/1.07  7 (wt=6) [] sum(additive_identity,A,A) = true.
% 0.41/1.07  8 (wt=6) [] sum(A,additive_identity,A) = true.
% 0.41/1.07  9 (wt=6) [] product(multiplicative_identity,A,A) = true.
% 0.41/1.07  10 (wt=6) [] product(A,multiplicative_identity,A) = true.
% 0.41/1.07  25 (wt=6) [] -(sum(x,x,x) = true).
% 0.41/1.07  1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.41/1.07  2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.41/1.07  19 (wt=7) [] sum(inverse(A),A,multiplicative_identity) = true.
% 0.41/1.07  20 (wt=7) [] sum(A,inverse(A),multiplicative_identity) = true.
% 0.41/1.07  21 (wt=7) [] product(inverse(A),A,additive_identity) = true.
% 0.41/1.07  22 (wt=7) [] product(A,inverse(A),additive_identity) = true.
% 0.41/1.07  3 (wt=8) [] sum(A,B,add(A,B)) = true.
% 0.41/1.07  4 (wt=8) [] product(A,B,multiply(A,B)) = true.
% 0.41/1.07  5 (wt=13) [] ifeq(sum(A,B,C),true,sum(B,A,C),true) = true.
% 0.41/1.07  6 (wt=13) [] ifeq(product(A,B,C),true,product(B,A,C),true) = true.
% 0.41/1.07  23 (wt=17) [] ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C) = C.
% 0.41/1.07  24 (wt=17) [] ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C) = C.
% 0.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  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.41/1.07  end_of_list.
% 0.41/1.07  
% 0.41/1.07  Demodulators:
% 0.41/1.07  1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.41/1.07  2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.41/1.07  3 (wt=8) [] sum(A,B,add(A,B)) = true.
% 0.41/1.07  4 (wt=8) [] product(A,B,multiply(A,B)) = true.
% 0.41/1.07  5 (wt=13) [] ifeq(sum(A,B,C),true,sum(B,A,C),true) = true.
% 0.41/1.07  6 (wt=13) [] ifeq(product(A,B,C),true,product(B,A,C),true) = true.
% 0.41/1.07  7 (wt=6) [] sum(additive_identity,A,A) = true.
% 0.41/1.07  8 (wt=6) [] sum(A,additive_identity,A) = true.
% 0.71/1.37  9 (wt=6) [] product(multiplicative_identity,A,A) = true.
% 0.71/1.37  10 (wt=6) [] product(A,multiplicative_identity,A) = true.
% 0.71/1.37  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.71/1.37  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.71/1.37  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.71/1.37  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.71/1.37  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.71/1.37  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.71/1.37  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.71/1.37  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.71/1.37  19 (wt=7) [] sum(inverse(A),A,multiplicative_identity) = true.
% 0.71/1.37  20 (wt=7) [] sum(A,inverse(A),multiplicative_identity) = true.
% 0.71/1.37  21 (wt=7) [] product(inverse(A),A,additive_identity) = true.
% 0.71/1.37  22 (wt=7) [] ---------------- PROOF FOUND ----------------
% 0.71/1.37  % SZS status Unsatisfiable
% 0.71/1.37  
% 0.71/1.37  product(A,inverse(A),additive_identity) = true.
% 0.71/1.37  23 (wt=17) [] ifeq2(sum(A,B,C),true,ifeq2(sum(A,B,D),true,D,C),C) = C.
% 0.71/1.37  24 (wt=17) [] ifeq2(product(A,B,C),true,ifeq2(product(A,B,D),true,D,C),C) = C.
% 0.71/1.37  end_of_list.
% 0.71/1.37  
% 0.71/1.37  Passive:
% 0.71/1.37  end_of_list.
% 0.71/1.37  
% 0.71/1.37  UNIT CONFLICT from 1401 and 25 at   0.15 seconds.
% 0.71/1.37  
% 0.71/1.37  ---------------- PROOF ----------------
% 0.71/1.37  % SZS output start Refutation
% See solution above
% 0.71/1.38  ------------ end of proof -------------
% 0.71/1.38  
% 0.71/1.38  
% 0.71/1.38  ------------- memory usage ------------
% 0.71/1.38  Memory dynamically allocated (tp_alloc): 2441.
% 0.71/1.38    type (bytes each)        gets      frees     in use      avail      bytes
% 0.71/1.38  sym_ent (  96)               71          0         71          0      6.7 K
% 0.71/1.38  term (  16)              125598      94275      31323         36    607.0 K
% 0.71/1.38  gen_ptr (   8)           146391      19007     127384         30    995.4 K
% 0.71/1.38  context ( 808)           720533     720531          2          2      3.2 K
% 0.71/1.38  trail (  12)              12257      12257          0          7      0.1 K
% 0.71/1.38  bt_node (  68)           541218     541215          3         29      2.1 K
% 0.71/1.38  ac_position (285432)          0          0          0          0      0.0 K
% 0.71/1.38  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.71/1.38  ac_match_free_vars_pos (4020)
% 0.71/1.38                                0          0          0          0      0.0 K
% 0.71/1.38  discrim (  12)            29239        908      28331        230    334.7 K
% 0.71/1.38  flat (  40)              212039     212039          0         33      1.3 K
% 0.71/1.38  discrim_pos (  12)         5843       5843          0          1      0.0 K
% 0.71/1.38  fpa_head (  12)            1449          0       1449          0     17.0 K
% 0.71/1.38  fpa_tree (  28)           21537      21537          0         25      0.7 K
% 0.71/1.38  fpa_pos (  36)             2798       2798          0          1      0.0 K
% 0.71/1.38  literal (  12)             5652       4251       1401          1     16.4 K
% 0.71/1.38  clause (  24)              5652       4251       1401          1     32.9 K
% 0.71/1.38  list (  12)                1456       1399         57          2      0.7 K
% 0.71/1.38  list_pos (  20)            5750        345       5405         71    107.0 K
% 0.71/1.38  pair_index (   40)              2          0          2          0      0.1 K
% 0.71/1.38  
% 0.71/1.38  -------------- statistics -------------
% 0.71/1.38  Clauses input                 25
% 0.71/1.38    Usable input                   0
% 0.71/1.38    Sos input                     25
% 0.71/1.38    Demodulators input             0
% 0.71/1.38    Passive input                  0
% 0.71/1.38  
% 0.71/1.38  Processed BS (before search)  25
% 0.71/1.38  Forward subsumed BS            0
% 0.71/1.38  Kept BS                       25
% 0.71/1.38  New demodulators BS           24
% 0.71/1.38  Back demodulated BS            0
% 0.71/1.38  
% 0.71/1.38  Clauses or pairs given     27398
% 0.71/1.38  Clauses generated           4215
% 0.71/1.38  Forward subsumed            2839
% 0.71/1.38  Deleted by weight              0
% 0.71/1.38  Deleted by variable count      0
% 0.71/1.38  Kept                        1376
% 0.71/1.38  New demodulators            1373
% 0.71/1.38  Back demodulated              64
% 0.71/1.38  Ordered paramod prunes         0
% 0.71/1.38  Basic paramod prunes       46074
% 0.71/1.38  Prime paramod prunes         673
% 0.71/1.38  Semantic prunes                0
% 0.71/1.38  
% 0.71/1.38  Rewrite attmepts           56247
% 0.71/1.38  Rewrites                    5158
% 0.71/1.38  
% 0.71/1.38  FPA overloads                  0
% 0.71/1.38  FPA underloads                 0
% 0.71/1.38  
% 0.71/1.38  Usable size                    0
% 0.71/1.38  Sos size                    1336
% 0.71/1.38  Demodulators size           1333
% 0.71/1.38  Passive size                   0
% 0.71/1.38  Disabled size                 64
% 0.71/1.38  
% 0.71/1.38  Proofs found                   1
% 0.71/1.38  
% 0.71/1.38  ----------- times (seconds) ----------- Wed Jun  1 23:14:47 2022
% 0.71/1.38  
% 0.71/1.38  user CPU time             0.15   (0 hr, 0 min, 0 sec)
% 0.71/1.38  system CPU time           0.16   (0 hr, 0 min, 0 sec)
% 0.71/1.38  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.71/1.38  input time                0.00
% 0.71/1.38  paramodulation time       0.06
% 0.71/1.38  demodulation time         0.01
% 0.71/1.38  orient time               0.00
% 0.71/1.38  weigh time                0.00
% 0.71/1.38  forward subsume time      0.00
% 0.71/1.38  back demod find time      0.03
% 0.71/1.38  conflict time             0.00
% 0.71/1.38  LRPO time                 0.00
% 0.71/1.38  store clause time         0.01
% 0.71/1.38  disable clause time       0.00
% 0.71/1.38  prime paramod time        0.01
% 0.71/1.38  semantics time            0.00
% 0.71/1.38  
% 0.71/1.38  EQP interrupted
%------------------------------------------------------------------------------