%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP190-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n020.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:39 AM UTC 2026
% Result : Unsatisfiable 0.18s 0.52s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of clauses : 65 ( 65 unt; 0 nHn; 25 RR)
% Number of literals : 65 ( 64 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
least_upper_bound(inverse(a),inverse(b)) != inverse(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p39a) ).
cnf(c2,axiom,
multiply(inverse(X2),X2) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).
cnf(c3,plain,
identity = multiply(inverse(X2),X2),
inference(symmetry,[status(thm)],[c2]) ).
cnf(c4,plain,
multiply(inverse(inverse(X2)),identity) = multiply(inverse(inverse(X2)),multiply(inverse(X2),X2)),
inference(congruence,[status(thm)],[c3]) ).
cnf(c5,axiom,
multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity) ).
cnf(c6,plain,
multiply(multiply(inverse(X2),X2),X3) = multiply(inverse(X2),multiply(X2,X3)),
inference(substitution,[status(thm)],[c5]) ).
cnf(c7,plain,
multiply(inverse(X3),multiply(X3,X2)) = multiply(multiply(inverse(X3),X3),X2),
inference(symmetry,[status(thm)],[c6]) ).
cnf(c8,plain,
multiply(multiply(inverse(X3),X3),X2) = multiply(identity,X2),
inference(congruence,[status(thm)],[c2]) ).
cnf(c9,axiom,
multiply(identity,X2) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).
cnf(c10,plain,
multiply(multiply(inverse(X3),X3),X2) = X2,
inference(transitivity,[status(thm)],[c8,c9]) ).
cnf(c11,plain,
multiply(inverse(X3),multiply(X3,X2)) = X2,
inference(transitivity,[status(thm)],[c7,c10]) ).
cnf(c12,plain,
multiply(inverse(inverse(X2)),multiply(inverse(X2),X2)) = X2,
inference(substitution,[status(thm)],[c11]) ).
cnf(c13,plain,
multiply(inverse(inverse(X2)),identity) = X2,
inference(transitivity,[status(thm)],[c4,c12]) ).
cnf(c14,plain,
multiply(inverse(inverse(least_upper_bound(inverse(a),inverse(b)))),identity) = least_upper_bound(inverse(a),inverse(b)),
inference(substitution,[status(thm)],[c13]) ).
cnf(c15,plain,
least_upper_bound(inverse(a),inverse(b)) = multiply(inverse(inverse(least_upper_bound(inverse(a),inverse(b)))),identity),
inference(symmetry,[status(thm)],[c14]) ).
cnf(c16,plain,
X2 = multiply(inverse(X3),multiply(X3,X2)),
inference(symmetry,[status(thm)],[c11]) ).
cnf(c17,plain,
multiply(inverse(inverse(X3)),X2) = multiply(inverse(inverse(X3)),multiply(inverse(X3),multiply(X3,X2))),
inference(congruence,[status(thm)],[c16]) ).
cnf(c18,plain,
multiply(inverse(inverse(X3)),multiply(inverse(X3),multiply(X3,X2))) = multiply(X3,X2),
inference(substitution,[status(thm)],[c11]) ).
cnf(c19,plain,
multiply(inverse(inverse(X3)),X2) = multiply(X3,X2),
inference(transitivity,[status(thm)],[c17,c18]) ).
cnf(c20,plain,
multiply(inverse(inverse(X2)),identity) = multiply(X2,identity),
inference(substitution,[status(thm)],[c19]) ).
cnf(c21,plain,
multiply(X2,identity) = multiply(inverse(inverse(X2)),identity),
inference(symmetry,[status(thm)],[c20]) ).
cnf(c22,plain,
multiply(X2,identity) = X2,
inference(transitivity,[status(thm)],[c21,c13]) ).
cnf(c23,plain,
multiply(inverse(least_upper_bound(inverse(a),inverse(b))),identity) = inverse(least_upper_bound(inverse(a),inverse(b))),
inference(substitution,[status(thm)],[c22]) ).
cnf(c24,plain,
inverse(least_upper_bound(inverse(a),inverse(b))) = multiply(inverse(least_upper_bound(inverse(a),inverse(b))),identity),
inference(symmetry,[status(thm)],[c23]) ).
cnf(c25,axiom,
least_upper_bound(X2,Y2) = least_upper_bound(Y2,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).
cnf(c26,plain,
least_upper_bound(inverse(X2),X3) = least_upper_bound(X3,inverse(X2)),
inference(substitution,[status(thm)],[c25]) ).
cnf(c27,plain,
least_upper_bound(X3,inverse(X2)) = least_upper_bound(inverse(X2),X3),
inference(symmetry,[status(thm)],[c26]) ).
cnf(c28,plain,
multiply(least_upper_bound(X3,inverse(X2)),X2) = multiply(least_upper_bound(inverse(X2),X3),X2),
inference(congruence,[status(thm)],[c27]) ).
cnf(c29,axiom,
multiply(least_upper_bound(Y2,Z2),X2) = least_upper_bound(multiply(Y2,X2),multiply(Z2,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_lub2) ).
cnf(c30,plain,
multiply(least_upper_bound(inverse(X2),X3),X2) = least_upper_bound(multiply(inverse(X2),X2),multiply(X3,X2)),
inference(substitution,[status(thm)],[c29]) ).
cnf(c31,plain,
least_upper_bound(multiply(inverse(X2),X2),multiply(X3,X2)) = least_upper_bound(identity,multiply(X3,X2)),
inference(congruence,[status(thm)],[c2]) ).
cnf(c32,plain,
multiply(least_upper_bound(inverse(X2),X3),X2) = least_upper_bound(identity,multiply(X3,X2)),
inference(transitivity,[status(thm)],[c30,c31]) ).
cnf(c33,plain,
multiply(least_upper_bound(X3,inverse(X2)),X2) = least_upper_bound(identity,multiply(X3,X2)),
inference(transitivity,[status(thm)],[c28,c32]) ).
cnf(c34,plain,
multiply(least_upper_bound(inverse(a),inverse(b)),b) = least_upper_bound(identity,multiply(inverse(a),b)),
inference(substitution,[status(thm)],[c33]) ).
cnf(c35,plain,
least_upper_bound(X2,X3) = least_upper_bound(X3,X2),
inference(substitution,[status(thm)],[c25]) ).
cnf(c36,plain,
least_upper_bound(X3,X2) = least_upper_bound(X2,X3),
inference(symmetry,[status(thm)],[c35]) ).
cnf(c37,plain,
multiply(inverse(X3),least_upper_bound(X3,X2)) = multiply(inverse(X3),least_upper_bound(X2,X3)),
inference(congruence,[status(thm)],[c36]) ).
cnf(c38,plain,
least_upper_bound(X3,X2) = least_upper_bound(X2,X3),
inference(substitution,[status(thm)],[c25]) ).
cnf(c39,plain,
least_upper_bound(X2,X3) = least_upper_bound(X3,X2),
inference(symmetry,[status(thm)],[c38]) ).
cnf(c40,plain,
multiply(inverse(X3),least_upper_bound(X2,X3)) = multiply(inverse(X3),least_upper_bound(X3,X2)),
inference(congruence,[status(thm)],[c39]) ).
cnf(c41,axiom,
multiply(X2,least_upper_bound(Y2,Z2)) = least_upper_bound(multiply(X2,Y2),multiply(X2,Z2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_lub1) ).
cnf(c42,plain,
multiply(inverse(X3),least_upper_bound(X3,X2)) = least_upper_bound(multiply(inverse(X3),X3),multiply(inverse(X3),X2)),
inference(substitution,[status(thm)],[c41]) ).
cnf(c43,plain,
least_upper_bound(multiply(inverse(X3),X3),multiply(inverse(X3),X2)) = least_upper_bound(identity,multiply(inverse(X3),X2)),
inference(congruence,[status(thm)],[c2]) ).
cnf(c44,plain,
multiply(inverse(X3),least_upper_bound(X3,X2)) = least_upper_bound(identity,multiply(inverse(X3),X2)),
inference(transitivity,[status(thm)],[c42,c43]) ).
cnf(c45,plain,
multiply(inverse(X3),least_upper_bound(X2,X3)) = least_upper_bound(identity,multiply(inverse(X3),X2)),
inference(transitivity,[status(thm)],[c40,c44]) ).
cnf(c46,plain,
multiply(inverse(X3),least_upper_bound(X3,X2)) = least_upper_bound(identity,multiply(inverse(X3),X2)),
inference(transitivity,[status(thm)],[c37,c45]) ).
cnf(c47,plain,
multiply(inverse(a),least_upper_bound(a,b)) = least_upper_bound(identity,multiply(inverse(a),b)),
inference(substitution,[status(thm)],[c46]) ).
cnf(c48,plain,
least_upper_bound(identity,multiply(inverse(a),b)) = multiply(inverse(a),least_upper_bound(a,b)),
inference(symmetry,[status(thm)],[c47]) ).
cnf(c49,axiom,
least_upper_bound(a,b) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).
cnf(c50,plain,
multiply(inverse(a),least_upper_bound(a,b)) = multiply(inverse(a),a),
inference(congruence,[status(thm)],[c49]) ).
cnf(c51,plain,
multiply(inverse(a),a) = identity,
inference(substitution,[status(thm)],[c2]) ).
cnf(c52,plain,
multiply(inverse(a),least_upper_bound(a,b)) = identity,
inference(transitivity,[status(thm)],[c50,c51]) ).
cnf(c53,plain,
least_upper_bound(identity,multiply(inverse(a),b)) = identity,
inference(transitivity,[status(thm)],[c48,c52]) ).
cnf(c54,plain,
multiply(least_upper_bound(inverse(a),inverse(b)),b) = identity,
inference(transitivity,[status(thm)],[c34,c53]) ).
cnf(c55,plain,
identity = multiply(least_upper_bound(inverse(a),inverse(b)),b),
inference(symmetry,[status(thm)],[c54]) ).
cnf(c56,plain,
multiply(inverse(least_upper_bound(inverse(a),inverse(b))),identity) = multiply(inverse(least_upper_bound(inverse(a),inverse(b))),multiply(least_upper_bound(inverse(a),inverse(b)),b)),
inference(congruence,[status(thm)],[c55]) ).
cnf(c57,plain,
multiply(inverse(least_upper_bound(inverse(a),inverse(b))),multiply(least_upper_bound(inverse(a),inverse(b)),b)) = b,
inference(substitution,[status(thm)],[c11]) ).
cnf(c58,plain,
multiply(inverse(least_upper_bound(inverse(a),inverse(b))),identity) = b,
inference(transitivity,[status(thm)],[c56,c57]) ).
cnf(c59,plain,
inverse(least_upper_bound(inverse(a),inverse(b))) = b,
inference(transitivity,[status(thm)],[c24,c58]) ).
cnf(c60,plain,
inverse(inverse(least_upper_bound(inverse(a),inverse(b)))) = inverse(b),
inference(congruence,[status(thm)],[c59]) ).
cnf(c61,plain,
multiply(inverse(inverse(least_upper_bound(inverse(a),inverse(b)))),identity) = multiply(inverse(b),identity),
inference(congruence,[status(thm)],[c60]) ).
cnf(c62,plain,
multiply(inverse(b),identity) = inverse(b),
inference(substitution,[status(thm)],[c22]) ).
cnf(c63,plain,
multiply(inverse(inverse(least_upper_bound(inverse(a),inverse(b)))),identity) = inverse(b),
inference(transitivity,[status(thm)],[c61,c62]) ).
cnf(c64,plain,
least_upper_bound(inverse(a),inverse(b)) = inverse(b),
inference(transitivity,[status(thm)],[c15,c63]) ).
cnf(c65,plain,
$false,
inference(resolution,[status(thm)],[c1,c64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP190-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n020.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 09:37:49 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.52 Command-line arguments: --flatten-regeneralise
% 0.18/0.52
% 0.18/0.52 % SZS status Unsatisfiable
% 0.18/0.52
% 0.18/0.52 % SZS output start CNFRefutation
% See solution above
% 0.18/0.55
% 0.18/0.55 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------