TSTP Solution File: GRP471-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : GRP471-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% 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 : 600s
% DateTime : Sat Jul 16 11:39:01 EDT 2022
% Result : Unsatisfiable 1.77s 1.97s
% Output : Refutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 37
% Number of leaves : 3
% Syntax : Number of clauses : 106 ( 106 unt; 0 nHn; 4 RR)
% Number of literals : 106 ( 105 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 13 ( 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 : 482 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(inverse(divide(X,divide(Y,divide(Z,U)))),divide(divide(U,Z),X)) = Y,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(multiply,axiom,
multiply(X,Y) = divide(X,inverse(Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/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(X,Y)),divide(divide(Z,divide(U,V)),X)) = inverse(divide(Z,divide(Y,divide(V,U)))),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(6,plain,
divide(inverse(X),divide(divide(Y,Z),inverse(divide(divide(Z,Y),divide(X,divide(U,V)))))) = divide(V,U),
inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).
cnf(9,plain,
inverse(divide(X,divide(divide(Y,divide(divide(Z,U),X)),divide(U,Z)))) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(10,plain,
divide(divide(inverse(divide(X,Y)),divide(divide(Z,divide(U,V)),X)),divide(divide(U,V),Z)) = Y,
inference('PARAMODULATE',[status(thm)],[single_axiom,5,theory(equality)]) ).
cnf(13,plain,
divide(inverse(divide(X,Y)),divide(Z,X)) = inverse(divide(inverse(divide(U,divide(Z,divide(V,W)))),divide(Y,divide(U,divide(W,V))))),
inference('PARAMODULATE',[status(thm)],[5,single_axiom,theory(equality)]) ).
cnf(18,plain,
divide(inverse(divide(X,divide(Y,divide(Z,U)))),divide(divide(inverse(divide(divide(V,W),X1)),divide(W,V)),X)) = inverse(inverse(divide(Y,divide(X1,divide(U,Z))))),
inference('PARAMODULATE',[status(thm)],[5,5,theory(equality)]) ).
cnf(27,plain,
inverse(inverse(divide(X,divide(Y,divide(inverse(divide(divide(Z,U),Y)),divide(U,Z)))))) = X,
inference('PARAMODULATE',[status(thm)],[9,5,theory(equality)]) ).
cnf(33,plain,
divide(divide(inverse(divide(X,Y)),divide(divide(Z,U),X)),divide(U,Z)) = Y,
inference('PARAMODULATE',[status(thm)],[10,10,theory(equality)]) ).
cnf(35,plain,
divide(divide(inverse(divide(divide(X,Y),Z)),U),divide(divide(divide(Y,X),V),inverse(divide(V,U)))) = Z,
inference('PARAMODULATE',[status(thm)],[33,33,theory(equality)]) ).
cnf(36,plain,
divide(inverse(divide(divide(X,Y),Z)),U) = inverse(divide(inverse(divide(V,U)),divide(Z,divide(V,divide(Y,X))))),
inference('PARAMODULATE',[status(thm)],[5,33,theory(equality)]) ).
cnf(37,plain,
divide(inverse(divide(X,Y)),divide(Z,X)) = divide(inverse(divide(divide(U,V),Y)),divide(Z,divide(U,V))),
inference('REWRITE',[status(thm)],[13,36,theory(equality)]) ).
cnf(39,plain,
inverse(divide(divide(X,Y),divide(divide(Z,U),divide(divide(divide(Y,X),V),inverse(divide(V,U)))))) = Z,
inference('PARAMODULATE',[status(thm)],[9,33,theory(equality)]) ).
cnf(41,plain,
divide(divide(X,divide(divide(Y,Z),U)),divide(Z,Y)) = divide(divide(X,divide(divide(V,W),U)),divide(W,V)),
inference('PARAMODULATE',[status(thm)],[33,9,theory(equality)]) ).
cnf(48,plain,
inverse(divide(X,divide(divide(Y,divide(Z,X)),divide(divide(U,V),divide(inverse(divide(W,Z)),divide(divide(V,U),W)))))) = Y,
inference('PARAMODULATE',[status(thm)],[9,33,theory(equality)]) ).
cnf(62,plain,
divide(inverse(divide(X,Y)),divide(Z,X)) = divide(inverse(divide(U,Y)),divide(Z,U)),
inference('PARAMODULATE',[status(thm)],[37,37,theory(equality)]) ).
cnf(63,plain,
divide(inverse(divide(inverse(divide(X,Y)),divide(Z,X))),divide(divide(U,V),inverse(divide(divide(V,U),Y)))) = Z,
inference('PARAMODULATE',[status(thm)],[single_axiom,62,theory(equality)]) ).
cnf(78,plain,
divide(inverse(divide(X,Y)),divide(divide(inverse(divide(divide(Z,U),V)),divide(U,Z)),X)) = inverse(divide(inverse(divide(W,V)),divide(Y,W))),
inference('PARAMODULATE',[status(thm)],[5,62,theory(equality)]) ).
cnf(107,plain,
divide(X,Y) = divide(divide(divide(Z,U),inverse(divide(divide(U,Z),divide(V,divide(X,Y))))),inverse(V)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,6,theory(equality)]),6,theory(equality)]) ).
cnf(139,plain,
inverse(inverse(divide(inverse(divide(X,Y)),divide(Z,X)))) = inverse(divide(divide(inverse(divide(divide(U,V),Z)),divide(V,U)),Y)),
inference('PARAMODULATE',[status(thm)],[27,62,theory(equality)]) ).
cnf(155,plain,
X = divide(divide(divide(Y,Z),inverse(divide(divide(Z,Y),divide(U,X)))),inverse(U)),
inference('PARAMODULATE',[status(thm)],[107,single_axiom,theory(equality)]) ).
cnf(156,plain,
X = divide(divide(divide(divide(divide(X,Y),Z),inverse(divide(Z,U))),inverse(U)),inverse(Y)),
inference('PARAMODULATE',[status(thm)],[155,33,theory(equality)]) ).
cnf(157,plain,
divide(X,Y) = divide(divide(divide(Z,U),V),inverse(divide(V,divide(divide(Y,X),divide(U,Z))))),
inference('PARAMODULATE',[status(thm)],[155,9,theory(equality)]) ).
cnf(158,plain,
divide(divide(inverse(divide(inverse(X),Y)),Z),divide(inverse(divide(divide(U,V),divide(X,Z))),divide(V,U))) = Y,
inference('PARAMODULATE',[status(thm)],[33,155,theory(equality)]) ).
cnf(171,plain,
inverse(X) = divide(divide(divide(Y,Z),inverse(divide(divide(Z,Y),U))),inverse(divide(divide(V,W),inverse(divide(divide(W,V),divide(X,U)))))),
inference('PARAMODULATE',[status(thm)],[155,155,theory(equality)]) ).
cnf(188,plain,
divide(divide(X,Y),inverse(divide(divide(Y,X),divide(Z,divide(U,V))))) = divide(divide(divide(W,X1),inverse(divide(divide(X1,W),divide(V,U)))),inverse(inverse(Z))),
inference('PARAMODULATE',[status(thm)],[155,6,theory(equality)]) ).
cnf(201,plain,
divide(divide(X,divide(inverse(Y),Z)),U) = divide(divide(X,inverse(Z)),inverse(inverse(divide(U,Y)))),
inference('PARAMODULATE',[status(thm)],[156,156,theory(equality)]) ).
cnf(255,plain,
X = divide(divide(divide(divide(divide(X,inverse(divide(Y,divide(Z,divide(inverse(divide(divide(U,V),Z)),divide(V,U)))))),W),inverse(divide(W,X1))),inverse(X1)),Y),
inference('PARAMODULATE',[status(thm)],[156,27,theory(equality)]) ).
cnf(279,plain,
divide(divide(X,divide(inverse(divide(divide(Y,Z),U)),V)),inverse(divide(U,divide(W,divide(Z,Y))))) = divide(divide(X,inverse(V)),inverse(inverse(W))),
inference('PARAMODULATE',[status(thm)],[201,single_axiom,theory(equality)]) ).
cnf(330,plain,
divide(divide(X,divide(Y,Z)),U) = divide(divide(X,inverse(Z)),inverse(inverse(divide(U,divide(V,divide(divide(Y,divide(divide(W,X1),V)),divide(X1,W))))))),
inference('PARAMODULATE',[status(thm)],[201,9,theory(equality)]) ).
cnf(348,plain,
divide(inverse(inverse(divide(X,Y))),divide(Z,inverse(U))) = divide(X,divide(Z,divide(inverse(Y),U))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[6,201,theory(equality)]),6,theory(equality)]) ).
cnf(513,plain,
divide(divide(X,Y),divide(divide(divide(Z,U),V),inverse(divide(V,Y)))) = divide(divide(X,divide(divide(W,X1),divide(U,Z))),divide(X1,W)),
inference('PARAMODULATE',[status(thm)],[35,9,theory(equality)]) ).
cnf(619,plain,
X = divide(divide(divide(divide(divide(X,Y),inverse(divide(Z,U))),inverse(U)),inverse(inverse(Z))),inverse(Y)),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[156,36,theory(equality)]),279,theory(equality)]) ).
cnf(666,plain,
inverse(divide(inverse(divide(X,divide(Y,divide(Z,inverse(Y))))),divide(divide(U,Z),X))) = U,
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[39,156,theory(equality)]),5,theory(equality)]) ).
cnf(679,plain,
inverse(divide(divide(X,Y),divide(Z,divide(divide(divide(Y,X),U),inverse(divide(U,inverse(V))))))) = divide(divide(W,X1),inverse(divide(divide(X1,W),divide(V,Z)))),
inference('PARAMODULATE',[status(thm)],[39,155,theory(equality)]) ).
cnf(690,plain,
inverse(divide(divide(X,Y),divide(Z,divide(divide(divide(Y,X),U),inverse(divide(U,inverse(V))))))) = divide(divide(divide(divide(Z,V),W),inverse(divide(W,X1))),inverse(X1)),
inference('PARAMODULATE',[status(thm)],[39,156,theory(equality)]) ).
cnf(716,plain,
inverse(divide(divide(X,Y),divide(divide(divide(Z,divide(inverse(U),V)),W),divide(divide(divide(Y,X),X1),inverse(divide(X1,inverse(inverse(divide(W,U))))))))) = divide(Z,inverse(V)),
inference('PARAMODULATE',[status(thm)],[39,201,theory(equality)]) ).
cnf(738,plain,
divide(inverse(inverse(divide(X,divide(divide(Y,Z),divide(divide(U,V),divide(divide(divide(Z,Y),W),inverse(divide(W,V)))))))),divide(X1,inverse(Y1))) = divide(X,divide(X1,divide(U,Y1))),
inference('PARAMODULATE',[status(thm)],[348,39,theory(equality)]) ).
cnf(742,plain,
divide(X,Y) = divide(divide(divide(Z,U),inverse(divide(divide(U,Z),divide(V,divide(X,inverse(V)))))),Y),
inference('PARAMODULATE',[status(thm)],[157,666,theory(equality)]) ).
cnf(768,plain,
inverse(divide(inverse(divide(inverse(divide(X,divide(divide(Y,Z),divide(U,V)))),divide(W,divide(X,inverse(W))))),divide(Z,Y))) = divide(V,U),
inference('PARAMODULATE',[status(thm)],[666,157,theory(equality)]) ).
cnf(770,plain,
inverse(divide(inverse(divide(X,divide(Y,divide(inverse(Z),inverse(Y))))),divide(U,X))) = divide(divide(divide(divide(U,Z),V),inverse(divide(V,W))),inverse(W)),
inference('PARAMODULATE',[status(thm)],[666,156,theory(equality)]) ).
cnf(904,plain,
divide(divide(X,Y),inverse(divide(divide(Y,X),Z))) = divide(divide(divide(U,V),inverse(divide(divide(V,U),W))),inverse(inverse(divide(inverse(divide(X1,Z)),divide(W,X1))))),
inference('PARAMODULATE',[status(thm)],[155,63,theory(equality)]) ).
cnf(916,plain,
inverse(divide(inverse(divide(X,Y)),divide(Z,X))) = divide(divide(divide(divide(Z,U),inverse(divide(U,V))),inverse(V)),inverse(divide(divide(W,X1),inverse(divide(divide(X1,W),Y))))),
inference('PARAMODULATE',[status(thm)],[156,63,theory(equality)]) ).
cnf(1037,plain,
divide(divide(inverse(divide(X,Y)),divide(divide(divide(inverse(divide(divide(Z,U),divide(V,W))),divide(U,Z)),divide(inverse(divide(inverse(V),X1)),W)),X)),X1) = Y,
inference('PARAMODULATE',[status(thm)],[33,158,theory(equality)]) ).
cnf(1096,plain,
inverse(divide(inverse(divide(X,divide(Y,divide(divide(inverse(divide(divide(Z,U),divide(V,W))),divide(U,Z)),inverse(Y))))),divide(X1,X))) = divide(inverse(divide(inverse(V),X1)),W),
inference('PARAMODULATE',[status(thm)],[666,158,theory(equality)]) ).
cnf(1122,plain,
inverse(divide(divide(X,Y),divide(Z,divide(divide(divide(Y,X),U),inverse(divide(U,divide(inverse(divide(divide(V,W),divide(X1,Y1))),divide(W,V)))))))) = divide(inverse(divide(inverse(X1),Z)),Y1),
inference('PARAMODULATE',[status(thm)],[39,158,theory(equality)]) ).
cnf(1126,plain,
divide(divide(X,divide(divide(divide(inverse(divide(divide(Y,Z),divide(U,V))),divide(Z,Y)),divide(inverse(divide(inverse(U),W)),V)),X1)),W) = divide(divide(X,divide(divide(Y1,Z1),X1)),divide(Z1,Y1)),
inference('PARAMODULATE',[status(thm)],[41,158,theory(equality)]) ).
cnf(1139,plain,
divide(X,inverse(Y)) = divide(X,inverse(inverse(divide(Z,divide(Y,inverse(Z)))))),
inference('PARAMODULATE',[status(thm)],[619,619,theory(equality)]) ).
cnf(1237,plain,
divide(divide(divide(divide(X,Y),inverse(divide(Z,U))),inverse(U)),inverse(inverse(Z))) = divide(divide(divide(divide(X,V),inverse(divide(V,W))),inverse(W)),inverse(inverse(Y))),
inference('PARAMODULATE',[status(thm)],[156,619,theory(equality)]) ).
cnf(1257,plain,
inverse(divide(inverse(divide(X,divide(Y,divide(inverse(Z),inverse(Y))))),divide(U,X))) = divide(divide(divide(divide(U,Z),inverse(divide(V,W))),inverse(W)),inverse(inverse(V))),
inference('PARAMODULATE',[status(thm)],[666,619,theory(equality)]) ).
cnf(1340,plain,
divide(X,inverse(divide(divide(Y,Z),inverse(divide(divide(Z,Y),U))))) = divide(X,inverse(inverse(U))),
inference('PARAMODULATE',[status(thm)],[1139,35,theory(equality)]) ).
cnf(1347,plain,
inverse(divide(inverse(divide(X,Y)),divide(Z,X))) = divide(divide(divide(divide(Z,U),inverse(divide(U,V))),inverse(V)),inverse(inverse(Y))),
inference('REWRITE',[status(thm)],[916,1340,theory(equality)]) ).
cnf(1354,plain,
inverse(X) = divide(divide(divide(Y,Z),inverse(divide(divide(Z,Y),U))),inverse(inverse(divide(X,U)))),
inference('REWRITE',[status(thm)],[171,1340,theory(equality)]) ).
cnf(1356,plain,
inverse(X) = inverse(inverse(divide(Y,divide(X,inverse(Y))))),
inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[33,1139,theory(equality)]),33,theory(equality)]) ).
cnf(1357,plain,
inverse(divide(divide(X,Y),inverse(divide(divide(Y,X),Z)))) = inverse(inverse(Z)),
inference('PARAMODULATE',[status(thm)],[1356,35,theory(equality)]) ).
cnf(1382,plain,
X = divide(divide(divide(Y,Z),inverse(divide(divide(Z,Y),divide(inverse(divide(U,divide(V,inverse(U)))),X)))),inverse(V)),
inference('PARAMODULATE',[status(thm)],[155,1356,theory(equality)]) ).
cnf(1457,plain,
inverse(X) = divide(divide(divide(divide(divide(Y,Z),U),inverse(divide(U,V))),inverse(V)),inverse(inverse(divide(X,divide(Z,Y))))),
inference('PARAMODULATE',[status(thm)],[1354,33,theory(equality)]) ).
cnf(1480,plain,
divide(divide(inverse(inverse(X)),divide(divide(Y,Z),divide(divide(U,V),inverse(divide(divide(V,U),W))))),divide(Z,Y)) = inverse(inverse(divide(X,W))),
inference('PARAMODULATE',[status(thm)],[33,1354,theory(equality)]) ).
cnf(1692,plain,
divide(divide(inverse(inverse(X)),divide(divide(Y,Z),divide(U,V))),divide(Z,Y)) = inverse(divide(divide(V,U),X)),
inference('PARAMODULATE',[status(thm)],[33,1357,theory(equality)]) ).
cnf(1693,plain,
inverse(divide(divide(inverse(divide(divide(X,Y),Z)),divide(Y,X)),U)) = inverse(inverse(divide(U,Z))),
inference('REWRITE',[status(thm)],[1480,1692,theory(equality)]) ).
cnf(1710,plain,
inverse(inverse(divide(inverse(divide(X,Y)),divide(Z,X)))) = inverse(inverse(divide(Y,Z))),
inference('REWRITE',[status(thm)],[139,1693,theory(equality)]) ).
cnf(1737,plain,
divide(divide(X,Y),inverse(divide(divide(Y,X),Z))) = inverse(Z),
inference('REWRITE',[status(thm)],[904,1354,1710,theory(equality)]) ).
cnf(1797,plain,
X = divide(inverse(divide(inverse(divide(Y,divide(Z,inverse(Y)))),X)),inverse(Z)),
inference('REWRITE',[status(thm)],[1382,1737,theory(equality)]) ).
cnf(1857,plain,
divide(X,Y) = divide(inverse(divide(Z,divide(X,inverse(Z)))),Y),
inference('REWRITE',[status(thm)],[742,1737,theory(equality)]) ).
cnf(1859,plain,
X = divide(inverse(divide(Y,X)),inverse(Y)),
inference('REWRITE',[status(thm)],[1797,1857,theory(equality)]) ).
cnf(1917,plain,
inverse(divide(divide(X,Y),divide(Z,divide(divide(divide(Y,X),U),inverse(divide(U,inverse(V))))))) = inverse(divide(V,Z)),
inference('REWRITE',[status(thm)],[679,1737,theory(equality)]) ).
cnf(1924,plain,
inverse(inverse(divide(X,divide(Y,divide(Z,inverse(Y)))))) = divide(X,inverse(Z)),
inference('REWRITE',[status(thm)],[716,5,1917,theory(equality)]) ).
cnf(1936,plain,
inverse(divide(X,Y)) = divide(divide(divide(divide(Y,X),Z),inverse(divide(Z,U))),inverse(U)),
inference('REWRITE',[status(thm)],[690,1917,theory(equality)]) ).
cnf(1943,plain,
X = divide(inverse(divide(inverse(divide(Y,divide(Z,divide(inverse(divide(divide(U,V),Z)),divide(V,U))))),X)),Y),
inference('REWRITE',[status(thm)],[255,1936,theory(equality)]) ).
cnf(1953,plain,
inverse(X) = divide(inverse(divide(Y,Z)),inverse(inverse(divide(X,divide(Y,Z))))),
inference('REWRITE',[status(thm)],[1457,1936,theory(equality)]) ).
cnf(1973,plain,
inverse(divide(inverse(divide(X,divide(Y,divide(inverse(Z),inverse(Y))))),divide(U,X))) = inverse(divide(Z,U)),
inference('REWRITE',[status(thm)],[770,1936,theory(equality)]) ).
cnf(1974,plain,
inverse(divide(X,Y)) = divide(divide(divide(divide(Y,X),inverse(divide(Z,U))),inverse(U)),inverse(inverse(Z))),
inference('REWRITE',[status(thm)],[1257,1973,theory(equality)]) ).
cnf(1978,plain,
inverse(divide(X,Y)) = divide(divide(divide(divide(Y,Z),inverse(divide(Z,U))),inverse(U)),inverse(inverse(X))),
inference('REWRITE',[status(thm)],[1237,1974,theory(equality)]) ).
cnf(1979,plain,
inverse(divide(inverse(divide(X,Y)),divide(Z,X))) = inverse(divide(Y,Z)),
inference('REWRITE',[status(thm)],[1347,1978,theory(equality)]) ).
cnf(1985,plain,
inverse(divide(divide(X,divide(divide(inverse(divide(divide(Y,Z),divide(U,V))),divide(Z,Y)),inverse(X))),W)) = divide(inverse(divide(inverse(U),W)),V),
inference('REWRITE',[status(thm)],[1096,1979,theory(equality)]) ).
cnf(2034,plain,
divide(inverse(divide(X,Y)),divide(divide(inverse(divide(divide(Z,U),V)),divide(U,Z)),X)) = inverse(divide(V,Y)),
inference('REWRITE',[status(thm)],[78,1979,theory(equality)]) ).
cnf(2035,plain,
inverse(divide(X,divide(Y,divide(Z,U)))) = inverse(inverse(divide(Y,divide(X,divide(U,Z))))),
inference('REWRITE',[status(thm)],[18,2034,theory(equality)]) ).
cnf(2037,plain,
inverse(inverse(divide(divide(X,divide(Y,Z)),divide(Z,Y)))) = X,
inference('REWRITE',[status(thm)],[48,33,2035,theory(equality)]) ).
cnf(2080,plain,
inverse(divide(X,divide(Y,Z))) = divide(inverse(divide(Z,Y)),inverse(inverse(X))),
inference('REWRITE',[status(thm)],[188,1737,theory(equality)]) ).
cnf(2084,plain,
inverse(X) = inverse(divide(divide(X,divide(Y,Z)),divide(Z,Y))),
inference('REWRITE',[status(thm)],[1953,2080,theory(equality)]) ).
cnf(2085,plain,
inverse(inverse(X)) = X,
inference('REWRITE',[status(thm)],[2037,2084,theory(equality)]) ).
cnf(2098,plain,
divide(divide(X,divide(divide(Y,Z),divide(divide(U,V),divide(divide(divide(Z,Y),W),inverse(divide(W,V)))))),divide(X1,inverse(Y1))) = divide(X,divide(X1,divide(U,Y1))),
inference('REWRITE',[status(thm)],[738,2085,theory(equality)]) ).
cnf(2116,plain,
divide(divide(X,divide(Y,Z)),U) = divide(divide(X,inverse(Z)),divide(U,divide(V,divide(divide(Y,divide(divide(W,X1),V)),divide(X1,W))))),
inference('REWRITE',[status(thm)],[330,2085,theory(equality)]) ).
cnf(2121,plain,
divide(X,divide(Y,divide(inverse(divide(divide(Z,U),Y)),divide(U,Z)))) = X,
inference('REWRITE',[status(thm)],[27,2085,theory(equality)]) ).
cnf(2124,plain,
X = divide(inverse(divide(inverse(Y),X)),Y),
inference('REWRITE',[status(thm)],[1943,2121,theory(equality)]) ).
cnf(2129,plain,
divide(X,divide(Y,divide(Z,inverse(Y)))) = divide(X,inverse(Z)),
inference('REWRITE',[status(thm)],[1924,2085,theory(equality)]) ).
cnf(2137,plain,
inverse(divide(inverse(divide(divide(X,Y),divide(Z,U))),divide(Y,X))) = divide(U,Z),
inference('REWRITE',[status(thm)],[768,1859,2129,theory(equality)]) ).
cnf(2165,plain,
inverse(divide(X,divide(Y,divide(Z,U)))) = divide(Y,divide(X,divide(U,Z))),
inference('REWRITE',[status(thm)],[2035,2085,theory(equality)]) ).
cnf(2171,plain,
divide(divide(X,divide(Y,Z)),U) = divide(divide(X,inverse(Z)),divide(U,inverse(Y))),
inference('REWRITE',[status(thm)],[2116,2084,2165,theory(equality)]) ).
cnf(2177,plain,
divide(divide(X,Y),divide(divide(divide(Z,U),V),inverse(divide(V,Y)))) = divide(divide(X,inverse(divide(U,Z))),divide(divide(W,X1),inverse(divide(X1,W)))),
inference('REWRITE',[status(thm)],[513,2171,theory(equality)]) ).
cnf(2198,plain,
divide(X,divide(Y,inverse(divide(divide(inverse(divide(divide(Z,U),divide(V,W))),divide(U,Z)),divide(inverse(divide(inverse(V),Y)),W))))) = X,
inference('REWRITE',[status(thm)],[1037,1859,2171,theory(equality)]) ).
cnf(2203,plain,
divide(X,inverse(Y)) = divide(divide(X,inverse(Y)),divide(divide(Z,U),inverse(divide(U,Z)))),
inference('REWRITE',[status(thm)],[1126,2198,2171,theory(equality)]) ).
cnf(2210,plain,
divide(divide(X,Y),divide(divide(divide(Z,U),V),inverse(divide(V,Y)))) = divide(X,inverse(divide(U,Z))),
inference('REWRITE',[status(thm)],[2177,2203,theory(equality)]) ).
cnf(2220,plain,
divide(divide(X,inverse(Y)),divide(Z,inverse(U))) = divide(X,divide(Z,divide(Y,U))),
inference('REWRITE',[status(thm)],[2098,2129,2210,theory(equality)]) ).
cnf(2249,plain,
inverse(divide(divide(inverse(X),inverse(X)),divide(Y,divide(Z,U)))) = divide(inverse(divide(inverse(U),Y)),Z),
inference('REWRITE',[status(thm)],[1122,2137,2085,1737,2220,theory(equality)]) ).
cnf(2254,plain,
inverse(divide(divide(inverse(X),inverse(X)),divide(Y,Z))) = inverse(divide(Z,Y)),
inference('REWRITE',[status(thm)],[1917,2085,1737,2220,theory(equality)]) ).
cnf(2255,plain,
inverse(divide(divide(X,Y),Z)) = divide(inverse(divide(inverse(Y),Z)),X),
inference('REWRITE',[status(thm)],[2249,2254,theory(equality)]) ).
cnf(2271,plain,
X = inverse(divide(divide(Y,Y),X)),
inference('REWRITE',[status(thm)],[2124,2255,theory(equality)]) ).
cnf(2273,plain,
divide(X,Y) = inverse(divide(Y,X)),
inference('REWRITE',[status(thm)],[2254,2271,theory(equality)]) ).
cnf(2294,plain,
inverse(X) = divide(divide(Y,Z),divide(X,divide(Z,Y))),
inference('REWRITE',[status(thm)],[2084,2273,theory(equality)]) ).
cnf(2325,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(c3),b3)),
inference('REWRITE',[status(thm)],[4,2273,theory(equality)]) ).
cnf(2342,plain,
divide(X,divide(Y,Z)) = divide(divide(X,inverse(Z)),Y),
inference('REWRITE',[status(thm)],[1985,2294,2129,2273,theory(equality)]) ).
cnf(2343,plain,
$false,
inference('REWRITE',[status(thm)],[2325,2342,theory(equality)]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP471-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 08:02:09 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.46 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47 *
% 0.21/0.47 *
% 0.21/0.48 #<PACKAGE "SNARK-USER">
% 0.21/0.48 *
% 0.21/0.48 SNARK-TPTP-OPTIONS
% 0.21/0.48 *
% 0.21/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48 (USE-FACTORING :POS)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48 *
% 0.21/0.48 "."
% 0.21/0.48 *
% 0.21/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T08:02:09
% 0.21/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n005.cluster.edu at 2022-06-13T08:02:09
% 1.77/1.97
% 1.77/1.97
% 1.77/1.97 #||
% 1.77/1.97 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.77/1.97 % SZS output start Refutation
% See solution above
% 1.83/2.00 ||#
% 1.83/2.00
% 1.83/2.00 ; Summary of computation:
% 1.83/2.00 ; 4971 formulas have been input or derived (from 33 formulas).
% 1.83/2.00 ; 2343 (47%) were retained. Of these,
% 1.83/2.00 ; 2284 (97%) were simplified or subsumed later,
% 1.83/2.00 ; 59 ( 3%) are still being kept.
% 1.83/2.00 ;
% 1.83/2.00 ; Run time in seconds excluding printing time:
% 1.83/2.00 ; 0.001 0% Read assertion file (1 call)
% 1.83/2.00 ; 0.000 0% Assert (3 calls)
% 1.83/2.00 ; 0.395 26% Process new row (3,692 calls)
% 1.83/2.00 ; 0.003 0% Resolution (64 calls)
% 1.83/2.00 ; 0.079 5% Paramodulation (32 calls)
% 1.83/2.00 ; 0.315 21% Forward simplification (3,431 calls)
% 1.83/2.00 ; 0.482 32% Backward simplification (2,342 calls)
% 1.83/2.00 ; 0.173 12% Ordering (13,634 calls)
% 1.83/2.00 ; 0.001 0% Sortal reasoning (32 calls)
% 1.83/2.00 ; 0.000 0% Purity testing (1 call)
% 1.83/2.00 ; 0.042 3% Other
% 1.83/2.00 ; 1.491 Total
% 1.83/2.00 ; 1.518 Real time
% 1.83/2.00 ;
% 1.83/2.00 ; Term-hash-array has 12,851 terms in all.
% 1.83/2.00 ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.83/2.00 ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.83/2.00 ; Path-index has 304 entries (9,177 at peak, 13,617 added, 13,313 deleted).
% 1.83/2.00 ; Path-index has 15,360 nodes (22,290 at peak, 25,827 added, 10,467 deleted).
% 1.83/2.00 ; Trie-index has 304 entries (9,177 at peak, 13,617 added, 13,313 deleted).
% 1.83/2.00 ; Trie-index has 1,377 nodes (64,555 at peak, 93,713 added, 92,336 deleted).
% 1.83/2.00 ; Retrieved 6,811 generalization terms in 50,956 calls.
% 1.83/2.00 ; Retrieved 11,209 instance terms in 2,712 calls.
% 1.83/2.00 ; Retrieved 16,271 unifiable terms in 363 calls.
% 1.83/2.00 ;
% 1.83/2.00 ; The agenda of backward simplifiable rows to process has 1179 entries:
% 1.83/2.00 ; 1179 with value 0
% 1.83/2.00 ; The agenda of rows to process has 97 entries:
% 1.83/2.00 ; 5 with value 37 18 with value 42 11 with value 47
% 1.83/2.00 ; 4 with value 38 7 with value 43 2 with value 48
% 1.83/2.00 ; 6 with value 39 5 with value 44 8 with value 49
% 1.83/2.00 ; 5 with value 40 12 with value 45 3 with value 50
% 1.83/2.00 ; 3 with value 41 7 with value 46 1 with value 51
% 1.83/2.00 ; The agenda of input rows to give has 1 entry:
% 1.83/2.00 ; 1 with value 20
% 1.83/2.00 ; The agenda of rows to give has 56 entries:
% 1.83/2.00 ; 1 with value (4 12) 3 with value (4 24) 3 with value (4 33)
% 1.83/2.00 ; 1 with value (4 15) 1 with value (4 25) 5 with value (4 34)
% 1.83/2.00 ; 1 with value (4 16) 1 with value (4 26) 4 with value (4 35)
% 1.83/2.00 ; 1 with value (4 17) 3 with value (4 27) 3 with value (4 36)
% 1.83/2.00 ; 1 with value (4 18) 2 with value (4 28) 2 with value (4 37)
% 1.83/2.00 ; 2 with value (4 20) 1 with value (4 29) 1 with value (4 38)
% 1.83/2.00 ; 3 with value (4 21) 4 with value (4 30) 2 with value (4 39)
% 1.83/2.00 ; 2 with value (4 22) 5 with value (4 31) 1 with value (4 41)
% 1.83/2.00 ; 2 with value (4 23) 1 with value (4 32)
% 1.83/2.00 Evaluation took:
% 1.83/2.00 1.519 seconds of real time
% 1.83/2.00 1.423071 seconds of user run time
% 1.83/2.00 0.096144 seconds of system run time
% 1.83/2.00 [Run times include 0.267 seconds GC run time.]
% 1.83/2.00 0 calls to %EVAL
% 1.83/2.00 0 page faults and
% 1.83/2.00 120,824,792 bytes consed.
% 1.83/2.00 :PROOF-FOUND
% 1.83/2.00 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-13T08:02:10
% 1.83/2.00 :PROOF-FOUND
% 1.83/2.00 *
%------------------------------------------------------------------------------