↑ Up

SNARK---20120808r022.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRP407-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n024.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:38:08 EDT 2022

% Result   : Unsatisfiable 1.62s 1.78s
% Output   : Refutation 1.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   27
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   83 (  83 unt;   0 nHn;   4 RR)
%            Number of literals    :   83 (  82 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   15 (   3 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :  371 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
    multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(Y),multiply(inverse(Y),Y))))) = Z,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).

cnf(prove_these_axioms_2,negated_conjecture,
    multiply(multiply(inverse(b2),b2),a2) != a2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).

cnf(3,plain,
    multiply(X,inverse(multiply(inverse(Y),multiply(inverse(Z),multiply(inverse(Z),Z))))) = inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Z)),U)),Y)),multiply(inverse(U),multiply(inverse(U),U)))),
    inference('PARAMODULATE',[status(thm)],[single_axiom,single_axiom,theory(equality)]) ).

cnf(5,plain,
    multiply(inverse(multiply(X,Y)),multiply(X,inverse(multiply(inverse(Z),multiply(inverse(Y),multiply(inverse(Y),Y)))))) = Z,
    inference('PARAMODULATE',[status(thm)],[single_axiom,3,theory(equality)]) ).

cnf(6,plain,
    inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(multiply(X,Y)),U))),multiply(inverse(Z),multiply(inverse(Z),Z)))) = U,
    inference('PARAMODULATE',[status(thm)],[single_axiom,3,theory(equality)]) ).

cnf(11,plain,
    multiply(X,inverse(multiply(inverse(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),U)),V)),multiply(inverse(U),multiply(inverse(U),U))))),multiply(inverse(Y),multiply(inverse(Y),Y))))) = inverse(multiply(inverse(V),multiply(inverse(Z),multiply(inverse(Z),Z)))),
    inference('PARAMODULATE',[status(thm)],[single_axiom,3,theory(equality)]) ).

cnf(25,plain,
    multiply(inverse(multiply(X,Y)),multiply(X,multiply(Z,inverse(multiply(inverse(U),multiply(inverse(V),multiply(inverse(V),V))))))) = multiply(inverse(multiply(inverse(multiply(Z,V)),Y)),U),
    inference('PARAMODULATE',[status(thm)],[5,3,theory(equality)]) ).

cnf(31,plain,
    multiply(inverse(X),multiply(Y,inverse(multiply(inverse(Z),multiply(inverse(inverse(multiply(inverse(multiply(inverse(multiply(Y,U)),X)),multiply(inverse(U),multiply(inverse(U),U))))),multiply(inverse(inverse(multiply(inverse(multiply(inverse(multiply(Y,U)),X)),multiply(inverse(U),multiply(inverse(U),U))))),inverse(multiply(inverse(multiply(inverse(multiply(Y,U)),X)),multiply(inverse(U),multiply(inverse(U),U)))))))))) = Z,
    inference('PARAMODULATE',[status(thm)],[5,single_axiom,theory(equality)]) ).

cnf(35,plain,
    inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),multiply(inverse(Y),multiply(inverse(Y),Y)))) = Z,
    inference('PARAMODULATE',[status(thm)],[6,6,theory(equality)]) ).

cnf(36,plain,
    multiply(inverse(multiply(X,Y)),multiply(X,Z)) = multiply(inverse(multiply(U,Y)),multiply(U,Z)),
    inference('PARAMODULATE',[status(thm)],[5,35,theory(equality)]) ).

cnf(59,plain,
    multiply(inverse(multiply(X,Y)),multiply(X,inverse(multiply(inverse(multiply(Z,U)),multiply(Z,multiply(inverse(Y),Y)))))) = multiply(inverse(Y),U),
    inference('PARAMODULATE',[status(thm)],[5,36,theory(equality)]) ).

cnf(60,plain,
    multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),multiply(inverse(multiply(U,Y)),V)) = multiply(inverse(multiply(W,multiply(U,Z))),multiply(W,V)),
    inference('PARAMODULATE',[status(thm)],[36,36,theory(equality)]) ).

cnf(61,plain,
    multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(multiply(U,Y)),multiply(U,V))) = multiply(inverse(multiply(W,Z)),multiply(W,multiply(X,V))),
    inference('PARAMODULATE',[status(thm)],[36,36,theory(equality)]) ).

