%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP152-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n016.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.13s 0.45s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 3 RR)
% Number of literals : 24 ( 23 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
least_upper_bound(b,least_upper_bound(a,b)) != least_upper_bound(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ax_lub3a) ).
cnf(c2,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_lub) ).
cnf(c3,plain,
least_upper_bound(least_upper_bound(X3,X2),X2) = least_upper_bound(X2,least_upper_bound(X3,X2)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
least_upper_bound(X2,least_upper_bound(X3,X2)) = least_upper_bound(least_upper_bound(X3,X2),X2),
inference(symmetry,[status(thm)],[c3]) ).
cnf(c5,plain,
least_upper_bound(X2,X3) = least_upper_bound(X3,X2),
inference(substitution,[status(thm)],[c2]) ).
cnf(c6,plain,
greatest_lower_bound(X3,least_upper_bound(X2,X3)) = greatest_lower_bound(X3,least_upper_bound(X3,X2)),
inference(congruence,[status(thm)],[c5]) ).
cnf(c7,axiom,
greatest_lower_bound(X2,least_upper_bound(X2,Y2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',glb_absorbtion) ).
cnf(c8,plain,
greatest_lower_bound(X3,least_upper_bound(X3,X2)) = X3,
inference(substitution,[status(thm)],[c7]) ).
cnf(c9,plain,
greatest_lower_bound(X3,least_upper_bound(X2,X3)) = X3,
inference(transitivity,[status(thm)],[c6,c8]) ).
cnf(c10,plain,
greatest_lower_bound(X2,least_upper_bound(X3,X2)) = X2,
inference(substitution,[status(thm)],[c9]) ).
cnf(c11,plain,
X2 = greatest_lower_bound(X2,least_upper_bound(X3,X2)),
inference(symmetry,[status(thm)],[c10]) ).
cnf(c12,plain,
least_upper_bound(least_upper_bound(X3,X2),X2) = least_upper_bound(least_upper_bound(X3,X2),greatest_lower_bound(X2,least_upper_bound(X3,X2))),
inference(congruence,[status(thm)],[c11]) ).
cnf(c13,axiom,
greatest_lower_bound(X2,Y2) = greatest_lower_bound(Y2,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_glb) ).
cnf(c14,plain,
greatest_lower_bound(X3,X2) = greatest_lower_bound(X2,X3),
inference(substitution,[status(thm)],[c13]) ).
cnf(c15,plain,
greatest_lower_bound(X2,X3) = greatest_lower_bound(X3,X2),
inference(symmetry,[status(thm)],[c14]) ).
cnf(c16,plain,
least_upper_bound(X3,greatest_lower_bound(X2,X3)) = least_upper_bound(X3,greatest_lower_bound(X3,X2)),
inference(congruence,[status(thm)],[c15]) ).
cnf(c17,axiom,
least_upper_bound(X2,greatest_lower_bound(X2,Y2)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lub_absorbtion) ).
cnf(c18,plain,
least_upper_bound(X3,greatest_lower_bound(X3,X2)) = X3,
inference(substitution,[status(thm)],[c17]) ).
cnf(c19,plain,
least_upper_bound(X3,greatest_lower_bound(X2,X3)) = X3,
inference(transitivity,[status(thm)],[c16,c18]) ).
cnf(c20,plain,
least_upper_bound(least_upper_bound(X3,X2),greatest_lower_bound(X2,least_upper_bound(X3,X2))) = least_upper_bound(X3,X2),
inference(substitution,[status(thm)],[c19]) ).
cnf(c21,plain,
least_upper_bound(least_upper_bound(X3,X2),X2) = least_upper_bound(X3,X2),
inference(transitivity,[status(thm)],[c12,c20]) ).
cnf(c22,plain,
least_upper_bound(X2,least_upper_bound(X3,X2)) = least_upper_bound(X3,X2),
inference(transitivity,[status(thm)],[c4,c21]) ).
cnf(c23,plain,
least_upper_bound(b,least_upper_bound(a,b)) = least_upper_bound(a,b),
inference(substitution,[status(thm)],[c22]) ).
cnf(c24,plain,
$false,
inference(resolution,[status(thm)],[c1,c23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP152-1 : 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 : n016.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:38:46 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.45 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 0.13/0.45
% 0.13/0.45 % SZS status Unsatisfiable
% 0.13/0.45
% 0.13/0.45 % SZS output start CNFRefutation
% See solution above
% 0.13/0.46
% 0.13/0.46 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------