%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP521-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 10:11:08 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.43s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of clauses : 47 ( 47 unt; 0 nHn; 3 RR)
% Number of literals : 47 ( 46 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 97 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(c2,axiom,
inverse(A) = divide(divide(B,B),A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(c3,plain,
inverse(X2) = divide(divide(X,X),X2),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
divide(X3,inverse(X2)) = divide(X3,divide(divide(X,X),X2)),
inference(congruence,[status(thm)],[c3]) ).
cnf(c5,axiom,
multiply(A2,B2) = divide(A2,divide(divide(C,C),B2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c6,plain,
multiply(X3,X2) = divide(X3,divide(divide(X,X),X2)),
inference(substitution,[status(thm)],[c5]) ).
cnf(c7,plain,
divide(X3,divide(divide(X,X),X2)) = multiply(X3,X2),
inference(symmetry,[status(thm)],[c6]) ).
cnf(c8,plain,
divide(X2,inverse(X)) = multiply(X2,X),
inference(transitivity,[status(thm)],[c4,c7]) ).
cnf(c9,plain,
divide(inverse(X),inverse(X)) = multiply(inverse(X),X),
inference(substitution,[status(thm)],[c8]) ).
cnf(c10,plain,
multiply(inverse(X),X) = divide(inverse(X),inverse(X)),
inference(symmetry,[status(thm)],[c9]) ).
cnf(c11,plain,
divide(X,inverse(X2)) = multiply(X,X2),
inference(substitution,[status(thm)],[c8]) ).
cnf(c12,plain,
multiply(X,X2) = divide(X,inverse(X2)),
inference(symmetry,[status(thm)],[c11]) ).
cnf(c13,plain,
divide(X2,multiply(X,X2)) = divide(X2,divide(X,inverse(X2))),
inference(congruence,[status(thm)],[c12]) ).
cnf(c14,plain,
inverse(divide(X2,multiply(X,X2))) = inverse(divide(X2,divide(X,inverse(X2)))),
inference(congruence,[status(thm)],[c13]) ).
cnf(c15,plain,
inverse(X2) = divide(divide(X,X),X2),
inference(substitution,[status(thm)],[c2]) ).
cnf(c16,plain,
divide(X2,inverse(X3)) = divide(X2,divide(divide(X,X),X3)),
inference(congruence,[status(thm)],[c15]) ).
cnf(c17,plain,
divide(X3,divide(X2,inverse(X3))) = divide(X3,divide(X2,divide(divide(X,X),X3))),
inference(congruence,[status(thm)],[c16]) ).
cnf(c18,plain,
inverse(divide(X3,divide(X2,inverse(X3)))) = inverse(divide(X3,divide(X2,divide(divide(X,X),X3)))),
inference(congruence,[status(thm)],[c17]) ).
cnf(c19,plain,
inverse(divide(X3,divide(X2,divide(divide(X,X),X3)))) = divide(divide(X,X),divide(X3,divide(X2,divide(divide(X,X),X3)))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c20,axiom,
divide(A2,divide(B2,divide(C2,divide(A2,B2)))) = C2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(c21,plain,
divide(divide(X,X),divide(X3,divide(X2,divide(divide(X,X),X3)))) = X2,
inference(substitution,[status(thm)],[c20]) ).
cnf(c22,plain,
inverse(divide(X3,divide(X2,divide(divide(X,X),X3)))) = X2,
inference(transitivity,[status(thm)],[c19,c21]) ).
cnf(c23,plain,
inverse(divide(X2,divide(X,inverse(X2)))) = X,
inference(transitivity,[status(thm)],[c18,c22]) ).
cnf(c24,plain,
inverse(divide(X2,multiply(X,X2))) = X,
inference(transitivity,[status(thm)],[c14,c23]) ).
cnf(c25,plain,
inverse(divide(X,multiply(divide(X2,X2),X))) = divide(X2,X2),
inference(substitution,[status(thm)],[c24]) ).
cnf(c26,plain,
divide(X2,X2) = inverse(divide(X,multiply(divide(X2,X2),X))),
inference(symmetry,[status(thm)],[c25]) ).
cnf(c27,plain,
divide(divide(X2,X2),inverse(X)) = multiply(divide(X2,X2),X),
inference(substitution,[status(thm)],[c8]) ).
cnf(c28,plain,
multiply(divide(X2,X2),X) = divide(divide(X2,X2),inverse(X)),
inference(symmetry,[status(thm)],[c27]) ).
cnf(c29,plain,
inverse(inverse(X)) = divide(divide(X2,X2),inverse(X)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c30,plain,
divide(divide(X2,X2),inverse(X)) = inverse(inverse(X)),
inference(symmetry,[status(thm)],[c29]) ).
cnf(c31,plain,
multiply(divide(X2,X2),X) = inverse(inverse(X)),
inference(transitivity,[status(thm)],[c28,c30]) ).
cnf(c32,plain,
divide(X,multiply(divide(X2,X2),X)) = divide(X,inverse(inverse(X))),
inference(congruence,[status(thm)],[c31]) ).
cnf(c33,plain,
inverse(divide(X,multiply(divide(X2,X2),X))) = inverse(divide(X,inverse(inverse(X)))),
inference(congruence,[status(thm)],[c32]) ).
cnf(c34,plain,
inverse(inverse(X)) = multiply(divide(X2,X2),X),
inference(symmetry,[status(thm)],[c31]) ).
cnf(c35,plain,
divide(X,inverse(inverse(X))) = divide(X,multiply(divide(X2,X2),X)),
inference(congruence,[status(thm)],[c34]) ).
cnf(c36,plain,
inverse(divide(X,inverse(inverse(X)))) = inverse(divide(X,multiply(divide(X2,X2),X))),
inference(congruence,[status(thm)],[c35]) ).
cnf(c37,plain,
inverse(divide(X,multiply(divide(X2,X2),X))) = divide(X2,X2),
inference(substitution,[status(thm)],[c24]) ).
cnf(c38,plain,
inverse(divide(X,inverse(inverse(X)))) = divide(X2,X2),
inference(transitivity,[status(thm)],[c36,c37]) ).
cnf(c39,plain,
inverse(divide(X,multiply(divide(X2,X2),X))) = divide(X3,X3),
inference(transitivity,[status(thm)],[c33,c38]) ).
cnf(c40,plain,
divide(X,X) = divide(X2,X2),
inference(transitivity,[status(thm)],[c26,c39]) ).
cnf(c41,plain,
divide(inverse(X2),inverse(X2)) = divide(inverse(X),inverse(X)),
inference(substitution,[status(thm)],[c40]) ).
cnf(c42,plain,
divide(inverse(X),inverse(X)) = divide(inverse(X2),inverse(X2)),
inference(symmetry,[status(thm)],[c41]) ).
cnf(c43,plain,
divide(inverse(X),inverse(X)) = multiply(inverse(X),X),
inference(substitution,[status(thm)],[c8]) ).
cnf(c44,plain,
divide(inverse(X),inverse(X)) = multiply(inverse(X2),X2),
inference(transitivity,[status(thm)],[c42,c43]) ).
cnf(c45,plain,
multiply(inverse(X),X) = multiply(inverse(X2),X2),
inference(transitivity,[status(thm)],[c10,c44]) ).
cnf(c46,plain,
multiply(inverse(a1),a1) = multiply(inverse(b1),b1),
inference(substitution,[status(thm)],[c45]) ).
cnf(c47,plain,
$false,
inference(resolution,[status(thm)],[c1,c46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP521-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n008.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 27 10:07:39 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.43 Command-line arguments: --no-flatten-goal
% 0.12/0.43
% 0.12/0.43 % SZS status Unsatisfiable
% 0.12/0.43
% 0.12/0.43 % SZS output start CNFRefutation
% See solution above
% 0.12/0.45
% 0.12/0.45 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------