%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP167-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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:30 AM UTC 2026
% Result : Unsatisfiable 0.60s 0.58s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 15
% Syntax : Number of clauses : 209 ( 209 unt; 0 nHn; 4 RR)
% Number of literals : 209 ( 208 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 312 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
a != multiply(positive_part(a),negative_part(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lat4) ).
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,plain,
multiply(multiply(inverse(X3),X3),X2) = multiply(identity,X2),
inference(congruence,[status(thm)],[c5]) ).
cnf(c7,axiom,
multiply(identity,X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c8,plain,
multiply(multiply(inverse(X3),X3),X2) = X2,
inference(transitivity,[status(thm)],[c6,c7]) ).
cnf(c9,plain,
multiply(inverse(X3),multiply(X3,X2)) = X2,
inference(transitivity,[status(thm)],[c4,c8]) ).
cnf(c10,plain,
X2 = multiply(inverse(X3),multiply(X3,X2)),
inference(symmetry,[status(thm)],[c9]) ).
cnf(c11,plain,
multiply(inverse(inverse(X3)),X2) = multiply(inverse(inverse(X3)),multiply(inverse(X3),multiply(X3,X2))),
inference(congruence,[status(thm)],[c10]) ).
cnf(c12,plain,
multiply(inverse(inverse(X3)),multiply(inverse(X3),multiply(X3,X2))) = multiply(X3,X2),
inference(substitution,[status(thm)],[c9]) ).
cnf(c13,plain,
multiply(inverse(inverse(X3)),X2) = multiply(X3,X2),
inference(transitivity,[status(thm)],[c11,c12]) ).
cnf(c14,plain,
multiply(inverse(inverse(X2)),identity) = multiply(X2,identity),
inference(substitution,[status(thm)],[c13]) ).
cnf(c15,plain,
multiply(X2,identity) = multiply(inverse(inverse(X2)),identity),
inference(symmetry,[status(thm)],[c14]) ).
cnf(c16,plain,
identity = multiply(inverse(X2),X2),
inference(symmetry,[status(thm)],[c5]) ).
cnf(c17,plain,
multiply(inverse(inverse(X2)),identity) = multiply(inverse(inverse(X2)),multiply(inverse(X2),X2)),
inference(congruence,[status(thm)],[c16]) ).
cnf(c18,plain,
multiply(inverse(inverse(X2)),multiply(inverse(X2),X2)) = X2,
inference(substitution,[status(thm)],[c9]) ).
cnf(c19,plain,
multiply(inverse(inverse(X2)),identity) = X2,
inference(transitivity,[status(thm)],[c17,c18]) ).
cnf(c20,plain,
multiply(X2,identity) = X2,
inference(transitivity,[status(thm)],[c15,c19]) ).
cnf(c21,plain,
multiply(inverse(negative_part(inverse(X2))),identity) = inverse(negative_part(inverse(X2))),
inference(substitution,[status(thm)],[c20]) ).
cnf(c22,plain,
inverse(negative_part(inverse(X2))) = multiply(inverse(negative_part(inverse(X2))),identity),
inference(symmetry,[status(thm)],[c21]) ).
cnf(c23,axiom,
negative_part(X2) = greatest_lower_bound(X2,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat4_2) ).
cnf(c24,plain,
negative_part(negative_part(X2)) = greatest_lower_bound(negative_part(X2),identity),
inference(substitution,[status(thm)],[c23]) ).
cnf(c25,axiom,
greatest_lower_bound(X2,Y2) = greatest_lower_bound(Y2,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).
cnf(c26,plain,
greatest_lower_bound(X2,identity) = greatest_lower_bound(identity,X2),
inference(substitution,[status(thm)],[c25]) ).
cnf(c27,plain,
greatest_lower_bound(identity,X2) = greatest_lower_bound(X2,identity),
inference(symmetry,[status(thm)],[c26]) ).
cnf(c28,plain,
greatest_lower_bound(X2,identity) = negative_part(X2),
inference(symmetry,[status(thm)],[c23]) ).
cnf(c29,plain,
greatest_lower_bound(identity,X2) = negative_part(X2),
inference(transitivity,[status(thm)],[c27,c28]) ).
cnf(c30,plain,
negative_part(X2) = greatest_lower_bound(identity,X2),
inference(symmetry,[status(thm)],[c29]) ).
cnf(c31,plain,
positive_part(negative_part(X2)) = positive_part(greatest_lower_bound(identity,X2)),
inference(congruence,[status(thm)],[c30]) ).
cnf(c32,axiom,
least_upper_bound(X2,Y2) = least_upper_bound(Y2,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).
cnf(c33,plain,
least_upper_bound(X2,identity) = least_upper_bound(identity,X2),
inference(substitution,[status(thm)],[c32]) ).
cnf(c34,plain,
least_upper_bound(identity,X2) = least_upper_bound(X2,identity),
inference(symmetry,[status(thm)],[c33]) ).
cnf(c35,axiom,
positive_part(X2) = least_upper_bound(X2,identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c36,plain,
least_upper_bound(X2,identity) = positive_part(X2),
inference(symmetry,[status(thm)],[c35]) ).
cnf(c37,plain,
least_upper_bound(identity,X2) = positive_part(X2),
inference(transitivity,[status(thm)],[c34,c36]) ).
cnf(c38,plain,
least_upper_bound(identity,greatest_lower_bound(identity,X2)) = positive_part(greatest_lower_bound(identity,X2)),
inference(substitution,[status(thm)],[c37]) ).
cnf(c39,plain,
positive_part(greatest_lower_bound(identity,X2)) = least_upper_bound(identity,greatest_lower_bound(identity,X2)),
inference(symmetry,[status(thm)],[c38]) ).
cnf(c40,axiom,
least_upper_bound(X2,greatest_lower_bound(X2,Y2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lub_absorbtion) ).
cnf(c41,plain,
least_upper_bound(identity,greatest_lower_bound(identity,X2)) = identity,
inference(substitution,[status(thm)],[c40]) ).
cnf(c42,plain,
positive_part(greatest_lower_bound(identity,X2)) = identity,
inference(transitivity,[status(thm)],[c39,c41]) ).
cnf(c43,plain,
positive_part(negative_part(X2)) = identity,
inference(transitivity,[status(thm)],[c31,c42]) ).
cnf(c44,plain,
identity = positive_part(negative_part(X2)),
inference(symmetry,[status(thm)],[c43]) ).
cnf(c45,plain,
greatest_lower_bound(negative_part(X2),identity) = greatest_lower_bound(negative_part(X2),positive_part(negative_part(X2))),
inference(congruence,[status(thm)],[c44]) ).
cnf(c46,plain,
greatest_lower_bound(X2,positive_part(X2)) = greatest_lower_bound(X2,least_upper_bound(X2,identity)),
inference(congruence,[status(thm)],[c35]) ).
cnf(c47,axiom,
greatest_lower_bound(X2,least_upper_bound(X2,Y2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',glb_absorbtion) ).
cnf(c48,plain,
greatest_lower_bound(X2,least_upper_bound(X2,identity)) = X2,
inference(substitution,[status(thm)],[c47]) ).
cnf(c49,plain,
greatest_lower_bound(X2,positive_part(X2)) = X2,
inference(transitivity,[status(thm)],[c46,c48]) ).
cnf(c50,plain,
greatest_lower_bound(negative_part(X2),positive_part(negative_part(X2))) = negative_part(X2),
inference(substitution,[status(thm)],[c49]) ).
cnf(c51,plain,
greatest_lower_bound(negative_part(X2),identity) = negative_part(X2),
inference(transitivity,[status(thm)],[c45,c50]) ).
cnf(c52,plain,
negative_part(negative_part(X2)) = negative_part(X2),
inference(transitivity,[status(thm)],[c24,c51]) ).
cnf(c53,plain,
negative_part(negative_part(inverse(X2))) = negative_part(inverse(X2)),
inference(substitution,[status(thm)],[c52]) ).
cnf(c54,plain,
negative_part(inverse(X2)) = negative_part(negative_part(inverse(X2))),
inference(symmetry,[status(thm)],[c53]) ).
cnf(c55,plain,
least_upper_bound(negative_part(X2),negative_part(inverse(X2))) = least_upper_bound(negative_part(X2),negative_part(negative_part(inverse(X2)))),
inference(congruence,[status(thm)],[c54]) ).
cnf(c56,plain,
negative_part(X2) = negative_part(negative_part(X2)),
inference(symmetry,[status(thm)],[c52]) ).
cnf(c57,plain,
least_upper_bound(negative_part(X2),negative_part(negative_part(inverse(X2)))) = least_upper_bound(negative_part(negative_part(X2)),negative_part(negative_part(inverse(X2)))),
inference(congruence,[status(thm)],[c56]) ).
cnf(c58,plain,
least_upper_bound(X2,X3) = least_upper_bound(X3,X2),
inference(substitution,[status(thm)],[c32]) ).
cnf(c59,plain,
least_upper_bound(X3,X2) = least_upper_bound(X2,X3),
inference(symmetry,[status(thm)],[c58]) ).
cnf(c60,plain,
negative_part(least_upper_bound(X3,X2)) = negative_part(least_upper_bound(X2,X3)),
inference(congruence,[status(thm)],[c59]) ).
cnf(c61,plain,
greatest_lower_bound(identity,least_upper_bound(X2,X3)) = negative_part(least_upper_bound(X2,X3)),
inference(substitution,[status(thm)],[c29]) ).
cnf(c62,plain,
negative_part(least_upper_bound(X2,X3)) = greatest_lower_bound(identity,least_upper_bound(X2,X3)),
inference(symmetry,[status(thm)],[c61]) ).
cnf(c63,axiom,
greatest_lower_bound(X2,least_upper_bound(Y2,Z2)) = least_upper_bound(greatest_lower_bound(X2,Y2),greatest_lower_bound(X2,Z2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lat4_4) ).
cnf(c64,plain,
greatest_lower_bound(identity,least_upper_bound(X2,X3)) = least_upper_bound(greatest_lower_bound(identity,X2),greatest_lower_bound(identity,X3)),
inference(substitution,[status(thm)],[c63]) ).
cnf(c65,plain,
least_upper_bound(greatest_lower_bound(identity,X2),greatest_lower_bound(identity,X3)) = least_upper_bound(negative_part(X2),greatest_lower_bound(identity,X3)),
inference(congruence,[status(thm)],[c29]) ).
cnf(c66,plain,
least_upper_bound(negative_part(X2),greatest_lower_bound(identity,X3)) = least_upper_bound(negative_part(X2),negative_part(X3)),
inference(congruence,[status(thm)],[c29]) ).
cnf(c67,plain,
least_upper_bound(negative_part(X2),negative_part(X3)) = least_upper_bound(negative_part(X3),negative_part(X2)),
inference(substitution,[status(thm)],[c32]) ).
cnf(c68,plain,
least_upper_bound(negative_part(X2),greatest_lower_bound(identity,X3)) = least_upper_bound(negative_part(X3),negative_part(X2)),
inference(transitivity,[status(thm)],[c66,c67]) ).
cnf(c69,plain,
least_upper_bound(greatest_lower_bound(identity,X2),greatest_lower_bound(identity,X3)) = least_upper_bound(negative_part(X3),negative_part(X2)),
inference(transitivity,[status(thm)],[c65,c68]) ).
cnf(c70,plain,
greatest_lower_bound(identity,least_upper_bound(X2,X3)) = least_upper_bound(negative_part(X3),negative_part(X2)),
inference(transitivity,[status(thm)],[c64,c69]) ).
cnf(c71,plain,
negative_part(least_upper_bound(X2,X3)) = least_upper_bound(negative_part(X3),negative_part(X2)),
inference(transitivity,[status(thm)],[c62,c70]) ).
cnf(c72,plain,
negative_part(least_upper_bound(X3,X2)) = least_upper_bound(negative_part(X3),negative_part(X2)),
inference(transitivity,[status(thm)],[c60,c71]) ).
cnf(c73,plain,
negative_part(least_upper_bound(negative_part(X2),negative_part(inverse(X2)))) = least_upper_bound(negative_part(negative_part(X2)),negative_part(negative_part(inverse(X2)))),
inference(substitution,[status(thm)],[c72]) ).
cnf(c74,plain,
least_upper_bound(negative_part(negative_part(X2)),negative_part(negative_part(inverse(X2)))) = negative_part(least_upper_bound(negative_part(X2),negative_part(inverse(X2)))),
inference(symmetry,[status(thm)],[c73]) ).
cnf(c75,plain,
greatest_lower_bound(negative_part(X3),X2) = greatest_lower_bound(X2,negative_part(X3)),
inference(substitution,[status(thm)],[c25]) ).
cnf(c76,plain,
greatest_lower_bound(X2,negative_part(X3)) = greatest_lower_bound(negative_part(X3),X2),
inference(symmetry,[status(thm)],[c75]) ).
cnf(c77,plain,
negative_part(X2) = greatest_lower_bound(identity,X2),
inference(symmetry,[status(thm)],[c29]) ).
cnf(c78,plain,
greatest_lower_bound(negative_part(X3),X2) = greatest_lower_bound(greatest_lower_bound(identity,X3),X2),
inference(congruence,[status(thm)],[c77]) ).
cnf(c79,axiom,
greatest_lower_bound(X2,greatest_lower_bound(Y2,Z2)) = greatest_lower_bound(greatest_lower_bound(X2,Y2),Z2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_glb) ).
cnf(c80,plain,
greatest_lower_bound(identity,greatest_lower_bound(X3,X2)) = greatest_lower_bound(greatest_lower_bound(identity,X3),X2),
inference(substitution,[status(thm)],[c79]) ).
cnf(c81,plain,
greatest_lower_bound(greatest_lower_bound(identity,X3),X2) = greatest_lower_bound(identity,greatest_lower_bound(X3,X2)),
inference(symmetry,[status(thm)],[c80]) ).
cnf(c82,plain,
greatest_lower_bound(identity,greatest_lower_bound(X3,X2)) = negative_part(greatest_lower_bound(X3,X2)),
inference(substitution,[status(thm)],[c29]) ).
cnf(c83,plain,
negative_part(greatest_lower_bound(X3,X2)) = greatest_lower_bound(greatest_lower_bound(X3,X2),identity),
inference(substitution,[status(thm)],[c23]) ).
cnf(c84,plain,
greatest_lower_bound(X3,greatest_lower_bound(X2,identity)) = greatest_lower_bound(greatest_lower_bound(X3,X2),identity),
inference(substitution,[status(thm)],[c79]) ).
cnf(c85,plain,
greatest_lower_bound(greatest_lower_bound(X3,X2),identity) = greatest_lower_bound(X3,greatest_lower_bound(X2,identity)),
inference(symmetry,[status(thm)],[c84]) ).
cnf(c86,plain,
greatest_lower_bound(X2,identity) = negative_part(X2),
inference(symmetry,[status(thm)],[c23]) ).
cnf(c87,plain,
greatest_lower_bound(X3,greatest_lower_bound(X2,identity)) = greatest_lower_bound(X3,negative_part(X2)),
inference(congruence,[status(thm)],[c86]) ).
cnf(c88,plain,
greatest_lower_bound(greatest_lower_bound(X3,X2),identity) = greatest_lower_bound(X3,negative_part(X2)),
inference(transitivity,[status(thm)],[c85,c87]) ).
cnf(c89,plain,
negative_part(greatest_lower_bound(X3,X2)) = greatest_lower_bound(X3,negative_part(X2)),
inference(transitivity,[status(thm)],[c83,c88]) ).
cnf(c90,plain,
greatest_lower_bound(identity,greatest_lower_bound(X3,X2)) = greatest_lower_bound(X3,negative_part(X2)),
inference(transitivity,[status(thm)],[c82,c89]) ).
cnf(c91,plain,
greatest_lower_bound(greatest_lower_bound(identity,X3),X2) = greatest_lower_bound(X3,negative_part(X2)),
inference(transitivity,[status(thm)],[c81,c90]) ).
cnf(c92,plain,
greatest_lower_bound(negative_part(X3),X2) = greatest_lower_bound(X3,negative_part(X2)),
inference(transitivity,[status(thm)],[c78,c91]) ).
cnf(c93,plain,
greatest_lower_bound(X2,negative_part(X3)) = greatest_lower_bound(X3,negative_part(X2)),
inference(transitivity,[status(thm)],[c76,c92]) ).
cnf(c94,plain,
greatest_lower_bound(positive_part(X3),negative_part(X2)) = greatest_lower_bound(X2,negative_part(positive_part(X3))),
inference(substitution,[status(thm)],[c93]) ).
cnf(c95,plain,
greatest_lower_bound(identity,positive_part(X2)) = negative_part(positive_part(X2)),
inference(substitution,[status(thm)],[c29]) ).
cnf(c96,plain,
negative_part(positive_part(X2)) = greatest_lower_bound(identity,positive_part(X2)),
inference(symmetry,[status(thm)],[c95]) ).
cnf(c97,plain,
positive_part(X2) = least_upper_bound(identity,X2),
inference(symmetry,[status(thm)],[c37]) ).
cnf(c98,plain,
greatest_lower_bound(identity,positive_part(X2)) = greatest_lower_bound(identity,least_upper_bound(identity,X2)),
inference(congruence,[status(thm)],[c97]) ).
cnf(c99,plain,
greatest_lower_bound(identity,least_upper_bound(identity,X2)) = identity,
inference(substitution,[status(thm)],[c47]) ).
cnf(c100,plain,
greatest_lower_bound(identity,positive_part(X2)) = identity,
inference(transitivity,[status(thm)],[c98,c99]) ).
cnf(c101,plain,
negative_part(positive_part(X2)) = identity,
inference(transitivity,[status(thm)],[c96,c100]) ).
cnf(c102,plain,
greatest_lower_bound(X2,negative_part(positive_part(X3))) = greatest_lower_bound(X2,identity),
inference(congruence,[status(thm)],[c101]) ).
cnf(c103,plain,
greatest_lower_bound(X2,identity) = negative_part(X2),
inference(symmetry,[status(thm)],[c23]) ).
cnf(c104,plain,
greatest_lower_bound(X2,negative_part(positive_part(X3))) = negative_part(X2),
inference(transitivity,[status(thm)],[c102,c103]) ).
cnf(c105,plain,
greatest_lower_bound(positive_part(X3),negative_part(X2)) = negative_part(X2),
inference(transitivity,[status(thm)],[c94,c104]) ).
cnf(c106,plain,
greatest_lower_bound(positive_part(X2),negative_part(least_upper_bound(negative_part(X2),negative_part(inverse(X2))))) = negative_part(least_upper_bound(negative_part(X2),negative_part(inverse(X2)))),
inference(substitution,[status(thm)],[c105]) ).
cnf(c107,plain,
negative_part(least_upper_bound(negative_part(X2),negative_part(inverse(X2)))) = greatest_lower_bound(positive_part(X2),negative_part(least_upper_bound(negative_part(X2),negative_part(inverse(X2))))),
inference(symmetry,[status(thm)],[c106]) ).
cnf(c108,plain,
greatest_lower_bound(multiply(X2,X3),X3) = greatest_lower_bound(X3,multiply(X2,X3)),
inference(substitution,[status(thm)],[c25]) ).
cnf(c109,plain,
greatest_lower_bound(X3,multiply(X2,X3)) = greatest_lower_bound(multiply(X2,X3),X3),
inference(symmetry,[status(thm)],[c108]) ).
cnf(c110,plain,
X2 = multiply(identity,X2),
inference(symmetry,[status(thm)],[c7]) ).
cnf(c111,plain,
greatest_lower_bound(multiply(X2,X3),X3) = greatest_lower_bound(multiply(X2,X3),multiply(identity,X3)),
inference(congruence,[status(thm)],[c110]) ).
cnf(c112,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(c113,plain,
multiply(greatest_lower_bound(X2,identity),X3) = greatest_lower_bound(multiply(X2,X3),multiply(identity,X3)),
inference(substitution,[status(thm)],[c112]) ).
cnf(c114,plain,
greatest_lower_bound(multiply(X2,X3),multiply(identity,X3)) = multiply(greatest_lower_bound(X2,identity),X3),
inference(symmetry,[status(thm)],[c113]) ).
cnf(c115,plain,
greatest_lower_bound(X2,identity) = negative_part(X2),
inference(symmetry,[status(thm)],[c23]) ).
cnf(c116,plain,
multiply(greatest_lower_bound(X2,identity),X3) = multiply(negative_part(X2),X3),
inference(congruence,[status(thm)],[c115]) ).
cnf(c117,plain,
greatest_lower_bound(multiply(X2,X3),multiply(identity,X3)) = multiply(negative_part(X2),X3),
inference(transitivity,[status(thm)],[c114,c116]) ).
cnf(c118,plain,
greatest_lower_bound(multiply(X2,X3),X3) = multiply(negative_part(X2),X3),
inference(transitivity,[status(thm)],[c111,c117]) ).
cnf(c119,plain,
greatest_lower_bound(X3,multiply(X2,X3)) = multiply(negative_part(X2),X3),
inference(transitivity,[status(thm)],[c109,c118]) ).
cnf(c120,plain,
greatest_lower_bound(X2,multiply(inverse(X2),X2)) = multiply(negative_part(inverse(X2)),X2),
inference(substitution,[status(thm)],[c119]) ).
cnf(c121,plain,
multiply(negative_part(inverse(X2)),X2) = greatest_lower_bound(X2,multiply(inverse(X2),X2)),
inference(symmetry,[status(thm)],[c120]) ).
cnf(c122,plain,
greatest_lower_bound(X2,multiply(inverse(X2),X2)) = greatest_lower_bound(X2,identity),
inference(congruence,[status(thm)],[c5]) ).
cnf(c123,plain,
greatest_lower_bound(X2,identity) = negative_part(X2),
inference(symmetry,[status(thm)],[c23]) ).
cnf(c124,plain,
greatest_lower_bound(X2,multiply(inverse(X2),X2)) = negative_part(X2),
inference(transitivity,[status(thm)],[c122,c123]) ).
cnf(c125,plain,
multiply(negative_part(inverse(X2)),X2) = negative_part(X2),
inference(transitivity,[status(thm)],[c121,c124]) ).
cnf(c126,plain,
negative_part(X2) = multiply(negative_part(inverse(X2)),X2),
inference(symmetry,[status(thm)],[c125]) ).
cnf(c127,plain,
multiply(inverse(negative_part(inverse(X2))),negative_part(X2)) = multiply(inverse(negative_part(inverse(X2))),multiply(negative_part(inverse(X2)),X2)),
inference(congruence,[status(thm)],[c126]) ).
cnf(c128,plain,
multiply(inverse(negative_part(inverse(X2))),multiply(negative_part(inverse(X2)),X2)) = X2,
inference(substitution,[status(thm)],[c9]) ).
cnf(c129,plain,
multiply(inverse(negative_part(inverse(X2))),negative_part(X2)) = X2,
inference(transitivity,[status(thm)],[c127,c128]) ).
cnf(c130,plain,
X2 = multiply(inverse(negative_part(inverse(X2))),negative_part(X2)),
inference(symmetry,[status(thm)],[c129]) ).
cnf(c131,plain,
positive_part(X2) = positive_part(multiply(inverse(negative_part(inverse(X2))),negative_part(X2))),
inference(congruence,[status(thm)],[c130]) ).
cnf(c132,plain,
multiply(negative_part(inverse(X2)),positive_part(X2)) = multiply(negative_part(inverse(X2)),positive_part(multiply(inverse(negative_part(inverse(X2))),negative_part(X2)))),
inference(congruence,[status(thm)],[c131]) ).
cnf(c133,plain,
multiply(inverse(inverse(X3)),positive_part(multiply(inverse(X3),X2))) = multiply(X3,positive_part(multiply(inverse(X3),X2))),
inference(substitution,[status(thm)],[c13]) ).
cnf(c134,plain,
multiply(X3,positive_part(multiply(inverse(X3),X2))) = multiply(inverse(inverse(X3)),positive_part(multiply(inverse(X3),X2))),
inference(symmetry,[status(thm)],[c133]) ).
cnf(c135,plain,
least_upper_bound(X2,X3) = least_upper_bound(X3,X2),
inference(substitution,[status(thm)],[c32]) ).
cnf(c136,plain,
least_upper_bound(X3,X2) = least_upper_bound(X2,X3),
inference(symmetry,[status(thm)],[c135]) ).
cnf(c137,plain,
multiply(inverse(X3),least_upper_bound(X3,X2)) = multiply(inverse(X3),least_upper_bound(X2,X3)),
inference(congruence,[status(thm)],[c136]) ).
cnf(c138,axiom,
multiply(X2,least_upper_bound(Y2,Z2)) = least_upper_bound(multiply(X2,Y2),multiply(X2,Z2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub1) ).
cnf(c139,plain,
multiply(inverse(X3),least_upper_bound(X2,X3)) = least_upper_bound(multiply(inverse(X3),X2),multiply(inverse(X3),X3)),
inference(substitution,[status(thm)],[c138]) ).
cnf(c140,plain,
least_upper_bound(multiply(inverse(X3),X2),multiply(inverse(X3),X3)) = least_upper_bound(multiply(inverse(X3),X2),identity),
inference(congruence,[status(thm)],[c5]) ).
cnf(c141,plain,
positive_part(multiply(inverse(X3),X2)) = least_upper_bound(multiply(inverse(X3),X2),identity),
inference(substitution,[status(thm)],[c35]) ).
cnf(c142,plain,
least_upper_bound(multiply(inverse(X3),X2),identity) = positive_part(multiply(inverse(X3),X2)),
inference(symmetry,[status(thm)],[c141]) ).
cnf(c143,plain,
least_upper_bound(multiply(inverse(X3),X2),multiply(inverse(X3),X3)) = positive_part(multiply(inverse(X3),X2)),
inference(transitivity,[status(thm)],[c140,c142]) ).
cnf(c144,plain,
multiply(inverse(X3),least_upper_bound(X2,X3)) = positive_part(multiply(inverse(X3),X2)),
inference(transitivity,[status(thm)],[c139,c143]) ).
cnf(c145,plain,
multiply(inverse(X3),least_upper_bound(X3,X2)) = positive_part(multiply(inverse(X3),X2)),
inference(transitivity,[status(thm)],[c137,c144]) ).
cnf(c146,plain,
positive_part(multiply(inverse(X3),X2)) = multiply(inverse(X3),least_upper_bound(X3,X2)),
inference(symmetry,[status(thm)],[c145]) ).
cnf(c147,plain,
multiply(inverse(inverse(X3)),positive_part(multiply(inverse(X3),X2))) = multiply(inverse(inverse(X3)),multiply(inverse(X3),least_upper_bound(X3,X2))),
inference(congruence,[status(thm)],[c146]) ).
cnf(c148,plain,
multiply(inverse(inverse(X3)),multiply(inverse(X3),least_upper_bound(X3,X2))) = least_upper_bound(X3,X2),
inference(substitution,[status(thm)],[c9]) ).
cnf(c149,plain,
multiply(inverse(inverse(X3)),positive_part(multiply(inverse(X3),X2))) = least_upper_bound(X3,X2),
inference(transitivity,[status(thm)],[c147,c148]) ).
cnf(c150,plain,
multiply(X3,positive_part(multiply(inverse(X3),X2))) = least_upper_bound(X3,X2),
inference(transitivity,[status(thm)],[c134,c149]) ).
cnf(c151,plain,
multiply(negative_part(inverse(X2)),positive_part(multiply(inverse(negative_part(inverse(X2))),negative_part(X2)))) = least_upper_bound(negative_part(inverse(X2)),negative_part(X2)),
inference(substitution,[status(thm)],[c150]) ).
cnf(c152,plain,
least_upper_bound(negative_part(inverse(X2)),negative_part(X2)) = least_upper_bound(negative_part(X2),negative_part(inverse(X2))),
inference(substitution,[status(thm)],[c32]) ).
cnf(c153,plain,
multiply(negative_part(inverse(X2)),positive_part(multiply(inverse(negative_part(inverse(X2))),negative_part(X2)))) = least_upper_bound(negative_part(X2),negative_part(inverse(X2))),
inference(transitivity,[status(thm)],[c151,c152]) ).
cnf(c154,plain,
multiply(negative_part(inverse(X2)),positive_part(X2)) = least_upper_bound(negative_part(X2),negative_part(inverse(X2))),
inference(transitivity,[status(thm)],[c132,c153]) ).
cnf(c155,plain,
least_upper_bound(negative_part(X2),negative_part(inverse(X2))) = multiply(negative_part(inverse(X2)),positive_part(X2)),
inference(symmetry,[status(thm)],[c154]) ).
cnf(c156,plain,
negative_part(least_upper_bound(negative_part(X2),negative_part(inverse(X2)))) = negative_part(multiply(negative_part(inverse(X2)),positive_part(X2))),
inference(congruence,[status(thm)],[c155]) ).
cnf(c157,plain,
greatest_lower_bound(positive_part(X2),negative_part(least_upper_bound(negative_part(X2),negative_part(inverse(X2))))) = greatest_lower_bound(positive_part(X2),negative_part(multiply(negative_part(inverse(X2)),positive_part(X2)))),
inference(congruence,[status(thm)],[c156]) ).
cnf(c158,plain,
negative_part(greatest_lower_bound(X3,multiply(X2,X3))) = greatest_lower_bound(X3,negative_part(multiply(X2,X3))),
inference(substitution,[status(thm)],[c89]) ).
cnf(c159,plain,
greatest_lower_bound(X3,negative_part(multiply(X2,X3))) = negative_part(greatest_lower_bound(X3,multiply(X2,X3))),
inference(symmetry,[status(thm)],[c158]) ).
cnf(c160,plain,
negative_part(greatest_lower_bound(X3,multiply(X2,X3))) = negative_part(multiply(negative_part(X2),X3)),
inference(congruence,[status(thm)],[c119]) ).
cnf(c161,plain,
greatest_lower_bound(X3,negative_part(multiply(X2,X3))) = negative_part(multiply(negative_part(X2),X3)),
inference(transitivity,[status(thm)],[c159,c160]) ).
cnf(c162,plain,
greatest_lower_bound(positive_part(X2),negative_part(multiply(negative_part(inverse(X2)),positive_part(X2)))) = negative_part(multiply(negative_part(negative_part(inverse(X2))),positive_part(X2))),
inference(substitution,[status(thm)],[c161]) ).
cnf(c163,plain,
greatest_lower_bound(positive_part(X2),negative_part(multiply(X3,positive_part(X2)))) = negative_part(multiply(negative_part(X3),positive_part(X2))),
inference(substitution,[status(thm)],[c161]) ).
cnf(c164,plain,
negative_part(multiply(negative_part(X3),positive_part(X2))) = greatest_lower_bound(positive_part(X2),negative_part(multiply(X3,positive_part(X2)))),
inference(symmetry,[status(thm)],[c163]) ).
cnf(c165,plain,
greatest_lower_bound(positive_part(X2),negative_part(multiply(X3,positive_part(X2)))) = negative_part(multiply(X3,positive_part(X2))),
inference(substitution,[status(thm)],[c105]) ).
cnf(c166,plain,
negative_part(multiply(negative_part(X3),positive_part(X2))) = negative_part(multiply(X3,positive_part(X2))),
inference(transitivity,[status(thm)],[c164,c165]) ).
cnf(c167,plain,
negative_part(multiply(negative_part(negative_part(inverse(X2))),positive_part(X2))) = negative_part(multiply(negative_part(inverse(X2)),positive_part(X2))),
inference(substitution,[status(thm)],[c166]) ).
cnf(c168,plain,
negative_part(multiply(negative_part(inverse(X2)),positive_part(X2))) = negative_part(multiply(inverse(X2),positive_part(X2))),
inference(substitution,[status(thm)],[c166]) ).
cnf(c169,plain,
greatest_lower_bound(X2,X3) = greatest_lower_bound(X3,X2),
inference(substitution,[status(thm)],[c25]) ).
cnf(c170,plain,
greatest_lower_bound(X3,X2) = greatest_lower_bound(X2,X3),
inference(symmetry,[status(thm)],[c169]) ).
cnf(c171,plain,
multiply(inverse(X3),greatest_lower_bound(X3,X2)) = multiply(inverse(X3),greatest_lower_bound(X2,X3)),
inference(congruence,[status(thm)],[c170]) ).
cnf(c172,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(c173,plain,
multiply(inverse(X3),greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(inverse(X3),X2),multiply(inverse(X3),X3)),
inference(substitution,[status(thm)],[c172]) ).
cnf(c174,plain,
greatest_lower_bound(multiply(inverse(X3),X2),multiply(inverse(X3),X3)) = greatest_lower_bound(multiply(inverse(X3),X2),identity),
inference(congruence,[status(thm)],[c5]) ).
cnf(c175,plain,
negative_part(multiply(inverse(X3),X2)) = greatest_lower_bound(multiply(inverse(X3),X2),identity),
inference(substitution,[status(thm)],[c23]) ).
cnf(c176,plain,
greatest_lower_bound(multiply(inverse(X3),X2),identity) = negative_part(multiply(inverse(X3),X2)),
inference(symmetry,[status(thm)],[c175]) ).
cnf(c177,plain,
greatest_lower_bound(multiply(inverse(X3),X2),multiply(inverse(X3),X3)) = negative_part(multiply(inverse(X3),X2)),
inference(transitivity,[status(thm)],[c174,c176]) ).
cnf(c178,plain,
multiply(inverse(X3),greatest_lower_bound(X2,X3)) = negative_part(multiply(inverse(X3),X2)),
inference(transitivity,[status(thm)],[c173,c177]) ).
cnf(c179,plain,
multiply(inverse(X3),greatest_lower_bound(X3,X2)) = negative_part(multiply(inverse(X3),X2)),
inference(transitivity,[status(thm)],[c171,c178]) ).
cnf(c180,plain,
multiply(inverse(X2),greatest_lower_bound(X2,positive_part(X2))) = negative_part(multiply(inverse(X2),positive_part(X2))),
inference(substitution,[status(thm)],[c179]) ).
cnf(c181,plain,
negative_part(multiply(inverse(X2),positive_part(X2))) = multiply(inverse(X2),greatest_lower_bound(X2,positive_part(X2))),
inference(symmetry,[status(thm)],[c180]) ).
cnf(c182,plain,
multiply(inverse(X2),greatest_lower_bound(X2,positive_part(X2))) = multiply(inverse(X2),X2),
inference(congruence,[status(thm)],[c49]) ).
cnf(c183,plain,
multiply(inverse(X2),greatest_lower_bound(X2,positive_part(X2))) = identity,
inference(transitivity,[status(thm)],[c182,c5]) ).
cnf(c184,plain,
negative_part(multiply(inverse(X2),positive_part(X2))) = identity,
inference(transitivity,[status(thm)],[c181,c183]) ).
cnf(c185,plain,
negative_part(multiply(negative_part(inverse(X2)),positive_part(X2))) = identity,
inference(transitivity,[status(thm)],[c168,c184]) ).
cnf(c186,plain,
negative_part(multiply(negative_part(negative_part(inverse(X2))),positive_part(X2))) = identity,
inference(transitivity,[status(thm)],[c167,c185]) ).
cnf(c187,plain,
greatest_lower_bound(positive_part(X2),negative_part(multiply(negative_part(inverse(X2)),positive_part(X2)))) = identity,
inference(transitivity,[status(thm)],[c162,c186]) ).
cnf(c188,plain,
greatest_lower_bound(positive_part(X2),negative_part(least_upper_bound(negative_part(X2),negative_part(inverse(X2))))) = identity,
inference(transitivity,[status(thm)],[c157,c187]) ).
cnf(c189,plain,
negative_part(least_upper_bound(negative_part(X2),negative_part(inverse(X2)))) = identity,
inference(transitivity,[status(thm)],[c107,c188]) ).
cnf(c190,plain,
least_upper_bound(negative_part(negative_part(X2)),negative_part(negative_part(inverse(X2)))) = identity,
inference(transitivity,[status(thm)],[c74,c189]) ).
cnf(c191,plain,
least_upper_bound(negative_part(X2),negative_part(negative_part(inverse(X2)))) = identity,
inference(transitivity,[status(thm)],[c57,c190]) ).
cnf(c192,plain,
least_upper_bound(negative_part(X2),negative_part(inverse(X2))) = identity,
inference(transitivity,[status(thm)],[c55,c191]) ).
cnf(c193,plain,
identity = least_upper_bound(negative_part(X2),negative_part(inverse(X2))),
inference(symmetry,[status(thm)],[c192]) ).
cnf(c194,plain,
multiply(inverse(negative_part(inverse(X2))),identity) = multiply(inverse(negative_part(inverse(X2))),least_upper_bound(negative_part(X2),negative_part(inverse(X2)))),
inference(congruence,[status(thm)],[c193]) ).
cnf(c195,plain,
least_upper_bound(X3,X2) = least_upper_bound(X2,X3),
inference(substitution,[status(thm)],[c32]) ).
cnf(c196,plain,
least_upper_bound(X2,X3) = least_upper_bound(X3,X2),
inference(symmetry,[status(thm)],[c195]) ).
cnf(c197,plain,
multiply(inverse(X3),least_upper_bound(X2,X3)) = multiply(inverse(X3),least_upper_bound(X3,X2)),
inference(congruence,[status(thm)],[c196]) ).
cnf(c198,plain,
multiply(inverse(X3),least_upper_bound(X2,X3)) = positive_part(multiply(inverse(X3),X2)),
inference(transitivity,[status(thm)],[c197,c145]) ).
cnf(c199,plain,
multiply(inverse(negative_part(inverse(X2))),least_upper_bound(negative_part(X2),negative_part(inverse(X2)))) = positive_part(multiply(inverse(negative_part(inverse(X2))),negative_part(X2))),
inference(substitution,[status(thm)],[c198]) ).
cnf(c200,plain,
positive_part(multiply(inverse(negative_part(inverse(X2))),negative_part(X2))) = positive_part(X2),
inference(congruence,[status(thm)],[c129]) ).
cnf(c201,plain,
multiply(inverse(negative_part(inverse(X2))),least_upper_bound(negative_part(X2),negative_part(inverse(X2)))) = positive_part(X2),
inference(transitivity,[status(thm)],[c199,c200]) ).
cnf(c202,plain,
multiply(inverse(negative_part(inverse(X2))),identity) = positive_part(X2),
inference(transitivity,[status(thm)],[c194,c201]) ).
cnf(c203,plain,
inverse(negative_part(inverse(X2))) = positive_part(X2),
inference(transitivity,[status(thm)],[c22,c202]) ).
cnf(c204,plain,
positive_part(X2) = inverse(negative_part(inverse(X2))),
inference(symmetry,[status(thm)],[c203]) ).
cnf(c205,plain,
multiply(positive_part(X2),negative_part(X2)) = multiply(inverse(negative_part(inverse(X2))),negative_part(X2)),
inference(congruence,[status(thm)],[c204]) ).
cnf(c206,plain,
multiply(positive_part(X2),negative_part(X2)) = X2,
inference(transitivity,[status(thm)],[c205,c129]) ).
cnf(c207,plain,
multiply(positive_part(a),negative_part(a)) = a,
inference(substitution,[status(thm)],[c206]) ).
cnf(c208,plain,
a = multiply(positive_part(a),negative_part(a)),
inference(symmetry,[status(thm)],[c207]) ).
cnf(c209,plain,
$false,
inference(resolution,[status(thm)],[c1,c208]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP167-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n018.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 27 09:36:53 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.60/0.58 Command-line arguments: --no-flatten-goal
% 0.60/0.58
% 0.60/0.58 % SZS status Unsatisfiable
% 0.60/0.58
% 0.60/0.58 % SZS output start CNFRefutation
% See solution above
% 0.60/0.63
% 0.60/0.63 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------