%------------------------------------------------------------------------------
% File : Toma---0.7
% Problem : GRP466-1 : TPTP v9.0.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Jul 15 06:44:07 AM UTC 2025
% Result : Unsatisfiable 0.21s 0.46s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 3 RR)
% Number of literals : 11 ( 10 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('theBenchmark.p',prove_these_axioms_1) ).
cnf(c1,axiom,
multiply(X,Y) = divide(X,inverse(Y)),
file('theBenchmark.p',multiply) ).
cnf(c2,axiom,
divide(divide(X,X),divide(Y,divide(divide(Z,divide(W,Y)),inverse(W)))) = Z,
file('theBenchmark.p',single_axiom) ).
cnf(c3,plain,
divide(divide(X,X),divide(divide(divide(Y,divide(Z,W)),inverse(Z)),divide(Y,inverse(W)))) = divide(V,V),
inference(equational,[status(thm)],[c2]) ).
cnf(c5,plain,
divide(divide(X,X),divide(divide(Y,inverse(Z)),divide(divide(W,W),inverse(divide(divide(Y,divide(V,Z)),inverse(V)))))) = divide(U,U),
inference(equational,[status(thm)],[c2,c3]) ).
cnf(c6,plain,
divide(X,X) = divide(divide(divide(Y,divide(Z,W)),inverse(Z)),divide(Y,inverse(W))),
inference(equational,[status(thm)],[c2,c5]) ).
cnf(c7,plain,
divide(divide(X,X),divide(Y,Y)) = divide(Z,Z),
inference(equational,[status(thm)],[c3,c6]) ).
cnf(c8,plain,
divide(divide(divide(X,X),divide(Y,Y)),divide(Z,Z)) = divide(W,W),
inference(equational,[status(thm)],[c7]) ).
cnf(c9,plain,
divide(X,X) = divide(Y,Y),
inference(equational,[status(thm)],[c7,c8]) ).
cnf(g1,plain,
multiply(inverse(a1),a1) = multiply(inverse(b1),b1),
inference(equational,[status(thm)],[c1,c9]) ).
cnf(g2,plain,
$false,
inference(resolution,[status(thm)],[g0,g1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP466-1 : TPTP v9.0.0. Released v2.6.0.
% 0.07/0.12 % Command : run_Leo-III %s %d THM
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Jul 14 08:29:34 EDT 2025
% 0.13/0.33 % CPUTime :
% 0.21/0.46 % SZS status Unsatisfiable
% 0.21/0.46 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------