%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP170-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 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:09:31 AM UTC 2026
% Result : Unsatisfiable 0.68s 0.55s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of clauses : 70 ( 70 unt; 0 nHn; 28 RR)
% Number of literals : 70 ( 69 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 93 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
greatest_lower_bound(multiply(a,c),multiply(b,d)) != multiply(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_p03c) ).
cnf(c2,axiom,
least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lub_absorbtion) ).
cnf(c3,plain,
least_upper_bound(greatest_lower_bound(multiply(a,c),multiply(b,d)),greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(b,d)),multiply(least_upper_bound(a,b),c))) = greatest_lower_bound(multiply(a,c),multiply(b,d)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
greatest_lower_bound(multiply(a,c),multiply(b,d)) = least_upper_bound(greatest_lower_bound(multiply(a,c),multiply(b,d)),greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(b,d)),multiply(least_upper_bound(a,b),c))),
inference(symmetry,[status(thm)],[c3]) ).
cnf(c5,axiom,
greatest_lower_bound(X2,Y2) = greatest_lower_bound(Y2,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_glb) ).
cnf(c6,plain,
greatest_lower_bound(multiply(least_upper_bound(a,b),c),greatest_lower_bound(multiply(a,c),multiply(b,d))) = greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(b,d)),multiply(least_upper_bound(a,b),c)),
inference(substitution,[status(thm)],[c5]) ).
cnf(c7,plain,
greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(b,d)),multiply(least_upper_bound(a,b),c)) = greatest_lower_bound(multiply(least_upper_bound(a,b),c),greatest_lower_bound(multiply(a,c),multiply(b,d))),
inference(symmetry,[status(thm)],[c6]) ).
cnf(c8,plain,
greatest_lower_bound(greatest_lower_bound(X4,X2),X3) = greatest_lower_bound(X3,greatest_lower_bound(X4,X2)),
inference(substitution,[status(thm)],[c5]) ).
cnf(c9,plain,
greatest_lower_bound(X3,greatest_lower_bound(X4,X2)) = greatest_lower_bound(greatest_lower_bound(X4,X2),X3),
inference(symmetry,[status(thm)],[c8]) ).
cnf(c10,axiom,
greatest_lower_bound(X2,greatest_lower_bound(Y2,Z)) = greatest_lower_bound(greatest_lower_bound(X2,Y2),Z),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_glb) ).
cnf(c11,plain,
greatest_lower_bound(X4,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X4,X2),X3),
inference(substitution,[status(thm)],[c10]) ).
cnf(c12,plain,
greatest_lower_bound(greatest_lower_bound(X4,X2),X3) = greatest_lower_bound(X4,greatest_lower_bound(X2,X3)),
inference(symmetry,[status(thm)],[c11]) ).
cnf(c13,plain,
greatest_lower_bound(X2,X3) = greatest_lower_bound(X3,X2),
inference(substitution,[status(thm)],[c5]) ).
cnf(c14,plain,
greatest_lower_bound(X4,greatest_lower_bound(X2,X3)) = greatest_lower_bound(X4,greatest_lower_bound(X3,X2)),
inference(congruence,[status(thm)],[c13]) ).
cnf(c15,plain,
greatest_lower_bound(greatest_lower_bound(X4,X2),X3) = greatest_lower_bound(X4,greatest_lower_bound(X3,X2)),
inference(transitivity,[status(thm)],[c12,c14]) ).
cnf(c16,plain,
greatest_lower_bound(X3,greatest_lower_bound(X4,X2)) = greatest_lower_bound(X4,greatest_lower_bound(X3,X2)),
inference(transitivity,[status(thm)],[c9,c15]) ).
cnf(c17,plain,
greatest_lower_bound(X2,greatest_lower_bound(X4,X3)) = greatest_lower_bound(X4,greatest_lower_bound(X2,X3)),
inference(substitution,[status(thm)],[c16]) ).
cnf(c18,plain,
greatest_lower_bound(X2,X3) = greatest_lower_bound(X3,X2),
inference(substitution,[status(thm)],[c5]) ).
cnf(c19,plain,
greatest_lower_bound(X4,greatest_lower_bound(X2,X3)) = greatest_lower_bound(X4,greatest_lower_bound(X3,X2)),
inference(congruence,[status(thm)],[c18]) ).
cnf(c20,plain,
greatest_lower_bound(X2,greatest_lower_bound(X4,X3)) = greatest_lower_bound(X4,greatest_lower_bound(X3,X2)),
inference(transitivity,[status(thm)],[c17,c19]) ).
cnf(c21,plain,
greatest_lower_bound(multiply(least_upper_bound(a,b),c),greatest_lower_bound(multiply(a,c),multiply(b,d))) = greatest_lower_bound(multiply(a,c),greatest_lower_bound(multiply(b,d),multiply(least_upper_bound(a,b),c))),
inference(substitution,[status(thm)],[c20]) ).
cnf(c22,plain,
greatest_lower_bound(X2,least_upper_bound(c,d)) = greatest_lower_bound(least_upper_bound(c,d),X2),
inference(substitution,[status(thm)],[c5]) ).
cnf(c23,plain,
greatest_lower_bound(least_upper_bound(c,d),X2) = greatest_lower_bound(X2,least_upper_bound(c,d)),
inference(symmetry,[status(thm)],[c22]) ).
cnf(c24,plain,
multiply(least_upper_bound(a,b),greatest_lower_bound(least_upper_bound(c,d),X2)) = multiply(least_upper_bound(a,b),greatest_lower_bound(X2,least_upper_bound(c,d))),
inference(congruence,[status(thm)],[c23]) ).
cnf(c25,plain,
greatest_lower_bound(least_upper_bound(c,d),X2) = greatest_lower_bound(X2,least_upper_bound(c,d)),
inference(substitution,[status(thm)],[c5]) ).
cnf(c26,plain,
greatest_lower_bound(X2,least_upper_bound(c,d)) = greatest_lower_bound(least_upper_bound(c,d),X2),
inference(symmetry,[status(thm)],[c25]) ).
cnf(c27,plain,
multiply(least_upper_bound(a,b),greatest_lower_bound(X2,least_upper_bound(c,d))) = multiply(least_upper_bound(a,b),greatest_lower_bound(least_upper_bound(c,d),X2)),
inference(congruence,[status(thm)],[c26]) ).
cnf(c28,axiom,
multiply(X2,greatest_lower_bound(Y2,Z2)) = greatest_lower_bound(multiply(X2,Y2),multiply(X2,Z2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_glb1) ).
cnf(c29,plain,
multiply(least_upper_bound(a,b),greatest_lower_bound(least_upper_bound(c,d),X2)) = greatest_lower_bound(multiply(least_upper_bound(a,b),least_upper_bound(c,d)),multiply(least_upper_bound(a,b),X2)),
inference(substitution,[status(thm)],[c28]) ).
cnf(c30,axiom,
least_upper_bound(c,d) = d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).
cnf(c31,plain,
multiply(least_upper_bound(a,b),least_upper_bound(c,d)) = multiply(least_upper_bound(a,b),d),
inference(congruence,[status(thm)],[c30]) ).
cnf(c32,axiom,
least_upper_bound(a,b) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).
cnf(c33,plain,
multiply(least_upper_bound(a,b),d) = multiply(b,d),
inference(congruence,[status(thm)],[c32]) ).
cnf(c34,plain,
multiply(least_upper_bound(a,b),least_upper_bound(c,d)) = multiply(b,d),
inference(transitivity,[status(thm)],[c31,c33]) ).
cnf(c35,plain,
greatest_lower_bound(multiply(least_upper_bound(a,b),least_upper_bound(c,d)),multiply(least_upper_bound(a,b),X2)) = greatest_lower_bound(multiply(b,d),multiply(least_upper_bound(a,b),X2)),
inference(congruence,[status(thm)],[c34]) ).
cnf(c36,plain,
multiply(least_upper_bound(a,b),greatest_lower_bound(least_upper_bound(c,d),X2)) = greatest_lower_bound(multiply(b,d),multiply(least_upper_bound(a,b),X2)),
inference(transitivity,[status(thm)],[c29,c35]) ).
cnf(c37,plain,
multiply(least_upper_bound(a,b),greatest_lower_bound(X2,least_upper_bound(c,d))) = greatest_lower_bound(multiply(b,d),multiply(least_upper_bound(a,b),X2)),
inference(transitivity,[status(thm)],[c27,c36]) ).
cnf(c38,plain,
multiply(least_upper_bound(a,b),greatest_lower_bound(least_upper_bound(c,d),X2)) = greatest_lower_bound(multiply(b,d),multiply(least_upper_bound(a,b),X2)),
inference(transitivity,[status(thm)],[c24,c37]) ).
cnf(c39,plain,
multiply(least_upper_bound(a,b),greatest_lower_bound(least_upper_bound(c,d),c)) = greatest_lower_bound(multiply(b,d),multiply(least_upper_bound(a,b),c)),
inference(substitution,[status(thm)],[c38]) ).
cnf(c40,plain,
greatest_lower_bound(multiply(b,d),multiply(least_upper_bound(a,b),c)) = multiply(least_upper_bound(a,b),greatest_lower_bound(least_upper_bound(c,d),c)),
inference(symmetry,[status(thm)],[c39]) ).
cnf(c41,plain,
greatest_lower_bound(X3,least_upper_bound(X3,X2)) = greatest_lower_bound(least_upper_bound(X3,X2),X3),
inference(substitution,[status(thm)],[c5]) ).
cnf(c42,plain,
greatest_lower_bound(least_upper_bound(X3,X2),X3) = greatest_lower_bound(X3,least_upper_bound(X3,X2)),
inference(symmetry,[status(thm)],[c41]) ).
cnf(c43,axiom,
greatest_lower_bound(X2,least_upper_bound(X2,Y2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',glb_absorbtion) ).
cnf(c44,plain,
greatest_lower_bound(X3,least_upper_bound(X3,X2)) = X3,
inference(substitution,[status(thm)],[c43]) ).
cnf(c45,plain,
greatest_lower_bound(least_upper_bound(X3,X2),X3) = X3,
inference(transitivity,[status(thm)],[c42,c44]) ).
cnf(c46,plain,
greatest_lower_bound(least_upper_bound(c,d),c) = c,
inference(substitution,[status(thm)],[c45]) ).
cnf(c47,plain,
multiply(least_upper_bound(a,b),greatest_lower_bound(least_upper_bound(c,d),c)) = multiply(least_upper_bound(a,b),c),
inference(congruence,[status(thm)],[c46]) ).
cnf(c48,plain,
greatest_lower_bound(multiply(b,d),multiply(least_upper_bound(a,b),c)) = multiply(least_upper_bound(a,b),c),
inference(transitivity,[status(thm)],[c40,c47]) ).
cnf(c49,plain,
greatest_lower_bound(multiply(a,c),greatest_lower_bound(multiply(b,d),multiply(least_upper_bound(a,b),c))) = greatest_lower_bound(multiply(a,c),multiply(least_upper_bound(a,b),c)),
inference(congruence,[status(thm)],[c48]) ).
cnf(c50,axiom,
multiply(greatest_lower_bound(Y2,Z2),X2) = greatest_lower_bound(multiply(Y2,X2),multiply(Z2,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',monotony_glb2) ).
cnf(c51,plain,
multiply(greatest_lower_bound(X3,X4),X2) = greatest_lower_bound(multiply(X3,X2),multiply(X4,X2)),
inference(substitution,[status(thm)],[c50]) ).
cnf(c52,plain,
greatest_lower_bound(multiply(X3,X2),multiply(X4,X2)) = multiply(greatest_lower_bound(X3,X4),X2),
inference(symmetry,[status(thm)],[c51]) ).
cnf(c53,plain,
greatest_lower_bound(X2,X3) = greatest_lower_bound(X3,X2),
inference(substitution,[status(thm)],[c5]) ).
cnf(c54,plain,
multiply(greatest_lower_bound(X3,X4),X2) = multiply(greatest_lower_bound(X4,X3),X2),
inference(congruence,[status(thm)],[c53]) ).
cnf(c55,plain,
greatest_lower_bound(multiply(X3,X2),multiply(X4,X2)) = multiply(greatest_lower_bound(X4,X3),X2),
inference(transitivity,[status(thm)],[c52,c54]) ).
cnf(c56,plain,
greatest_lower_bound(multiply(X4,X3),multiply(least_upper_bound(X4,X2),X3)) = multiply(greatest_lower_bound(least_upper_bound(X4,X2),X4),X3),
inference(substitution,[status(thm)],[c55]) ).
cnf(c57,plain,
multiply(greatest_lower_bound(least_upper_bound(X4,X2),X4),X3) = multiply(X4,X3),
inference(congruence,[status(thm)],[c45]) ).
cnf(c58,plain,
greatest_lower_bound(multiply(X4,X3),multiply(least_upper_bound(X4,X2),X3)) = multiply(X4,X3),
inference(transitivity,[status(thm)],[c56,c57]) ).
cnf(c59,plain,
greatest_lower_bound(multiply(a,c),multiply(least_upper_bound(a,b),c)) = multiply(a,c),
inference(substitution,[status(thm)],[c58]) ).
cnf(c60,plain,
greatest_lower_bound(multiply(a,c),greatest_lower_bound(multiply(b,d),multiply(least_upper_bound(a,b),c))) = multiply(a,c),
inference(transitivity,[status(thm)],[c49,c59]) ).
cnf(c61,plain,
greatest_lower_bound(multiply(least_upper_bound(a,b),c),greatest_lower_bound(multiply(a,c),multiply(b,d))) = multiply(a,c),
inference(transitivity,[status(thm)],[c21,c60]) ).
cnf(c62,plain,
greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(b,d)),multiply(least_upper_bound(a,b),c)) = multiply(a,c),
inference(transitivity,[status(thm)],[c7,c61]) ).
cnf(c63,plain,
least_upper_bound(greatest_lower_bound(multiply(a,c),multiply(b,d)),greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(b,d)),multiply(least_upper_bound(a,b),c))) = least_upper_bound(greatest_lower_bound(multiply(a,c),multiply(b,d)),multiply(a,c)),
inference(congruence,[status(thm)],[c62]) ).
cnf(c64,axiom,
least_upper_bound(X2,Y2) = least_upper_bound(Y2,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).
cnf(c65,plain,
least_upper_bound(greatest_lower_bound(multiply(a,c),multiply(b,d)),multiply(a,c)) = least_upper_bound(multiply(a,c),greatest_lower_bound(multiply(a,c),multiply(b,d))),
inference(substitution,[status(thm)],[c64]) ).
cnf(c66,plain,
least_upper_bound(multiply(a,c),greatest_lower_bound(multiply(a,c),multiply(b,d))) = multiply(a,c),
inference(substitution,[status(thm)],[c2]) ).
cnf(c67,plain,
least_upper_bound(greatest_lower_bound(multiply(a,c),multiply(b,d)),multiply(a,c)) = multiply(a,c),
inference(transitivity,[status(thm)],[c65,c66]) ).
cnf(c68,plain,
least_upper_bound(greatest_lower_bound(multiply(a,c),multiply(b,d)),greatest_lower_bound(greatest_lower_bound(multiply(a,c),multiply(b,d)),multiply(least_upper_bound(a,b),c))) = multiply(a,c),
inference(transitivity,[status(thm)],[c63,c67]) ).
cnf(c69,plain,
greatest_lower_bound(multiply(a,c),multiply(b,d)) = multiply(a,c),
inference(transitivity,[status(thm)],[c4,c68]) ).
cnf(c70,plain,
$false,
inference(resolution,[status(thm)],[c1,c69]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP170-3 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n026.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:37:56 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.68/0.55 Command-line arguments: --flatten --complete-subsets
% 0.68/0.55
% 0.68/0.55 % SZS status Unsatisfiable
% 0.68/0.55
% 0.68/0.55 % SZS output start CNFRefutation
% See solution above
% 0.68/0.60
% 0.68/0.60 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------