%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP446-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n026.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:10:30 AM UTC 2026
% Result : Unsatisfiable 0.12s 0.45s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 4
% Syntax : Number of clauses : 71 ( 71 unt; 0 nHn; 3 RR)
% Number of literals : 71 ( 70 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 : 156 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(c2,axiom,
inverse(A) = divide(divide(B,B),A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(c3,plain,
inverse(X) = divide(divide(X,X),X),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
divide(inverse(X),X2) = divide(divide(divide(X,X),X),X2),
inference(congruence,[status(thm)],[c3]) ).
cnf(c5,plain,
divide(divide(inverse(X3),X),divide(inverse(X2),X)) = divide(divide(inverse(X3),X),divide(divide(divide(X2,X2),X2),X)),
inference(congruence,[status(thm)],[c4]) ).
cnf(c6,plain,
divide(X3,divide(divide(inverse(X2),X),divide(inverse(X3),X))) = divide(X3,divide(divide(inverse(X2),X),divide(divide(divide(X3,X3),X3),X))),
inference(congruence,[status(thm)],[c5]) ).
cnf(c7,plain,
inverse(X) = divide(divide(X2,X2),X),
inference(substitution,[status(thm)],[c2]) ).
cnf(c8,plain,
divide(inverse(X2),X) = divide(divide(divide(X3,X3),X2),X),
inference(congruence,[status(thm)],[c7]) ).
cnf(c9,plain,
divide(divide(inverse(X2),X),divide(divide(divide(X3,X3),X3),X)) = divide(divide(divide(divide(X3,X3),X2),X),divide(divide(divide(X3,X3),X3),X)),
inference(congruence,[status(thm)],[c8]) ).
cnf(c10,plain,
divide(X3,divide(divide(inverse(X2),X),divide(divide(divide(X3,X3),X3),X))) = divide(X3,divide(divide(divide(divide(X3,X3),X2),X),divide(divide(divide(X3,X3),X3),X))),
inference(congruence,[status(thm)],[c9]) ).
cnf(c11,axiom,
divide(A2,divide(divide(divide(divide(A2,A2),B2),C),divide(divide(divide(A2,A2),A2),C))) = B2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(c12,plain,
divide(X3,divide(divide(divide(divide(X3,X3),X2),X),divide(divide(divide(X3,X3),X3),X))) = X2,
inference(substitution,[status(thm)],[c11]) ).
cnf(c13,plain,
divide(X3,divide(divide(inverse(X2),X),divide(divide(divide(X3,X3),X3),X))) = X2,
inference(transitivity,[status(thm)],[c10,c12]) ).
cnf(c14,plain,
divide(X3,divide(divide(inverse(X2),X),divide(inverse(X3),X))) = X2,
inference(transitivity,[status(thm)],[c6,c13]) ).
cnf(c15,plain,
divide(X,divide(divide(inverse(multiply(multiply(inverse(X3),X3),X2)),X4),divide(inverse(X),X4))) = multiply(multiply(inverse(X3),X3),X2),
inference(substitution,[status(thm)],[c14]) ).
cnf(c16,plain,
multiply(multiply(inverse(X4),X4),X3) = divide(X2,divide(divide(inverse(multiply(multiply(inverse(X4),X4),X3)),X),divide(inverse(X2),X))),
inference(symmetry,[status(thm)],[c15]) ).
cnf(c17,axiom,
multiply(A2,B2) = divide(A2,divide(divide(C2,C2),B2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c18,plain,
multiply(X3,X2) = divide(X3,divide(divide(X,X),X2)),
inference(substitution,[status(thm)],[c17]) ).
cnf(c19,plain,
inverse(X2) = divide(divide(X,X),X2),
inference(substitution,[status(thm)],[c2]) ).
cnf(c20,plain,
divide(divide(X,X),X2) = inverse(X2),
inference(symmetry,[status(thm)],[c19]) ).
cnf(c21,plain,
divide(X3,divide(divide(X,X),X2)) = divide(X3,inverse(X2)),
inference(congruence,[status(thm)],[c20]) ).
cnf(c22,plain,
multiply(X2,X) = divide(X2,inverse(X)),
inference(transitivity,[status(thm)],[c18,c21]) ).
cnf(c23,plain,
multiply(multiply(inverse(X),X),X2) = divide(multiply(inverse(X),X),inverse(X2)),
inference(substitution,[status(thm)],[c22]) ).
cnf(c24,plain,
multiply(inverse(X),X) = divide(inverse(X),inverse(X)),
inference(substitution,[status(thm)],[c22]) ).
cnf(c25,plain,
divide(multiply(inverse(X2),X2),X) = divide(divide(inverse(X2),inverse(X2)),X),
inference(congruence,[status(thm)],[c24]) ).
cnf(c26,plain,
inverse(X) = divide(divide(inverse(X2),inverse(X2)),X),
inference(substitution,[status(thm)],[c2]) ).
cnf(c27,plain,
divide(divide(inverse(X2),inverse(X2)),X) = inverse(X),
inference(symmetry,[status(thm)],[c26]) ).
cnf(c28,plain,
divide(multiply(inverse(X2),X2),X) = inverse(X),
inference(transitivity,[status(thm)],[c25,c27]) ).
cnf(c29,plain,
divide(multiply(inverse(X),X),inverse(X2)) = inverse(inverse(X2)),
inference(substitution,[status(thm)],[c28]) ).
cnf(c30,plain,
multiply(multiply(inverse(X),X),X2) = inverse(inverse(X2)),
inference(transitivity,[status(thm)],[c23,c29]) ).
cnf(c31,plain,
multiply(multiply(inverse(X2),X2),X) = inverse(inverse(X)),
inference(substitution,[status(thm)],[c30]) ).
cnf(c32,plain,
inverse(multiply(multiply(inverse(X2),X2),X)) = inverse(inverse(inverse(X))),
inference(congruence,[status(thm)],[c31]) ).
cnf(c33,plain,
divide(inverse(multiply(multiply(inverse(X3),X3),X2)),X) = divide(inverse(inverse(inverse(X2))),X),
inference(congruence,[status(thm)],[c32]) ).
cnf(c34,plain,
inverse(divide(X,X)) = divide(divide(X,X),divide(X,X)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c35,plain,
divide(inverse(divide(X2,X2)),X) = divide(divide(divide(X2,X2),divide(X2,X2)),X),
inference(congruence,[status(thm)],[c34]) ).
cnf(c36,plain,
inverse(X) = divide(divide(divide(X2,X2),divide(X2,X2)),X),
inference(substitution,[status(thm)],[c2]) ).
cnf(c37,plain,
divide(divide(divide(X2,X2),divide(X2,X2)),X) = inverse(X),
inference(symmetry,[status(thm)],[c36]) ).
cnf(c38,plain,
divide(inverse(divide(X2,X2)),X) = inverse(X),
inference(transitivity,[status(thm)],[c35,c37]) ).
cnf(c39,plain,
divide(inverse(divide(X,X)),inverse(X2)) = inverse(inverse(X2)),
inference(substitution,[status(thm)],[c38]) ).
cnf(c40,plain,
inverse(inverse(X2)) = divide(inverse(divide(X,X)),inverse(X2)),
inference(symmetry,[status(thm)],[c39]) ).
cnf(c41,plain,
inverse(inverse(inverse(X2))) = inverse(divide(inverse(divide(X,X)),inverse(X2))),
inference(congruence,[status(thm)],[c40]) ).
cnf(c42,plain,
inverse(inverse(inverse(inverse(X2)))) = inverse(inverse(divide(inverse(divide(X,X)),inverse(X2)))),
inference(congruence,[status(thm)],[c41]) ).
cnf(c43,plain,
inverse(inverse(divide(inverse(divide(X,X)),inverse(X2)))) = divide(divide(X,X),inverse(divide(inverse(divide(X,X)),inverse(X2)))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c44,plain,
inverse(divide(inverse(X2),inverse(X))) = divide(divide(inverse(X),inverse(X)),divide(inverse(X2),inverse(X))),
inference(substitution,[status(thm)],[c2]) ).
cnf(c45,plain,
divide(X2,inverse(divide(inverse(X2),inverse(X)))) = divide(X2,divide(divide(inverse(X),inverse(X)),divide(inverse(X2),inverse(X)))),
inference(congruence,[status(thm)],[c44]) ).
cnf(c46,plain,
divide(X2,divide(divide(inverse(X),inverse(X)),divide(inverse(X2),inverse(X)))) = X,
inference(substitution,[status(thm)],[c14]) ).
cnf(c47,plain,
divide(X2,inverse(divide(inverse(X2),inverse(X)))) = X,
inference(transitivity,[status(thm)],[c45,c46]) ).
cnf(c48,plain,
divide(divide(X,X),inverse(divide(inverse(divide(X,X)),inverse(X2)))) = X2,
inference(substitution,[status(thm)],[c47]) ).
cnf(c49,plain,
inverse(inverse(divide(inverse(divide(X,X)),inverse(X2)))) = X2,
inference(transitivity,[status(thm)],[c43,c48]) ).
cnf(c50,plain,
inverse(inverse(inverse(inverse(X)))) = X,
inference(transitivity,[status(thm)],[c42,c49]) ).
cnf(c51,plain,
X = inverse(inverse(inverse(inverse(X)))),
inference(symmetry,[status(thm)],[c50]) ).
cnf(c52,plain,
divide(inverse(inverse(X2)),X) = divide(inverse(inverse(X2)),inverse(inverse(inverse(inverse(X))))),
inference(congruence,[status(thm)],[c51]) ).
cnf(c53,plain,
divide(X2,inverse(divide(inverse(X2),inverse(divide(inverse(inverse(X2)),inverse(X)))))) = divide(inverse(inverse(X2)),inverse(X)),
inference(substitution,[status(thm)],[c47]) ).
cnf(c54,plain,
divide(inverse(inverse(X2)),inverse(X)) = divide(X2,inverse(divide(inverse(X2),inverse(divide(inverse(inverse(X2)),inverse(X)))))),
inference(symmetry,[status(thm)],[c53]) ).
cnf(c55,plain,
divide(inverse(X2),inverse(divide(inverse(inverse(X2)),inverse(X)))) = X,
inference(substitution,[status(thm)],[c47]) ).
cnf(c56,plain,
inverse(divide(inverse(X2),inverse(divide(inverse(inverse(X2)),inverse(X))))) = inverse(X),
inference(congruence,[status(thm)],[c55]) ).
cnf(c57,plain,
divide(X2,inverse(divide(inverse(X2),inverse(divide(inverse(inverse(X2)),inverse(X)))))) = divide(X2,inverse(X)),
inference(congruence,[status(thm)],[c56]) ).
cnf(c58,plain,
divide(inverse(inverse(X2)),inverse(X)) = divide(X2,inverse(X)),
inference(transitivity,[status(thm)],[c54,c57]) ).
cnf(c59,plain,
divide(inverse(inverse(X2)),inverse(inverse(inverse(inverse(X))))) = divide(X2,inverse(inverse(inverse(inverse(X))))),
inference(substitution,[status(thm)],[c58]) ).
cnf(c60,plain,
divide(X2,inverse(inverse(inverse(inverse(X))))) = divide(X2,X),
inference(congruence,[status(thm)],[c50]) ).
cnf(c61,plain,
divide(inverse(inverse(X2)),inverse(inverse(inverse(inverse(X))))) = divide(X2,X),
inference(transitivity,[status(thm)],[c59,c60]) ).
cnf(c62,plain,
divide(inverse(inverse(X2)),X) = divide(X2,X),
inference(transitivity,[status(thm)],[c52,c61]) ).
cnf(c63,plain,
divide(inverse(inverse(inverse(X2))),X) = divide(inverse(X2),X),
inference(substitution,[status(thm)],[c62]) ).
cnf(c64,plain,
divide(inverse(multiply(multiply(inverse(X3),X3),X2)),X) = divide(inverse(X2),X),
inference(transitivity,[status(thm)],[c33,c63]) ).
cnf(c65,plain,
divide(divide(inverse(multiply(multiply(inverse(X4),X4),X3)),X),divide(inverse(X2),X)) = divide(divide(inverse(X3),X),divide(inverse(X2),X)),
inference(congruence,[status(thm)],[c64]) ).
cnf(c66,plain,
divide(X2,divide(divide(inverse(multiply(multiply(inverse(X4),X4),X3)),X),divide(inverse(X2),X))) = divide(X2,divide(divide(inverse(X3),X),divide(inverse(X2),X))),
inference(congruence,[status(thm)],[c65]) ).
cnf(c67,plain,
divide(X2,divide(divide(inverse(X3),X),divide(inverse(X2),X))) = X3,
inference(substitution,[status(thm)],[c14]) ).
cnf(c68,plain,
divide(X2,divide(divide(inverse(multiply(multiply(inverse(X4),X4),X3)),X),divide(inverse(X2),X))) = X3,
inference(transitivity,[status(thm)],[c66,c67]) ).
cnf(c69,plain,
multiply(multiply(inverse(X2),X2),X) = X,
inference(transitivity,[status(thm)],[c16,c68]) ).
cnf(c70,plain,
multiply(multiply(inverse(b2),b2),a2) = a2,
inference(substitution,[status(thm)],[c69]) ).
cnf(c71,plain,
$false,
inference(resolution,[status(thm)],[c1,c70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP446-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n026.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:41 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.45 Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.12/0.45
% 0.12/0.45 % SZS status Unsatisfiable
% 0.12/0.45
% 0.12/0.46 % SZS output start CNFRefutation
% See solution above
% 0.12/0.51
% 0.12/0.51 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------