cnf(62,plain,
    multiply(X,multiply(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,X))),U)) = multiply(inverse(multiply(V,multiply(inverse(Z),multiply(inverse(Z),Z)))),multiply(V,U)),
    inference('PARAMODULATE',[status(thm)],[36,35,theory(equality)]) ).

cnf(71,plain,
    multiply(inverse(multiply(X,Y)),inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(Z,Y)),multiply(Z,U))),V)),multiply(inverse(multiply(X,U)),multiply(inverse(multiply(X,U)),multiply(X,U)))))) = V,
    inference('PARAMODULATE',[status(thm)],[single_axiom,36,theory(equality)]) ).

cnf(73,plain,
    multiply(X,inverse(multiply(inverse(Y),multiply(inverse(Z),multiply(inverse(Z),Z))))) = inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(U,Z)),multiply(U,V))),Y)),multiply(inverse(multiply(X,V)),multiply(inverse(multiply(X,V)),multiply(X,V))))),
    inference('PARAMODULATE',[status(thm)],[3,36,theory(equality)]) ).

cnf(75,plain,
    multiply(multiply(X,inverse(multiply(inverse(Y),multiply(inverse(Z),multiply(inverse(Z),Z))))),multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Z)),U)),Y)),V)) = multiply(inverse(multiply(W,multiply(inverse(U),multiply(inverse(U),U)))),multiply(W,V)),
    inference('PARAMODULATE',[status(thm)],[36,3,theory(equality)]) ).

cnf(80,plain,
    inverse(multiply(inverse(multiply(inverse(X),Y)),multiply(inverse(X),multiply(inverse(X),X)))) = inverse(multiply(inverse(multiply(Z,Y)),multiply(Z,multiply(inverse(X),X)))),
    inference('PARAMODULATE',[status(thm)],[35,59,theory(equality)]) ).

cnf(85,plain,
    multiply(inverse(multiply(X,Y)),multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(Z,U)),multiply(Z,V))),multiply(inverse(multiply(W,U)),multiply(inverse(Y),Y)))))) = multiply(inverse(Y),multiply(W,V)),
    inference('PARAMODULATE',[status(thm)],[59,36,theory(equality)]) ).

cnf(140,plain,
    multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,multiply(Z,inverse(multiply(inverse(U),multiply(inverse(V),multiply(inverse(V),V)))))))),multiply(inverse(multiply(inverse(multiply(Z,V)),Y)),W)) = multiply(inverse(multiply(X1,U)),multiply(X1,W)),
    inference('PARAMODULATE',[status(thm)],[60,5,theory(equality)]) ).

cnf(195,plain,
    multiply(inverse(multiply(X,multiply(Y,Z))),multiply(X,multiply(Y,U))) = multiply(inverse(multiply(V,multiply(W,Z))),multiply(V,multiply(W,U))),
    inference('PARAMODULATE',[status(thm)],[60,61,theory(equality)]) ).

cnf(226,plain,
    multiply(X,inverse(multiply(inverse(Y),multiply(inverse(Z),multiply(inverse(Z),Z))))) = inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Z)),multiply(inverse(multiply(U,V)),V))),Y)),multiply(inverse(multiply(W,V)),multiply(W,multiply(U,V))))),
    inference('PARAMODULATE',[status(thm)],[3,61,theory(equality)]) ).

cnf(241,plain,
    multiply(inverse(X),multiply(inverse(multiply(Y,Z)),multiply(Y,U))) = multiply(inverse(X),multiply(inverse(multiply(V,Z)),multiply(V,U))),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[59,61,theory(equality)]),85,theory(equality)]) ).

cnf(277,plain,
    multiply(inverse(multiply(X,multiply(Y,multiply(Z,U)))),multiply(X,inverse(multiply(inverse(multiply(V,W)),multiply(V,multiply(inverse(multiply(inverse(multiply(Z,X1)),multiply(Z,U))),multiply(inverse(multiply(Y1,X1)),multiply(Y1,U)))))))) = multiply(inverse(multiply(Y,multiply(Z,U))),W),
    inference('PARAMODULATE',[status(thm)],[59,61,theory(equality)]) ).

cnf(303,plain,
    multiply(X,multiply(inverse(multiply(Y,Z)),multiply(Y,U))) = multiply(X,multiply(inverse(multiply(V,Z)),multiply(V,U))),
    inference('PARAMODULATE',[status(thm)],[241,35,theory(equality)]) ).

