%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP181-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n014.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:09:35 AM UTC 2026
% Result : Unsatisfiable 1.33s 0.63s
% Output : CNFRefutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 13
% Syntax : Number of clauses : 89 ( 89 unt; 0 nHn; 42 RR)
% Number of literals : 89 ( 88 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 90 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
a != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p12x) ).
cnf(c2,axiom,
multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity) ).
cnf(c3,plain,
multiply(multiply(inverse(X3),X3),X2) = multiply(inverse(X3),multiply(X3,X2)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
multiply(inverse(X3),multiply(X3,X2)) = multiply(multiply(inverse(X3),X3),X2),
inference(symmetry,[status(thm)],[c3]) ).
cnf(c5,axiom,
multiply(inverse(X2),X2) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c6,axiom,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c7,plain,
identity = inverse(identity),
inference(symmetry,[status(thm)],[c6]) ).
cnf(c8,plain,
multiply(inverse(X2),X2) = inverse(identity),
inference(transitivity,[status(thm)],[c5,c7]) ).
cnf(c9,plain,
multiply(multiply(inverse(X3),X3),X2) = multiply(inverse(identity),X2),
inference(congruence,[status(thm)],[c8]) ).
cnf(c10,plain,
multiply(inverse(identity),X2) = multiply(identity,X2),
inference(congruence,[status(thm)],[c6]) ).
cnf(c11,axiom,
multiply(identity,X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c12,plain,
multiply(inverse(identity),X2) = X2,
inference(transitivity,[status(thm)],[c10,c11]) ).
cnf(c13,plain,
multiply(multiply(inverse(X3),X3),X2) = X2,
inference(transitivity,[status(thm)],[c9,c12]) ).
cnf(c14,plain,
multiply(inverse(X3),multiply(X3,X2)) = X2,
inference(transitivity,[status(thm)],[c4,c13]) ).
cnf(c15,plain,
multiply(inverse(inverse(greatest_lower_bound(a,c))),multiply(inverse(greatest_lower_bound(a,c)),b)) = b,
inference(substitution,[status(thm)],[c14]) ).
cnf(c16,plain,
b = multiply(inverse(inverse(greatest_lower_bound(a,c))),multiply(inverse(greatest_lower_bound(a,c)),b)),
inference(symmetry,[status(thm)],[c15]) ).
cnf(c17,hypothesis,
inverse(inverse(X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12x_2) ).
cnf(c18,plain,
inverse(inverse(b)) = b,
inference(substitution,[status(thm)],[c17]) ).
cnf(c19,plain,
b = inverse(inverse(b)),
inference(symmetry,[status(thm)],[c18]) ).
cnf(c20,plain,
multiply(inverse(greatest_lower_bound(a,c)),b) = multiply(inverse(greatest_lower_bound(a,c)),inverse(inverse(b))),
inference(congruence,[status(thm)],[c19]) ).
cnf(c21,hypothesis,
inverse(multiply(X2,Y2)) = multiply(inverse(Y2),inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12x_3) ).
cnf(c22,plain,
inverse(multiply(inverse(b),greatest_lower_bound(a,c))) = multiply(inverse(greatest_lower_bound(a,c)),inverse(inverse(b))),
inference(substitution,[status(thm)],[c21]) ).
cnf(c23,plain,
multiply(inverse(greatest_lower_bound(a,c)),inverse(inverse(b))) = inverse(multiply(inverse(b),greatest_lower_bound(a,c))),
inference(symmetry,[status(thm)],[c22]) ).
cnf(c24,axiom,
least_upper_bound(a,c) = least_upper_bound(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c25,plain,
inverse(least_upper_bound(a,c)) = inverse(least_upper_bound(b,c)),
inference(congruence,[status(thm)],[c24]) ).
cnf(c26,hypothesis,
inverse(least_upper_bound(X2,Y2)) = greatest_lower_bound(inverse(X2),inverse(Y2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12x_7) ).
cnf(c27,plain,
inverse(least_upper_bound(b,c)) = greatest_lower_bound(inverse(b),inverse(c)),
inference(substitution,[status(thm)],[c26]) ).
cnf(c28,plain,
inverse(least_upper_bound(a,c)) = greatest_lower_bound(inverse(b),inverse(c)),
inference(transitivity,[status(thm)],[c25,c27]) ).
cnf(c29,plain,
multiply(inverse(least_upper_bound(a,c)),c) = multiply(greatest_lower_bound(inverse(b),inverse(c)),c),
inference(congruence,[status(thm)],[c28]) ).
cnf(c30,axiom,
greatest_lower_bound(X2,Y2) = greatest_lower_bound(Y2,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).
cnf(c31,plain,
greatest_lower_bound(inverse(X2),X3) = greatest_lower_bound(X3,inverse(X2)),
inference(substitution,[status(thm)],[c30]) ).
cnf(c32,plain,
greatest_lower_bound(X3,inverse(X2)) = greatest_lower_bound(inverse(X2),X3),
inference(symmetry,[status(thm)],[c31]) ).
cnf(c33,plain,
multiply(greatest_lower_bound(X3,inverse(X2)),X2) = multiply(greatest_lower_bound(inverse(X2),X3),X2),
inference(congruence,[status(thm)],[c32]) ).
cnf(c34,axiom,
multiply(greatest_lower_bound(Y2,Z2),X2) = greatest_lower_bound(multiply(Y2,X2),multiply(Z2,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_glb2) ).
cnf(c35,plain,
multiply(greatest_lower_bound(inverse(X2),X3),X2) = greatest_lower_bound(multiply(inverse(X2),X2),multiply(X3,X2)),
inference(substitution,[status(thm)],[c34]) ).
cnf(c36,plain,
greatest_lower_bound(multiply(inverse(X2),X2),multiply(X3,X2)) = greatest_lower_bound(inverse(identity),multiply(X3,X2)),
inference(congruence,[status(thm)],[c8]) ).
cnf(c37,plain,
multiply(greatest_lower_bound(inverse(X2),X3),X2) = greatest_lower_bound(inverse(identity),multiply(X3,X2)),
inference(transitivity,[status(thm)],[c35,c36]) ).
cnf(c38,plain,
multiply(greatest_lower_bound(X3,inverse(X2)),X2) = greatest_lower_bound(inverse(identity),multiply(X3,X2)),
inference(transitivity,[status(thm)],[c33,c37]) ).
cnf(c39,plain,
multiply(greatest_lower_bound(inverse(b),inverse(c)),c) = greatest_lower_bound(inverse(identity),multiply(inverse(b),c)),
inference(substitution,[status(thm)],[c38]) ).
cnf(c40,plain,
multiply(inverse(least_upper_bound(a,c)),c) = greatest_lower_bound(inverse(identity),multiply(inverse(b),c)),
inference(transitivity,[status(thm)],[c29,c39]) ).
cnf(c41,axiom,
multiply(X2,greatest_lower_bound(Y2,Z2)) = greatest_lower_bound(multiply(X2,Y2),multiply(X2,Z2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_glb1) ).
cnf(c42,plain,
multiply(inverse(X3),greatest_lower_bound(X3,X2)) = greatest_lower_bound(multiply(inverse(X3),X3),multiply(inverse(X3),X2)),
inference(substitution,[status(thm)],[c41]) ).
cnf(c43,plain,
greatest_lower_bound(multiply(inverse(X3),X3),multiply(inverse(X3),X2)) = greatest_lower_bound(inverse(identity),multiply(inverse(X3),X2)),
inference(congruence,[status(thm)],[c8]) ).
cnf(c44,plain,
multiply(inverse(X3),greatest_lower_bound(X3,X2)) = greatest_lower_bound(inverse(identity),multiply(inverse(X3),X2)),
inference(transitivity,[status(thm)],[c42,c43]) ).
cnf(c45,plain,
multiply(inverse(b),greatest_lower_bound(b,c)) = greatest_lower_bound(inverse(identity),multiply(inverse(b),c)),
inference(substitution,[status(thm)],[c44]) ).
cnf(c46,plain,
greatest_lower_bound(inverse(identity),multiply(inverse(b),c)) = multiply(inverse(b),greatest_lower_bound(b,c)),
inference(symmetry,[status(thm)],[c45]) ).
cnf(c47,axiom,
greatest_lower_bound(a,c) = greatest_lower_bound(b,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c48,plain,
greatest_lower_bound(b,c) = greatest_lower_bound(a,c),
inference(symmetry,[status(thm)],[c47]) ).
cnf(c49,plain,
multiply(inverse(b),greatest_lower_bound(b,c)) = multiply(inverse(b),greatest_lower_bound(a,c)),
inference(congruence,[status(thm)],[c48]) ).
cnf(c50,plain,
greatest_lower_bound(inverse(identity),multiply(inverse(b),c)) = multiply(inverse(b),greatest_lower_bound(a,c)),
inference(transitivity,[status(thm)],[c46,c49]) ).
cnf(c51,plain,
multiply(inverse(least_upper_bound(a,c)),c) = multiply(inverse(b),greatest_lower_bound(a,c)),
inference(transitivity,[status(thm)],[c40,c50]) ).
cnf(c52,plain,
multiply(inverse(b),greatest_lower_bound(a,c)) = multiply(inverse(least_upper_bound(a,c)),c),
inference(symmetry,[status(thm)],[c51]) ).
cnf(c53,plain,
inverse(multiply(inverse(b),greatest_lower_bound(a,c))) = inverse(multiply(inverse(least_upper_bound(a,c)),c)),
inference(congruence,[status(thm)],[c52]) ).
cnf(c54,plain,
inverse(multiply(inverse(least_upper_bound(a,c)),c)) = multiply(inverse(c),inverse(inverse(least_upper_bound(a,c)))),
inference(substitution,[status(thm)],[c21]) ).
cnf(c55,plain,
inverse(inverse(least_upper_bound(a,c))) = least_upper_bound(a,c),
inference(substitution,[status(thm)],[c17]) ).
cnf(c56,plain,
multiply(inverse(c),inverse(inverse(least_upper_bound(a,c)))) = multiply(inverse(c),least_upper_bound(a,c)),
inference(congruence,[status(thm)],[c55]) ).
cnf(c57,plain,
X2 = inverse(inverse(X2)),
inference(symmetry,[status(thm)],[c17]) ).
cnf(c58,plain,
multiply(inverse(greatest_lower_bound(X2,X3)),X2) = multiply(inverse(greatest_lower_bound(X2,X3)),inverse(inverse(X2))),
inference(congruence,[status(thm)],[c57]) ).
cnf(c59,plain,
inverse(multiply(inverse(X2),greatest_lower_bound(X2,X3))) = multiply(inverse(greatest_lower_bound(X2,X3)),inverse(inverse(X2))),
inference(substitution,[status(thm)],[c21]) ).
cnf(c60,plain,
multiply(inverse(greatest_lower_bound(X2,X3)),inverse(inverse(X2))) = inverse(multiply(inverse(X2),greatest_lower_bound(X2,X3))),
inference(symmetry,[status(thm)],[c59]) ).
cnf(c61,plain,
inverse(least_upper_bound(X3,X2)) = greatest_lower_bound(inverse(X3),inverse(X2)),
inference(substitution,[status(thm)],[c26]) ).
cnf(c62,plain,
multiply(inverse(least_upper_bound(X3,X2)),X2) = multiply(greatest_lower_bound(inverse(X3),inverse(X2)),X2),
inference(congruence,[status(thm)],[c61]) ).
cnf(c63,plain,
multiply(greatest_lower_bound(inverse(X3),inverse(X2)),X2) = greatest_lower_bound(inverse(identity),multiply(inverse(X3),X2)),
inference(substitution,[status(thm)],[c38]) ).
cnf(c64,plain,
multiply(inverse(least_upper_bound(X3,X2)),X2) = greatest_lower_bound(inverse(identity),multiply(inverse(X3),X2)),
inference(transitivity,[status(thm)],[c62,c63]) ).
cnf(c65,plain,
greatest_lower_bound(inverse(identity),multiply(inverse(X3),X2)) = multiply(inverse(X3),greatest_lower_bound(X3,X2)),
inference(symmetry,[status(thm)],[c44]) ).
cnf(c66,plain,
multiply(inverse(least_upper_bound(X3,X2)),X2) = multiply(inverse(X3),greatest_lower_bound(X3,X2)),
inference(transitivity,[status(thm)],[c64,c65]) ).
cnf(c67,plain,
multiply(inverse(least_upper_bound(X2,X3)),X3) = multiply(inverse(X2),greatest_lower_bound(X2,X3)),
inference(substitution,[status(thm)],[c66]) ).
cnf(c68,plain,
multiply(inverse(X2),greatest_lower_bound(X2,X3)) = multiply(inverse(least_upper_bound(X2,X3)),X3),
inference(symmetry,[status(thm)],[c67]) ).
cnf(c69,plain,
inverse(multiply(inverse(X2),greatest_lower_bound(X2,X3))) = inverse(multiply(inverse(least_upper_bound(X2,X3)),X3)),
inference(congruence,[status(thm)],[c68]) ).
cnf(c70,plain,
inverse(multiply(inverse(least_upper_bound(X2,X3)),X3)) = multiply(inverse(X3),inverse(inverse(least_upper_bound(X2,X3)))),
inference(substitution,[status(thm)],[c21]) ).
cnf(c71,plain,
inverse(inverse(least_upper_bound(X2,X3))) = least_upper_bound(X2,X3),
inference(substitution,[status(thm)],[c17]) ).
cnf(c72,plain,
multiply(inverse(X3),inverse(inverse(least_upper_bound(X2,X3)))) = multiply(inverse(X3),least_upper_bound(X2,X3)),
inference(congruence,[status(thm)],[c71]) ).
cnf(c73,plain,
inverse(multiply(inverse(least_upper_bound(X2,X3)),X3)) = multiply(inverse(X3),least_upper_bound(X2,X3)),
inference(transitivity,[status(thm)],[c70,c72]) ).
cnf(c74,plain,
inverse(multiply(inverse(X2),greatest_lower_bound(X2,X3))) = multiply(inverse(X3),least_upper_bound(X2,X3)),
inference(transitivity,[status(thm)],[c69,c73]) ).
cnf(c75,plain,
multiply(inverse(greatest_lower_bound(X2,X3)),inverse(inverse(X2))) = multiply(inverse(X3),least_upper_bound(X2,X3)),
inference(transitivity,[status(thm)],[c60,c74]) ).
cnf(c76,plain,
multiply(inverse(greatest_lower_bound(X2,X3)),X2) = multiply(inverse(X3),least_upper_bound(X2,X3)),
inference(transitivity,[status(thm)],[c58,c75]) ).
cnf(c77,plain,
multiply(inverse(greatest_lower_bound(a,c)),a) = multiply(inverse(c),least_upper_bound(a,c)),
inference(substitution,[status(thm)],[c76]) ).
cnf(c78,plain,
multiply(inverse(c),least_upper_bound(a,c)) = multiply(inverse(greatest_lower_bound(a,c)),a),
inference(symmetry,[status(thm)],[c77]) ).
cnf(c79,plain,
multiply(inverse(c),inverse(inverse(least_upper_bound(a,c)))) = multiply(inverse(greatest_lower_bound(a,c)),a),
inference(transitivity,[status(thm)],[c56,c78]) ).
cnf(c80,plain,
inverse(multiply(inverse(least_upper_bound(a,c)),c)) = multiply(inverse(greatest_lower_bound(a,c)),a),
inference(transitivity,[status(thm)],[c54,c79]) ).
cnf(c81,plain,
inverse(multiply(inverse(b),greatest_lower_bound(a,c))) = multiply(inverse(greatest_lower_bound(a,c)),a),
inference(transitivity,[status(thm)],[c53,c80]) ).
cnf(c82,plain,
multiply(inverse(greatest_lower_bound(a,c)),inverse(inverse(b))) = multiply(inverse(greatest_lower_bound(a,c)),a),
inference(transitivity,[status(thm)],[c23,c81]) ).
cnf(c83,plain,
multiply(inverse(greatest_lower_bound(a,c)),b) = multiply(inverse(greatest_lower_bound(a,c)),a),
inference(transitivity,[status(thm)],[c20,c82]) ).
cnf(c84,plain,
multiply(inverse(inverse(greatest_lower_bound(a,c))),multiply(inverse(greatest_lower_bound(a,c)),b)) = multiply(inverse(inverse(greatest_lower_bound(a,c))),multiply(inverse(greatest_lower_bound(a,c)),a)),
inference(congruence,[status(thm)],[c83]) ).
cnf(c85,plain,
multiply(inverse(inverse(greatest_lower_bound(a,c))),multiply(inverse(greatest_lower_bound(a,c)),a)) = a,
inference(substitution,[status(thm)],[c14]) ).
cnf(c86,plain,
multiply(inverse(inverse(greatest_lower_bound(a,c))),multiply(inverse(greatest_lower_bound(a,c)),b)) = a,
inference(transitivity,[status(thm)],[c84,c85]) ).
cnf(c87,plain,
b = a,
inference(transitivity,[status(thm)],[c16,c86]) ).
cnf(c88,plain,
a = b,
inference(symmetry,[status(thm)],[c87]) ).
cnf(c89,plain,
$false,
inference(resolution,[status(thm)],[c1,c88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP181-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n014.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 27 09:36:01 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.33/0.63 Command-line arguments: --flatten --complete-subsets
% 1.33/0.63
% 1.33/0.63 % SZS status Unsatisfiable
% 1.33/0.63
% 1.33/0.64 % SZS output start CNFRefutation
% See solution above
% 1.73/0.68
% 1.73/0.68 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------