TSTP Solution File: BOO017-10 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : BOO017-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n018.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  : 300s
% DateTime : Wed Jul 27 12:47:36 EDT 2022

% Result   : Unsatisfiable 1.96s 2.21s
% Output   : Refutation 1.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   49 (  49 unt;   0 nHn;   8 RR)
%            Number of literals    :   49 (  48 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   6 con; 0-4 aty)
%            Number of variables   :  104 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    product(x,z,x) != true,
    file('BOO017-10.p',unknown),
    [] ).

cnf(4,axiom,
    ife_q2(A,A,B,C) = B,
    file('BOO017-10.p',unknown),
    [] ).

cnf(6,axiom,
    ife_q(A,A,B,C) = B,
    file('BOO017-10.p',unknown),
    [] ).

cnf(7,axiom,
    sum(A,B,add(A,B)) = true,
    file('BOO017-10.p',unknown),
    [] ).

cnf(9,axiom,
    product(A,B,multiply(A,B)) = true,
    file('BOO017-10.p',unknown),
    [] ).

cnf(11,axiom,
    ife_q(sum(A,B,C),true,sum(B,A,C),true) = true,
    file('BOO017-10.p',unknown),
    [] ).

cnf(13,axiom,
    ife_q(product(A,B,C),true,product(B,A,C),true) = true,
    file('BOO017-10.p',unknown),
    [] ).

cnf(17,axiom,
    sum(A,additive_identity,A) = true,
    file('BOO017-10.p',unknown),
    [] ).

cnf(21,axiom,
    product(A,multiplicative_identity,A) = true,
    file('BOO017-10.p',unknown),
    [] ).

cnf(23,axiom,
    ife_q(product(A,B,C),true,ife_q(product(A,D,E),true,ife_q(product(A,F,G),true,ife_q(sum(F,D,B),true,sum(G,E,C),true),true),true),true) = true,
    file('BOO017-10.p',unknown),
    [] ).

cnf(31,axiom,
    ife_q(product(A,B,C),true,ife_q(sum(D,C,E),true,ife_q(sum(D,B,F),true,ife_q(sum(D,A,G),true,product(G,F,E),true),true),true),true) = true,
    file('BOO017-10.p',unknown),
    [] ).

cnf(39,axiom,
    sum(inverse(A),A,multiplicative_identity) = true,
    file('BOO017-10.p',unknown),
    [] ).

cnf(43,axiom,
    product(inverse(A),A,additive_identity) = true,
    file('BOO017-10.p',unknown),
    [] ).

cnf(45,axiom,
    product(A,inverse(A),additive_identity) = true,
    file('BOO017-10.p',unknown),
    [] ).

cnf(47,axiom,
    ife_q2(sum(A,B,C),true,ife_q2(sum(A,B,D),true,D,C),C) = C,
    file('BOO017-10.p',unknown),
    [] ).

cnf(49,axiom,
    ife_q2(product(A,B,C),true,ife_q2(product(A,B,D),true,D,C),C) = C,
    file('BOO017-10.p',unknown),
    [] ).

cnf(51,axiom,
    sum(x,y,z) = true,
    file('BOO017-10.p',unknown),
    [] ).

cnf(55,plain,
    sum(A,B,add(B,A)) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[11,7]),6]),
    [iquote('para_into,11.1.1.1,7.1.1,demod,6')] ).

cnf(57,plain,
    product(A,B,multiply(B,A)) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[13,9]),6]),
    [iquote('para_into,13.1.1.1,9.1.1,demod,6')] ).

cnf(69,plain,
    ife_q2(sum(A,additive_identity,B),true,B,A) = A,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[47,17]),4]),
    [iquote('para_into,47.1.1.1,17.1.1,demod,4')] ).

cnf(85,plain,
    ife_q2(sum(A,additive_identity,B),true,A,B) = B,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[47,17]),4]),
    [iquote('para_into,47.1.1.3.1,17.1.1,demod,4')] ).