cnf(338,plain,
    multiply(inverse(multiply(X,multiply(inverse(multiply(Y,Z)),multiply(Y,U)))),multiply(X,inverse(multiply(inverse(multiply(V,W)),multiply(V,multiply(inverse(multiply(inverse(multiply(X1,Z)),multiply(X1,U))),multiply(inverse(multiply(X1,Z)),multiply(X1,U)))))))) = multiply(inverse(multiply(inverse(multiply(X1,Z)),multiply(X1,U))),W),
    inference('PARAMODULATE',[status(thm)],[59,303,theory(equality)]) ).

cnf(347,plain,
    multiply(inverse(multiply(X,multiply(inverse(multiply(Y,Z)),multiply(Y,U)))),multiply(X,multiply(inverse(multiply(V,Z)),W))) = multiply(inverse(multiply(X1,multiply(Y1,multiply(V,U)))),multiply(X1,multiply(Y1,W))),
    inference('PARAMODULATE',[status(thm)],[195,36,theory(equality)]) ).

cnf(368,plain,
    multiply(inverse(multiply(X,multiply(Y,multiply(Z,U)))),multiply(X,inverse(multiply(inverse(multiply(V,W)),multiply(V,multiply(inverse(multiply(X1,multiply(Y1,U))),multiply(X1,multiply(Y1,U)))))))) = multiply(inverse(multiply(Y,multiply(Z,U))),W),
    inference('PARAMODULATE',[status(thm)],[59,195,theory(equality)]) ).

cnf(369,plain,
    multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),U) = multiply(inverse(multiply(inverse(multiply(V,Y)),multiply(V,Z))),U),
    inference('REWRITE',[status(thm)],[338,368,theory(equality)]) ).

cnf(376,plain,
    multiply(inverse(multiply(X,multiply(Y,Z))),multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,U))),V)),multiply(inverse(multiply(W,multiply(X1,U))),multiply(W,multiply(X1,Z))))))) = multiply(inverse(multiply(Y,Z)),V),
    inference('PARAMODULATE',[status(thm)],[59,195,theory(equality)]) ).

cnf(399,plain,
    multiply(inverse(multiply(inverse(multiply(X,multiply(Y,Z))),multiply(X,multiply(Y,U)))),multiply(inverse(multiply(V,multiply(W,Z))),inverse(multiply(inverse(multiply(X1,Y1)),multiply(X1,multiply(inverse(multiply(V,multiply(W,U))),multiply(V,multiply(W,U)))))))) = multiply(inverse(multiply(V,multiply(W,U))),Y1),
    inference('PARAMODULATE',[status(thm)],[59,195,theory(equality)]) ).

cnf(453,plain,
    inverse(multiply(inverse(multiply(X,Y)),multiply(X,multiply(inverse(Z),Z)))) = inverse(multiply(inverse(multiply(U,Y)),multiply(U,multiply(inverse(Z),Z)))),
    inference('PARAMODULATE',[status(thm)],[80,80,theory(equality)]) ).

cnf(467,plain,
    inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),U)),multiply(inverse(multiply(V,multiply(W,Z))),multiply(V,multiply(W,Y))))) = inverse(multiply(inverse(multiply(X1,U)),multiply(X1,multiply(inverse(multiply(X,Y)),multiply(X,Y))))),
    inference('PARAMODULATE',[status(thm)],[453,195,theory(equality)]) ).

cnf(491,plain,
    multiply(X,multiply(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,X))),U)) = multiply(inverse(multiply(inverse(multiply(V,multiply(W,X1))),multiply(V,multiply(W,Z)))),multiply(inverse(multiply(inverse(Z),multiply(inverse(Z),X1))),U)),
    inference('PARAMODULATE',[status(thm)],[62,195,theory(equality)]) ).

cnf(499,plain,
    multiply(X,multiply(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,X))),U)) = multiply(multiply(V,inverse(multiply(inverse(W),multiply(inverse(X1),multiply(inverse(X1),X1))))),multiply(inverse(multiply(inverse(multiply(inverse(multiply(V,X1)),Z)),W)),U)),
    inference('PARAMODULATE',[status(thm)],[62,3,theory(equality)]) ).

