%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP148-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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.10s 0.45s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of clauses : 36 ( 36 unt; 0 nHn; 20 RR)
% Number of literals : 36 ( 35 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 40 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_lub1c) ).
cnf(c2,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).
cnf(c3,plain,
least_upper_bound(least_upper_bound(X4,X2),X3) = least_upper_bound(X3,least_upper_bound(X4,X2)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
least_upper_bound(X3,least_upper_bound(X4,X2)) = least_upper_bound(least_upper_bound(X4,X2),X3),
inference(symmetry,[status(thm)],[c3]) ).
cnf(c5,axiom,
least_upper_bound(X2,least_upper_bound(Y2,Z)) = least_upper_bound(least_upper_bound(X2,Y2),Z),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_lub) ).
cnf(c6,plain,
least_upper_bound(X4,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X4,X2),X3),
inference(substitution,[status(thm)],[c5]) ).
cnf(c7,plain,
least_upper_bound(least_upper_bound(X4,X2),X3) = least_upper_bound(X4,least_upper_bound(X2,X3)),
inference(symmetry,[status(thm)],[c6]) ).
cnf(c8,plain,
least_upper_bound(X2,X3) = least_upper_bound(X3,X2),
inference(substitution,[status(thm)],[c2]) ).
cnf(c9,plain,
least_upper_bound(X4,least_upper_bound(X2,X3)) = least_upper_bound(X4,least_upper_bound(X3,X2)),
inference(congruence,[status(thm)],[c8]) ).
cnf(c10,plain,
least_upper_bound(least_upper_bound(X4,X2),X3) = least_upper_bound(X4,least_upper_bound(X3,X2)),
inference(transitivity,[status(thm)],[c7,c9]) ).
cnf(c11,plain,
least_upper_bound(X3,least_upper_bound(X4,X2)) = least_upper_bound(X4,least_upper_bound(X3,X2)),
inference(transitivity,[status(thm)],[c4,c10]) ).
cnf(c12,plain,
least_upper_bound(c,least_upper_bound(a,b)) = least_upper_bound(a,least_upper_bound(c,b)),
inference(substitution,[status(thm)],[c11]) ).
cnf(c13,plain,
least_upper_bound(b,c) = least_upper_bound(c,b),
inference(substitution,[status(thm)],[c2]) ).
cnf(c14,plain,
least_upper_bound(c,b) = least_upper_bound(b,c),
inference(symmetry,[status(thm)],[c13]) ).
cnf(c15,axiom,
least_upper_bound(b,c) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c16,plain,
least_upper_bound(c,b) = c,
inference(transitivity,[status(thm)],[c14,c15]) ).
cnf(c17,plain,
least_upper_bound(a,least_upper_bound(c,b)) = least_upper_bound(a,c),
inference(congruence,[status(thm)],[c16]) ).
cnf(c18,plain,
least_upper_bound(a,c) = least_upper_bound(c,a),
inference(substitution,[status(thm)],[c2]) ).
cnf(c19,plain,
least_upper_bound(a,c) = least_upper_bound(c,a),
inference(substitution,[status(thm)],[c2]) ).
cnf(c20,plain,
least_upper_bound(c,a) = least_upper_bound(a,c),
inference(symmetry,[status(thm)],[c19]) ).
cnf(c21,axiom,
least_upper_bound(a,c) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c22,plain,
least_upper_bound(c,a) = c,
inference(transitivity,[status(thm)],[c20,c21]) ).
cnf(c23,plain,
least_upper_bound(a,c) = c,
inference(transitivity,[status(thm)],[c18,c22]) ).
cnf(c24,plain,
least_upper_bound(a,least_upper_bound(c,b)) = c,
inference(transitivity,[status(thm)],[c17,c23]) ).
cnf(c25,plain,
least_upper_bound(c,least_upper_bound(a,b)) = c,
inference(transitivity,[status(thm)],[c12,c24]) ).
cnf(c26,plain,
c = least_upper_bound(c,least_upper_bound(a,b)),
inference(symmetry,[status(thm)],[c25]) ).
cnf(c27,plain,
greatest_lower_bound(least_upper_bound(a,b),c) = greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(c,least_upper_bound(a,b))),
inference(congruence,[status(thm)],[c26]) ).
cnf(c28,plain,
least_upper_bound(X3,X2) = least_upper_bound(X2,X3),
inference(substitution,[status(thm)],[c2]) ).
cnf(c29,plain,
least_upper_bound(X2,X3) = least_upper_bound(X3,X2),
inference(symmetry,[status(thm)],[c28]) ).
cnf(c30,plain,
greatest_lower_bound(X3,least_upper_bound(X2,X3)) = greatest_lower_bound(X3,least_upper_bound(X3,X2)),
inference(congruence,[status(thm)],[c29]) ).
cnf(c31,axiom,
greatest_lower_bound(X2,least_upper_bound(X2,Y2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',glb_absorbtion) ).
cnf(c32,plain,
greatest_lower_bound(X3,least_upper_bound(X3,X2)) = X3,
inference(substitution,[status(thm)],[c31]) ).
cnf(c33,plain,
greatest_lower_bound(X3,least_upper_bound(X2,X3)) = X3,
inference(transitivity,[status(thm)],[c30,c32]) ).
cnf(c34,plain,
greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(c,least_upper_bound(a,b))) = least_upper_bound(a,b),
inference(substitution,[status(thm)],[c33]) ).
cnf(c35,plain,
greatest_lower_bound(least_upper_bound(a,b),c) = least_upper_bound(a,b),
inference(transitivity,[status(thm)],[c27,c34]) ).
cnf(c36,plain,
$false,
inference(resolution,[status(thm)],[c1,c35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP148-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 09:35:39 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/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.10/0.45
% 0.10/0.45 % SZS status Unsatisfiable
% 0.10/0.45
% 0.10/0.45 % SZS output start CNFRefutation
% See solution above
% 0.10/0.46
% 0.10/0.46 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------