TSTP Solution File: TOP051-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : TOP051-1 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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 13:27:00 EDT 2022
% Result : Unsatisfiable 1.67s 1.90s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 15
% Syntax : Number of clauses : 70 ( 70 unt; 0 nHn; 56 RR)
% Number of literals : 70 ( 69 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-10 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
tuple(a1,a6,a5,a2,a7,a3,a4,a9,a10,a8) != tuple(a2,a7,a6,a3,a8,a4,a5,a10,a11,a9),
file('TOP051-1.p',unknown),
[] ).
cnf(2,plain,
tuple(a2,a7,a6,a3,a8,a4,a5,a10,a11,a9) != tuple(a1,a6,a5,a2,a7,a3,a4,a9,a10,a8),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(3,axiom,
A = A,
file('TOP051-1.p',unknown),
[] ).
cnf(5,axiom,
product(A,A) = A,
file('TOP051-1.p',unknown),
[] ).
cnf(6,axiom,
product(product(A,B),B) = A,
file('TOP051-1.p',unknown),
[] ).
cnf(8,axiom,
product(product(A,B),C) = product(product(A,C),product(B,C)),
file('TOP051-1.p',unknown),
[] ).
cnf(10,axiom,
product(a1,a6) = a2,
file('TOP051-1.p',unknown),
[] ).
cnf(11,axiom,
product(a2,a7) = a3,
file('TOP051-1.p',unknown),
[] ).
cnf(14,axiom,
product(a3,a1) = a4,
file('TOP051-1.p',unknown),
[] ).
cnf(15,axiom,
product(a4,a10) = a5,
file('TOP051-1.p',unknown),
[] ).
cnf(17,axiom,
product(a5,a9) = a6,
file('TOP051-1.p',unknown),
[] ).
cnf(20,axiom,
product(a6,a2) = a7,
file('TOP051-1.p',unknown),
[] ).
cnf(21,axiom,
product(a7,a3) = a8,
file('TOP051-1.p',unknown),
[] ).
cnf(24,axiom,
product(a8,a6) = a9,
file('TOP051-1.p',unknown),
[] ).
cnf(26,axiom,
product(a9,a4) = a10,
file('TOP051-1.p',unknown),
[] ).
cnf(27,axiom,
product(a10,a5) = a11,
file('TOP051-1.p',unknown),
[] ).
cnf(29,plain,
product(product(A,B),product(C,B)) = product(product(A,C),B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[8])]),
[iquote('copy,8,flip.1')] ).
cnf(31,plain,
product(a4,a1) = a3,
inference(para_into,[status(thm),theory(equality)],[6,14]),
[iquote('para_into,6.1.1.1,13.1.1')] ).
cnf(33,plain,
product(a3,a7) = a2,
inference(para_into,[status(thm),theory(equality)],[6,11]),
[iquote('para_into,6.1.1.1,11.1.1')] ).
cnf(35,plain,
product(a2,a6) = a1,
inference(para_into,[status(thm),theory(equality)],[6,10]),
[iquote('para_into,6.1.1.1,9.1.1')] ).
cnf(38,plain,
product(a6,a9) = a5,
inference(para_from,[status(thm),theory(equality)],[17,6]),
[iquote('para_from,17.1.1,6.1.1.1')] ).
cnf(41,plain,
product(a7,a2) = a6,
inference(para_from,[status(thm),theory(equality)],[20,6]),
[iquote('para_from,19.1.1,6.1.1.1')] ).
cnf(44,plain,
product(product(a7,A),product(a3,A)) = product(a8,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[8,21])]),
[iquote('para_into,8.1.1.1,21.1.1,flip.1')] ).
cnf(46,plain,
product(product(a6,A),product(a2,A)) = product(a7,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[8,20])]),
[iquote('para_into,8.1.1.1,19.1.1,flip.1')] ).
cnf(48,plain,
product(product(a5,A),product(a9,A)) = product(a6,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[8,17])]),
[iquote('para_into,8.1.1.1,17.1.1,flip.1')] ).
cnf(50,plain,
product(product(a4,A),product(a10,A)) = product(a5,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[8,15])]),
[iquote('para_into,8.1.1.1,15.1.1,flip.1')] ).
cnf(52,plain,
product(product(a3,A),product(a1,A)) = product(a4,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[8,14])]),
[iquote('para_into,8.1.1.1,13.1.1,flip.1')] ).
cnf(54,plain,
product(product(a2,A),product(a7,A)) = product(a3,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[8,11])]),
[iquote('para_into,8.1.1.1,11.1.1,flip.1')] ).
cnf(56,plain,
product(product(a1,A),product(a6,A)) = product(a2,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[8,10])]),
[iquote('para_into,8.1.1.1,9.1.1,flip.1')] ).
cnf(135,plain,
product(product(A,product(B,C)),product(C,product(B,C))) = product(product(A,B),C),
inference(para_into,[status(thm),theory(equality)],[29,8]),
[iquote('para_into,29.1.1,8.1.1')] ).
cnf(153,plain,
product(product(a3,A),a7) = product(a2,product(A,a7)),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[33,29])]),
[iquote('para_from,32.1.1,29.1.1.1,flip.1')] ).
cnf(209,plain,
product(a8,a7) = a6,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[44,5]),33,41])]),
[iquote('para_into,44.1.1.1,4.1.1,demod,33,41,flip.1')] ).
cnf(210,plain,
product(product(a7,a1),a4) = product(a8,a1),
inference(para_into,[status(thm),theory(equality)],[44,14]),
[iquote('para_into,44.1.1.2,13.1.1')] ).
cnf(224,plain,
product(a6,a7) = a8,
inference(para_from,[status(thm),theory(equality)],[209,6]),
[iquote('para_from,208.1.1,6.1.1.1')] ).
cnf(251,plain,
product(a7,a6) = product(a6,a1),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[46,5]),35])]),
[iquote('para_into,46.1.1.1,4.1.1,demod,35,flip.1')] ).
cnf(258,plain,
product(product(a6,a1),product(a3,a6)) = a9,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[251,44]),24]),
[iquote('para_from,250.1.1,44.1.1.1,demod,24')] ).
cnf(284,plain,
product(product(a6,product(a3,a6)),product(a1,product(a3,a6))) = a9,
inference(para_into,[status(thm),theory(equality)],[258,8]),
[iquote('para_into,258.1.1,8.1.1')] ).
cnf(292,plain,
product(a9,product(a3,a6)) = product(a6,a1),
inference(para_from,[status(thm),theory(equality)],[258,6]),
[iquote('para_from,258.1.1,6.1.1.1')] ).
cnf(342,plain,
product(a5,a1) = product(a3,product(a10,a1)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[50,31])]),
[iquote('para_into,50.1.1.1,30.1.1,flip.1')] ).
cnf(388,plain,
product(a4,a7) = product(a2,product(a1,a7)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[52,33])]),
[iquote('para_into,52.1.1.1,32.1.1,flip.1')] ).
cnf(404,plain,
product(product(a3,product(a10,a1)),product(a9,a1)) = product(a6,a1),
inference(para_from,[status(thm),theory(equality)],[342,48]),
[iquote('para_from,342.1.1,48.1.1.1')] ).
cnf(431,plain,
product(a1,product(a6,a1)) = product(a3,a6),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[54,35]),251]),
[iquote('para_into,54.1.1.1,34.1.1,demod,251')] ).
cnf(475,plain,
product(a3,a6) = product(a2,a1),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[56,5]),431]),
[iquote('para_into,56.1.1.1,4.1.1,demod,431')] ).
cnf(480,plain,
product(a1,product(a6,a1)) = product(a2,a1),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[431]),475]),
[iquote('back_demod,430,demod,475')] ).
cnf(488,plain,
product(a9,product(a2,a1)) = product(a6,a1),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[292]),475]),
[iquote('back_demod,292,demod,475')] ).
cnf(495,plain,
product(a7,a1) = a9,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[284]),475,475,135,20]),
[iquote('back_demod,284,demod,475,475,135,20')] ).
cnf(502,plain,
product(a8,a1) = a10,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[210]),495,26])]),
[iquote('back_demod,210,demod,495,26,flip.1')] ).
cnf(520,plain,
product(product(a2,a1),a9) = a4,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[495,54]),14]),
[iquote('para_from,494.1.1,54.1.1.2,demod,14')] ).
cnf(529,plain,
product(a9,a1) = a7,
inference(para_from,[status(thm),theory(equality)],[495,6]),
[iquote('para_from,494.1.1,6.1.1.1')] ).
cnf(530,plain,
product(a2,product(product(a10,a1),a7)) = product(a6,a1),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[404]),529,153]),
[iquote('back_demod,404,demod,529,153')] ).
cnf(539,plain,
product(a10,a1) = a8,
inference(para_from,[status(thm),theory(equality)],[502,6]),
[iquote('para_from,502.1.1,6.1.1.1')] ).
cnf(541,plain,
product(a6,a1) = a1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[530]),539,209,35])]),
[iquote('back_demod,530,demod,539,209,35,flip.1')] ).
cnf(550,plain,
product(a9,product(a2,a1)) = a1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[488]),541]),
[iquote('back_demod,488,demod,541')] ).
cnf(559,plain,
product(a2,a1) = a1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[480]),541,5])]),
[iquote('back_demod,480,demod,541,5,flip.1')] ).
cnf(576,plain,
product(a7,a6) = a1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[251]),541]),
[iquote('back_demod,250,demod,541')] ).
cnf(585,plain,
a7 = a1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[550]),559,529]),
[iquote('back_demod,550,demod,559,529')] ).
cnf(586,plain,
product(a1,a9) = a4,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[520]),559]),
[iquote('back_demod,520,demod,559')] ).
cnf(591,plain,
a2 = a1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[576]),585,10]),
[iquote('back_demod,576,demod,585,10')] ).
cnf(605,plain,
a9 = a1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[495]),585,5])]),
[iquote('back_demod,494,demod,585,5,flip.1')] ).
cnf(613,plain,
a3 = a1,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[388]),585,31,591,585,5,5]),
[iquote('back_demod,388,demod,585,31,591,585,5,5')] ).
cnf(633,plain,
a8 = a1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[224]),585,541])]),
[iquote('back_demod,224,demod,585,541,flip.1')] ).
cnf(637,plain,
a6 = a1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[209]),633,585,5])]),
[iquote('back_demod,208,demod,633,585,5,flip.1')] ).
cnf(638,plain,
tuple(a1,a1,a5,a1,a1,a1,a4,a1,a10,a1) != tuple(a1,a1,a1,a1,a1,a4,a5,a10,a11,a1),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[2]),591,585,637,613,633,605,637,591,585,613,605,633])]),
[iquote('back_demod,2,demod,591,585,637,613,633,605,637,591,585,613,605,633,flip.1')] ).
cnf(690,plain,
a4 = a1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[586]),605,5])]),
[iquote('back_demod,586,demod,605,5,flip.1')] ).
cnf(698,plain,
a5 = a1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[38]),637,605,5])]),
[iquote('back_demod,38,demod,637,605,5,flip.1')] ).
cnf(706,plain,
a10 = a1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[502]),633,5])]),
[iquote('back_demod,502,demod,633,5,flip.1')] ).
cnf(711,plain,
tuple(a1,a1,a1,a1,a1,a1,a1,a1,a11,a1) != tuple(a1,a1,a1,a1,a1,a1,a1,a1,a1,a1),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[638]),698,690,706,690,698,706])]),
[iquote('back_demod,638,demod,698,690,706,690,698,706,flip.1')] ).
cnf(717,plain,
a11 = a1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[27]),706,698,5])]),
[iquote('back_demod,27,demod,706,698,5,flip.1')] ).
cnf(718,plain,
tuple(a1,a1,a1,a1,a1,a1,a1,a1,a1,a1) != tuple(a1,a1,a1,a1,a1,a1,a1,a1,a1,a1),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[711]),717]),
[iquote('back_demod,711,demod,717')] ).
cnf(719,plain,
$false,
inference(binary,[status(thm)],[718,3]),
[iquote('binary,718.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : TOP051-1 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n003.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 01:55:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.67/1.88 ----- Otter 3.3f, August 2004 -----
% 1.67/1.88 The process was started by sandbox on n003.cluster.edu,
% 1.67/1.88 Wed Jul 27 01:55:41 2022
% 1.67/1.88 The command was "./otter". The process ID is 22768.
% 1.67/1.88
% 1.67/1.88 set(prolog_style_variables).
% 1.67/1.88 set(auto).
% 1.67/1.88 dependent: set(auto1).
% 1.67/1.88 dependent: set(process_input).
% 1.67/1.88 dependent: clear(print_kept).
% 1.67/1.88 dependent: clear(print_new_demod).
% 1.67/1.88 dependent: clear(print_back_demod).
% 1.67/1.88 dependent: clear(print_back_sub).
% 1.67/1.88 dependent: set(control_memory).
% 1.67/1.88 dependent: assign(max_mem, 12000).
% 1.67/1.88 dependent: assign(pick_given_ratio, 4).
% 1.67/1.88 dependent: assign(stats_level, 1).
% 1.67/1.88 dependent: assign(max_seconds, 10800).
% 1.67/1.88 clear(print_given).
% 1.67/1.88
% 1.67/1.88 list(usable).
% 1.67/1.88 0 [] A=A.
% 1.67/1.88 0 [] product(X,X)=X.
% 1.67/1.88 0 [] product(product(X,Y),Y)=X.
% 1.67/1.88 0 [] product(product(X,Y),Z)=product(product(X,Z),product(Y,Z)).
% 1.67/1.88 0 [] product(a1,a6)=a2.
% 1.67/1.88 0 [] product(a2,a7)=a3.
% 1.67/1.88 0 [] product(a3,a1)=a4.
% 1.67/1.88 0 [] product(a4,a10)=a5.
% 1.67/1.88 0 [] product(a5,a9)=a6.
% 1.67/1.88 0 [] product(a6,a2)=a7.
% 1.67/1.88 0 [] product(a7,a3)=a8.
% 1.67/1.88 0 [] product(a8,a6)=a9.
% 1.67/1.88 0 [] product(a9,a4)=a10.
% 1.67/1.88 0 [] product(a10,a5)=a11.
% 1.67/1.88 0 [] tuple(a1,a6,a5,a2,a7,a3,a4,a9,a10,a8)!=tuple(a2,a7,a6,a3,a8,a4,a5,a10,a11,a9).
% 1.67/1.88 end_of_list.
% 1.67/1.88
% 1.67/1.88 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.67/1.88
% 1.67/1.88 All clauses are units, and equality is present; the
% 1.67/1.88 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.67/1.88
% 1.67/1.88 dependent: set(knuth_bendix).
% 1.67/1.88 dependent: set(anl_eq).
% 1.67/1.88 dependent: set(para_from).
% 1.67/1.88 dependent: set(para_into).
% 1.67/1.88 dependent: clear(para_from_right).
% 1.67/1.88 dependent: clear(para_into_right).
% 1.67/1.88 dependent: set(para_from_vars).
% 1.67/1.88 dependent: set(eq_units_both_ways).
% 1.67/1.88 dependent: set(dynamic_demod_all).
% 1.67/1.88 dependent: set(dynamic_demod).
% 1.67/1.88 dependent: set(order_eq).
% 1.67/1.88 dependent: set(back_demod).
% 1.67/1.88 dependent: set(lrpo).
% 1.67/1.88
% 1.67/1.88 ------------> process usable:
% 1.67/1.88 ** KEPT (pick-wt=23): 2 [copy,1,flip.1] tuple(a2,a7,a6,a3,a8,a4,a5,a10,a11,a9)!=tuple(a1,a6,a5,a2,a7,a3,a4,a9,a10,a8).
% 1.67/1.88
% 1.67/1.88 ------------> process sos:
% 1.67/1.88 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.67/1.88 ** KEPT (pick-wt=5): 4 [] product(A,A)=A.
% 1.67/1.88 ---> New Demodulator: 5 [new_demod,4] product(A,A)=A.
% 1.67/1.88 ** KEPT (pick-wt=7): 6 [] product(product(A,B),B)=A.
% 1.67/1.88 ---> New Demodulator: 7 [new_demod,6] product(product(A,B),B)=A.
% 1.67/1.88 ** KEPT (pick-wt=13): 8 [] product(product(A,B),C)=product(product(A,C),product(B,C)).
% 1.67/1.88 ** KEPT (pick-wt=5): 9 [] product(a1,a6)=a2.
% 1.67/1.88 ---> New Demodulator: 10 [new_demod,9] product(a1,a6)=a2.
% 1.67/1.88 ** KEPT (pick-wt=5): 11 [] product(a2,a7)=a3.
% 1.67/1.88 ---> New Demodulator: 12 [new_demod,11] product(a2,a7)=a3.
% 1.67/1.88 ** KEPT (pick-wt=5): 13 [] product(a3,a1)=a4.
% 1.67/1.88 ---> New Demodulator: 14 [new_demod,13] product(a3,a1)=a4.
% 1.67/1.88 ** KEPT (pick-wt=5): 15 [] product(a4,a10)=a5.
% 1.67/1.88 ---> New Demodulator: 16 [new_demod,15] product(a4,a10)=a5.
% 1.67/1.88 ** KEPT (pick-wt=5): 17 [] product(a5,a9)=a6.
% 1.67/1.88 ---> New Demodulator: 18 [new_demod,17] product(a5,a9)=a6.
% 1.67/1.88 ** KEPT (pick-wt=5): 19 [] product(a6,a2)=a7.
% 1.67/1.88 ---> New Demodulator: 20 [new_demod,19] product(a6,a2)=a7.
% 1.67/1.88 ** KEPT (pick-wt=5): 21 [] product(a7,a3)=a8.
% 1.67/1.88 ---> New Demodulator: 22 [new_demod,21] product(a7,a3)=a8.
% 1.67/1.88 ** KEPT (pick-wt=5): 23 [] product(a8,a6)=a9.
% 1.67/1.88 ---> New Demodulator: 24 [new_demod,23] product(a8,a6)=a9.
% 1.67/1.88 ** KEPT (pick-wt=5): 25 [] product(a9,a4)=a10.
% 1.67/1.88 ---> New Demodulator: 26 [new_demod,25] product(a9,a4)=a10.
% 1.67/1.88 ** KEPT (pick-wt=5): 27 [] product(a10,a5)=a11.
% 1.67/1.88 ---> New Demodulator: 28 [new_demod,27] product(a10,a5)=a11.
% 1.67/1.88 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.67/1.88 >>>> Starting back demodulation with 5.
% 1.67/1.88 >>>> Starting back demodulation with 7.
% 1.67/1.88 ** KEPT (pick-wt=13): 29 [copy,8,flip.1] product(product(A,B),product(C,B))=product(product(A,C),B).
% 1.67/1.88 >>>> Starting back demodulation with 10.
% 1.67/1.88 >>>> Starting back demodulation with 12.
% 1.67/1.88 >>>> Starting back demodulation with 14.
% 1.67/1.88 >>>> Starting back demodulation with 16.
% 1.67/1.88 >>>> Starting back demodulation with 18.
% 1.67/1.88 >>>> Starting back demodulation with 20.
% 1.67/1.88 >>>> Starting back demodulation with 22.
% 1.67/1.88 >>>> Starting back demodulation with 24.
% 1.67/1.88 >>>> Starting back demodulation with 26.
% 1.67/1.88 >>>> Starting back demodulation with 28.
% 1.67/1.88 Following clause subsumed by 8 during input processing: 0 [copy,29,flip.1] product(product(A,B),C)=product(product(A,C),product(B,C)).
% 1.67/1.90
% 1.67/1.90 ======= end of input processing =======
% 1.67/1.90
% 1.67/1.90 =========== start of search ===========
% 1.67/1.90
% 1.67/1.90 -------- PROOF --------
% 1.67/1.90
% 1.67/1.90 ----> UNIT CONFLICT at 0.01 sec ----> 719 [binary,718.1,3.1] $F.
% 1.67/1.90
% 1.67/1.90 Length of proof is 54. Level of proof is 15.
% 1.67/1.90
% 1.67/1.90 ---------------- PROOF ----------------
% 1.67/1.90 % SZS status Unsatisfiable
% 1.67/1.90 % SZS output start Refutation
% See solution above
% 1.67/1.90 ------------ end of proof -------------
% 1.67/1.90
% 1.67/1.90
% 1.67/1.90 Search stopped by max_proofs option.
% 1.67/1.90
% 1.67/1.90
% 1.67/1.90 Search stopped by max_proofs option.
% 1.67/1.90
% 1.67/1.90 ============ end of search ============
% 1.67/1.90
% 1.67/1.90 -------------- statistics -------------
% 1.67/1.90 clauses given 58
% 1.67/1.90 clauses generated 455
% 1.67/1.90 clauses kept 370
% 1.67/1.90 clauses forward subsumed 455
% 1.67/1.90 clauses back subsumed 0
% 1.67/1.90 Kbytes malloced 1953
% 1.67/1.90
% 1.67/1.90 ----------- times (seconds) -----------
% 1.67/1.90 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.67/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.90 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.67/1.90
% 1.67/1.90 That finishes the proof of the theorem.
% 1.67/1.90
% 1.67/1.90 Process 22768 finished Wed Jul 27 01:55:43 2022
% 1.67/1.90 Otter interrupted
% 1.67/1.90 PROOF FOUND
%------------------------------------------------------------------------------