cnf(500,plain,
    multiply(X,multiply(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,X))),inverse(multiply(inverse(multiply(inverse(multiply(U,V)),W)),multiply(inverse(V),multiply(inverse(V),V)))))) = multiply(inverse(multiply(U,multiply(inverse(Z),multiply(inverse(Z),Z)))),W),
    inference('PARAMODULATE',[status(thm)],[62,single_axiom,theory(equality)]) ).

cnf(587,plain,
    multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,inverse(Z)))),multiply(inverse(Y),multiply(inverse(Y),Y))) = Z,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[5,62,theory(equality)]),277,theory(equality)]) ).

cnf(592,plain,
    multiply(inverse(multiply(X,multiply(inverse(multiply(Y,Z)),multiply(Y,U)))),multiply(X,inverse(multiply(inverse(multiply(U,V)),multiply(inverse(multiply(W,multiply(inverse(Z),multiply(inverse(Z),Z)))),multiply(W,multiply(inverse(multiply(Y,Z)),multiply(Y,U)))))))) = multiply(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,U))),V),
    inference('PARAMODULATE',[status(thm)],[59,62,theory(equality)]) ).

cnf(594,plain,
    inverse(multiply(inverse(multiply(X,Y)),multiply(inverse(multiply(Z,multiply(inverse(U),multiply(inverse(U),U)))),multiply(Z,multiply(inverse(multiply(V,U)),multiply(V,X)))))) = inverse(multiply(inverse(multiply(W,Y)),multiply(W,multiply(inverse(multiply(inverse(multiply(V,U)),multiply(V,X))),multiply(inverse(multiply(V,U)),multiply(V,X)))))),
    inference('PARAMODULATE',[status(thm)],[453,62,theory(equality)]) ).

cnf(619,plain,
    multiply(inverse(multiply(inverse(multiply(X,multiply(inverse(Y),multiply(inverse(Y),Y)))),multiply(X,Z))),multiply(U,inverse(multiply(inverse(multiply(V,W)),multiply(V,multiply(inverse(multiply(inverse(multiply(inverse(multiply(X1,Y)),multiply(X1,U))),Z)),multiply(inverse(multiply(inverse(multiply(X1,Y)),multiply(X1,U))),Z))))))) = multiply(inverse(multiply(inverse(multiply(inverse(multiply(X1,Y)),multiply(X1,U))),Z)),W),
    inference('PARAMODULATE',[status(thm)],[59,62,theory(equality)]) ).

cnf(629,plain,
    multiply(inverse(X),X) = multiply(inverse(multiply(Y,multiply(inverse(Z),multiply(inverse(Z),Z)))),multiply(Y,multiply(inverse(Z),multiply(inverse(Z),Z)))),
    inference('PARAMODULATE',[status(thm)],[62,587,theory(equality)]) ).

cnf(677,plain,
    multiply(inverse(X),X) = multiply(inverse(Y),Y),
    inference('PARAMODULATE',[status(thm)],[629,629,theory(equality)]) ).

cnf(678,plain,
    multiply(multiply(inverse(X),X),a2) != a2,
    inference('PARAMODULATE',[status(thm)],[prove_these_axioms_2,677,theory(equality)]) ).

cnf(679,plain,
    inverse(multiply(inverse(multiply(inverse(X),X)),multiply(inverse(Y),multiply(inverse(Y),Y)))) = Y,
    inference('PARAMODULATE',[status(thm)],[35,677,theory(equality)]) ).

cnf(688,plain,
    multiply(inverse(multiply(X,Y)),multiply(X,inverse(multiply(inverse(Z),multiply(inverse(Y),multiply(inverse(U),U)))))) = Z,
    inference('PARAMODULATE',[status(thm)],[5,677,theory(equality)]) ).

cnf(689,plain,
    multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),Z)),multiply(inverse(Y),multiply(inverse(U),U))))) = Z,
    inference('PARAMODULATE',[status(thm)],[single_axiom,677,theory(equality)]) ).

cnf(694,plain,
    multiply(X,multiply(inverse(multiply(inverse(Y),Y)),Z)) = multiply(inverse(multiply(U,multiply(inverse(X),multiply(inverse(X),X)))),multiply(U,Z)),
    inference('PARAMODULATE',[status(thm)],[62,677,theory(equality)]) ).

cnf(706,plain,
    multiply(inverse(multiply(inverse(multiply(inverse(X),Y)),multiply(inverse(Z),Z))),U) = multiply(inverse(multiply(inverse(multiply(V,Y)),multiply(V,X))),U),
    inference('PARAMODULATE',[status(thm)],[369,677,theory(equality)]) ).

