%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP138-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/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:25 AM UTC 2026
% Result : Unsatisfiable 0.08s 0.45s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of clauses : 44 ( 44 unt; 0 nHn; 31 RR)
% Number of literals : 44 ( 43 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 34 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_glb1a) ).
cnf(c2,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_glb) ).
cnf(c3,plain,
greatest_lower_bound(c,greatest_lower_bound(a,b)) = greatest_lower_bound(greatest_lower_bound(a,b),c),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
greatest_lower_bound(greatest_lower_bound(a,b),c) = greatest_lower_bound(c,greatest_lower_bound(a,b)),
inference(symmetry,[status(thm)],[c3]) ).
cnf(c5,plain,
greatest_lower_bound(greatest_lower_bound(X4,X2),X3) = greatest_lower_bound(X3,greatest_lower_bound(X4,X2)),
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/sandbox/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(c,greatest_lower_bound(a,b)) = greatest_lower_bound(a,greatest_lower_bound(c,b)),
inference(substitution,[status(thm)],[c13]) ).
cnf(c15,axiom,
least_upper_bound(X2,Y2) = least_upper_bound(Y2,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).
cnf(c16,plain,
least_upper_bound(b,c) = least_upper_bound(c,b),
inference(substitution,[status(thm)],[c15]) ).
cnf(c17,plain,
least_upper_bound(c,b) = least_upper_bound(b,c),
inference(symmetry,[status(thm)],[c16]) ).
cnf(c18,axiom,
least_upper_bound(b,c) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c19,plain,
least_upper_bound(c,b) = b,
inference(transitivity,[status(thm)],[c17,c18]) ).
cnf(c20,plain,
b = least_upper_bound(c,b),
inference(symmetry,[status(thm)],[c19]) ).
cnf(c21,plain,
greatest_lower_bound(c,b) = greatest_lower_bound(c,least_upper_bound(c,b)),
inference(congruence,[status(thm)],[c20]) ).
cnf(c22,axiom,
greatest_lower_bound(X2,least_upper_bound(X2,Y2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',glb_absorbtion) ).
cnf(c23,plain,
greatest_lower_bound(c,least_upper_bound(c,b)) = c,
inference(substitution,[status(thm)],[c22]) ).
cnf(c24,plain,
greatest_lower_bound(c,b) = c,
inference(transitivity,[status(thm)],[c21,c23]) ).
cnf(c25,plain,
greatest_lower_bound(a,greatest_lower_bound(c,b)) = greatest_lower_bound(a,c),
inference(congruence,[status(thm)],[c24]) ).
cnf(c26,plain,
greatest_lower_bound(a,c) = greatest_lower_bound(c,a),
inference(substitution,[status(thm)],[c2]) ).
cnf(c27,plain,
least_upper_bound(a,c) = least_upper_bound(c,a),
inference(substitution,[status(thm)],[c15]) ).
cnf(c28,plain,
least_upper_bound(c,a) = least_upper_bound(a,c),
inference(symmetry,[status(thm)],[c27]) ).
cnf(c29,axiom,
least_upper_bound(a,c) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c30,plain,
least_upper_bound(c,a) = a,
inference(transitivity,[status(thm)],[c28,c29]) ).
cnf(c31,plain,
a = least_upper_bound(c,a),
inference(symmetry,[status(thm)],[c30]) ).
cnf(c32,plain,
greatest_lower_bound(c,a) = greatest_lower_bound(c,least_upper_bound(c,a)),
inference(congruence,[status(thm)],[c31]) ).
cnf(c33,plain,
greatest_lower_bound(c,least_upper_bound(c,a)) = c,
inference(substitution,[status(thm)],[c22]) ).
cnf(c34,plain,
greatest_lower_bound(c,a) = c,
inference(transitivity,[status(thm)],[c32,c33]) ).
cnf(c35,plain,
greatest_lower_bound(a,c) = c,
inference(transitivity,[status(thm)],[c26,c34]) ).
cnf(c36,plain,
greatest_lower_bound(a,greatest_lower_bound(c,b)) = c,
inference(transitivity,[status(thm)],[c25,c35]) ).
cnf(c37,plain,
greatest_lower_bound(c,greatest_lower_bound(a,b)) = c,
inference(transitivity,[status(thm)],[c14,c36]) ).
cnf(c38,plain,
greatest_lower_bound(greatest_lower_bound(a,b),c) = c,
inference(transitivity,[status(thm)],[c4,c37]) ).
cnf(c39,plain,
c = greatest_lower_bound(greatest_lower_bound(a,b),c),
inference(symmetry,[status(thm)],[c38]) ).
cnf(c40,plain,
least_upper_bound(greatest_lower_bound(a,b),c) = least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(greatest_lower_bound(a,b),c)),
inference(congruence,[status(thm)],[c39]) ).
cnf(c41,axiom,
least_upper_bound(X2,greatest_lower_bound(X2,Y2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lub_absorbtion) ).
cnf(c42,plain,
least_upper_bound(greatest_lower_bound(a,b),greatest_lower_bound(greatest_lower_bound(a,b),c)) = greatest_lower_bound(a,b),
inference(substitution,[status(thm)],[c41]) ).
cnf(c43,plain,
least_upper_bound(greatest_lower_bound(a,b),c) = greatest_lower_bound(a,b),
inference(transitivity,[status(thm)],[c40,c42]) ).
cnf(c44,plain,
$false,
inference(resolution,[status(thm)],[c1,c43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP138-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 : n020.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:34:20 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.45 Command-line arguments: --flatten-regeneralise
% 0.08/0.45
% 0.08/0.45 % SZS status Unsatisfiable
% 0.08/0.45
% 0.08/0.45 % SZS output start CNFRefutation
% See solution above
% 0.08/0.46
% 0.08/0.46 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------