TSTP Solution File: GRP436-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP436-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %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 : 600s
% DateTime : Sat Jul 16 08:47:10 EDT 2022
% Result : Unsatisfiable 1.54s 1.93s
% Output : Refutation 1.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 43
% Number of leaves : 1
% Syntax : Number of clauses : 90 ( 90 unt; 0 nHn; 2 RR)
% Number of literals : 90 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 3 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 310 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(A,inverse(multiply(B,multiply(C,multiply(multiply(inverse(C),inverse(multiply(D,B))),A))))),D),
file('GRP436-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(multiply(A,inverse(multiply(inverse(multiply(B,multiply(C,multiply(multiply(inverse(C),inverse(multiply(D,B))),E)))),multiply(F,multiply(multiply(inverse(F),inverse(D)),A))))),E),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(4,plain,
equal(multiply(A,inverse(multiply(multiply(B,multiply(multiply(inverse(B),inverse(multiply(C,D))),inverse(E))),multiply(E,multiply(C,A))))),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(7,plain,
equal(multiply(A,inverse(multiply(multiply(B,multiply(multiply(inverse(B),inverse(C)),inverse(D))),multiply(D,multiply(E,A))))),inverse(multiply(F,multiply(G,multiply(multiply(inverse(G),inverse(multiply(C,F))),E))))),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(8,plain,
equal(inverse(multiply(A,multiply(B,multiply(multiply(inverse(B),inverse(multiply(C,A))),D)))),multiply(E,inverse(multiply(multiply(F,multiply(multiply(inverse(F),inverse(C)),inverse(G))),multiply(G,multiply(D,E)))))),
inference(flip,[status(thm),theory(equality)],[7]),
[iquote('flip(7)')] ).
cnf(14,plain,
equal(multiply(A,inverse(multiply(multiply(B,multiply(C,inverse(D))),multiply(D,multiply(E,A))))),multiply(F,multiply(multiply(inverse(F),inverse(multiply(C,E))),inverse(B)))),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(25,plain,
equal(multiply(A,multiply(multiply(inverse(A),inverse(multiply(B,multiply(inverse(C),inverse(multiply(D,multiply(E,multiply(B,inverse(C))))))))),inverse(E))),D),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,14]),1]),
[iquote('para(1,14),flip(1)')] ).
cnf(35,plain,
equal(multiply(inverse(A),inverse(multiply(multiply(inverse(B),inverse(multiply(C,multiply(A,multiply(D,inverse(B)))))),C))),D),
inference(para,[status(thm),theory(equality)],[25,1]),
[iquote('para(25,1)')] ).
cnf(39,plain,
equal(multiply(A,inverse(multiply(B,multiply(C,multiply(D,A))))),multiply(inverse(E),inverse(multiply(B,multiply(C,multiply(D,inverse(E))))))),
inference(para,[status(thm),theory(equality)],[35,1]),
[iquote('para(35,1)')] ).
cnf(40,plain,
equal(multiply(inverse(A),inverse(multiply(B,multiply(C,multiply(D,inverse(A)))))),multiply(E,inverse(multiply(B,multiply(C,multiply(D,E)))))),
inference(flip,[status(thm),theory(equality)],[39]),
[iquote('flip(39)')] ).
cnf(50,plain,
equal(multiply(A,inverse(multiply(multiply(B,multiply(C,inverse(D))),multiply(D,multiply(multiply(E,inverse(multiply(F,multiply(B,multiply(C,E))))),A))))),F),
inference(para,[status(thm),theory(equality)],[40,1]),
[iquote('para(40,1)')] ).
cnf(69,plain,
equal(multiply(A,inverse(multiply(multiply(B,multiply(multiply(C,inverse(multiply(D,multiply(E,multiply(F,C))))),inverse(G))),multiply(G,multiply(D,A))))),multiply(E,multiply(F,inverse(B)))),
inference(para,[status(thm),theory(equality)],[50,1]),
[iquote('para(50,1)')] ).
cnf(108,plain,
equal(inverse(multiply(A,multiply(B,multiply(multiply(inverse(B),inverse(multiply(multiply(C,D),A))),C)))),D),
inference(para,[status(thm),theory(equality)],[7,4]),
[iquote('para(7,4)')] ).
cnf(112,plain,
equal(multiply(A,inverse(multiply(multiply(B,multiply(multiply(inverse(B),inverse(multiply(multiply(C,D),E))),C)),multiply(F,multiply(multiply(inverse(F),D),A))))),E),
inference(para,[status(thm),theory(equality)],[108,1]),
[iquote('para(108,1)')] ).
cnf(129,plain,
equal(multiply(A,multiply(B,inverse(multiply(multiply(C,multiply(multiply(inverse(C),inverse(D)),inverse(E))),multiply(E,multiply(A,B)))))),D),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(134,plain,
equal(multiply(multiply(inverse(A),inverse(multiply(B,multiply(C,multiply(multiply(inverse(C),inverse(D)),inverse(A)))))),B),D),
inference(para,[status(thm),theory(equality)],[1,129]),
[iquote('para(1,129)')] ).
cnf(137,plain,
equal(multiply(A,inverse(multiply(multiply(B,multiply(multiply(inverse(B),inverse(C)),inverse(D))),multiply(D,C)))),A),
inference(para,[status(thm),theory(equality)],[134,1]),
[iquote('para(134,1)')] ).
cnf(142,plain,
equal(multiply(A,inverse(multiply(multiply(B,C),multiply(D,multiply(inverse(D),A))))),multiply(E,multiply(multiply(inverse(E),inverse(C)),inverse(B)))),
inference(para,[status(thm),theory(equality)],[137,1]),
[iquote('para(137,1)')] ).
cnf(169,plain,
equal(multiply(A,inverse(multiply(multiply(B,multiply(inverse(B),inverse(C))),multiply(C,multiply(multiply(D,multiply(multiply(inverse(D),inverse(E)),inverse(F))),A))))),multiply(F,E)),
inference(para,[status(thm),theory(equality)],[142,1]),
[iquote('para(142,1)')] ).
cnf(348,plain,
equal(multiply(A,inverse(multiply(multiply(B,multiply(multiply(inverse(B),inverse(multiply(C,D))),C)),multiply(E,multiply(inverse(E),A))))),D),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[137,112]),137]),
[iquote('para(137,112),demod([137])')] ).
cnf(351,plain,
equal(multiply(A,inverse(multiply(multiply(B,multiply(inverse(B),inverse(C))),multiply(C,multiply(D,A))))),multiply(E,multiply(multiply(inverse(E),inverse(multiply(F,D))),F))),
inference(para,[status(thm),theory(equality)],[348,1]),
[iquote('para(348,1)')] ).
cnf(352,plain,
equal(multiply(A,multiply(multiply(inverse(A),inverse(multiply(B,C))),B)),multiply(D,inverse(multiply(multiply(E,multiply(inverse(E),inverse(F))),multiply(F,multiply(C,D)))))),
inference(flip,[status(thm),theory(equality)],[351]),
[iquote('flip(351)')] ).
cnf(391,plain,
equal(multiply(A,multiply(multiply(inverse(A),inverse(multiply(B,multiply(inverse(C),inverse(multiply(D,multiply(E,multiply(inverse(E),inverse(C))))))))),B)),D),
inference(para,[status(thm),theory(equality)],[351,1]),
[iquote('para(351,1)')] ).
cnf(402,plain,
equal(multiply(A,inverse(multiply(multiply(inverse(B),inverse(multiply(C,multiply(D,multiply(inverse(D),inverse(B)))))),C))),A),
inference(para,[status(thm),theory(equality)],[391,1]),
[iquote('para(391,1)')] ).
cnf(404,plain,
equal(multiply(A,inverse(multiply(B,multiply(C,multiply(inverse(C),A))))),multiply(inverse(D),inverse(multiply(B,multiply(E,multiply(inverse(E),inverse(D))))))),
inference(para,[status(thm),theory(equality)],[402,1]),
[iquote('para(402,1)')] ).
cnf(405,plain,
equal(multiply(inverse(A),inverse(multiply(B,multiply(C,multiply(inverse(C),inverse(A)))))),multiply(D,inverse(multiply(B,multiply(E,multiply(inverse(E),D)))))),
inference(flip,[status(thm),theory(equality)],[404]),
[iquote('flip(404)')] ).
cnf(445,plain,
equal(multiply(A,inverse(multiply(multiply(B,multiply(inverse(B),inverse(C))),multiply(C,multiply(multiply(D,inverse(multiply(E,multiply(F,multiply(inverse(F),D))))),A))))),E),
inference(para,[status(thm),theory(equality)],[405,1]),
[iquote('para(405,1)')] ).
cnf(565,plain,
equal(multiply(A,inverse(multiply(B,multiply(C,inverse(multiply(multiply(D,multiply(inverse(D),inverse(E))),multiply(E,multiply(B,C)))))))),A),
inference(para,[status(thm),theory(equality)],[352,1]),
[iquote('para(352,1)')] ).
cnf(616,plain,
equal(multiply(A,multiply(inverse(A),inverse(B))),multiply(C,multiply(inverse(C),inverse(B)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[445,1]),69]),
[iquote('para(445,1),demod([69])')] ).
cnf(627,plain,
equal(multiply(A,multiply(inverse(A),B)),multiply(C,multiply(inverse(C),B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[108,616]),108]),
[iquote('para(108,616),demod([108])')] ).
cnf(639,plain,
equal(multiply(A,inverse(A)),multiply(B,inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[137,627]),137]),
[iquote('para(137,627),demod([137])')] ).
cnf(640,plain,
equal(multiply(A,inverse(multiply(multiply(B,multiply(multiply(inverse(B),inverse(multiply(inverse(C),D))),inverse(C))),multiply(E,multiply(inverse(E),D))))),A),
inference(para,[status(thm),theory(equality)],[627,137]),
[iquote('para(627,137)')] ).
cnf(643,plain,
equal(multiply(A,multiply(B,inverse(B))),multiply(C,multiply(inverse(C),inverse(inverse(A))))),
inference(para,[status(thm),theory(equality)],[639,627]),
[iquote('para(639,627)')] ).
cnf(651,plain,
equal(multiply(A,multiply(B,multiply(inverse(B),inverse(inverse(inverse(A)))))),multiply(C,multiply(inverse(C),multiply(D,inverse(D))))),
inference(para,[status(thm),theory(equality)],[643,627]),
[iquote('para(643,627)')] ).
cnf(652,plain,
equal(multiply(A,multiply(inverse(A),multiply(B,inverse(B)))),multiply(C,multiply(D,multiply(inverse(D),inverse(inverse(inverse(C))))))),
inference(flip,[status(thm),theory(equality)],[651]),
[iquote('flip(651)')] ).
cnf(656,plain,
equal(multiply(A,inverse(A)),multiply(multiply(B,multiply(multiply(inverse(B),inverse(C)),inverse(D))),multiply(D,C))),
inference(para,[status(thm),theory(equality)],[639,137]),
[iquote('para(639,137)')] ).
cnf(772,plain,
equal(multiply(A,multiply(B,multiply(C,multiply(inverse(C),inverse(inverse(inverse(B))))))),multiply(D,multiply(inverse(D),multiply(inverse(inverse(A)),multiply(E,inverse(E)))))),
inference(para,[status(thm),theory(equality)],[652,627]),
[iquote('para(652,627)')] ).
cnf(773,plain,
equal(multiply(A,multiply(inverse(A),multiply(inverse(inverse(B)),multiply(C,inverse(C))))),multiply(B,multiply(D,multiply(E,multiply(inverse(E),inverse(inverse(inverse(D)))))))),
inference(flip,[status(thm),theory(equality)],[772]),
[iquote('flip(772)')] ).
cnf(787,plain,
equal(multiply(multiply(A,multiply(multiply(inverse(A),inverse(multiply(inverse(B),C))),inverse(B))),multiply(D,multiply(inverse(D),C))),multiply(E,inverse(E))),
inference(para,[status(thm),theory(equality)],[640,639]),
[iquote('para(640,639)')] ).
cnf(788,plain,
equal(multiply(A,inverse(A)),multiply(multiply(B,multiply(multiply(inverse(B),inverse(multiply(inverse(C),D))),inverse(C))),multiply(E,multiply(inverse(E),D)))),
inference(flip,[status(thm),theory(equality)],[787]),
[iquote('flip(787)')] ).
cnf(988,plain,
equal(multiply(A,inverse(multiply(inverse(B),multiply(C,multiply(inverse(C),A))))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[656,1]),137]),
[iquote('para(656,1),demod([137])')] ).
cnf(999,plain,
equal(multiply(multiply(A,inverse(A)),inverse(multiply(inverse(B),multiply(C,multiply(D,multiply(inverse(D),inverse(inverse(inverse(C))))))))),B),
inference(para,[status(thm),theory(equality)],[643,988]),
[iquote('para(643,988)')] ).
cnf(1080,plain,
equal(multiply(A,inverse(multiply(multiply(B,multiply(inverse(B),inverse(C))),multiply(C,multiply(D,A))))),inverse(D)),
inference(para,[status(thm),theory(equality)],[988,1]),
[iquote('para(988,1)')] ).
cnf(1094,plain,
equal(multiply(A,inverse(multiply(B,inverse(B)))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[565]),1080]),
[iquote('back_demod(565),demod([1080])')] ).
cnf(1101,plain,
equal(multiply(A,multiply(multiply(inverse(A),inverse(multiply(B,C))),B)),inverse(C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[352]),1080]),
[iquote('back_demod(352),demod([1080])')] ).
cnf(1105,plain,
equal(multiply(A,inverse(A)),multiply(inverse(B),multiply(C,multiply(inverse(C),B)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[788]),1101]),
[iquote('back_demod(788),demod([1101])')] ).
cnf(1106,plain,
equal(multiply(inverse(A),multiply(B,multiply(inverse(B),A))),multiply(C,inverse(C))),
inference(flip,[status(thm),theory(equality)],[1105]),
[iquote('flip(1105)')] ).
cnf(1133,plain,
equal(inverse(multiply(A,multiply(multiply(inverse(A),inverse(B)),inverse(C)))),multiply(C,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[169]),1080]),
[iquote('back_demod(169),demod([1080])')] ).
cnf(1150,plain,
equal(inverse(multiply(A,multiply(multiply(B,inverse(B)),inverse(C)))),multiply(C,inverse(A))),
inference(para,[status(thm),theory(equality)],[639,1133]),
[iquote('para(639,1133)')] ).
cnf(1151,plain,
equal(inverse(multiply(A,multiply(B,inverse(B)))),multiply(multiply(inverse(A),inverse(C)),C)),
inference(para,[status(thm),theory(equality)],[639,1133]),
[iquote('para(639,1133)')] ).
cnf(1152,plain,
equal(multiply(multiply(inverse(A),inverse(B)),B),inverse(multiply(A,multiply(C,inverse(C))))),
inference(flip,[status(thm),theory(equality)],[1151]),
[iquote('flip(1151)')] ).
cnf(1157,plain,
equal(inverse(multiply(A,multiply(inverse(A),inverse(B)))),multiply(multiply(C,inverse(C)),B)),
inference(para,[status(thm),theory(equality)],[1094,1133]),
[iquote('para(1094,1133)')] ).
cnf(1158,plain,
equal(multiply(multiply(A,inverse(A)),B),inverse(multiply(C,multiply(inverse(C),inverse(B))))),
inference(flip,[status(thm),theory(equality)],[1157]),
[iquote('flip(1157)')] ).
cnf(1159,plain,
equal(inverse(multiply(A,multiply(B,inverse(B)))),multiply(multiply(C,inverse(C)),inverse(A))),
inference(para,[status(thm),theory(equality)],[639,1150]),
[iquote('para(639,1150)')] ).
cnf(1166,plain,
equal(inverse(multiply(A,multiply(B,inverse(B)))),multiply(inverse(A),inverse(inverse(multiply(C,inverse(C)))))),
inference(para,[status(thm),theory(equality)],[1152,1094]),
[iquote('para(1152,1094)')] ).
cnf(1167,plain,
equal(multiply(inverse(A),inverse(inverse(multiply(B,inverse(B))))),inverse(multiply(A,multiply(C,inverse(C))))),
inference(flip,[status(thm),theory(equality)],[1166]),
[iquote('flip(1166)')] ).
cnf(1188,plain,
equal(multiply(A,multiply(B,inverse(multiply(B,multiply(C,inverse(C)))))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1159,1094]),1150]),
[iquote('para(1159,1094),demod([1150])')] ).
cnf(1259,plain,
equal(multiply(inverse(multiply(inverse(A),multiply(B,inverse(B)))),inverse(multiply(inverse(C),A))),C),
inference(para,[status(thm),theory(equality)],[1188,988]),
[iquote('para(1188,988)')] ).
cnf(1260,plain,
equal(inverse(multiply(inverse(inverse(inverse(A))),multiply(B,inverse(B)))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[639,1259]),1094]),
[iquote('para(639,1259),demod([1094])')] ).
cnf(1265,plain,
equal(inverse(multiply(A,multiply(inverse(A),inverse(inverse(inverse(inverse(inverse(B)))))))),B),
inference(para,[status(thm),theory(equality)],[627,1260]),
[iquote('para(627,1260)')] ).
cnf(1272,plain,
equal(multiply(A,multiply(inverse(inverse(inverse(B))),B)),A),
inference(para,[status(thm),theory(equality)],[1260,1188]),
[iquote('para(1260,1188)')] ).
cnf(1273,plain,
equal(multiply(A,inverse(inverse(inverse(inverse(multiply(B,inverse(B))))))),A),
inference(para,[status(thm),theory(equality)],[1094,1272]),
[iquote('para(1094,1272)')] ).
cnf(1294,plain,
equal(multiply(A,multiply(inverse(A),B)),inverse(inverse(B))),
inference(para,[status(thm),theory(equality)],[627,1272]),
[iquote('para(627,1272)')] ).
cnf(1295,plain,
equal(inverse(inverse(A)),multiply(B,multiply(inverse(B),A))),
inference(flip,[status(thm),theory(equality)],[1294]),
[iquote('flip(1294)')] ).
cnf(1301,plain,
equal(inverse(inverse(inverse(inverse(inverse(inverse(inverse(inverse(A)))))))),A),
inference(para,[status(thm),theory(equality)],[1294,1260]),
[iquote('para(1294,1260)')] ).
cnf(1336,plain,
equal(multiply(A,multiply(B,inverse(inverse(inverse(inverse(inverse(B))))))),A),
inference(para,[status(thm),theory(equality)],[1294,1188]),
[iquote('para(1294,1188)')] ).
cnf(1337,plain,
equal(inverse(inverse(inverse(multiply(inverse(A),multiply(B,inverse(B)))))),A),
inference(para,[status(thm),theory(equality)],[1294,1188]),
[iquote('para(1294,1188)')] ).
cnf(1344,plain,
equal(multiply(A,multiply(B,multiply(C,multiply(inverse(C),inverse(inverse(inverse(B))))))),A),
inference(para,[status(thm),theory(equality)],[1295,1336]),
[iquote('para(1295,1336)')] ).
cnf(1345,plain,
equal(multiply(multiply(A,inverse(A)),inverse(inverse(B))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[999]),1344]),
[iquote('back_demod(999),demod([1344])')] ).
cnf(1346,plain,
equal(multiply(A,multiply(inverse(A),multiply(inverse(inverse(B)),multiply(C,inverse(C))))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[773]),1344]),
[iquote('back_demod(773),demod([1344])')] ).
cnf(1356,plain,
equal(multiply(multiply(A,inverse(A)),B),inverse(inverse(inverse(inverse(inverse(inverse(B))))))),
inference(para,[status(thm),theory(equality)],[1301,1345]),
[iquote('para(1301,1345)')] ).
cnf(1357,plain,
equal(inverse(inverse(inverse(inverse(inverse(inverse(A)))))),multiply(multiply(B,inverse(B)),A)),
inference(flip,[status(thm),theory(equality)],[1356]),
[iquote('flip(1356)')] ).
cnf(1362,plain,
equal(inverse(inverse(multiply(A,inverse(A)))),multiply(B,inverse(B))),
inference(para,[status(thm),theory(equality)],[1345,1273]),
[iquote('para(1345,1273)')] ).
cnf(1370,plain,
equal(multiply(A,inverse(A)),inverse(multiply(B,inverse(B)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1362,1345]),1094]),
[iquote('para(1362,1345),demod([1094])')] ).
cnf(1376,plain,
equal(multiply(A,inverse(inverse(multiply(B,inverse(B))))),A),
inference(para,[status(thm),theory(equality)],[1370,1094]),
[iquote('para(1370,1094)')] ).
cnf(1378,plain,
equal(inverse(multiply(A,multiply(B,inverse(B)))),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1167]),1376]),1]),
[iquote('back_demod(1167),demod([1376]),flip(1)')] ).
cnf(1380,plain,
equal(inverse(inverse(inverse(inverse(A)))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1337]),1378]),
[iquote('back_demod(1337),demod([1378])')] ).
cnf(1381,plain,
equal(inverse(inverse(A)),multiply(multiply(B,inverse(B)),A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1357]),1380]),
[iquote('back_demod(1357),demod([1380])')] ).
cnf(1382,plain,
equal(multiply(multiply(A,inverse(A)),B),inverse(inverse(B))),
inference(flip,[status(thm),theory(equality)],[1381]),
[iquote('flip(1381)')] ).
cnf(1387,plain,
equal(multiply(A,multiply(B,inverse(B))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1336]),1380]),
[iquote('back_demod(1336),demod([1380])')] ).
cnf(1388,plain,
equal(multiply(A,multiply(inverse(A),inverse(inverse(B)))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1346]),1387]),
[iquote('back_demod(1346),demod([1387])')] ).
cnf(1390,plain,
equal(inverse(multiply(A,multiply(inverse(A),inverse(B)))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1265]),1380]),
[iquote('back_demod(1265),demod([1380])')] ).
cnf(1391,plain,
equal(multiply(multiply(A,inverse(A)),B),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1158]),1390]),
[iquote('back_demod(1158),demod([1390])')] ).
cnf(1392,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1382]),1391]),1]),
[iquote('back_demod(1382),demod([1391]),flip(1)')] ).
cnf(1393,plain,
equal(multiply(A,multiply(inverse(A),B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1388]),1392]),
[iquote('back_demod(1388),demod([1392])')] ).
cnf(1415,plain,
equal(multiply(inverse(A),A),multiply(B,inverse(B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1106]),1393]),
[iquote('back_demod(1106),demod([1393])')] ).
cnf(1416,plain,
equal(multiply(A,inverse(A)),multiply(inverse(B),B)),
inference(flip,[status(thm),theory(equality)],[1415]),
[iquote('flip(1415)')] ).
cnf(4359,plain,
equal(multiply(inverse(A),A),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[1392,1416]),
[iquote('para(1392,1416)')] ).
cnf(4360,plain,
$false,
inference(conflict,[status(thm)],[4359,2]),
[iquote('conflict(4359,2)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP436-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 22:09:13 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.54/1.93 ----- EQP 0.9e, May 2009 -----
% 1.54/1.93 The job began on n018.cluster.edu, Mon Jun 13 22:09:13 2022
% 1.54/1.93 The command was "./eqp09e".
% 1.54/1.93
% 1.54/1.93 set(prolog_style_variables).
% 1.54/1.93 set(lrpo).
% 1.54/1.93 set(basic_paramod).
% 1.54/1.93 set(functional_subsume).
% 1.54/1.93 set(ordered_paramod).
% 1.54/1.93 set(prime_paramod).
% 1.54/1.93 set(para_pairs).
% 1.54/1.93 assign(pick_given_ratio,4).
% 1.54/1.93 clear(print_kept).
% 1.54/1.93 clear(print_new_demod).
% 1.54/1.93 clear(print_back_demod).
% 1.54/1.93 clear(print_given).
% 1.54/1.93 assign(max_mem,64000).
% 1.54/1.93 end_of_commands.
% 1.54/1.93
% 1.54/1.93 Usable:
% 1.54/1.93 end_of_list.
% 1.54/1.93
% 1.54/1.93 Sos:
% 1.54/1.93 0 (wt=-1) [] multiply(A,inverse(multiply(B,multiply(C,multiply(multiply(inverse(C),inverse(multiply(D,B))),A))))) = D.
% 1.54/1.93 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 1.54/1.93 end_of_list.
% 1.54/1.93
% 1.54/1.93 Demodulators:
% 1.54/1.93 end_of_list.
% 1.54/1.93
% 1.54/1.93 Passive:
% 1.54/1.93 end_of_list.
% 1.54/1.93
% 1.54/1.93 Starting to process input.
% 1.54/1.93
% 1.54/1.93 ** KEPT: 1 (wt=18) [] multiply(A,inverse(multiply(B,multiply(C,multiply(multiply(inverse(C),inverse(multiply(D,B))),A))))) = D.
% 1.54/1.93 1 is a new demodulator.
% 1.54/1.93
% 1.54/1.93 ** KEPT: 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 1.54/1.93 ---------------- PROOF FOUND ----------------
% 1.54/1.93 % SZS status Unsatisfiable
% 1.54/1.93
% 1.54/1.93
% 1.54/1.93 After processing input:
% 1.54/1.93
% 1.54/1.93 Usable:
% 1.54/1.93 end_of_list.
% 1.54/1.93
% 1.54/1.93 Sos:
% 1.54/1.93 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 1.54/1.93 1 (wt=18) [] multiply(A,inverse(multiply(B,multiply(C,multiply(multiply(inverse(C),inverse(multiply(D,B))),A))))) = D.
% 1.54/1.93 end_of_list.
% 1.54/1.93
% 1.54/1.93 Demodulators:
% 1.54/1.93 1 (wt=18) [] multiply(A,inverse(multiply(B,multiply(C,multiply(multiply(inverse(C),inverse(multiply(D,B))),A))))) = D.
% 1.54/1.93 end_of_list.
% 1.54/1.93
% 1.54/1.93 Passive:
% 1.54/1.93 end_of_list.
% 1.54/1.93
% 1.54/1.93 UNIT CONFLICT from 4359 and 2 at 0.74 seconds.
% 1.54/1.93
% 1.54/1.93 ---------------- PROOF ----------------
% 1.54/1.93 % SZS output start Refutation
% See solution above
% 1.54/1.93 ------------ end of proof -------------
% 1.54/1.93
% 1.54/1.93
% 1.54/1.93 ------------- memory usage ------------
% 1.54/1.93 Memory dynamically allocated (tp_alloc): 16601.
% 1.54/1.93 type (bytes each) gets frees in use avail bytes
% 1.54/1.93 sym_ent ( 96) 56 0 56 0 5.2 K
% 1.54/1.93 term ( 16) 652534 446584 205950 82 4007.0 K
% 1.54/1.93 gen_ptr ( 8) 1740577 392701 1347876 936 10537.6 K
% 1.54/1.93 context ( 808) 291788 291786 2 12 11.0 K
% 1.54/1.93 trail ( 12) 162551 162551 0 18 0.2 K
% 1.54/1.93 bt_node ( 68) 21503 21501 2 47 3.3 K
% 1.54/1.93 ac_position (285432) 0 0 0 0 0.0 K
% 1.54/1.93 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.54/1.93 ac_match_free_vars_pos (4020)
% 1.54/1.93 0 0 0 0 0.0 K
% 1.54/1.93 discrim ( 12) 183229 183135 94 47314 555.6 K
% 1.54/1.93 flat ( 40) 1996809 1996809 0 95 3.7 K
% 1.54/1.93 discrim_pos ( 12) 33075 33075 0 1 0.0 K
% 1.54/1.93 fpa_head ( 12) 10619 0 10619 0 124.4 K
% 1.54/1.93 fpa_tree ( 28) 40690 40690 0 29 0.8 K
% 1.54/1.93 fpa_pos ( 36) 7650 7650 0 1 0.0 K
% 1.54/1.93 literal ( 12) 12268 7909 4359 1 51.1 K
% 1.54/1.93 clause ( 24) 12268 7909 4359 1 102.2 K
% 1.54/1.93 list ( 12) 3350 3294 56 26 1.0 K
% 1.54/1.93 list_pos ( 20) 28877 24490 4387 5997 202.8 K
% 1.54/1.93 pair_index ( 40) 2 0 2 0 0.1 K
% 1.54/1.93
% 1.54/1.93 -------------- statistics -------------
% 1.54/1.93 Clauses input 2
% 1.54/1.93 Usable input 0
% 1.54/1.93 Sos input 2
% 1.54/1.93 Demodulators input 0
% 1.54/1.93 Passive input 0
% 1.54/1.93
% 1.54/1.93 Processed BS (before search) 2
% 1.54/1.93 Forward subsumed BS 0
% 1.54/1.93 Kept BS 2
% 1.54/1.93 New demodulators BS 1
% 1.54/1.93 Back demodulated BS 0
% 1.54/1.93
% 1.54/1.93 Clauses or pairs given 1443
% 1.54/1.93 Clauses generated 6827
% 1.54/1.93 Forward subsumed 2470
% 1.54/1.93 Deleted by weight 0
% 1.54/1.93 Deleted by variable count 0
% 1.54/1.93 Kept 4357
% 1.54/1.93 New demodulators 3290
% 1.54/1.93 Back demodulated 4347
% 1.54/1.93 Ordered paramod prunes 0
% 1.54/1.93 Basic paramod prunes 13724
% 1.54/1.93 Prime paramod prunes 3
% 1.54/1.93 Semantic prunes 0
% 1.54/1.94
% 1.54/1.94 Rewrite attmepts 243335
% 1.54/1.94 Rewrites 32012
% 1.54/1.94
% 1.54/1.94 FPA overloads 0
% 1.54/1.94 FPA underloads 0
% 1.54/1.94
% 1.54/1.94 Usable size 0
% 1.54/1.94 Sos size 11
% 1.54/1.94 Demodulators size 7
% 1.54/1.94 Passive size 0
% 1.54/1.94 Disabled size 4347
% 1.54/1.94
% 1.54/1.94 Proofs found 1
% 1.54/1.94
% 1.54/1.94 ----------- times (seconds) ----------- Mon Jun 13 22:09:14 2022
% 1.54/1.94
% 1.54/1.94 user CPU time 0.74 (0 hr, 0 min, 0 sec)
% 1.54/1.94 system CPU time 0.10 (0 hr, 0 min, 0 sec)
% 1.54/1.94 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.54/1.94 input time 0.00
% 1.54/1.94 paramodulation time 0.02
% 1.54/1.94 demodulation time 0.11
% 1.54/1.94 orient time 0.03
% 1.54/1.94 weigh time 0.01
% 1.54/1.94 forward subsume time 0.02
% 1.54/1.94 back demod find time 0.13
% 1.54/1.94 conflict time 0.01
% 1.54/1.94 LRPO time 0.01
% 1.54/1.94 store clause time 0.27
% 1.54/1.94 disable clause time 0.09
% 1.54/1.94 prime paramod time 0.01
% 1.54/1.94 semantics time 0.00
% 1.54/1.94
% 1.54/1.94 EQP interrupted
%------------------------------------------------------------------------------