cnf(708,plain,
    inverse(multiply(inverse(multiply(inverse(X),X)),multiply(inverse(Y),multiply(inverse(Z),Z)))) = inverse(multiply(inverse(multiply(U,Y)),multiply(U,multiply(inverse(Z),Z)))),
    inference('PARAMODULATE',[status(thm)],[453,677,theory(equality)]) ).

cnf(711,plain,
    multiply(X,multiply(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,X))),U)) = multiply(inverse(multiply(V,multiply(inverse(Z),multiply(inverse(W),W)))),multiply(V,U)),
    inference('PARAMODULATE',[status(thm)],[62,677,theory(equality)]) ).

cnf(729,plain,
    inverse(multiply(inverse(multiply(inverse(X),X)),multiply(inverse(Y),multiply(inverse(Z),Z)))) = Y,
    inference('PARAMODULATE',[status(thm)],[679,677,theory(equality)]) ).

cnf(730,plain,
    X = inverse(multiply(inverse(multiply(Y,X)),multiply(Y,multiply(inverse(Z),Z)))),
    inference('REWRITE',[status(thm)],[708,729,theory(equality)]) ).

cnf(736,plain,
    inverse(multiply(inverse(multiply(X,Y)),multiply(inverse(multiply(Z,multiply(inverse(U),multiply(inverse(U),U)))),multiply(Z,multiply(inverse(multiply(V,U)),multiply(V,X)))))) = Y,
    inference('REWRITE',[status(thm)],[594,730,theory(equality)]) ).

cnf(737,plain,
    multiply(inverse(multiply(X,multiply(inverse(multiply(Y,Z)),multiply(Y,U)))),multiply(X,V)) = multiply(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,U))),V),
    inference('REWRITE',[status(thm)],[592,736,theory(equality)]) ).

cnf(755,plain,
    multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),multiply(inverse(multiply(U,Y)),V)) = multiply(inverse(multiply(W,multiply(X1,multiply(U,Z)))),multiply(W,multiply(X1,V))),
    inference('REWRITE',[status(thm)],[347,737,theory(equality)]) ).

cnf(770,plain,
    multiply(inverse(multiply(inverse(multiply(X,multiply(Y,Z))),multiply(X,multiply(Y,U)))),multiply(inverse(multiply(V,multiply(W,Z))),X1)) = multiply(inverse(multiply(V,multiply(W,U))),X1),
    inference('REWRITE',[status(thm)],[399,730,theory(equality)]) ).

cnf(771,plain,
    multiply(X,multiply(inverse(multiply(inverse(multiply(Y,Z)),multiply(Y,X))),U)) = multiply(inverse(multiply(inverse(Z),multiply(inverse(Z),Z))),U),
    inference('REWRITE',[status(thm)],[491,770,theory(equality)]) ).

cnf(821,plain,
    multiply(inverse(multiply(inverse(X),multiply(inverse(X),X))),inverse(multiply(inverse(multiply(inverse(multiply(Y,Z)),U)),multiply(inverse(Z),multiply(inverse(Z),Z))))) = multiply(inverse(multiply(Y,multiply(inverse(X),multiply(inverse(X),X)))),U),
    inference('REWRITE',[status(thm)],[500,771,theory(equality)]) ).

cnf(897,plain,
    multiply(inverse(multiply(inverse(X),multiply(inverse(X),X))),Y) = multiply(multiply(Z,inverse(multiply(inverse(U),multiply(inverse(V),multiply(inverse(V),V))))),multiply(inverse(multiply(inverse(multiply(inverse(multiply(Z,V)),X)),U)),Y)),
    inference('REWRITE',[status(thm)],[499,771,theory(equality)]) ).

cnf(898,plain,
    multiply(inverse(multiply(inverse(X),multiply(inverse(X),X))),Y) = multiply(inverse(multiply(Z,multiply(inverse(X),multiply(inverse(X),X)))),multiply(Z,Y)),
    inference('REWRITE',[status(thm)],[75,897,theory(equality)]) ).

cnf(913,plain,
    multiply(X,multiply(inverse(multiply(inverse(Y),Y)),Z)) = multiply(inverse(multiply(inverse(X),multiply(inverse(X),X))),Z),
    inference('REWRITE',[status(thm)],[694,898,theory(equality)]) ).