cnf(93,plain,
    ife_q(product(A,B,C),true,ife_q(product(A,D,E),true,ife_q(sum(D,B,inverse(A)),true,sum(E,C,additive_identity),true),true),true) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[23,45]),6]),
    [iquote('para_into,23.1.1.1,45.1.1,demod,6')] ).

cnf(97,plain,
    ife_q(product(A,B,C),true,ife_q(product(A,D,E),true,ife_q(sum(D,B,multiplicative_identity),true,sum(E,C,A),true),true),true) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[23,21]),6]),
    [iquote('para_into,23.1.1.1,21.1.1,demod,6')] ).

cnf(127,plain,
    ife_q(product(A,add(B,C),D),true,ife_q(product(A,B,E),true,ife_q(product(A,C,F),true,sum(F,E,D),true),true),true) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[23,55]),6]),
    [iquote('para_into,23.1.1.3.3.3.1,55.1.1,demod,6')] ).

cnf(234,plain,
    add(additive_identity,A) = A,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[69,55]),4]),
    [iquote('para_into,69.1.1.1,55.1.1,demod,4')] ).

cnf(403,plain,
    ife_q(product(A,B,additive_identity),true,ife_q(sum(C,B,D),true,ife_q(sum(C,A,E),true,product(E,D,C),true),true),true) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[31,17]),6]),
    [iquote('para_into,31.1.1.3.1,17.1.1,demod,6')] ).

cnf(602,plain,
    ife_q2(product(A,inverse(A),B),true,B,additive_identity) = additive_identity,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[49,45]),4]),
    [iquote('para_into,49.1.1.1,45.1.1,demod,4')] ).

cnf(606,plain,
    ife_q2(product(A,multiplicative_identity,B),true,B,A) = A,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[49,21]),4]),
    [iquote('para_into,49.1.1.1,21.1.1,demod,4')] ).

cnf(627,plain,
    inverse(multiplicative_identity) = additive_identity,
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[606,43]),4])]),
    [iquote('para_into,606.1.1.1,43.1.1,demod,4,flip.1')] ).

cnf(749,plain,
    multiply(inverse(A),A) = additive_identity,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[602,57]),4]),
    [iquote('para_into,602.1.1.1,57.1.1,demod,4')] ).

cnf(772,plain,
    ife_q(product(A,additive_identity,B),true,ife_q(product(A,inverse(A),C),true,sum(C,B,additive_identity),true),true) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[93,17]),6]),
    [iquote('para_into,93.1.1.3.3.1,17.1.1,demod,6')] ).

cnf(821,plain,
    ife_q(product(A,B,C),true,ife_q(sum(B,multiplicative_identity,multiplicative_identity),true,sum(C,A,A),true),true) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[97,21]),6]),
    [iquote('para_into,97.1.1.1,21.1.1,demod,6')] ).

cnf(1083,plain,
    ife_q(product(A,additive_identity,B),true,sum(B,A,A),true) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[821,39]),627,6]),
    [iquote('para_into,821.1.1.3.1,39.1.1,demod,627,6')] ).

cnf(1107,plain,
    sum(multiply(additive_identity,A),A,A) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1083,57]),6]),
    [iquote('para_into,1083.1.1.1,57.1.1,demod,6')] ).

cnf(1121,plain,
    multiply(additive_identity,additive_identity) = additive_identity,
    inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1107,85]),4]),
    [iquote('para_from,1107.1.1,85.1.1.1,demod,4')] ).

cnf(1139,plain,
    product(additive_identity,additive_identity,additive_identity) = true,
    inference(para_from,[status(thm),theory(equality)],[1121,57]),
    [iquote('para_from,1121.1.1,57.1.1.3')] ).

cnf(1201,plain,
    ife_q(product(additive_identity,A,B),true,ife_q(product(additive_identity,A,C),true,sum(C,additive_identity,B),true),true) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[127,1139]),234,6]),
    [iquote('para_into,127.1.1.3.1,1139.1.1,demod,234,6')] ).

