TSTP Solution File: GRP480-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP480-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n026.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 11:39:04 EDT 2022
% Result : Unsatisfiable 1.56s 1.76s
% Output : Refutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of clauses : 99 ( 99 unt; 0 nHn; 3 RR)
% Number of literals : 99 ( 98 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 14 ( 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 : 502 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(inverse(divide(divide(divide(X,X),Y),divide(Z,divide(Y,U)))),U) = Z,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,inverse(Y)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(4,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference('REWRITE',[status(thm)],[prove_these_axioms_3,multiply,theory(equality)]) ).
cnf(5,plain,
divide(inverse(divide(divide(divide(X,X),Y),Z)),U) = inverse(divide(divide(divide(V,V),W),divide(Z,divide(W,divide(Y,U))))),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(7,plain,
divide(divide(inverse(divide(divide(divide(X,X),Y),Z)),U),divide(Y,U)) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(8,plain,
inverse(divide(divide(divide(X,X),Y),divide(divide(Z,divide(U,V)),divide(Y,divide(U,V))))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(15,plain,
divide(inverse(divide(divide(divide(X,X),Y),inverse(divide(divide(divide(Z,Z),U),divide(V,divide(U,divide(W,divide(Y,X1)))))))),X1) = inverse(divide(divide(divide(Y1,Y1),W),V)),
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(21,plain,
divide(inverse(divide(divide(inverse(divide(divide(divide(X,X),Y),divide(Z,divide(Y,divide(U,inverse(divide(divide(divide(V,V),U),Z))))))),W),X1)),Y1) = inverse(divide(divide(divide(Z1,Z1),U1),divide(X1,divide(U1,divide(W,Y1))))),
inference('PARAMODULATE',[status(thm)],[5,5,theory(equality)]) ).
cnf(22,plain,
divide(divide(inverse(divide(X,Y)),Z),divide(divide(U,inverse(divide(divide(divide(V,V),U),X))),Z)) = Y,
inference('PARAMODULATE',[status(thm)],[7,7,theory(equality)]) ).
cnf(29,plain,
inverse(divide(divide(divide(X,X),Y),Z)) = inverse(divide(divide(divide(U,U),Y),Z)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[5,7,theory(equality)]),single_axiom,theory(equality)]) ).
cnf(37,plain,
inverse(divide(divide(divide(X,X),Y),divide(divide(Z,U),divide(Y,U)))) = Z,
inference('PARAMODULATE',[status(thm)],[8,single_axiom,theory(equality)]) ).
cnf(38,plain,
divide(divide(X,Y),divide(Z,Y)) = divide(divide(X,U),divide(Z,U)),
inference('PARAMODULATE',[status(thm)],[7,37,theory(equality)]) ).
cnf(48,plain,
inverse(divide(divide(divide(X,Y),divide(Z,Y)),U)) = inverse(divide(divide(divide(V,V),divide(Z,X)),U)),
inference('PARAMODULATE',[status(thm)],[29,38,theory(equality)]) ).
cnf(49,plain,
inverse(divide(divide(divide(X,X),Y),divide(Z,Y))) = inverse(divide(divide(divide(U,U),V),divide(Z,V))),
inference('PARAMODULATE',[status(thm)],[29,38,theory(equality)]) ).
cnf(50,plain,
divide(divide(inverse(divide(divide(divide(X,Y),divide(Z,Y)),U)),V),divide(divide(Z,X),V)) = U,
inference('PARAMODULATE',[status(thm)],[7,38,theory(equality)]) ).
cnf(52,plain,
divide(divide(inverse(divide(divide(divide(X,X),Y),divide(Z,Y))),U),divide(V,U)) = divide(Z,V),
inference('PARAMODULATE',[status(thm)],[7,38,theory(equality)]) ).
cnf(53,plain,
divide(divide(divide(X,Y),divide(Z,Y)),divide(U,divide(Z,V))) = divide(divide(divide(X,V),W),divide(U,W)),
inference('PARAMODULATE',[status(thm)],[38,38,theory(equality)]) ).
cnf(54,plain,
divide(divide(X,Y),divide(divide(Z,U),Y)) = divide(divide(X,divide(V,U)),divide(divide(Z,W),divide(V,W))),
inference('PARAMODULATE',[status(thm)],[38,38,theory(equality)]) ).
cnf(153,plain,
divide(X,divide(Y,inverse(divide(divide(divide(Z,Z),Y),divide(divide(U,U),V))))) = divide(X,V),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[22,49,theory(equality)]),52,theory(equality)]) ).
cnf(268,plain,
divide(divide(inverse(divide(divide(divide(X,X),divide(Y,Z)),divide(divide(U,V),divide(Y,V)))),W),divide(X1,W)) = divide(divide(U,Z),X1),
inference('PARAMODULATE',[status(thm)],[52,38,theory(equality)]) ).
cnf(380,plain,
divide(divide(divide(X,Y),divide(inverse(divide(divide(divide(Z,Z),U),divide(V,divide(U,W)))),Y)),divide(X1,V)) = divide(divide(divide(X,W),Y1),divide(X1,Y1)),
inference('PARAMODULATE',[status(thm)],[53,single_axiom,theory(equality)]) ).
cnf(386,plain,
divide(divide(X,Y),divide(Z,divide(Y,U))) = divide(divide(X,V),divide(Z,divide(V,U))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[53,52,theory(equality)]),52,theory(equality)]) ).
cnf(407,plain,
divide(divide(divide(X,Y),divide(Z,Y)),U) = divide(divide(divide(X,V),divide(Z,V)),U),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[52,53,theory(equality)]),268,theory(equality)]) ).
cnf(502,plain,
divide(divide(X,inverse(divide(divide(divide(Y,Y),Z),divide(U,divide(Z,V))))),divide(W,U)) = divide(divide(X,X1),divide(W,divide(X1,V))),
inference('PARAMODULATE',[status(thm)],[386,single_axiom,theory(equality)]) ).
cnf(512,plain,
divide(divide(X,Y),divide(divide(divide(Z,U),divide(V,U)),divide(Y,divide(V,W)))) = divide(divide(X,X1),divide(divide(divide(Z,W),Y1),divide(X1,Y1))),
inference('PARAMODULATE',[status(thm)],[386,53,theory(equality)]) ).
cnf(584,plain,
divide(X,divide(divide(Y,Z),divide(U,Z))) = divide(X,divide(divide(Y,V),divide(U,V))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[52,407,theory(equality)]),52,theory(equality)]) ).
cnf(724,plain,
divide(divide(X,divide(Y,Z)),divide(U,Y)) = divide(divide(X,divide(V,Z)),divide(U,V)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[54,52,theory(equality)]),52,theory(equality)]) ).
cnf(763,plain,
divide(inverse(divide(divide(divide(X,X),divide(Y,Z)),divide(divide(U,V),divide(Y,V)))),W) = inverse(divide(divide(divide(X1,X1),Y1),divide(divide(divide(U,Z),Z1),divide(Y1,divide(Z1,W))))),
inference('PARAMODULATE',[status(thm)],[5,54,theory(equality)]) ).
cnf(779,plain,
divide(inverse(divide(divide(divide(X,X),divide(Y,Z)),U)),V) = inverse(divide(divide(divide(W,W),divide(X1,V)),divide(U,divide(divide(X1,divide(Y1,Z)),divide(divide(Y,Z1),divide(Y1,Z1)))))),
inference('PARAMODULATE',[status(thm)],[5,54,theory(equality)]) ).
cnf(783,plain,
divide(divide(inverse(divide(divide(divide(X,X),divide(divide(Y,Z),U)),divide(divide(V,divide(W,Z)),divide(divide(Y,X1),divide(W,X1))))),Y1),divide(Z1,Y1)) = divide(divide(V,U),Z1),
inference('PARAMODULATE',[status(thm)],[52,54,theory(equality)]) ).
cnf(845,plain,
divide(divide(X,Y),divide(divide(Z,divide(divide(U,V),W)),Y)) = divide(divide(X,X1),divide(divide(Z,Y1),divide(divide(inverse(divide(divide(divide(V,Z1),divide(U,Z1)),X1)),W),Y1))),
inference('PARAMODULATE',[status(thm)],[54,50,theory(equality)]) ).
cnf(885,plain,
divide(divide(X,Y),divide(divide(Z,divide(U,V)),Y)) = divide(divide(X,divide(W,U)),divide(divide(Z,divide(X1,V)),divide(W,X1))),
inference('PARAMODULATE',[status(thm)],[38,724,theory(equality)]) ).
cnf(888,plain,
divide(X,divide(Y,Z)) = divide(divide(divide(inverse(divide(divide(divide(U,U),Z),X)),V),divide(W,V)),divide(Y,W)),
inference('PARAMODULATE',[status(thm)],[724,7,theory(equality)]) ).
cnf(927,plain,
divide(X,divide(Y,divide(Z,inverse(divide(divide(divide(U,U),Z),V))))) = divide(divide(divide(inverse(divide(V,X)),W),divide(X1,W)),divide(Y,X1)),
inference('PARAMODULATE',[status(thm)],[724,22,theory(equality)]) ).
cnf(1050,plain,
X = divide(Y,inverse(divide(divide(divide(Z,Z),Y),divide(divide(U,U),X)))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[7,153,theory(equality)]),7,theory(equality)]) ).
cnf(1051,plain,
X = divide(X,inverse(divide(divide(divide(Y,Y),Z),divide(divide(U,U),Z)))),
inference('PARAMODULATE',[status(thm)],[1050,38,theory(equality)]) ).
cnf(1053,plain,
divide(X,Y) = divide(Z,inverse(divide(divide(divide(U,U),Z),divide(divide(Y,V),divide(X,V))))),
inference('PARAMODULATE',[status(thm)],[1050,38,theory(equality)]) ).
cnf(1054,plain,
divide(X,Y) = divide(divide(X,Z),inverse(divide(divide(divide(Z,Y),U),divide(divide(V,V),U)))),
inference('PARAMODULATE',[status(thm)],[1050,53,theory(equality)]) ).
cnf(1057,plain,
divide(X,Y) = divide(divide(X,Z),inverse(divide(divide(divide(U,U),V),divide(divide(Y,Z),V)))),
inference('PARAMODULATE',[status(thm)],[1050,54,theory(equality)]) ).
cnf(1063,plain,
divide(divide(inverse(X),Y),divide(Z,Y)) = inverse(divide(divide(divide(U,U),divide(divide(V,V),Z)),divide(divide(W,W),X))),
inference('PARAMODULATE',[status(thm)],[7,1050,theory(equality)]) ).
cnf(1064,plain,
divide(X,divide(Y,inverse(divide(divide(divide(Z,Z),U),divide(divide(V,V),X))))) = divide(divide(U,W),divide(Y,W)),
inference('PARAMODULATE',[status(thm)],[38,1050,theory(equality)]) ).
cnf(1065,plain,
X = divide(inverse(divide(divide(divide(Y,Y),divide(Z,Z)),divide(divide(U,U),V))),inverse(divide(V,divide(divide(W,W),X)))),
inference('PARAMODULATE',[status(thm)],[1050,1050,theory(equality)]) ).
cnf(1071,plain,
divide(X,divide(Y,Z)) = divide(U,inverse(divide(divide(divide(V,V),U),divide(divide(Y,W),divide(X,divide(W,Z)))))),
inference('PARAMODULATE',[status(thm)],[1050,386,theory(equality)]) ).
cnf(1078,plain,
inverse(divide(X,Y)) = inverse(divide(divide(divide(Z,Z),inverse(divide(divide(divide(U,U),divide(V,V)),divide(divide(W,W),X)))),Y)),
inference('PARAMODULATE',[status(thm)],[29,1050,theory(equality)]) ).
cnf(1080,plain,
inverse(divide(divide(divide(X,X),Y),divide(Z,divide(Y,inverse(divide(divide(divide(U,U),V),divide(divide(W,W),Z))))))) = V,
inference('PARAMODULATE',[status(thm)],[37,1050,theory(equality)]) ).
cnf(1083,plain,
divide(X,divide(Y,inverse(divide(divide(divide(Z,Z),inverse(divide(divide(divide(U,U),Y),V))),divide(divide(W,W),X))))) = V,
inference('PARAMODULATE',[status(thm)],[7,1050,theory(equality)]) ).
cnf(1093,plain,
divide(divide(X,divide(Y,inverse(divide(divide(divide(Z,Z),U),divide(divide(V,V),X))))),W) = divide(divide(divide(U,X1),divide(Y,X1)),W),
inference('PARAMODULATE',[status(thm)],[407,1050,theory(equality)]) ).
cnf(1095,plain,
divide(X,divide(Y,divide(Z,inverse(divide(divide(divide(U,U),V),divide(divide(W,W),Y)))))) = divide(X,divide(divide(V,X1),divide(Z,X1))),
inference('PARAMODULATE',[status(thm)],[584,1050,theory(equality)]) ).
cnf(1116,plain,
inverse(divide(divide(X,divide(Y,inverse(divide(divide(divide(Z,Z),U),divide(divide(V,V),X))))),W)) = inverse(divide(divide(divide(X1,X1),divide(Y,U)),W)),
inference('PARAMODULATE',[status(thm)],[48,1050,theory(equality)]) ).
cnf(1125,plain,
divide(inverse(divide(divide(divide(X,X),Y),Z)),inverse(divide(divide(divide(U,U),Y),divide(divide(V,V),W)))) = inverse(divide(divide(divide(X1,X1),Y1),divide(Z,divide(Y1,W)))),
inference('PARAMODULATE',[status(thm)],[5,1050,theory(equality)]) ).
cnf(1136,plain,
divide(divide(X,Y),divide(divide(Z,inverse(divide(divide(divide(U,U),V),divide(divide(W,W),X1)))),Y)) = divide(divide(X,X1),divide(divide(Z,Y1),divide(V,Y1))),
inference('PARAMODULATE',[status(thm)],[54,1050,theory(equality)]) ).
cnf(1146,plain,
inverse(divide(divide(divide(X,X),Y),divide(Z,Y))) = Z,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[single_axiom,1051,theory(equality)]),1051,theory(equality)]) ).
cnf(1147,plain,
divide(X,Y) = divide(divide(X,Z),divide(Y,Z)),
inference('REWRITE',[status(thm)],[1057,1146,theory(equality)]) ).
cnf(1158,plain,
divide(X,divide(Y,divide(Z,inverse(divide(divide(divide(U,U),V),divide(divide(W,W),Y)))))) = divide(X,divide(V,Z)),
inference('REWRITE',[status(thm)],[1095,1147,theory(equality)]) ).
cnf(1159,plain,
inverse(divide(divide(X,X),Y)) = Y,
inference('REWRITE',[status(thm)],[1080,1147,1158,theory(equality)]) ).
cnf(1160,plain,
divide(divide(X,divide(Y,inverse(divide(divide(divide(Z,Z),U),divide(divide(V,V),X))))),W) = divide(divide(U,Y),W),
inference('REWRITE',[status(thm)],[1093,1147,theory(equality)]) ).
cnf(1163,plain,
inverse(divide(divide(X,Y),Z)) = inverse(divide(divide(divide(U,U),divide(Y,X)),Z)),
inference('REWRITE',[status(thm)],[1116,1160,theory(equality)]) ).
cnf(1188,plain,
inverse(divide(X,Y)) = inverse(divide(divide(X,divide(Z,Z)),Y)),
inference('REWRITE',[status(thm)],[1078,1159,1163,theory(equality)]) ).
cnf(1192,plain,
X = divide(divide(divide(Y,Y),Z),inverse(divide(Z,divide(divide(U,U),X)))),
inference('REWRITE',[status(thm)],[1065,1159,1163,theory(equality)]) ).
cnf(1221,plain,
divide(X,divide(Y,inverse(divide(divide(divide(Z,Z),U),divide(divide(V,V),X))))) = divide(U,Y),
inference('REWRITE',[status(thm)],[1064,1147,theory(equality)]) ).
cnf(1223,plain,
divide(inverse(divide(divide(divide(X,X),Y),Z)),Y) = Z,
inference('REWRITE',[status(thm)],[1083,1221,theory(equality)]) ).
cnf(1224,plain,
divide(inverse(X),Y) = inverse(divide(Y,divide(divide(Z,Z),X))),
inference('REWRITE',[status(thm)],[1063,1188,1163,1147,theory(equality)]) ).
cnf(1225,plain,
X = divide(divide(Y,Y),inverse(X)),
inference('REWRITE',[status(thm)],[1192,1147,1224,theory(equality)]) ).
cnf(1250,plain,
divide(X,divide(Y,divide(inverse(X),divide(divide(Z,Z),U)))) = divide(U,Y),
inference('REWRITE',[status(thm)],[1221,1224,theory(equality)]) ).
cnf(1257,plain,
divide(inverse(divide(divide(divide(X,X),Y),Z)),divide(inverse(U),divide(divide(V,V),Y))) = inverse(divide(divide(divide(W,W),X1),divide(Z,divide(X1,U)))),
inference('REWRITE',[status(thm)],[1125,1224,theory(equality)]) ).
cnf(1262,plain,
divide(X,Y) = divide(divide(X,Z),inverse(divide(divide(Z,Y),divide(U,U)))),
inference('REWRITE',[status(thm)],[1054,1147,theory(equality)]) ).
cnf(1263,plain,
divide(X,Y) = divide(Z,inverse(divide(divide(divide(U,U),Z),divide(Y,X)))),
inference('REWRITE',[status(thm)],[1053,1147,theory(equality)]) ).
cnf(1264,plain,
divide(X,divide(Y,Z)) = divide(divide(X,divide(U,Z)),divide(Y,U)),
inference('REWRITE',[status(thm)],[1071,1263,theory(equality)]) ).
cnf(1276,plain,
divide(X,divide(Y,divide(Z,inverse(divide(divide(divide(U,U),Z),V))))) = divide(inverse(divide(V,X)),Y),
inference('REWRITE',[status(thm)],[927,1147,theory(equality)]) ).
cnf(1281,plain,
divide(inverse(divide(divide(inverse(divide(X,X)),Y),Z)),U) = inverse(divide(divide(divide(V,V),W),divide(Z,divide(W,divide(Y,U))))),
inference('REWRITE',[status(thm)],[21,1225,1147,1276,theory(equality)]) ).
cnf(1286,plain,
divide(X,divide(Y,Z)) = divide(inverse(divide(divide(divide(U,U),Z),X)),Y),
inference('REWRITE',[status(thm)],[888,1147,theory(equality)]) ).
cnf(1287,plain,
divide(X,divide(Y,Y)) = X,
inference('REWRITE',[status(thm)],[1223,1286,theory(equality)]) ).
cnf(1288,plain,
divide(X,Y) = divide(divide(X,Z),inverse(divide(Z,Y))),
inference('REWRITE',[status(thm)],[1262,1287,theory(equality)]) ).
cnf(1291,plain,
divide(X,divide(divide(Y,Z),divide(U,divide(Z,Y)))) = inverse(divide(divide(divide(V,V),U),X)),
inference('REWRITE',[status(thm)],[15,1264,1286,theory(equality)]) ).
cnf(1302,plain,
divide(X,divide(Y,divide(divide(Z,U),V))) = divide(divide(X,W),divide(Y,divide(inverse(divide(divide(U,Z),W)),V))),
inference('REWRITE',[status(thm)],[845,1147,theory(equality)]) ).
cnf(1308,plain,
divide(inverse(divide(divide(X,Y),Z)),U) = inverse(divide(divide(U,V),divide(Z,divide(divide(V,divide(W,X)),divide(Y,W))))),
inference('REWRITE',[status(thm)],[779,1163,1147,theory(equality)]) ).
cnf(1328,plain,
divide(inverse(divide(divide(X,divide(Y,Z)),divide(divide(U,divide(V,Z)),divide(Y,V)))),W) = divide(divide(U,X),W),
inference('REWRITE',[status(thm)],[783,1163,1147,theory(equality)]) ).
cnf(1343,plain,
divide(X,divide(Y,divide(Z,U))) = divide(divide(X,divide(V,Z)),divide(divide(Y,divide(W,U)),divide(V,W))),
inference('REWRITE',[status(thm)],[885,1147,theory(equality)]) ).
cnf(1344,plain,
divide(inverse(divide(X,Y)),Z) = divide(divide(Y,X),Z),
inference('REWRITE',[status(thm)],[1328,1287,1343,theory(equality)]) ).
cnf(1389,plain,
divide(divide(X,divide(Y,Z)),U) = inverse(divide(divide(U,V),divide(X,divide(divide(V,divide(W,Y)),divide(Z,W))))),
inference('REWRITE',[status(thm)],[1308,1344,theory(equality)]) ).
cnf(1393,plain,
divide(X,divide(Y,divide(divide(Z,U),V))) = divide(divide(X,W),divide(Y,divide(divide(W,divide(U,Z)),V))),
inference('REWRITE',[status(thm)],[1302,1344,theory(equality)]) ).
cnf(1394,plain,
divide(divide(X,divide(Y,Z)),U) = inverse(divide(U,divide(X,divide(Y,Z)))),
inference('REWRITE',[status(thm)],[1389,1147,1393,theory(equality)]) ).
cnf(1418,plain,
divide(divide(X,divide(divide(Y,divide(Z,U)),divide(divide(V,V),Z))),divide(W,Y)) = divide(divide(X,X1),divide(W,divide(X1,U))),
inference('REWRITE',[status(thm)],[502,1394,theory(equality)]) ).
cnf(1423,plain,
divide(divide(X,divide(divide(Y,Y),Z)),U) = divide(divide(X,divide(V,divide(Z,U))),divide(divide(W,W),V)),
inference('REWRITE',[status(thm)],[1281,1394,1344,theory(equality)]) ).
cnf(1429,plain,
divide(divide(X,divide(divide(Y,Y),Z)),divide(inverse(U),divide(divide(V,V),Z))) = divide(divide(X,divide(W,U)),divide(divide(X1,X1),W)),
inference('REWRITE',[status(thm)],[1257,1394,1344,theory(equality)]) ).
cnf(1542,plain,
divide(X,divide(Y,divide(inverse(Z),divide(divide(U,U),V)))) = divide(divide(X,Z),divide(Y,V)),
inference('REWRITE',[status(thm)],[1136,1224,1147,theory(equality)]) ).
cnf(1543,plain,
divide(divide(X,X),divide(Y,Z)) = divide(Z,Y),
inference('REWRITE',[status(thm)],[1250,1542,theory(equality)]) ).
cnf(1618,plain,
divide(divide(X,divide(divide(Y,divide(Z,U)),divide(divide(V,V),Z))),divide(W,Y)) = divide(divide(X,U),W),
inference('REWRITE',[status(thm)],[380,1394,1147,theory(equality)]) ).
cnf(1619,plain,
divide(divide(X,Y),Z) = divide(divide(X,U),divide(Z,divide(U,Y))),
inference('REWRITE',[status(thm)],[1418,1618,theory(equality)]) ).
cnf(1620,plain,
divide(X,divide(divide(Y,Y),Z)) = inverse(divide(divide(divide(U,U),Z),X)),
inference('REWRITE',[status(thm)],[1291,1619,theory(equality)]) ).
cnf(1715,plain,
divide(divide(X,Y),divide(divide(Z,U),divide(Y,divide(U,V)))) = divide(X,divide(Z,V)),
inference('REWRITE',[status(thm)],[512,1147,theory(equality)]) ).
cnf(1766,plain,
divide(divide(X,Y),Z) = inverse(divide(Z,divide(X,Y))),
inference('REWRITE',[status(thm)],[763,1715,1344,1543,1147,theory(equality)]) ).
cnf(1773,plain,
divide(inverse(X),Y) = divide(divide(divide(Z,Z),X),Y),
inference('REWRITE',[status(thm)],[1224,1766,theory(equality)]) ).
cnf(1788,plain,
divide(X,divide(divide(Y,Y),Z)) = inverse(divide(inverse(Z),X)),
inference('REWRITE',[status(thm)],[1620,1773,theory(equality)]) ).
cnf(1851,plain,
divide(divide(X,inverse(Y)),Z) = divide(divide(X,divide(U,divide(Y,Z))),inverse(U)),
inference('REWRITE',[status(thm)],[1423,1766,1344,1788,theory(equality)]) ).
cnf(1874,plain,
divide(X,inverse(Y)) = divide(divide(X,divide(Z,Y)),inverse(Z)),
inference('REWRITE',[status(thm)],[1429,1766,1288,1344,1788,theory(equality)]) ).
cnf(1875,plain,
divide(divide(X,inverse(Y)),Z) = divide(X,inverse(divide(Y,Z))),
inference('REWRITE',[status(thm)],[1851,1874,theory(equality)]) ).
cnf(1876,plain,
$false,
inference('REWRITE',[status(thm)],[4,1875,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP480-1 : TPTP v8.1.0. Released v2.6.0.
% 0.13/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 13:02:36 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.49 #<PACKAGE "SNARK-USER">
% 0.20/0.49 *
% 0.20/0.49 SNARK-TPTP-OPTIONS
% 0.20/0.49 *
% 0.20/0.49 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49 (USE-FACTORING :POS)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49 *
% 0.20/0.49 "."
% 0.20/0.49 *
% 0.20/0.49 ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T13:02:36
% 0.20/0.49 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-06-14T13:02:36
% 1.56/1.76
% 1.56/1.76
% 1.56/1.76 #||
% 1.56/1.76 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.56/1.76 % SZS output start Refutation
% See solution above
% 1.56/1.77 ||#
% 1.56/1.77
% 1.56/1.77 ; Summary of computation:
% 1.56/1.77 ; 5161 formulas have been input or derived (from 28 formulas).
% 1.56/1.77 ; 1876 (36%) were retained. Of these,
% 1.56/1.77 ; 1637 (87%) were simplified or subsumed later,
% 1.56/1.77 ; 239 (13%) are still being kept.
% 1.56/1.77 ;
% 1.56/1.77 ; Run time in seconds excluding printing time:
% 1.56/1.77 ; 0.002 0% Read assertion file (1 call)
% 1.56/1.77 ; 0.000 0% Assert (3 calls)
% 1.56/1.77 ; 0.338 27% Process new row (4,379 calls)
% 1.56/1.77 ; 0.005 0% Resolution (54 calls)
% 1.56/1.77 ; 0.096 8% Paramodulation (27 calls)
% 1.56/1.77 ; 0.390 31% Forward simplification (4,175 calls)
% 1.56/1.77 ; 0.281 22% Backward simplification (1,875 calls)
% 1.56/1.77 ; 0.120 9% Ordering (19,022 calls)
% 1.56/1.77 ; 0.000 0% Sortal reasoning (32 calls)
% 1.56/1.77 ; 0.000 0% Purity testing (1 call)
% 1.56/1.77 ; 0.037 3% Other
% 1.56/1.77 ; 1.269 Total
% 1.56/1.77 ; 1.284 Real time
% 1.56/1.77 ;
% 1.56/1.77 ; Term-hash-array has 9,372 terms in all.
% 1.56/1.77 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.56/1.77 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.56/1.77 ; Path-index has 1,125 entries (6,434 at peak, 9,947 added, 8,822 deleted).
% 1.56/1.77 ; Path-index has 6,380 nodes (8,014 at peak, 10,056 added, 3,676 deleted).
% 1.56/1.77 ; Trie-index has 1,125 entries (6,434 at peak, 9,947 added, 8,822 deleted).
% 1.56/1.77 ; Trie-index has 4,507 nodes (34,699 at peak, 50,454 added, 45,947 deleted).
% 1.56/1.77 ; Retrieved 25,260 generalization terms in 45,319 calls.
% 1.56/1.77 ; Retrieved 21,006 instance terms in 2,192 calls.
% 1.56/1.77 ; Retrieved 34,963 unifiable terms in 306 calls.
% 1.56/1.77 ;
% 1.56/1.77 ; The agenda of backward simplifiable rows to process has 589 entries:
% 1.56/1.77 ; 589 with value 0
% 1.56/1.77 ; The agenda of rows to process has 172 entries:
% 1.56/1.77 ; 19 with value 40 32 with value 45 1 with value 50
% 1.56/1.77 ; 7 with value 41 7 with value 46 2 with value 51
% 1.56/1.77 ; 3 with value 42 18 with value 47 2 with value 52
% 1.56/1.77 ; 19 with value 43 22 with value 48 2 with value 53
% 1.56/1.77 ; 20 with value 44 16 with value 49 2 with value 57
% 1.56/1.77 ; The agenda of rows to give has 235 entries:
% 1.56/1.77 ; 1 with value (4 18) 5 with value (4 28) 9 with value (4 37)
% 1.56/1.77 ; 4 with value (4 19) 3 with value (4 29) 14 with value (4 38)
% 1.56/1.77 ; 2 with value (4 20) 14 with value (4 30) 25 with value (4 39)
% 1.56/1.77 ; 7 with value (4 22) 8 with value (4 31) 20 with value (4 40)
% 1.56/1.77 ; 1 with value (4 23) 7 with value (4 32) 13 with value (4 41)
% 1.56/1.77 ; 4 with value (4 24) 4 with value (4 33) 1 with value (4 42)
% 1.56/1.77 ; 4 with value (4 25) 16 with value (4 34) 11 with value (4 43)
% 1.56/1.77 ; 3 with value (4 26) 14 with value (4 35) 19 with value (4 44)
% 1.56/1.77 ; 3 with value (4 27) 19 with value (4 36) 4 with value (4 45)
% 1.56/1.77 Evaluation took:
% 1.56/1.77 1.286 seconds of real time
% 1.56/1.77 1.205164 seconds of user run time
% 1.56/1.77 0.08054 seconds of system run time
% 1.56/1.77 [Run times include 0.125 seconds GC run time.]
% 1.56/1.77 0 calls to %EVAL
% 1.56/1.77 0 page faults and
% 1.56/1.77 102,979,112 bytes consed.
% 1.56/1.77 :PROOF-FOUND
% 1.56/1.77 ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-14T13:02:38
% 1.56/1.77 :PROOF-FOUND
% 1.56/1.77 *
%------------------------------------------------------------------------------