%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP184-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n002.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:37 AM UTC 2026
% Result : Unsatisfiable 0.19s 0.54s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 13
% Syntax : Number of clauses : 110 ( 110 unt; 0 nHn; 7 RR)
% Number of literals : 110 ( 109 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 140 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) != multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_p21x) ).
cnf(c2,hypothesis,
inverse(greatest_lower_bound(X,Y)) = least_upper_bound(inverse(X),inverse(Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_4) ).
cnf(c3,plain,
inverse(greatest_lower_bound(X2,X3)) = least_upper_bound(inverse(X2),inverse(X3)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,axiom,
least_upper_bound(X2,Y2) = least_upper_bound(Y2,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).
cnf(c5,plain,
least_upper_bound(inverse(X2),inverse(X3)) = least_upper_bound(inverse(X3),inverse(X2)),
inference(substitution,[status(thm)],[c4]) ).
cnf(c6,plain,
inverse(greatest_lower_bound(X2,X3)) = least_upper_bound(inverse(X3),inverse(X2)),
inference(transitivity,[status(thm)],[c3,c5]) ).
cnf(c7,plain,
inverse(greatest_lower_bound(X2,identity)) = least_upper_bound(inverse(identity),inverse(X2)),
inference(substitution,[status(thm)],[c6]) ).
cnf(c8,plain,
multiply(inverse(greatest_lower_bound(X2,identity)),least_upper_bound(X2,identity)) = multiply(least_upper_bound(inverse(identity),inverse(X2)),least_upper_bound(X2,identity)),
inference(congruence,[status(thm)],[c7]) ).
cnf(c9,plain,
least_upper_bound(X2,inverse(identity)) = least_upper_bound(inverse(identity),X2),
inference(substitution,[status(thm)],[c4]) ).
cnf(c10,plain,
least_upper_bound(inverse(identity),X2) = least_upper_bound(X2,inverse(identity)),
inference(symmetry,[status(thm)],[c9]) ).
cnf(c11,plain,
multiply(least_upper_bound(inverse(identity),X2),X3) = multiply(least_upper_bound(X2,inverse(identity)),X3),
inference(congruence,[status(thm)],[c10]) ).
cnf(c12,plain,
least_upper_bound(inverse(identity),X2) = least_upper_bound(X2,inverse(identity)),
inference(substitution,[status(thm)],[c4]) ).
cnf(c13,plain,
least_upper_bound(X2,inverse(identity)) = least_upper_bound(inverse(identity),X2),
inference(symmetry,[status(thm)],[c12]) ).
cnf(c14,plain,
multiply(least_upper_bound(X3,inverse(identity)),X2) = multiply(least_upper_bound(inverse(identity),X3),X2),
inference(congruence,[status(thm)],[c13]) ).
cnf(c15,axiom,
multiply(least_upper_bound(Y2,Z),X2) = least_upper_bound(multiply(Y2,X2),multiply(Z,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',monotony_lub2) ).
cnf(c16,plain,
multiply(least_upper_bound(inverse(identity),X3),X2) = least_upper_bound(multiply(inverse(identity),X2),multiply(X3,X2)),
inference(substitution,[status(thm)],[c15]) ).
cnf(c17,axiom,
inverse(identity) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c18,plain,
multiply(inverse(identity),X2) = multiply(identity,X2),
inference(congruence,[status(thm)],[c17]) ).
cnf(c19,axiom,
multiply(identity,X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c20,plain,
multiply(inverse(identity),X2) = X2,
inference(transitivity,[status(thm)],[c18,c19]) ).
cnf(c21,plain,
least_upper_bound(multiply(inverse(identity),X2),multiply(X3,X2)) = least_upper_bound(X2,multiply(X3,X2)),
inference(congruence,[status(thm)],[c20]) ).
cnf(c22,plain,
multiply(least_upper_bound(inverse(identity),X3),X2) = least_upper_bound(X2,multiply(X3,X2)),
inference(transitivity,[status(thm)],[c16,c21]) ).
cnf(c23,plain,
multiply(least_upper_bound(X3,inverse(identity)),X2) = least_upper_bound(X2,multiply(X3,X2)),
inference(transitivity,[status(thm)],[c14,c22]) ).
cnf(c24,plain,
multiply(least_upper_bound(X2,inverse(identity)),X3) = least_upper_bound(X3,multiply(X2,X3)),
inference(substitution,[status(thm)],[c23]) ).
cnf(c25,plain,
multiply(least_upper_bound(inverse(identity),X2),X3) = least_upper_bound(X3,multiply(X2,X3)),
inference(transitivity,[status(thm)],[c11,c24]) ).
cnf(c26,plain,
multiply(least_upper_bound(inverse(identity),inverse(X2)),least_upper_bound(X2,identity)) = least_upper_bound(least_upper_bound(X2,identity),multiply(inverse(X2),least_upper_bound(X2,identity))),
inference(substitution,[status(thm)],[c25]) ).
cnf(c27,axiom,
inverse(inverse(X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c28,plain,
X2 = inverse(inverse(X2)),
inference(symmetry,[status(thm)],[c27]) ).
cnf(c29,plain,
multiply(X2,inverse(greatest_lower_bound(X2,identity))) = multiply(inverse(inverse(X2)),inverse(greatest_lower_bound(X2,identity))),
inference(congruence,[status(thm)],[c28]) ).
cnf(c30,hypothesis,
inverse(multiply(X2,Y2)) = multiply(inverse(Y2),inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_3) ).
cnf(c31,plain,
inverse(multiply(greatest_lower_bound(X2,identity),inverse(X2))) = multiply(inverse(inverse(X2)),inverse(greatest_lower_bound(X2,identity))),
inference(substitution,[status(thm)],[c30]) ).
cnf(c32,plain,
multiply(inverse(inverse(X2)),inverse(greatest_lower_bound(X2,identity))) = inverse(multiply(greatest_lower_bound(X2,identity),inverse(X2))),
inference(symmetry,[status(thm)],[c31]) ).
cnf(c33,axiom,
greatest_lower_bound(X2,Y2) = greatest_lower_bound(Y2,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).
cnf(c34,plain,
greatest_lower_bound(X2,inverse(identity)) = greatest_lower_bound(inverse(identity),X2),
inference(substitution,[status(thm)],[c33]) ).
cnf(c35,plain,
greatest_lower_bound(inverse(identity),X2) = greatest_lower_bound(X2,inverse(identity)),
inference(symmetry,[status(thm)],[c34]) ).
cnf(c36,plain,
greatest_lower_bound(X2,inverse(identity)) = greatest_lower_bound(X2,identity),
inference(congruence,[status(thm)],[c17]) ).
cnf(c37,plain,
greatest_lower_bound(inverse(identity),X2) = greatest_lower_bound(X2,identity),
inference(transitivity,[status(thm)],[c35,c36]) ).
cnf(c38,plain,
greatest_lower_bound(X2,identity) = greatest_lower_bound(inverse(identity),X2),
inference(symmetry,[status(thm)],[c37]) ).
cnf(c39,plain,
multiply(greatest_lower_bound(X2,identity),X3) = multiply(greatest_lower_bound(inverse(identity),X2),X3),
inference(congruence,[status(thm)],[c38]) ).
cnf(c40,plain,
greatest_lower_bound(X2,inverse(identity)) = greatest_lower_bound(inverse(identity),X2),
inference(substitution,[status(thm)],[c33]) ).
cnf(c41,plain,
greatest_lower_bound(inverse(identity),X2) = greatest_lower_bound(X2,inverse(identity)),
inference(symmetry,[status(thm)],[c40]) ).
cnf(c42,plain,
multiply(greatest_lower_bound(inverse(identity),X2),X3) = multiply(greatest_lower_bound(X2,inverse(identity)),X3),
inference(congruence,[status(thm)],[c41]) ).
cnf(c43,plain,
greatest_lower_bound(inverse(identity),X2) = greatest_lower_bound(X2,inverse(identity)),
inference(substitution,[status(thm)],[c33]) ).
cnf(c44,plain,
greatest_lower_bound(X2,inverse(identity)) = greatest_lower_bound(inverse(identity),X2),
inference(symmetry,[status(thm)],[c43]) ).
cnf(c45,plain,
multiply(greatest_lower_bound(X3,inverse(identity)),X2) = multiply(greatest_lower_bound(inverse(identity),X3),X2),
inference(congruence,[status(thm)],[c44]) ).
cnf(c46,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(c47,plain,
multiply(greatest_lower_bound(inverse(identity),X3),X2) = greatest_lower_bound(multiply(inverse(identity),X2),multiply(X3,X2)),
inference(substitution,[status(thm)],[c46]) ).
cnf(c48,plain,
greatest_lower_bound(multiply(inverse(identity),X2),multiply(X3,X2)) = greatest_lower_bound(X2,multiply(X3,X2)),
inference(congruence,[status(thm)],[c20]) ).
cnf(c49,plain,
multiply(greatest_lower_bound(inverse(identity),X3),X2) = greatest_lower_bound(X2,multiply(X3,X2)),
inference(transitivity,[status(thm)],[c47,c48]) ).
cnf(c50,plain,
multiply(greatest_lower_bound(X3,inverse(identity)),X2) = greatest_lower_bound(X2,multiply(X3,X2)),
inference(transitivity,[status(thm)],[c45,c49]) ).
cnf(c51,plain,
multiply(greatest_lower_bound(X2,inverse(identity)),X3) = greatest_lower_bound(X3,multiply(X2,X3)),
inference(substitution,[status(thm)],[c50]) ).
cnf(c52,plain,
multiply(greatest_lower_bound(inverse(identity),X2),X3) = greatest_lower_bound(X3,multiply(X2,X3)),
inference(transitivity,[status(thm)],[c42,c51]) ).
cnf(c53,plain,
multiply(greatest_lower_bound(X2,identity),X3) = greatest_lower_bound(X3,multiply(X2,X3)),
inference(transitivity,[status(thm)],[c39,c52]) ).
cnf(c54,plain,
multiply(greatest_lower_bound(X2,identity),inverse(X2)) = greatest_lower_bound(inverse(X2),multiply(X2,inverse(X2))),
inference(substitution,[status(thm)],[c53]) ).
cnf(c55,plain,
X2 = inverse(inverse(X2)),
inference(symmetry,[status(thm)],[c27]) ).
cnf(c56,plain,
multiply(X2,inverse(X2)) = multiply(inverse(inverse(X2)),inverse(X2)),
inference(congruence,[status(thm)],[c55]) ).
cnf(c57,axiom,
multiply(inverse(X2),X2) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c58,plain,
identity = inverse(identity),
inference(symmetry,[status(thm)],[c17]) ).
cnf(c59,plain,
multiply(inverse(X2),X2) = inverse(identity),
inference(transitivity,[status(thm)],[c57,c58]) ).
cnf(c60,plain,
multiply(inverse(inverse(X2)),inverse(X2)) = inverse(identity),
inference(substitution,[status(thm)],[c59]) ).
cnf(c61,plain,
multiply(X2,inverse(X2)) = inverse(identity),
inference(transitivity,[status(thm)],[c56,c60]) ).
cnf(c62,plain,
greatest_lower_bound(inverse(X2),multiply(X2,inverse(X2))) = greatest_lower_bound(inverse(X2),inverse(identity)),
inference(congruence,[status(thm)],[c61]) ).
cnf(c63,plain,
greatest_lower_bound(inverse(X2),inverse(identity)) = greatest_lower_bound(inverse(identity),inverse(X2)),
inference(substitution,[status(thm)],[c33]) ).
cnf(c64,plain,
least_upper_bound(X2,inverse(identity)) = least_upper_bound(inverse(identity),X2),
inference(substitution,[status(thm)],[c4]) ).
cnf(c65,plain,
least_upper_bound(inverse(identity),X2) = least_upper_bound(X2,inverse(identity)),
inference(symmetry,[status(thm)],[c64]) ).
cnf(c66,plain,
least_upper_bound(X2,inverse(identity)) = least_upper_bound(X2,identity),
inference(congruence,[status(thm)],[c17]) ).
cnf(c67,plain,
least_upper_bound(inverse(identity),X2) = least_upper_bound(X2,identity),
inference(transitivity,[status(thm)],[c65,c66]) ).
cnf(c68,plain,
least_upper_bound(X2,identity) = least_upper_bound(inverse(identity),X2),
inference(symmetry,[status(thm)],[c67]) ).
cnf(c69,plain,
inverse(least_upper_bound(X2,identity)) = inverse(least_upper_bound(inverse(identity),X2)),
inference(congruence,[status(thm)],[c68]) ).
cnf(c70,hypothesis,
inverse(least_upper_bound(X2,Y2)) = greatest_lower_bound(inverse(X2),inverse(Y2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p21x_5) ).
cnf(c71,plain,
inverse(least_upper_bound(inverse(identity),X2)) = greatest_lower_bound(inverse(inverse(identity)),inverse(X2)),
inference(substitution,[status(thm)],[c70]) ).
cnf(c72,plain,
inverse(inverse(identity)) = inverse(identity),
inference(congruence,[status(thm)],[c17]) ).
cnf(c73,plain,
greatest_lower_bound(inverse(inverse(identity)),inverse(X2)) = greatest_lower_bound(inverse(identity),inverse(X2)),
inference(congruence,[status(thm)],[c72]) ).
cnf(c74,plain,
inverse(least_upper_bound(inverse(identity),X2)) = greatest_lower_bound(inverse(identity),inverse(X2)),
inference(transitivity,[status(thm)],[c71,c73]) ).
cnf(c75,plain,
inverse(least_upper_bound(X2,identity)) = greatest_lower_bound(inverse(identity),inverse(X2)),
inference(transitivity,[status(thm)],[c69,c74]) ).
cnf(c76,plain,
greatest_lower_bound(inverse(identity),inverse(X2)) = inverse(least_upper_bound(X2,identity)),
inference(symmetry,[status(thm)],[c75]) ).
cnf(c77,plain,
greatest_lower_bound(inverse(X2),inverse(identity)) = inverse(least_upper_bound(X2,identity)),
inference(transitivity,[status(thm)],[c63,c76]) ).
cnf(c78,plain,
greatest_lower_bound(inverse(X2),multiply(X2,inverse(X2))) = inverse(least_upper_bound(X2,identity)),
inference(transitivity,[status(thm)],[c62,c77]) ).
cnf(c79,plain,
multiply(greatest_lower_bound(X2,identity),inverse(X2)) = inverse(least_upper_bound(X2,identity)),
inference(transitivity,[status(thm)],[c54,c78]) ).
cnf(c80,plain,
inverse(multiply(greatest_lower_bound(X2,identity),inverse(X2))) = inverse(inverse(least_upper_bound(X2,identity))),
inference(congruence,[status(thm)],[c79]) ).
cnf(c81,plain,
inverse(inverse(least_upper_bound(X2,identity))) = least_upper_bound(X2,identity),
inference(substitution,[status(thm)],[c27]) ).
cnf(c82,plain,
inverse(multiply(greatest_lower_bound(X2,identity),inverse(X2))) = least_upper_bound(X2,identity),
inference(transitivity,[status(thm)],[c80,c81]) ).
cnf(c83,plain,
multiply(inverse(inverse(X2)),inverse(greatest_lower_bound(X2,identity))) = least_upper_bound(X2,identity),
inference(transitivity,[status(thm)],[c32,c82]) ).
cnf(c84,plain,
multiply(X2,inverse(greatest_lower_bound(X2,identity))) = least_upper_bound(X2,identity),
inference(transitivity,[status(thm)],[c29,c83]) ).
cnf(c85,plain,
least_upper_bound(X2,identity) = multiply(X2,inverse(greatest_lower_bound(X2,identity))),
inference(symmetry,[status(thm)],[c84]) ).
cnf(c86,plain,
multiply(inverse(X2),least_upper_bound(X2,identity)) = multiply(inverse(X2),multiply(X2,inverse(greatest_lower_bound(X2,identity)))),
inference(congruence,[status(thm)],[c85]) ).
cnf(c87,axiom,
multiply(multiply(X2,Y2),Z2) = multiply(X2,multiply(Y2,Z2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity) ).
cnf(c88,plain,
multiply(multiply(inverse(X3),X3),X2) = multiply(inverse(X3),multiply(X3,X2)),
inference(substitution,[status(thm)],[c87]) ).
cnf(c89,plain,
multiply(inverse(X3),multiply(X3,X2)) = multiply(multiply(inverse(X3),X3),X2),
inference(symmetry,[status(thm)],[c88]) ).
cnf(c90,plain,
multiply(multiply(inverse(X3),X3),X2) = multiply(inverse(identity),X2),
inference(congruence,[status(thm)],[c59]) ).
cnf(c91,plain,
multiply(multiply(inverse(X3),X3),X2) = X2,
inference(transitivity,[status(thm)],[c90,c20]) ).
cnf(c92,plain,
multiply(inverse(X3),multiply(X3,X2)) = X2,
inference(transitivity,[status(thm)],[c89,c91]) ).
cnf(c93,plain,
multiply(inverse(X2),multiply(X2,inverse(greatest_lower_bound(X2,identity)))) = inverse(greatest_lower_bound(X2,identity)),
inference(substitution,[status(thm)],[c92]) ).
cnf(c94,plain,
multiply(inverse(X2),least_upper_bound(X2,identity)) = inverse(greatest_lower_bound(X2,identity)),
inference(transitivity,[status(thm)],[c86,c93]) ).
cnf(c95,plain,
least_upper_bound(least_upper_bound(X2,identity),multiply(inverse(X2),least_upper_bound(X2,identity))) = least_upper_bound(least_upper_bound(X2,identity),inverse(greatest_lower_bound(X2,identity))),
inference(congruence,[status(thm)],[c94]) ).
cnf(c96,plain,
least_upper_bound(least_upper_bound(X2,identity),inverse(greatest_lower_bound(X2,identity))) = least_upper_bound(inverse(greatest_lower_bound(X2,identity)),least_upper_bound(X2,identity)),
inference(substitution,[status(thm)],[c4]) ).
cnf(c97,plain,
least_upper_bound(X2,identity) = least_upper_bound(inverse(identity),X2),
inference(symmetry,[status(thm)],[c67]) ).
cnf(c98,plain,
multiply(least_upper_bound(X2,identity),inverse(greatest_lower_bound(X2,identity))) = multiply(least_upper_bound(inverse(identity),X2),inverse(greatest_lower_bound(X2,identity))),
inference(congruence,[status(thm)],[c97]) ).
cnf(c99,plain,
multiply(least_upper_bound(inverse(identity),X2),inverse(greatest_lower_bound(X2,identity))) = least_upper_bound(inverse(greatest_lower_bound(X2,identity)),multiply(X2,inverse(greatest_lower_bound(X2,identity)))),
inference(substitution,[status(thm)],[c25]) ).
cnf(c100,plain,
least_upper_bound(inverse(greatest_lower_bound(X2,identity)),multiply(X2,inverse(greatest_lower_bound(X2,identity)))) = least_upper_bound(inverse(greatest_lower_bound(X2,identity)),least_upper_bound(X2,identity)),
inference(congruence,[status(thm)],[c84]) ).
cnf(c101,plain,
multiply(least_upper_bound(inverse(identity),X2),inverse(greatest_lower_bound(X2,identity))) = least_upper_bound(inverse(greatest_lower_bound(X2,identity)),least_upper_bound(X2,identity)),
inference(transitivity,[status(thm)],[c99,c100]) ).
cnf(c102,plain,
multiply(least_upper_bound(X2,identity),inverse(greatest_lower_bound(X2,identity))) = least_upper_bound(inverse(greatest_lower_bound(X2,identity)),least_upper_bound(X2,identity)),
inference(transitivity,[status(thm)],[c98,c101]) ).
cnf(c103,plain,
least_upper_bound(inverse(greatest_lower_bound(X2,identity)),least_upper_bound(X2,identity)) = multiply(least_upper_bound(X2,identity),inverse(greatest_lower_bound(X2,identity))),
inference(symmetry,[status(thm)],[c102]) ).
cnf(c104,plain,
least_upper_bound(least_upper_bound(X2,identity),inverse(greatest_lower_bound(X2,identity))) = multiply(least_upper_bound(X2,identity),inverse(greatest_lower_bound(X2,identity))),
inference(transitivity,[status(thm)],[c96,c103]) ).
cnf(c105,plain,
least_upper_bound(least_upper_bound(X2,identity),multiply(inverse(X2),least_upper_bound(X2,identity))) = multiply(least_upper_bound(X2,identity),inverse(greatest_lower_bound(X2,identity))),
inference(transitivity,[status(thm)],[c95,c104]) ).
cnf(c106,plain,
multiply(least_upper_bound(inverse(identity),inverse(X2)),least_upper_bound(X2,identity)) = multiply(least_upper_bound(X2,identity),inverse(greatest_lower_bound(X2,identity))),
inference(transitivity,[status(thm)],[c26,c105]) ).
cnf(c107,plain,
multiply(inverse(greatest_lower_bound(X2,identity)),least_upper_bound(X2,identity)) = multiply(least_upper_bound(X2,identity),inverse(greatest_lower_bound(X2,identity))),
inference(transitivity,[status(thm)],[c8,c106]) ).
cnf(c108,plain,
multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)) = multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))),
inference(substitution,[status(thm)],[c107]) ).
cnf(c109,plain,
multiply(least_upper_bound(a,identity),inverse(greatest_lower_bound(a,identity))) = multiply(inverse(greatest_lower_bound(a,identity)),least_upper_bound(a,identity)),
inference(symmetry,[status(thm)],[c108]) ).
cnf(c110,plain,
$false,
inference(resolution,[status(thm)],[c1,c109]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP184-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 % Computer : n002.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 27 09:39:06 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.54 Command-line arguments: --flatten --complete-subsets
% 0.19/0.54
% 0.19/0.54 % SZS status Unsatisfiable
% 0.19/0.54
% 0.19/0.54 % SZS output start CNFRefutation
% See solution above
% 0.19/0.57
% 0.19/0.57 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------