cnf(1727,plain,
    ife_q(product(additive_identity,A,B),true,sum(B,additive_identity,multiply(A,additive_identity)),true) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1201,57]),6]),
    [iquote('para_into,1201.1.1.1,57.1.1,demod,6')] ).

cnf(1737,plain,
    sum(multiply(additive_identity,A),additive_identity,multiply(A,additive_identity)) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1727,9]),6]),
    [iquote('para_into,1727.1.1.1,9.1.1,demod,6')] ).

cnf(1743,plain,
    sum(additive_identity,multiply(additive_identity,A),multiply(A,additive_identity)) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1737,11]),6]),
    [iquote('para_from,1737.1.1,11.1.1.1,demod,6')] ).

cnf(1745,plain,
    ife_q2(sum(additive_identity,multiply(additive_identity,A),B),true,multiply(A,additive_identity),B) = B,
    inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1743,47]),4]),
    [iquote('para_from,1743.1.1,47.1.1.3.1,demod,4')] ).

cnf(1813,plain,
    ife_q(product(A,additive_identity,B),true,sum(additive_identity,B,additive_identity),true) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[772,57]),749,6]),
    [iquote('para_into,772.1.1.3.1,57.1.1,demod,749,6')] ).

cnf(1815,plain,
    sum(additive_identity,multiply(additive_identity,A),additive_identity) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1813,57]),6]),
    [iquote('para_into,1813.1.1.1,57.1.1,demod,6')] ).

cnf(1823,plain,
    multiply(A,additive_identity) = additive_identity,
    inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[1815,1745]),4]),
    [iquote('para_from,1815.1.1,1745.1.1.1,demod,4')] ).

cnf(1866,plain,
    product(A,additive_identity,additive_identity) = true,
    inference(para_from,[status(thm),theory(equality)],[1823,9]),
    [iquote('para_from,1823.1.1,9.1.1.3')] ).

cnf(2155,plain,
    ife_q(sum(A,B,C),true,product(C,A,A),true) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[403,17]),1866,6,6]),
    [iquote('para_into,403.1.1.3.1,17.1.1,demod,1866,6,6')] ).

cnf(2183,plain,
    product(z,x,x) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[2155,51]),6]),
    [iquote('para_into,2155.1.1.1,51.1.1,demod,6')] ).

cnf(2325,plain,
    product(x,z,x) = true,
    inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[2183,13]),6]),
    [iquote('para_from,2183.1.1,13.1.1.1,demod,6')] ).