cnf(942,plain,
    multiply(inverse(multiply(inverse(X),multiply(inverse(X),X))),Y) = multiply(inverse(multiply(Z,multiply(inverse(X),multiply(inverse(U),U)))),multiply(Z,Y)),
    inference('REWRITE',[status(thm)],[711,771,theory(equality)]) ).

cnf(946,plain,
    multiply(inverse(multiply(inverse(multiply(inverse(X),multiply(inverse(X),X))),Y)),multiply(Z,U)) = multiply(inverse(multiply(inverse(multiply(inverse(multiply(V,X)),multiply(V,Z))),Y)),U),
    inference('REWRITE',[status(thm)],[619,942,730,theory(equality)]) ).

cnf(951,plain,
    inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),U)),multiply(inverse(multiply(V,multiply(W,Z))),multiply(V,multiply(W,Y))))) = U,
    inference('REWRITE',[status(thm)],[467,730,theory(equality)]) ).

cnf(952,plain,
    multiply(inverse(multiply(X,multiply(Y,Z))),multiply(X,U)) = multiply(inverse(multiply(Y,Z)),U),
    inference('REWRITE',[status(thm)],[376,951,theory(equality)]) ).

cnf(962,plain,
    multiply(inverse(multiply(inverse(multiply(X,Y)),multiply(X,Z))),multiply(inverse(multiply(U,Y)),V)) = multiply(inverse(multiply(U,Z)),V),
    inference('REWRITE',[status(thm)],[755,952,theory(equality)]) ).

cnf(963,plain,
    multiply(inverse(X),Y) = multiply(inverse(multiply(Z,X)),multiply(Z,Y)),
    inference('REWRITE',[status(thm)],[140,688,962,theory(equality)]) ).

cnf(970,plain,
    multiply(inverse(X),multiply(Y,inverse(multiply(inverse(Z),multiply(inverse(U),multiply(inverse(U),U)))))) = multiply(inverse(multiply(inverse(multiply(Y,U)),X)),Z),
    inference('REWRITE',[status(thm)],[25,963,theory(equality)]) ).

cnf(971,plain,
    multiply(inverse(multiply(inverse(X),X)),Y) = Y,
    inference('REWRITE',[status(thm)],[31,689,970,theory(equality)]) ).

cnf(972,plain,
    multiply(X,Y) = multiply(inverse(multiply(inverse(X),multiply(inverse(X),X))),Y),
    inference('REWRITE',[status(thm)],[913,971,theory(equality)]) ).

cnf(982,plain,
    multiply(X,inverse(multiply(inverse(multiply(inverse(multiply(Y,Z)),U)),multiply(inverse(Z),multiply(inverse(Z),Z))))) = multiply(inverse(multiply(Y,multiply(inverse(X),multiply(inverse(X),X)))),U),
    inference('REWRITE',[status(thm)],[821,972,theory(equality)]) ).

cnf(990,plain,
    inverse(multiply(inverse(X),multiply(inverse(Y),Y))) = X,
    inference('REWRITE',[status(thm)],[729,971,theory(equality)]) ).

cnf(1013,plain,
    multiply(X,inverse(multiply(inverse(Y),multiply(inverse(Z),multiply(inverse(Z),Z))))) = inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(X,Z)),multiply(inverse(multiply(U,V)),V))),Y)),multiply(inverse(V),multiply(U,V)))),
    inference('REWRITE',[status(thm)],[226,963,theory(equality)]) ).

cnf(1067,plain,
    multiply(inverse(multiply(X,Y)),multiply(Z,U)) = multiply(inverse(multiply(inverse(multiply(inverse(X),Z)),Y)),U),
    inference('REWRITE',[status(thm)],[946,990,963,theory(equality)]) ).

cnf(1068,plain,
    multiply(X,inverse(multiply(inverse(Y),multiply(inverse(Z),multiply(inverse(Z),Z))))) = inverse(multiply(inverse(multiply(multiply(X,Z),Y)),multiply(multiply(inverse(multiply(U,V)),V),multiply(inverse(V),multiply(U,V))))),
    inference('REWRITE',[status(thm)],[1013,1067,theory(equality)]) ).

cnf(1094,plain,
    multiply(multiply(inverse(X),Y),Z) = multiply(inverse(multiply(inverse(Y),X)),Z),
    inference('REWRITE',[status(thm)],[706,990,963,theory(equality)]) ).

