%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP147-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n010.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:27 AM UTC 2026
% Result : Unsatisfiable 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 9
% Syntax : Number of clauses : 90 ( 90 unt; 0 nHn; 21 RR)
% Number of literals : 90 ( 89 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 101 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_lub1b) ).
cnf(c2,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_glb) ).
cnf(c3,plain,
greatest_lower_bound(greatest_lower_bound(a,c),greatest_lower_bound(least_upper_bound(a,X2),c)) = greatest_lower_bound(greatest_lower_bound(least_upper_bound(a,X2),c),greatest_lower_bound(a,c)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
greatest_lower_bound(greatest_lower_bound(least_upper_bound(a,X2),c),greatest_lower_bound(a,c)) = greatest_lower_bound(greatest_lower_bound(a,c),greatest_lower_bound(least_upper_bound(a,X2),c)),
inference(symmetry,[status(thm)],[c3]) ).
cnf(c5,plain,
greatest_lower_bound(greatest_lower_bound(X2,X3),X4) = greatest_lower_bound(X4,greatest_lower_bound(X2,X3)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c6,plain,
greatest_lower_bound(X3,greatest_lower_bound(X4,X2)) = greatest_lower_bound(greatest_lower_bound(X4,X2),X3),
inference(symmetry,[status(thm)],[c5]) ).
cnf(c7,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(c8,plain,
greatest_lower_bound(X4,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X4,X2),X3),
inference(substitution,[status(thm)],[c7]) ).
cnf(c9,plain,
greatest_lower_bound(greatest_lower_bound(X4,X2),X3) = greatest_lower_bound(X4,greatest_lower_bound(X2,X3)),
inference(symmetry,[status(thm)],[c8]) ).
cnf(c10,plain,
greatest_lower_bound(X2,X3) = greatest_lower_bound(X3,X2),
inference(substitution,[status(thm)],[c2]) ).
cnf(c11,plain,
greatest_lower_bound(X4,greatest_lower_bound(X2,X3)) = greatest_lower_bound(X4,greatest_lower_bound(X3,X2)),
inference(congruence,[status(thm)],[c10]) ).
cnf(c12,plain,
greatest_lower_bound(greatest_lower_bound(X4,X2),X3) = greatest_lower_bound(X4,greatest_lower_bound(X3,X2)),
inference(transitivity,[status(thm)],[c9,c11]) ).
cnf(c13,plain,
greatest_lower_bound(X3,greatest_lower_bound(X4,X2)) = greatest_lower_bound(X4,greatest_lower_bound(X3,X2)),
inference(transitivity,[status(thm)],[c6,c12]) ).
cnf(c14,plain,
greatest_lower_bound(greatest_lower_bound(a,c),greatest_lower_bound(least_upper_bound(a,X2),c)) = greatest_lower_bound(least_upper_bound(a,X2),greatest_lower_bound(greatest_lower_bound(a,c),c)),
inference(substitution,[status(thm)],[c13]) ).
cnf(c15,axiom,
greatest_lower_bound(a,c) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).
cnf(c16,plain,
greatest_lower_bound(greatest_lower_bound(a,c),c) = greatest_lower_bound(a,c),
inference(congruence,[status(thm)],[c15]) ).
cnf(c17,plain,
greatest_lower_bound(least_upper_bound(a,X2),greatest_lower_bound(greatest_lower_bound(a,c),c)) = greatest_lower_bound(least_upper_bound(a,X2),greatest_lower_bound(a,c)),
inference(congruence,[status(thm)],[c16]) ).
cnf(c18,plain,
greatest_lower_bound(least_upper_bound(a,X2),greatest_lower_bound(a,c)) = greatest_lower_bound(greatest_lower_bound(a,c),least_upper_bound(a,X2)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c19,plain,
greatest_lower_bound(greatest_lower_bound(a,c),least_upper_bound(a,X2)) = greatest_lower_bound(a,least_upper_bound(a,X2)),
inference(congruence,[status(thm)],[c15]) ).
cnf(c20,axiom,
greatest_lower_bound(X2,least_upper_bound(X2,Y2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',glb_absorbtion) ).
cnf(c21,plain,
greatest_lower_bound(a,least_upper_bound(a,X2)) = a,
inference(substitution,[status(thm)],[c20]) ).
cnf(c22,plain,
a = greatest_lower_bound(a,c),
inference(symmetry,[status(thm)],[c15]) ).
cnf(c23,plain,
greatest_lower_bound(a,least_upper_bound(a,X2)) = greatest_lower_bound(a,c),
inference(transitivity,[status(thm)],[c21,c22]) ).
cnf(c24,plain,
greatest_lower_bound(greatest_lower_bound(a,c),least_upper_bound(a,X2)) = greatest_lower_bound(a,c),
inference(transitivity,[status(thm)],[c19,c23]) ).
cnf(c25,plain,
greatest_lower_bound(least_upper_bound(a,X2),greatest_lower_bound(a,c)) = greatest_lower_bound(a,c),
inference(transitivity,[status(thm)],[c18,c24]) ).
cnf(c26,plain,
greatest_lower_bound(least_upper_bound(a,X2),greatest_lower_bound(greatest_lower_bound(a,c),c)) = greatest_lower_bound(a,c),
inference(transitivity,[status(thm)],[c17,c25]) ).
cnf(c27,plain,
greatest_lower_bound(greatest_lower_bound(a,c),greatest_lower_bound(least_upper_bound(a,X2),c)) = greatest_lower_bound(a,c),
inference(transitivity,[status(thm)],[c14,c26]) ).
cnf(c28,plain,
greatest_lower_bound(greatest_lower_bound(least_upper_bound(a,X2),c),greatest_lower_bound(a,c)) = greatest_lower_bound(a,c),
inference(transitivity,[status(thm)],[c4,c27]) ).
cnf(c29,plain,
greatest_lower_bound(a,c) = greatest_lower_bound(greatest_lower_bound(least_upper_bound(a,X2),c),greatest_lower_bound(a,c)),
inference(symmetry,[status(thm)],[c28]) ).
cnf(c30,plain,
least_upper_bound(greatest_lower_bound(least_upper_bound(a,X2),c),greatest_lower_bound(a,c)) = least_upper_bound(greatest_lower_bound(least_upper_bound(a,X2),c),greatest_lower_bound(greatest_lower_bound(least_upper_bound(a,X2),c),greatest_lower_bound(a,c))),
inference(congruence,[status(thm)],[c29]) ).
cnf(c31,axiom,
least_upper_bound(X2,greatest_lower_bound(X2,Y2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lub_absorbtion) ).
cnf(c32,plain,
least_upper_bound(greatest_lower_bound(least_upper_bound(a,X2),c),greatest_lower_bound(greatest_lower_bound(least_upper_bound(a,X2),c),greatest_lower_bound(a,c))) = greatest_lower_bound(least_upper_bound(a,X2),c),
inference(substitution,[status(thm)],[c31]) ).
cnf(c33,plain,
least_upper_bound(greatest_lower_bound(least_upper_bound(a,X2),c),greatest_lower_bound(a,c)) = greatest_lower_bound(least_upper_bound(a,X2),c),
inference(transitivity,[status(thm)],[c30,c32]) ).
cnf(c34,plain,
least_upper_bound(greatest_lower_bound(least_upper_bound(a,b),c),greatest_lower_bound(a,c)) = greatest_lower_bound(least_upper_bound(a,b),c),
inference(substitution,[status(thm)],[c33]) ).
cnf(c35,plain,
greatest_lower_bound(least_upper_bound(a,b),c) = least_upper_bound(greatest_lower_bound(least_upper_bound(a,b),c),greatest_lower_bound(a,c)),
inference(symmetry,[status(thm)],[c34]) ).
cnf(c36,axiom,
least_upper_bound(X2,Y2) = least_upper_bound(Y2,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).
cnf(c37,plain,
least_upper_bound(greatest_lower_bound(a,c),greatest_lower_bound(least_upper_bound(a,b),c)) = least_upper_bound(greatest_lower_bound(least_upper_bound(a,b),c),greatest_lower_bound(a,c)),
inference(substitution,[status(thm)],[c36]) ).
cnf(c38,plain,
least_upper_bound(greatest_lower_bound(least_upper_bound(a,b),c),greatest_lower_bound(a,c)) = least_upper_bound(greatest_lower_bound(a,c),greatest_lower_bound(least_upper_bound(a,b),c)),
inference(symmetry,[status(thm)],[c37]) ).
cnf(c39,plain,
greatest_lower_bound(greatest_lower_bound(b,c),greatest_lower_bound(least_upper_bound(X2,b),c)) = greatest_lower_bound(greatest_lower_bound(least_upper_bound(X2,b),c),greatest_lower_bound(b,c)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c40,plain,
greatest_lower_bound(greatest_lower_bound(least_upper_bound(X2,b),c),greatest_lower_bound(b,c)) = greatest_lower_bound(greatest_lower_bound(b,c),greatest_lower_bound(least_upper_bound(X2,b),c)),
inference(symmetry,[status(thm)],[c39]) ).
cnf(c41,plain,
greatest_lower_bound(greatest_lower_bound(b,c),greatest_lower_bound(least_upper_bound(X2,b),c)) = greatest_lower_bound(least_upper_bound(X2,b),greatest_lower_bound(greatest_lower_bound(b,c),c)),
inference(substitution,[status(thm)],[c13]) ).
cnf(c42,axiom,
greatest_lower_bound(b,c) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',step) ).
cnf(c43,plain,
greatest_lower_bound(greatest_lower_bound(b,c),c) = greatest_lower_bound(b,c),
inference(congruence,[status(thm)],[c42]) ).
cnf(c44,plain,
greatest_lower_bound(least_upper_bound(X2,b),greatest_lower_bound(greatest_lower_bound(b,c),c)) = greatest_lower_bound(least_upper_bound(X2,b),greatest_lower_bound(b,c)),
inference(congruence,[status(thm)],[c43]) ).
cnf(c45,plain,
greatest_lower_bound(least_upper_bound(X2,b),greatest_lower_bound(b,c)) = greatest_lower_bound(greatest_lower_bound(b,c),least_upper_bound(X2,b)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c46,plain,
greatest_lower_bound(greatest_lower_bound(b,c),least_upper_bound(X2,b)) = greatest_lower_bound(b,least_upper_bound(X2,b)),
inference(congruence,[status(thm)],[c42]) ).
cnf(c47,plain,
least_upper_bound(X3,X2) = least_upper_bound(X2,X3),
inference(substitution,[status(thm)],[c36]) ).
cnf(c48,plain,
least_upper_bound(X2,X3) = least_upper_bound(X3,X2),
inference(symmetry,[status(thm)],[c47]) ).
cnf(c49,plain,
greatest_lower_bound(X3,least_upper_bound(X2,X3)) = greatest_lower_bound(X3,least_upper_bound(X3,X2)),
inference(congruence,[status(thm)],[c48]) ).
cnf(c50,plain,
greatest_lower_bound(X3,least_upper_bound(X3,X2)) = X3,
inference(substitution,[status(thm)],[c20]) ).
cnf(c51,plain,
greatest_lower_bound(X3,least_upper_bound(X2,X3)) = X3,
inference(transitivity,[status(thm)],[c49,c50]) ).
cnf(c52,plain,
greatest_lower_bound(b,least_upper_bound(X2,b)) = b,
inference(substitution,[status(thm)],[c51]) ).
cnf(c53,plain,
b = greatest_lower_bound(b,c),
inference(symmetry,[status(thm)],[c42]) ).
cnf(c54,plain,
greatest_lower_bound(b,least_upper_bound(X2,b)) = greatest_lower_bound(b,c),
inference(transitivity,[status(thm)],[c52,c53]) ).
cnf(c55,plain,
greatest_lower_bound(greatest_lower_bound(b,c),least_upper_bound(X2,b)) = greatest_lower_bound(b,c),
inference(transitivity,[status(thm)],[c46,c54]) ).
cnf(c56,plain,
greatest_lower_bound(least_upper_bound(X2,b),greatest_lower_bound(b,c)) = greatest_lower_bound(b,c),
inference(transitivity,[status(thm)],[c45,c55]) ).
cnf(c57,plain,
greatest_lower_bound(least_upper_bound(X2,b),greatest_lower_bound(greatest_lower_bound(b,c),c)) = greatest_lower_bound(b,c),
inference(transitivity,[status(thm)],[c44,c56]) ).
cnf(c58,plain,
greatest_lower_bound(greatest_lower_bound(b,c),greatest_lower_bound(least_upper_bound(X2,b),c)) = greatest_lower_bound(b,c),
inference(transitivity,[status(thm)],[c41,c57]) ).
cnf(c59,plain,
greatest_lower_bound(greatest_lower_bound(least_upper_bound(X2,b),c),greatest_lower_bound(b,c)) = greatest_lower_bound(b,c),
inference(transitivity,[status(thm)],[c40,c58]) ).
cnf(c60,plain,
greatest_lower_bound(b,c) = greatest_lower_bound(greatest_lower_bound(least_upper_bound(X2,b),c),greatest_lower_bound(b,c)),
inference(symmetry,[status(thm)],[c59]) ).
cnf(c61,plain,
least_upper_bound(greatest_lower_bound(least_upper_bound(X2,b),c),greatest_lower_bound(b,c)) = least_upper_bound(greatest_lower_bound(least_upper_bound(X2,b),c),greatest_lower_bound(greatest_lower_bound(least_upper_bound(X2,b),c),greatest_lower_bound(b,c))),
inference(congruence,[status(thm)],[c60]) ).
cnf(c62,plain,
least_upper_bound(greatest_lower_bound(least_upper_bound(X2,b),c),greatest_lower_bound(greatest_lower_bound(least_upper_bound(X2,b),c),greatest_lower_bound(b,c))) = greatest_lower_bound(least_upper_bound(X2,b),c),
inference(substitution,[status(thm)],[c31]) ).
cnf(c63,plain,
least_upper_bound(greatest_lower_bound(least_upper_bound(X2,b),c),greatest_lower_bound(b,c)) = greatest_lower_bound(least_upper_bound(X2,b),c),
inference(transitivity,[status(thm)],[c61,c62]) ).
cnf(c64,plain,
least_upper_bound(greatest_lower_bound(least_upper_bound(a,b),c),greatest_lower_bound(b,c)) = greatest_lower_bound(least_upper_bound(a,b),c),
inference(substitution,[status(thm)],[c63]) ).
cnf(c65,plain,
greatest_lower_bound(least_upper_bound(a,b),c) = least_upper_bound(greatest_lower_bound(least_upper_bound(a,b),c),greatest_lower_bound(b,c)),
inference(symmetry,[status(thm)],[c64]) ).
cnf(c66,plain,
least_upper_bound(greatest_lower_bound(a,c),greatest_lower_bound(least_upper_bound(a,b),c)) = least_upper_bound(greatest_lower_bound(a,c),least_upper_bound(greatest_lower_bound(least_upper_bound(a,b),c),greatest_lower_bound(b,c))),
inference(congruence,[status(thm)],[c65]) ).
cnf(c67,plain,
least_upper_bound(greatest_lower_bound(b,c),X2) = least_upper_bound(X2,greatest_lower_bound(b,c)),
inference(substitution,[status(thm)],[c36]) ).
cnf(c68,plain,
least_upper_bound(X2,greatest_lower_bound(b,c)) = least_upper_bound(greatest_lower_bound(b,c),X2),
inference(symmetry,[status(thm)],[c67]) ).
cnf(c69,plain,
least_upper_bound(greatest_lower_bound(a,c),least_upper_bound(X2,greatest_lower_bound(b,c))) = least_upper_bound(greatest_lower_bound(a,c),least_upper_bound(greatest_lower_bound(b,c),X2)),
inference(congruence,[status(thm)],[c68]) ).
cnf(c70,plain,
least_upper_bound(greatest_lower_bound(b,c),X2) = least_upper_bound(b,X2),
inference(congruence,[status(thm)],[c42]) ).
cnf(c71,plain,
least_upper_bound(greatest_lower_bound(a,c),least_upper_bound(greatest_lower_bound(b,c),X2)) = least_upper_bound(greatest_lower_bound(a,c),least_upper_bound(b,X2)),
inference(congruence,[status(thm)],[c70]) ).
cnf(c72,plain,
least_upper_bound(greatest_lower_bound(a,c),least_upper_bound(b,X2)) = least_upper_bound(a,least_upper_bound(b,X2)),
inference(congruence,[status(thm)],[c15]) ).
cnf(c73,axiom,
least_upper_bound(X2,least_upper_bound(Y2,Z2)) = least_upper_bound(least_upper_bound(X2,Y2),Z2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_lub) ).
cnf(c74,plain,
least_upper_bound(a,least_upper_bound(b,X2)) = least_upper_bound(least_upper_bound(a,b),X2),
inference(substitution,[status(thm)],[c73]) ).
cnf(c75,plain,
least_upper_bound(least_upper_bound(a,b),X2) = least_upper_bound(X2,least_upper_bound(a,b)),
inference(substitution,[status(thm)],[c36]) ).
cnf(c76,plain,
least_upper_bound(a,least_upper_bound(b,X2)) = least_upper_bound(X2,least_upper_bound(a,b)),
inference(transitivity,[status(thm)],[c74,c75]) ).
cnf(c77,plain,
least_upper_bound(greatest_lower_bound(a,c),least_upper_bound(b,X2)) = least_upper_bound(X2,least_upper_bound(a,b)),
inference(transitivity,[status(thm)],[c72,c76]) ).
cnf(c78,plain,
least_upper_bound(greatest_lower_bound(a,c),least_upper_bound(greatest_lower_bound(b,c),X2)) = least_upper_bound(X2,least_upper_bound(a,b)),
inference(transitivity,[status(thm)],[c71,c77]) ).
cnf(c79,plain,
least_upper_bound(greatest_lower_bound(a,c),least_upper_bound(X2,greatest_lower_bound(b,c))) = least_upper_bound(X2,least_upper_bound(a,b)),
inference(transitivity,[status(thm)],[c69,c78]) ).
cnf(c80,plain,
least_upper_bound(greatest_lower_bound(a,c),least_upper_bound(greatest_lower_bound(least_upper_bound(a,b),c),greatest_lower_bound(b,c))) = least_upper_bound(greatest_lower_bound(least_upper_bound(a,b),c),least_upper_bound(a,b)),
inference(substitution,[status(thm)],[c79]) ).
cnf(c81,plain,
least_upper_bound(X3,greatest_lower_bound(X3,X2)) = least_upper_bound(greatest_lower_bound(X3,X2),X3),
inference(substitution,[status(thm)],[c36]) ).
cnf(c82,plain,
least_upper_bound(greatest_lower_bound(X3,X2),X3) = least_upper_bound(X3,greatest_lower_bound(X3,X2)),
inference(symmetry,[status(thm)],[c81]) ).
cnf(c83,plain,
least_upper_bound(X3,greatest_lower_bound(X3,X2)) = X3,
inference(substitution,[status(thm)],[c31]) ).
cnf(c84,plain,
least_upper_bound(greatest_lower_bound(X3,X2),X3) = X3,
inference(transitivity,[status(thm)],[c82,c83]) ).
cnf(c85,plain,
least_upper_bound(greatest_lower_bound(least_upper_bound(a,b),c),least_upper_bound(a,b)) = least_upper_bound(a,b),
inference(substitution,[status(thm)],[c84]) ).
cnf(c86,plain,
least_upper_bound(greatest_lower_bound(a,c),least_upper_bound(greatest_lower_bound(least_upper_bound(a,b),c),greatest_lower_bound(b,c))) = least_upper_bound(a,b),
inference(transitivity,[status(thm)],[c80,c85]) ).
cnf(c87,plain,
least_upper_bound(greatest_lower_bound(a,c),greatest_lower_bound(least_upper_bound(a,b),c)) = least_upper_bound(a,b),
inference(transitivity,[status(thm)],[c66,c86]) ).
cnf(c88,plain,
least_upper_bound(greatest_lower_bound(least_upper_bound(a,b),c),greatest_lower_bound(a,c)) = least_upper_bound(a,b),
inference(transitivity,[status(thm)],[c38,c87]) ).
cnf(c89,plain,
greatest_lower_bound(least_upper_bound(a,b),c) = least_upper_bound(a,b),
inference(transitivity,[status(thm)],[c35,c88]) ).
cnf(c90,plain,
$false,
inference(resolution,[status(thm)],[c1,c89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP147-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.37 % Computer : n010.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 09:33:46 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.49 Command-line arguments: --flatten --complete-subsets
% 0.20/0.49
% 0.20/0.49 % SZS status Unsatisfiable
% 0.20/0.49
% 0.20/0.49 % SZS output start CNFRefutation
% See solution above
% 0.20/0.52
% 0.20/0.52 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------