cnf(2327,plain,
    $false,
    inference(binary,[status(thm)],[2325,1]),
    [iquote('binary,2325.1,1.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : BOO017-10 : TPTP v8.1.0. Released v7.5.0.
% 0.03/0.13  % Command  : otter-tptp-script %s
% 0.13/0.34  % Computer : n018.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  : 300
% 0.13/0.34  % DateTime : Wed Jul 27 02:40:16 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.68/1.87  ----- Otter 3.3f, August 2004 -----
% 1.68/1.87  The process was started by sandbox on n018.cluster.edu,
% 1.68/1.87  Wed Jul 27 02:40:16 2022
% 1.68/1.87  The command was "./otter".  The process ID is 6237.
% 1.68/1.87  
% 1.68/1.87  set(prolog_style_variables).
% 1.68/1.87  set(auto).
% 1.68/1.87     dependent: set(auto1).
% 1.68/1.87     dependent: set(process_input).
% 1.68/1.87     dependent: clear(print_kept).
% 1.68/1.87     dependent: clear(print_new_demod).
% 1.68/1.87     dependent: clear(print_back_demod).
% 1.68/1.87     dependent: clear(print_back_sub).
% 1.68/1.87     dependent: set(control_memory).
% 1.68/1.87     dependent: assign(max_mem, 12000).
% 1.68/1.87     dependent: assign(pick_given_ratio, 4).
% 1.68/1.87     dependent: assign(stats_level, 1).
% 1.68/1.87     dependent: assign(max_seconds, 10800).
% 1.68/1.87  clear(print_given).
% 1.68/1.87  
% 1.68/1.87  list(usable).
% 1.68/1.87  0 [] A=A.
% 1.68/1.87  0 [] ife_q2(A,A,B,C)=B.
% 1.68/1.87  0 [] ife_q(A,A,B,C)=B.
% 1.68/1.87  0 [] sum(X,Y,add(X,Y))=true.
% 1.68/1.87  0 [] product(X,Y,multiply(X,Y))=true.
% 1.68/1.87  0 [] ife_q(sum(X,Y,Z),true,sum(Y,X,Z),true)=true.
% 1.68/1.87  0 [] ife_q(product(X,Y,Z),true,product(Y,X,Z),true)=true.
% 1.68/1.87  0 [] sum(additive_identity,X,X)=true.
% 1.68/1.87  0 [] sum(X,additive_identity,X)=true.
% 1.68/1.87  0 [] product(multiplicative_identity,X,X)=true.
% 1.68/1.87  0 [] product(X,multiplicative_identity,X)=true.
% 1.68/1.87  0 [] ife_q(product(X,V3,V4),true,ife_q(product(X,Z,V2),true,ife_q(product(X,Y,V1),true,ife_q(sum(Y,Z,V3),true,sum(V1,V2,V4),true),true),true),true)=true.
% 1.68/1.87  0 [] ife_q(product(X,Z,V2),true,ife_q(product(X,Y,V1),true,ife_q(sum(V1,V2,V4),true,ife_q(sum(Y,Z,V3),true,product(X,V3,V4),true),true),true),true)=true.
% 1.68/1.87  0 [] ife_q(product(V3,X,V4),true,ife_q(product(Z,X,V2),true,ife_q(product(Y,X,V1),true,ife_q(sum(Y,Z,V3),true,sum(V1,V2,V4),true),true),true),true)=true.
% 1.68/1.87  0 [] ife_q(product(Z,X,V2),true,ife_q(product(Y,X,V1),true,ife_q(sum(V1,V2,V4),true,ife_q(sum(Y,Z,V3),true,product(V3,X,V4),true),true),true),true)=true.
% 1.68/1.87  0 [] ife_q(product(Y,Z,V3),true,ife_q(sum(X,V3,V4),true,ife_q(sum(X,Z,V2),true,ife_q(sum(X,Y,V1),true,product(V1,V2,V4),true),true),true),true)=true.
% 1.68/1.87  0 [] ife_q(product(V1,V2,V4),true,ife_q(product(Y,Z,V3),true,ife_q(sum(X,Z,V2),true,ife_q(sum(X,Y,V1),true,sum(X,V3,V4),true),true),true),true)=true.
% 1.68/1.87  0 [] ife_q(product(Y,Z,V3),true,ife_q(sum(V3,X,V4),true,ife_q(sum(Z,X,V2),true,ife_q(sum(Y,X,V1),true,product(V1,V2,V4),true),true),true),true)=true.
% 1.68/1.87  0 [] ife_q(product(V1,V2,V4),true,ife_q(product(Y,Z,V3),true,ife_q(sum(Z,X,V2),true,ife_q(sum(Y,X,V1),true,sum(V3,X,V4),true),true),true),true)=true.
% 1.68/1.87  0 [] sum(inverse(X),X,multiplicative_identity)=true.
% 1.68/1.87  0 [] sum(X,inverse(X),multiplicative_identity)=true.
% 1.68/1.87  0 [] product(inverse(X),X,additive_identity)=true.
% 1.68/1.87  0 [] product(X,inverse(X),additive_identity)=true.
% 1.68/1.87  0 [] ife_q2(sum(X,Y,V),true,ife_q2(sum(X,Y,U),true,U,V),V)=V.
% 1.68/1.87  0 [] ife_q2(product(X,Y,V),true,ife_q2(product(X,Y,U),true,U,V),V)=V.
% 1.68/1.87  0 [] sum(x,y,z)=true.
% 1.68/1.87  0 [] product(x,z,x)!=true.
% 1.68/1.87  end_of_list.
% 1.68/1.87  
% 1.68/1.87  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.68/1.87  
% 1.68/1.87  All clauses are units, and equality is present; the
% 1.68/1.87  strategy will be Knuth-Bendix with positive clauses in sos.
% 1.68/1.87  
% 1.68/1.87     dependent: set(knuth_bendix).
% 1.68/1.87     dependent: set(anl_eq).
% 1.68/1.87     dependent: set(para_from).
% 1.68/1.87     dependent: set(para_into).
% 1.68/1.87     dependent: clear(para_from_right).
% 1.68/1.87     dependent: clear(para_into_right).
% 1.68/1.87     dependent: set(para_from_vars).
% 1.68/1.87     dependent: set(eq_units_both_ways).
% 1.68/1.87     dependent: set(dynamic_demod_all).
% 1.68/1.87     dependent: set(dynamic_demod).
% 1.68/1.87     dependent: set(order_eq).
% 1.68/1.87     dependent: set(back_demod).
% 1.68/1.87     dependent: set(lrpo).
% 1.68/1.87  
% 1.68/1.87  ------------> process usable:
% 1.68/1.87  ** KEPT (pick-wt=6): 1 [] product(x,z,x)!=true.
% 1.68/1.87  
% 1.68/1.87  ------------> process sos:
% 1.68/1.87  ** KEPT (pick-wt=3): 2 [] A=A.
% 1.68/1.87  ** KEPT (pick-wt=7): 3 [] ife_q2(A,A,B,C)=B.
% 1.68/1.87  ---> New Demodulator: 4 [new_demod,3] ife_q2(A,A,B,C)=B.
% 1.68/1.87  ** KEPT (pick-wt=7): 5 [] ife_q(A,A,B,C)=B.
% 1.68/1.87  ---> New Demodulator: 6 [new_demod,5] ife_q(A,A,B,C)=B.
% 1.68/1.87  ** KEPT (pick-wt=8): 7 [] sum(A,B,add(A,B))=true.
% 1.68/1.87  ---> New Demodulator: 8 [new_demod,7] sum(A,B,add(A,B))=true.
% 1.68/1.87  ** KEPT (pick-wt=8): 9 [] product(A,B,multiply(A,B))=true.
% 1.68/1.87  ---> New Demodulator: 10 [new_demod,9] product(A,B,multiply(A,B))=true.
% 1.68/1.87  ** KEPT (pick-wt=13): 11 [] ife_q(sum(A,B,C),true,sum(B,A,C),true)=true.
% 1.68/1.87  ---> New Demodulator: 12 [new_demod,11] ife_q(sum(A,B,C),true,sum(B,A,C),true)=true.
% 1.68/1.87  ** KEPT (pick-wt=13): 13 [] ife_q(product(A,B,C),true,product(B,A,C),true)=true.
% 1.68/1.87  ---> New Demodulator: 14 [new_demod,13] ife_q(product(A,B,C),true,product(B,A,C),true)=true.
% 1.68/1.87  ** KEPT (pick-wt=6): 15 [] sum(additive_identity,A,A)=true.
% 1.68/1.87  ---> New Demodulator: 16 [new_demod,15] sum(additive_identity,A,A)=true.
% 1.68/1.87  ** KEPT (pick-wt=6): 17 [] sum(A,additive_identity,A)=true.
% 1.68/1.87  ---> New Demodulator: 18 [new_demod,17] sum(A,additive_identity,A)=true.
% 1.68/1.87  ** KEPT (pick-wt=6): 19 [] product(multiplicative_identity,A,A)=true.
% 1.68/1.87  ---> New Demodulator: 20 [new_demod,19] product(multiplicative_identity,A,A)=true.
% 1.68/1.87  ** KEPT (pick-wt=6): 21 [] product(A,multiplicative_identity,A)=true.
% 1.68/1.87  ---> New Demodulator: 22 [new_demod,21] product(A,multiplicative_identity,A)=true.
% 1.68/1.87  ** KEPT (pick-wt=34): 23 [] ife_q(product(A,B,C),true,ife_q(product(A,D,E),true,ife_q(product(A,F,G),true,ife_q(sum(F,D,B),true,sum(G,E,C),true),true),true),true)=true.
% 1.68/1.87  ---> New Demodulator: 24 [new_demod,23] ife_q(product(A,B,C),true,ife_q(product(A,D,E),true,ife_q(product(A,F,G),true,ife_q(sum(F,D,B),true,sum(G,E,C),true),true),true),true)=true.
% 1.68/1.87  ** KEPT (pick-wt=34): 25 [] ife_q(product(A,B,C),true,ife_q(product(A,D,E),true,ife_q(sum(E,C,F),true,ife_q(sum(D,B,G),true,product(A,G,F),true),true),true),true)=true.
% 1.68/1.87  ---> New Demodulator: 26 [new_demod,25] ife_q(product(A,B,C),true,ife_q(product(A,D,E),true,ife_q(sum(E,C,F),true,ife_q(sum(D,B,G),true,product(A,G,F),true),true),true),true)=true.
% 1.68/1.87  ** KEPT (pick-wt=34): 27 [] ife_q(product(A,B,C),true,ife_q(product(D,B,E),true,ife_q(product(F,B,G),true,ife_q(sum(F,D,A),true,sum(G,E,C),true),true),true),true)=true.
% 1.68/1.87  ---> New Demodulator: 28 [new_demod,27] ife_q(product(A,B,C),true,ife_q(product(D,B,E),true,ife_q(product(F,B,G),true,ife_q(sum(F,D,A),true,sum(G,E,C),true),true),true),true)=true.
% 1.68/1.87  ** KEPT (pick-wt=34): 29 [] ife_q(product(A,B,C),true,ife_q(product(D,B,E),true,ife_q(sum(E,C,F),true,ife_q(sum(D,A,G),true,product(G,B,F),true),true),true),true)=true.
% 1.68/1.87  ---> New Demodulator: 30 [new_demod,29] ife_q(product(A,B,C),true,ife_q(product(D,B,E),true,ife_q(sum(E,C,F),true,ife_q(sum(D,A,G),true,product(G,B,F),true),true),true),true)=true.
% 1.68/1.87  ** KEPT (pick-wt=34): 31 [] ife_q(product(A,B,C),true,ife_q(sum(D,C,E),true,ife_q(sum(D,B,F),true,ife_q(sum(D,A,G),true,product(G,F,E),true),true),true),true)=true.
% 1.68/1.87  ---> New Demodulator: 32 [new_demod,31] ife_q(product(A,B,C),true,ife_q(sum(D,C,E),true,ife_q(sum(D,B,F),true,ife_q(sum(D,A,G),true,product(G,F,E),true),true),true),true)=true.
% 1.68/1.87  ** KEPT (pick-wt=34): 33 [] ife_q(product(A,B,C),true,ife_q(product(D,E,F),true,ife_q(sum(G,E,B),true,ife_q(sum(G,D,A),true,sum(G,F,C),true),true),true),true)=true.
% 1.68/1.87  ---> New Demodulator: 34 [new_demod,33] ife_q(product(A,B,C),true,ife_q(product(D,E,F),true,ife_q(sum(G,E,B),true,ife_q(sum(G,D,A),true,sum(G,F,C),true),true),true),true)=true.
% 1.68/1.87  ** KEPT (pick-wt=34): 35 [] ife_q(product(A,B,C),true,ife_q(sum(C,D,E),true,ife_q(sum(B,D,F),true,ife_q(sum(A,D,G),true,product(G,F,E),true),true),true),true)=true.
% 1.68/1.87  ---> New Demodulator: 36 [new_demod,35] ife_q(product(A,B,C),true,ife_q(sum(C,D,E),true,ife_q(sum(B,D,F),true,ife_q(sum(A,D,G),true,product(G,F,E),true),true),true),true)=true.
% 1.68/1.87  ** KEPT (pick-wt=34): 37 [] ife_q(product(A,B,C),true,ife_q(product(D,E,F),true,ife_q(sum(E,G,B),true,ife_q(sum(D,G,A),true,sum(F,G,C),true),true),true),true)=true.
% 1.68/1.87  ---> New Demodulator: 38 [new_demod,37] ife_q(product(A,B,C),true,ife_q(product(D,E,F),true,ife_q(sum(E,G,B),true,ife_q(sum(D,G,A),true,sum(F,G,C),true),true),true),true)=true.
% 1.68/1.87  ** KEPT (pick-wt=7): 39 [] sum(inverse(A),A,multiplicative_identity)=true.
% 1.68/1.87  ---> New Demodulator: 40 [new_demod,39] sum(inverse(A),A,multiplicative_identity)=true.
% 1.68/1.87  ** KEPT (pick-wt=7): 41 [] sum(A,inverse(A),multiplicative_identity)=true.
% 1.68/1.87  ---> New Demodulator: 42 [new_demod,41] sum(A,inverse(A),multiplicative_identity)=true.
% 1.68/1.87  ** KEPT (pick-wt=7): 43 [] product(inverse(A),A,additive_identity)=true.
% 1.68/1.87  ---> New Demodulator: 44 [new_demod,43] product(inverse(A),A,additive_identity)=true.
% 1.68/1.87  ** KEPT (pick-wt=7): 45 [] product(A,inverse(A),additive_identity)=true.
% 1.68/1.87  ---> New Demodulator: 46 [new_demod,45] product(A,inverse(A),additive_identity)=true.
% 1.68/1.87  ** KEPT (pick-wt=17): 47 [] ife_q2(sum(A,B,C),true,ife_q2(sum(A,B,D),true,D,C),C)=C.
% 1.96/2.21  ---> New Demodulator: 48 [new_demod,47] ife_q2(sum(A,B,C),true,ife_q2(sum(A,B,D),true,D,C),C)=C.
% 1.96/2.21  ** KEPT (pick-wt=17): 49 [] ife_q2(product(A,B,C),true,ife_q2(product(A,B,D),true,D,C),C)=C.
% 1.96/2.21  ---> New Demodulator: 50 [new_demod,49] ife_q2(product(A,B,C),true,ife_q2(product(A,B,D),true,D,C),C)=C.
% 1.96/2.21  ** KEPT (pick-wt=6): 51 [] sum(x,y,z)=true.
% 1.96/2.21  ---> New Demodulator: 52 [new_demod,51] sum(x,y,z)=true.
% 1.96/2.21    Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.96/2.21  >>>> Starting back demodulation with 4.
% 1.96/2.21  >>>> Starting back demodulation with 6.
% 1.96/2.21  >>>> Starting back demodulation with 8.
% 1.96/2.21  >>>> Starting back demodulation with 10.
% 1.96/2.21  >>>> Starting back demodulation with 12.
% 1.96/2.21  >>>> Starting back demodulation with 14.
% 1.96/2.21  >>>> Starting back demodulation with 16.
% 1.96/2.21  >>>> Starting back demodulation with 18.
% 1.96/2.21  >>>> Starting back demodulation with 20.
% 1.96/2.21  >>>> Starting back demodulation with 22.
% 1.96/2.21  >>>> Starting back demodulation with 24.
% 1.96/2.21  >>>> Starting back demodulation with 26.
% 1.96/2.21  >>>> Starting back demodulation with 28.
% 1.96/2.21  >>>> Starting back demodulation with 30.
% 1.96/2.21  >>>> Starting back demodulation with 32.
% 1.96/2.21  >>>> Starting back demodulation with 34.
% 1.96/2.21  >>>> Starting back demodulation with 36.
% 1.96/2.21  >>>> Starting back demodulation with 38.
% 1.96/2.21  >>>> Starting back demodulation with 40.
% 1.96/2.21  >>>> Starting back demodulation with 42.
% 1.96/2.21  >>>> Starting back demodulation with 44.
% 1.96/2.21  >>>> Starting back demodulation with 46.
% 1.96/2.21  >>>> Starting back demodulation with 48.
% 1.96/2.21  >>>> Starting back demodulation with 50.
% 1.96/2.21  >>>> Starting back demodulation with 52.
% 1.96/2.21  
% 1.96/2.21  ======= end of input processing =======
% 1.96/2.21  
% 1.96/2.21  =========== start of search ===========
% 1.96/2.21  
% 1.96/2.21  
% 1.96/2.21  Resetting weight limit to 21.
% 1.96/2.21  
% 1.96/2.21  
% 1.96/2.21  Resetting weight limit to 21.
% 1.96/2.21  
% 1.96/2.21  sos_size=406
% 1.96/2.21  
% 1.96/2.21  
% 1.96/2.21  Resetting weight limit to 20.
% 1.96/2.21  
% 1.96/2.21  
% 1.96/2.21  Resetting weight limit to 20.
% 1.96/2.21  
% 1.96/2.21  sos_size=421
% 1.96/2.21  
% 1.96/2.21  
% 1.96/2.21  Resetting weight limit to 15.
% 1.96/2.21  
% 1.96/2.21  
% 1.96/2.21  Resetting weight limit to 15.
% 1.96/2.21  
% 1.96/2.21  sos_size=452
% 1.96/2.21  
% 1.96/2.21  -------- PROOF -------- 
% 1.96/2.21  
% 1.96/2.21  ----> UNIT CONFLICT at   0.32 sec ----> 2327 [binary,2325.1,1.1] $F.
% 1.96/2.21  
% 1.96/2.21  Length of proof is 31.  Level of proof is 16.
% 1.96/2.21  
% 1.96/2.21  ---------------- PROOF ----------------
% 1.96/2.21  % SZS status Unsatisfiable
% 1.96/2.21  % SZS output start Refutation
% See solution above
% 1.96/2.21  ------------ end of proof -------------
% 1.96/2.21  
% 1.96/2.21  
% 1.96/2.21  Search stopped by max_proofs option.
% 1.96/2.21  
% 1.96/2.21  
% 1.96/2.21  Search stopped by max_proofs option.
% 1.96/2.21  
% 1.96/2.21  ============ end of search ============
% 1.96/2.21  
% 1.96/2.21  -------------- statistics -------------
% 1.96/2.21  clauses given                777
% 1.96/2.21  clauses generated          37652
% 1.96/2.21  clauses kept                1165
% 1.96/2.21  clauses forward subsumed   23147
% 1.96/2.21  clauses back subsumed          0
% 1.96/2.21  Kbytes malloced             7812
% 1.96/2.21  
% 1.96/2.21  ----------- times (seconds) -----------
% 1.96/2.21  user CPU time          0.32          (0 hr, 0 min, 0 sec)
% 1.96/2.21  system CPU time        0.01          (0 hr, 0 min, 0 sec)
% 1.96/2.21  wall-clock time        2             (0 hr, 0 min, 2 sec)
% 1.96/2.21  
% 1.96/2.21  That finishes the proof of the theorem.
% 1.96/2.21  
% 1.96/2.21  Process 6237 finished Wed Jul 27 02:40:18 2022
% 1.96/2.21  Otter interrupted
% 1.96/2.21  PROOF FOUND
%------------------------------------------------------------------------------