cnf(1095,plain,
    multiply(X,inverse(multiply(inverse(Y),multiply(inverse(Z),multiply(inverse(Z),Z))))) = multiply(multiply(X,Z),Y),
    inference('REWRITE',[status(thm)],[1068,990,963,1094,theory(equality)]) ).

cnf(1096,plain,
    multiply(X,Y) = inverse(multiply(inverse(Y),multiply(inverse(X),multiply(inverse(X),X)))),
    inference('REWRITE',[status(thm)],[11,990,963,982,1095,theory(equality)]) ).

cnf(1148,plain,
    multiply(X,multiply(Y,Z)) = multiply(multiply(X,Y),Z),
    inference('REWRITE',[status(thm)],[1095,1096,theory(equality)]) ).

cnf(1149,plain,
    multiply(inverse(X),multiply(X,a2)) != a2,
    inference('REWRITE',[status(thm)],[678,1148,theory(equality)]) ).

cnf(1227,plain,
    multiply(X,multiply(Y,Z)) = inverse(multiply(inverse(multiply(inverse(multiply(inverse(Y),U)),Z)),multiply(inverse(multiply(X,U)),multiply(inverse(U),U)))),
    inference('REWRITE',[status(thm)],[73,1096,963,theory(equality)]) ).

cnf(1233,plain,
    multiply(inverse(X),multiply(X,Y)) = Y,
    inference('REWRITE',[status(thm)],[71,1227,963,theory(equality)]) ).

