TSTP Solution File: GRP683-11 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP683-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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:57:39 EDT 2022
% Result : Unsatisfiable 1.69s 1.93s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 8
% Syntax : Number of clauses : 80 ( 80 unt; 0 nHn; 4 RR)
% Number of literals : 80 ( 79 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 172 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
mult(rd(mult(x3,x4),x4),x5) != mult(x3,x5),
file('GRP683-11.p',unknown),
[] ).
cnf(4,axiom,
ld(A,mult(A,A)) = A,
file('GRP683-11.p',unknown),
[] ).
cnf(5,axiom,
rd(mult(A,A),A) = A,
file('GRP683-11.p',unknown),
[] ).
cnf(8,axiom,
mult(A,ld(A,B)) = ld(A,mult(A,B)),
file('GRP683-11.p',unknown),
[] ).
cnf(9,axiom,
mult(rd(A,B),B) = rd(mult(A,B),B),
file('GRP683-11.p',unknown),
[] ).
cnf(11,plain,
rd(mult(A,B),B) = mult(rd(A,B),B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[9])]),
[iquote('copy,9,flip.1')] ).
cnf(12,axiom,
ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D),
file('GRP683-11.p',unknown),
[] ).
cnf(13,axiom,
rd(mult(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,rd(mult(B,D),D)),
file('GRP683-11.p',unknown),
[] ).
cnf(14,plain,
mult(rd(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,mult(rd(B,D),D)),
inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[13]),11,11]),
[iquote('copy,13,demod,11,11')] ).
cnf(16,axiom,
ld(A,mult(A,ld(B,B))) = rd(mult(rd(A,A),B),B),
file('GRP683-11.p',unknown),
[] ).
cnf(18,plain,
mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[16]),11])]),
[iquote('copy,16,demod,11,flip.1')] ).
cnf(19,plain,
mult(rd(A,A),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[5]),11]),
[iquote('back_demod,5,demod,11')] ).
cnf(21,plain,
mult(mult(rd(x3,x4),x4),x5) != mult(x3,x5),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1]),11]),
[iquote('back_demod,1,demod,11')] ).
cnf(26,plain,
rd(A,A) = ld(A,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[11,19]),18,8,4]),
[iquote('para_into,10.1.1.1,19.1.1,demod,18,8,4')] ).
cnf(27,plain,
rd(ld(A,mult(A,B)),ld(A,B)) = mult(rd(A,ld(A,B)),ld(A,B)),
inference(para_into,[status(thm),theory(equality)],[11,8]),
[iquote('para_into,10.1.1.1,7.1.1')] ).
cnf(30,plain,
mult(ld(A,A),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[19]),26]),
[iquote('back_demod,19,demod,26')] ).
cnf(31,plain,
mult(rd(ld(A,A),B),B) = ld(A,mult(A,ld(B,B))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[18]),26]),
[iquote('back_demod,17,demod,26')] ).
cnf(35,plain,
mult(ld(A,mult(A,B)),C) = ld(A,mult(A,mult(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[12,4]),4])]),
[iquote('para_into,12.1.1.1,3.1.1,demod,4,flip.1')] ).
cnf(37,plain,
ld(ld(A,B),mult(ld(A,B),ld(C,mult(C,D)))) = ld(A,mult(A,ld(C,mult(C,D)))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[12,8]),35,8]),
[iquote('para_into,12.1.1.2.2,7.1.1,demod,35,8')] ).
cnf(48,plain,
mult(rd(A,rd(B,C)),rd(B,C)) = mult(ld(A,A),mult(rd(A,C),C)),
inference(para_into,[status(thm),theory(equality)],[14,30]),
[iquote('para_into,14.1.1.1.1,29.1.1')] ).
cnf(56,plain,
mult(mult(ld(A,A),mult(rd(A,B),B)),rd(C,B)) = mult(A,mult(rd(rd(C,B),B),B)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[14,11]),48]),
[iquote('para_into,14.1.1.1,10.1.1,demod,48')] ).
cnf(57,plain,
mult(ld(mult(A,B),mult(A,B)),mult(rd(mult(A,B),C),C)) = mult(A,mult(rd(B,C),C)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[14]),48]),
[iquote('back_demod,14,demod,48')] ).
cnf(62,plain,
ld(A,mult(A,ld(ld(A,A),ld(A,A)))) = ld(A,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[31,26]),30])]),
[iquote('para_into,31.1.1.1,25.1.1,demod,30,flip.1')] ).
cnf(77,plain,
ld(A,mult(A,mult(A,B))) = mult(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[35,4])]),
[iquote('para_into,34.1.1.1,3.1.1,flip.1')] ).
cnf(91,plain,
ld(ld(A,A),A) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[77,30]),30,30]),
[iquote('para_into,76.1.1.2.2,29.1.1,demod,30,30')] ).
cnf(98,plain,
rd(ld(A,ld(A,mult(A,B))),ld(A,ld(A,B))) = mult(rd(A,ld(A,ld(A,B))),ld(A,ld(A,B))),
inference(para_into,[status(thm),theory(equality)],[27,8]),
[iquote('para_into,27.1.1.1.2,7.1.1')] ).
cnf(102,plain,
mult(rd(A,ld(A,A)),ld(A,A)) = rd(A,ld(A,A)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[27,4])]),
[iquote('para_into,27.1.1.1,3.1.1,flip.1')] ).
cnf(112,plain,
mult(A,ld(ld(A,A),ld(A,A))) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[62,8]),8,4,77])]),
[iquote('para_from,62.1.1,7.1.1.2,demod,8,4,77,flip.1')] ).
cnf(128,plain,
rd(ld(A,A),ld(ld(A,A),ld(A,A))) = ld(A,mult(A,ld(ld(ld(A,A),ld(A,A)),ld(ld(A,A),ld(A,A))))),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[102,31])]),
[iquote('para_into,102.1.1,31.1.1,flip.1')] ).
cnf(149,plain,
ld(ld(A,B),mult(ld(A,B),C)) = ld(A,mult(A,C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[37,30]),91,30,91]),
[iquote('para_into,37.1.1.2.2.2,29.1.1,demod,91,30,91')] ).
cnf(152,plain,
ld(ld(A,mult(A,B)),ld(A,mult(A,mult(B,C)))) = ld(A,mult(A,C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[149,149]),149,35,149]),
[iquote('para_into,148.1.1.1,148.1.1,demod,149,35,149')] ).
cnf(157,plain,
ld(mult(A,B),mult(mult(A,B),C)) = ld(A,mult(A,C)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[149,77]),77]),
[iquote('para_into,148.1.1.1,76.1.1,demod,77')] ).
cnf(159,plain,
ld(A,mult(A,ld(ld(ld(A,B),ld(A,B)),ld(ld(A,B),ld(A,B))))) = ld(ld(A,B),ld(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[149,112])]),
[iquote('para_into,148.1.1.2,112.1.1,flip.1')] ).
cnf(167,plain,
ld(A,ld(A,mult(A,B))) = ld(A,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[149,4]),8])]),
[iquote('para_into,148.1.1,3.1.1,demod,8,flip.1')] ).
cnf(171,plain,
rd(ld(A,A),ld(ld(A,A),ld(A,A))) = ld(ld(A,A),ld(A,A)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[128]),159]),
[iquote('back_demod,128,demod,159')] ).
cnf(173,plain,
rd(ld(A,B),ld(A,ld(A,B))) = mult(rd(A,ld(A,ld(A,B))),ld(A,ld(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[98]),167]),
[iquote('back_demod,98,demod,167')] ).
cnf(191,plain,
ld(ld(A,B),ld(A,mult(A,C))) = ld(ld(A,B),C),
inference(para_into,[status(thm),theory(equality)],[167,149]),
[iquote('para_into,166.1.1.2,148.1.1')] ).
cnf(192,plain,
ld(ld(A,mult(A,B)),mult(B,C)) = ld(A,mult(A,C)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[152]),191]),
[iquote('back_demod,152,demod,191')] ).
cnf(200,plain,
ld(A,mult(A,B)) = ld(ld(A,mult(A,C)),mult(C,B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[192])]),
[iquote('copy,192,flip.1')] ).
cnf(221,plain,
mult(mult(A,B),ld(A,mult(A,C))) = mult(mult(A,B),C),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[157,8]),77]),
[iquote('para_from,156.1.1,7.1.1.2,demod,77')] ).
cnf(239,plain,
mult(rd(A,ld(B,B)),ld(B,B)) = mult(ld(A,A),mult(rd(A,B),B)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[48,26]),26]),
[iquote('para_into,47.1.1.1.2,25.1.1,demod,26')] ).
cnf(250,plain,
rd(A,ld(A,A)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[102]),239,26,30,30])]),
[iquote('back_demod,102,demod,239,26,30,30,flip.1')] ).
cnf(254,plain,
ld(ld(A,A),ld(A,A)) = ld(A,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[171]),250])]),
[iquote('back_demod,171,demod,250,flip.1')] ).
cnf(267,plain,
mult(ld(A,A),mult(ld(A,A),mult(rd(A,B),B))) = mult(rd(A,B),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[250,48]),250,239])]),
[iquote('para_from,249.1.1,47.1.1.2,demod,250,239,flip.1')] ).
cnf(296,plain,
mult(mult(rd(A,B),B),B) = mult(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[56,250]),239,267,250,250,8,4]),
[iquote('para_into,56.1.1.2,249.1.1,demod,239,267,250,250,8,4')] ).
cnf(326,plain,
mult(ld(A,A),B) = ld(A,mult(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[296,31]),35,30])]),
[iquote('para_into,295.1.1.1,31.1.1,demod,35,30,flip.1')] ).
cnf(328,plain,
ld(A,mult(A,mult(rd(A,B),B))) = mult(rd(A,B),B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[267]),326,326,8,77]),
[iquote('back_demod,266,demod,326,326,8,77')] ).
cnf(332,plain,
mult(rd(A,ld(B,B)),ld(B,B)) = mult(rd(A,B),B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[239]),326,328]),
[iquote('back_demod,238,demod,326,328')] ).
cnf(336,plain,
mult(rd(mult(A,B),C),C) = mult(A,mult(rd(B,C),C)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[57]),326,328]),
[iquote('back_demod,57,demod,326,328')] ).
cnf(338,plain,
mult(rd(A,rd(B,C)),rd(B,C)) = mult(rd(A,C),C),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[48]),326,328]),
[iquote('back_demod,47,demod,326,328')] ).
cnf(343,plain,
ld(rd(A,B),mult(rd(A,B),C)) = ld(A,mult(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[296,157]),296,157,157])]),
[iquote('para_from,295.1.1,156.1.1.1,demod,296,157,157,flip.1')] ).
cnf(346,plain,
ld(A,mult(A,B)) = ld(ld(A,A),B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[326,254]),326,326,191]),
[iquote('para_into,325.1.1.1,254.1.1,demod,326,326,191')] ).
cnf(350,plain,
ld(ld(rd(A,B),rd(A,B)),C) = ld(ld(A,A),C),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[343]),346,346]),
[iquote('back_demod,343,demod,346,346')] ).
cnf(355,plain,
mult(ld(A,A),B) = ld(ld(A,A),B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[326]),346]),
[iquote('back_demod,325,demod,346')] ).
cnf(360,plain,
mult(mult(A,B),ld(ld(A,A),C)) = mult(mult(A,B),C),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[221]),346]),
[iquote('back_demod,221,demod,346')] ).
cnf(364,plain,
ld(ld(ld(A,A),B),mult(B,C)) = ld(ld(A,A),C),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[200]),346,346])]),
[iquote('back_demod,200,demod,346,346,flip.1')] ).
cnf(372,plain,
ld(A,ld(ld(A,A),B)) = ld(A,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[167]),346]),
[iquote('back_demod,166,demod,346')] ).
cnf(376,plain,
ld(ld(mult(A,B),mult(A,B)),C) = ld(ld(A,A),C),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[157]),346,346]),
[iquote('back_demod,156,demod,346,346')] ).
cnf(382,plain,
ld(ld(A,A),mult(A,B)) = mult(A,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[77]),346]),
[iquote('back_demod,76,demod,346')] ).
cnf(386,plain,
mult(rd(ld(A,A),B),B) = ld(ld(A,A),ld(B,B)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[31]),346]),
[iquote('back_demod,31,demod,346')] ).
cnf(387,plain,
mult(A,ld(A,B)) = ld(ld(A,A),B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[8]),346]),
[iquote('back_demod,7,demod,346')] ).
cnf(391,plain,
ld(mult(rd(A,B),B),mult(A,B)) = ld(ld(A,A),B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[346,296]),376,350]),
[iquote('para_into,345.1.1.2,295.1.1,demod,376,350')] ).
cnf(396,plain,
mult(A,ld(ld(A,A),B)) = mult(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[387,346]),382]),
[iquote('para_into,387.1.1.2,345.1.1,demod,382')] ).
cnf(398,plain,
ld(ld(A,A),ld(A,B)) = ld(A,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[387,346]),372])]),
[iquote('para_from,387.1.1,345.1.1.2,demod,372,flip.1')] ).
cnf(400,plain,
mult(mult(rd(A,B),B),ld(B,B)) = mult(A,ld(B,B)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[332,11]),332,336,386,398]),
[iquote('para_into,331.1.1.1,10.1.1,demod,332,336,386,398')] ).
cnf(407,plain,
mult(mult(A,mult(rd(B,C),C)),C) = mult(mult(A,B),C),
inference(para_from,[status(thm),theory(equality)],[336,296]),
[iquote('para_from,335.1.1,295.1.1.1')] ).
cnf(420,plain,
ld(ld(A,A),rd(A,B)) = rd(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[350,91])]),
[iquote('para_into,349.1.1,90.1.1,flip.1')] ).
cnf(422,plain,
mult(rd(A,B),ld(ld(A,A),C)) = mult(rd(A,B),C),
inference(para_from,[status(thm),theory(equality)],[350,396]),
[iquote('para_from,349.1.1,395.1.1.2')] ).
cnf(430,plain,
ld(rd(A,B),rd(A,B)) = ld(ld(A,A),ld(B,B)),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[420,173]),420,420,26,420,420,420,420,338,386]),
[iquote('para_from,419.1.1,173.1.1.1,demod,420,420,26,420,420,420,420,338,386')] ).
cnf(432,plain,
ld(ld(ld(A,A),ld(B,B)),C) = ld(ld(A,A),C),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[350]),430]),
[iquote('back_demod,349,demod,430')] ).
cnf(435,plain,
ld(ld(A,A),ld(ld(B,B),C)) = ld(ld(A,A),C),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[364,396]),364])]),
[iquote('para_into,363.1.1.2,395.1.1,demod,364,flip.1')] ).
cnf(451,plain,
mult(mult(rd(A,B),B),ld(ld(A,A),B)) = mult(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[391,387]),376,430,432,382]),
[iquote('para_from,391.1.1,387.1.1.2,demod,376,430,432,382')] ).
cnf(457,plain,
mult(rd(A,B),ld(B,B)) = rd(A,B),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[430,387]),422,430,432,420]),
[iquote('para_from,429.1.1,387.1.1.2,demod,422,430,432,420')] ).
cnf(462,plain,
mult(rd(A,B),B) = mult(A,ld(B,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[457,11]),400,11])]),
[iquote('para_into,457.1.1.1,10.1.1,demod,400,11,flip.1')] ).
cnf(468,plain,
mult(mult(A,ld(B,B)),B) = mult(A,B),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[451]),462,360]),
[iquote('back_demod,451,demod,462,360')] ).
cnf(475,plain,
mult(mult(A,mult(B,ld(C,C))),C) = mult(mult(A,B),C),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[407]),462]),
[iquote('back_demod,407,demod,462')] ).
cnf(487,plain,
mult(mult(x3,ld(x4,x4)),x5) != mult(x3,x5),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[21]),462]),
[iquote('back_demod,21,demod,462')] ).
cnf(509,plain,
mult(A,ld(ld(B,B),C)) = mult(A,C),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[435,396]),396])]),
[iquote('para_from,435.1.1,395.1.1.2,demod,396,flip.1')] ).
cnf(518,plain,
mult(mult(A,ld(B,B)),C) = mult(A,C),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[475,355]),509,468])]),
[iquote('para_into,475.1.1.1.2,355.1.1,demod,509,468,flip.1')] ).
cnf(520,plain,
$false,
inference(binary,[status(thm)],[518,487]),
[iquote('binary,518.1,487.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP683-11 : TPTP v8.1.0. Released v8.1.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n005.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 05:18:20 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.69/1.93 ----- Otter 3.3f, August 2004 -----
% 1.69/1.93 The process was started by sandbox on n005.cluster.edu,
% 1.69/1.93 Wed Jul 27 05:18:20 2022
% 1.69/1.93 The command was "./otter". The process ID is 3575.
% 1.69/1.93
% 1.69/1.93 set(prolog_style_variables).
% 1.69/1.93 set(auto).
% 1.69/1.93 dependent: set(auto1).
% 1.69/1.93 dependent: set(process_input).
% 1.69/1.93 dependent: clear(print_kept).
% 1.69/1.93 dependent: clear(print_new_demod).
% 1.69/1.93 dependent: clear(print_back_demod).
% 1.69/1.93 dependent: clear(print_back_sub).
% 1.69/1.93 dependent: set(control_memory).
% 1.69/1.93 dependent: assign(max_mem, 12000).
% 1.69/1.93 dependent: assign(pick_given_ratio, 4).
% 1.69/1.93 dependent: assign(stats_level, 1).
% 1.69/1.93 dependent: assign(max_seconds, 10800).
% 1.69/1.93 clear(print_given).
% 1.69/1.93
% 1.69/1.93 list(usable).
% 1.69/1.93 0 [] A=A.
% 1.69/1.93 0 [] ld(A,mult(A,A))=A.
% 1.69/1.93 0 [] rd(mult(A,A),A)=A.
% 1.69/1.93 0 [] mult(A,ld(A,B))=ld(A,mult(A,B)).
% 1.69/1.93 0 [] mult(rd(A,B),B)=rd(mult(A,B),B).
% 1.69/1.93 0 [] ld(ld(A,B),mult(ld(A,B),mult(C,D)))=mult(ld(A,mult(A,C)),D).
% 1.69/1.93 0 [] rd(mult(mult(A,B),rd(C,D)),rd(C,D))=mult(A,rd(mult(B,D),D)).
% 1.69/1.93 0 [] ld(A,mult(A,ld(B,B)))=rd(mult(rd(A,A),B),B).
% 1.69/1.93 0 [] mult(rd(mult(x3,x4),x4),x5)!=mult(x3,x5).
% 1.69/1.93 end_of_list.
% 1.69/1.93
% 1.69/1.93 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.69/1.93
% 1.69/1.93 All clauses are units, and equality is present; the
% 1.69/1.93 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.69/1.93
% 1.69/1.93 dependent: set(knuth_bendix).
% 1.69/1.93 dependent: set(anl_eq).
% 1.69/1.93 dependent: set(para_from).
% 1.69/1.93 dependent: set(para_into).
% 1.69/1.93 dependent: clear(para_from_right).
% 1.69/1.93 dependent: clear(para_into_right).
% 1.69/1.93 dependent: set(para_from_vars).
% 1.69/1.93 dependent: set(eq_units_both_ways).
% 1.69/1.93 dependent: set(dynamic_demod_all).
% 1.69/1.93 dependent: set(dynamic_demod).
% 1.69/1.93 dependent: set(order_eq).
% 1.69/1.93 dependent: set(back_demod).
% 1.69/1.93 dependent: set(lrpo).
% 1.69/1.93
% 1.69/1.93 ------------> process usable:
% 1.69/1.93 ** KEPT (pick-wt=11): 1 [] mult(rd(mult(x3,x4),x4),x5)!=mult(x3,x5).
% 1.69/1.93
% 1.69/1.93 ------------> process sos:
% 1.69/1.93 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.69/1.93 ** KEPT (pick-wt=7): 3 [] ld(A,mult(A,A))=A.
% 1.69/1.93 ---> New Demodulator: 4 [new_demod,3] ld(A,mult(A,A))=A.
% 1.69/1.93 ** KEPT (pick-wt=7): 5 [] rd(mult(A,A),A)=A.
% 1.69/1.93 ---> New Demodulator: 6 [new_demod,5] rd(mult(A,A),A)=A.
% 1.69/1.93 ** KEPT (pick-wt=11): 7 [] mult(A,ld(A,B))=ld(A,mult(A,B)).
% 1.69/1.93 ---> New Demodulator: 8 [new_demod,7] mult(A,ld(A,B))=ld(A,mult(A,B)).
% 1.69/1.93 ** KEPT (pick-wt=11): 10 [copy,9,flip.1] rd(mult(A,B),B)=mult(rd(A,B),B).
% 1.69/1.93 ---> New Demodulator: 11 [new_demod,10] rd(mult(A,B),B)=mult(rd(A,B),B).
% 1.69/1.93 ** KEPT (pick-wt=19): 12 [] ld(ld(A,B),mult(ld(A,B),mult(C,D)))=mult(ld(A,mult(A,C)),D).
% 1.69/1.93 ** KEPT (pick-wt=19): 14 [copy,13,demod,11,11] mult(rd(mult(A,B),rd(C,D)),rd(C,D))=mult(A,mult(rd(B,D),D)).
% 1.69/1.93 ---> New Demodulator: 15 [new_demod,14] mult(rd(mult(A,B),rd(C,D)),rd(C,D))=mult(A,mult(rd(B,D),D)).
% 1.69/1.93 ** KEPT (pick-wt=15): 17 [copy,16,demod,11,flip.1] mult(rd(rd(A,A),B),B)=ld(A,mult(A,ld(B,B))).
% 1.69/1.93 ---> New Demodulator: 18 [new_demod,17] mult(rd(rd(A,A),B),B)=ld(A,mult(A,ld(B,B))).
% 1.69/1.93 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.69/1.93 >>>> Starting back demodulation with 4.
% 1.69/1.93 >>>> Starting back demodulation with 6.
% 1.69/1.93 >>>> Starting back demodulation with 8.
% 1.69/1.93 >>>> Starting back demodulation with 11.
% 1.69/1.93 >> back demodulating 5 with 11.
% 1.69/1.93 >> back demodulating 1 with 11.
% 1.69/1.93 ** KEPT (pick-wt=19): 22 [copy,12,flip.1] mult(ld(A,mult(A,B)),C)=ld(ld(A,D),mult(ld(A,D),mult(B,C))).
% 1.69/1.93 >>>> Starting back demodulation with 15.
% 1.69/1.93 >>>> Starting back demodulation with 18.
% 1.69/1.93 >>>> Starting back demodulation with 20.
% 1.69/1.93 Following clause subsumed by 12 during input processing: 0 [copy,22,flip.1] ld(ld(A,B),mult(ld(A,B),mult(C,D)))=mult(ld(A,mult(A,C)),D).
% 1.69/1.93
% 1.69/1.93 ======= end of input processing =======
% 1.69/1.93
% 1.69/1.93 =========== start of search ===========
% 1.69/1.93
% 1.69/1.93
% 1.69/1.93 Resetting weight limit to 15.
% 1.69/1.93
% 1.69/1.93
% 1.69/1.93 Resetting weight limit to 15.
% 1.69/1.93
% 1.69/1.93 sos_size=79
% 1.69/1.93
% 1.69/1.93
% 1.69/1.93 Resetting weight limit to 11.
% 1.69/1.93
% 1.69/1.93
% 1.69/1.93 Resetting weight limit to 11.
% 1.69/1.93
% 1.69/1.93 sos_size=18
% 1.69/1.93
% 1.69/1.93 -------- PROOF --------
% 1.69/1.93
% 1.69/1.93 ----> UNIT CONFLICT at 0.03 sec ----> 520 [binary,518.1,487.1] $F.
% 1.69/1.93
% 1.69/1.93 Length of proof is 71. Level of proof is 19.
% 1.69/1.93
% 1.69/1.93 ---------------- PROOF ----------------
% 1.69/1.93 % SZS status Unsatisfiable
% 1.69/1.93 % SZS output start Refutation
% See solution above
% 1.69/1.93 ------------ end of proof -------------
% 1.69/1.93
% 1.69/1.93
% 1.69/1.93 Search stopped by max_proofs option.
% 1.69/1.93
% 1.69/1.93
% 1.69/1.93 Search stopped by max_proofs option.
% 1.69/1.93
% 1.69/1.93 ============ end of search ============
% 1.69/1.93
% 1.69/1.93 -------------- statistics -------------
% 1.69/1.93 clauses given 104
% 1.69/1.93 clauses generated 3017
% 1.69/1.93 clauses kept 275
% 1.69/1.93 clauses forward subsumed 1803
% 1.69/1.93 clauses back subsumed 2
% 1.69/1.93 Kbytes malloced 4882
% 1.69/1.93
% 1.69/1.93 ----------- times (seconds) -----------
% 1.69/1.93 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 1.69/1.93 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.93 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.69/1.93
% 1.69/1.93 That finishes the proof of the theorem.
% 1.69/1.93
% 1.69/1.93 Process 3575 finished Wed Jul 27 05:18:22 2022
% 1.69/1.93 Otter interrupted
% 1.69/1.93 PROOF FOUND
%------------------------------------------------------------------------------