cnf(1234,plain,
    $false,
    inference('REWRITE',[status(thm)],[1149,1233,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : GRP407-1 : TPTP v8.1.0. Released v2.6.0.
% 0.08/0.15  % Command  : run-snark %s %d
% 0.16/0.37  % Computer : n024.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 600
% 0.16/0.37  % DateTime : Mon Jun 13 17:39:48 EDT 2022
% 0.16/0.37  % CPUTime  : 
% 0.23/0.50  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.23/0.51  * 
% 0.23/0.51  * 
% 0.23/0.52  #<PACKAGE "SNARK-USER">
% 0.23/0.52  * 
% 0.23/0.52  SNARK-TPTP-OPTIONS
% 0.23/0.52  * 
% 0.23/0.52  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.23/0.52   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.23/0.52   (USE-FACTORING :POS)
% 0.23/0.52   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.23/0.52   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.23/0.52   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.23/0.52   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.23/0.52   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.23/0.52   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.23/0.52   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.23/0.52   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.23/0.52   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.23/0.52   (DECLARE-TPTP-SYMBOLS2))
% 0.23/0.52  * 
% 0.23/0.52  "."
% 0.23/0.52  * 
% 0.23/0.52  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T17:39:48
% 0.23/0.52  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n024.cluster.edu at 2022-06-13T17:39:48
% 1.62/1.78  
% 1.62/1.78  
% 1.62/1.78  #||
% 1.62/1.78  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.62/1.78  % SZS output start Refutation
% See solution above
% 1.64/1.80  ||#
% 1.64/1.80  
% 1.64/1.80  ; Summary of computation:
% 1.64/1.80  ;      3673 formulas have been input or derived (from 23 formulas).
% 1.64/1.80  ;      1234 (34%) were retained.  Of these,
% 1.64/1.80  ;         1054 (85%) were simplified or subsumed later,
% 1.64/1.80  ;          180 (15%) are still being kept.
% 1.64/1.80  ; 
% 1.64/1.80  ; Run time in seconds excluding printing time:
% 1.64/1.80  ;     0.001   0%   Read assertion file          (1 call)
% 1.64/1.80  ;     0.000   0%   Assert                       (2 calls)
% 1.64/1.80  ;     0.256  20%   Process new row              (3,170 calls)
% 1.64/1.80  ;     0.006   0%   Resolution                   (44 calls)
% 1.64/1.80  ;     0.104   8%   Paramodulation               (22 calls)
% 1.64/1.80  ;     0.370  29%   Forward simplification       (2,508 calls)
% 1.64/1.80  ;     0.333  26%   Backward simplification      (1,234 calls)
% 1.64/1.80  ;     0.152  12%   Ordering                     (12,552 calls)
% 1.64/1.80  ;     0.001   0%   Sortal reasoning             (32 calls)
% 1.64/1.80  ;     0.000   0%   Purity testing               (1 call)
% 1.64/1.80  ;     0.034   3%   Other
% 1.64/1.80  ;     1.257        Total
% 1.64/1.80  ;     1.278        Real time
% 1.64/1.80  ; 
% 1.64/1.80  ; Term-hash-array has 8,085 terms in all.
% 1.64/1.80  ; Feature-vector-row-index has 0 entries (0 at peak, 0 added, 0 deleted).
% 1.64/1.80  ; Feature-vector-row-index has 1 node (1 at peak, 1 added, 0 deleted).
% 1.64/1.80  ; Path-index has 1,207 entries (5,616 at peak, 9,135 added, 7,928 deleted).
% 1.64/1.80  ; Path-index has 5,159 nodes (6,512 at peak, 8,130 added, 2,971 deleted).
% 1.64/1.80  ; Trie-index has 1,207 entries (5,616 at peak, 9,135 added, 7,928 deleted).
% 1.64/1.80  ; Trie-index has 5,289 nodes (38,415 at peak, 60,429 added, 55,140 deleted).
% 1.64/1.80  ; Retrieved 11,819 generalization terms in 37,531 calls.
% 1.64/1.80  ; Retrieved 14,836 instance terms in 1,544 calls.
% 1.64/1.80  ; Retrieved 42,135 unifiable terms in 295 calls.
% 1.64/1.80  ; 
% 1.64/1.80  ; The agenda of backward simplifiable rows to process has 406 entries:
% 1.64/1.80  ;   406 with value 0
% 1.64/1.80  ; The agenda of rows to process has 68 entries:
% 1.64/1.80  ;     1 with value 32              4 with value 42               2 with value 53
% 1.64/1.80  ;     2 with value 35              6 with value 45               4 with value 56
% 1.64/1.80  ;     3 with value 36              3 with value 46               3 with value 57
% 1.64/1.80  ;     4 with value 37              1 with value 47               1 with value 62
% 1.64/1.80  ;     1 with value 38              8 with value 49               6 with value 63
% 1.64/1.80  ;     2 with value 39              4 with value 50               1 with value 66
% 1.64/1.80  ;     1 with value 40              1 with value 51               2 with value 76
% 1.64/1.80  ;     6 with value 41              2 with value 52
% 1.64/1.80  ; The agenda of rows to give has 178 entries:
% 1.64/1.80  ;     1 with value (4 15)          3 with value (4 33)           7 with value (4 46)
% 1.64/1.80  ;     1 with value (4 16)          6 with value (4 34)           5 with value (4 47)
% 1.64/1.80  ;     1 with value (4 20)          6 with value (4 35)           7 with value (4 48)
% 1.64/1.80  ;     1 with value (4 21)          7 with value (4 36)          10 with value (4 49)
% 1.64/1.80  ;     3 with value (4 23)          9 with value (4 37)           6 with value (4 50)
% 1.64/1.80  ;     1 with value (4 25)         15 with value (4 38)           3 with value (4 51)
% 1.64/1.80  ;     3 with value (4 26)         10 with value (4 39)           3 with value (4 52)
% 1.64/1.80  ;     2 with value (4 27)          5 with value (4 40)           6 with value (4 53)
% 1.64/1.80  ;     2 with value (4 28)          6 with value (4 41)           2 with value (4 54)
% 1.64/1.80  ;     7 with value (4 29)         10 with value (4 42)           1 with value (4 55)
% 1.64/1.80  ;     4 with value (4 30)          8 with value (4 43)           1 with value (4 57)
% 1.64/1.80  ;     1 with value (4 31)          4 with value (4 44)           1 with value (4 59)
% 1.64/1.80  ;     7 with value (4 32)          3 with value (4 45)
% 1.64/1.80  Evaluation took:
% 1.64/1.80    1.279 seconds of real time
% 1.64/1.80    1.216439 seconds of user run time
% 1.64/1.80    0.061871 seconds of system run time
% 1.64/1.80    [Run times include 0.13 seconds GC run time.]
% 1.64/1.80    0 calls to %EVAL
% 1.64/1.80    0 page faults and
% 1.64/1.80    97,308,392 bytes consed.
% 1.64/1.80  :PROOF-FOUND
% 1.64/1.80  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-13T17:39:50
% 1.64/1.80  :PROOF-FOUND
% 1.64/1.80  * 
%------------------------------------------------------------------------------