%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP163-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n009.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:29 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.48s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 16 RR)
% Number of literals : 33 ( 32 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 : 42 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
greatest_lower_bound(a,c) != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ax_transb) ).
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(X3,X2) = greatest_lower_bound(X2,X3),
inference(substitution,[status(thm)],[c2]) ).
cnf(c4,plain,
greatest_lower_bound(X2,X3) = greatest_lower_bound(X3,X2),
inference(symmetry,[status(thm)],[c3]) ).
cnf(c5,plain,
least_upper_bound(X3,greatest_lower_bound(X2,X3)) = least_upper_bound(X3,greatest_lower_bound(X3,X2)),
inference(congruence,[status(thm)],[c4]) ).
cnf(c6,axiom,
least_upper_bound(X2,greatest_lower_bound(X2,Y2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lub_absorbtion) ).
cnf(c7,plain,
least_upper_bound(X3,greatest_lower_bound(X3,X2)) = X3,
inference(substitution,[status(thm)],[c6]) ).
cnf(c8,plain,
least_upper_bound(X3,greatest_lower_bound(X2,X3)) = X3,
inference(transitivity,[status(thm)],[c5,c7]) ).
cnf(c9,plain,
least_upper_bound(greatest_lower_bound(a,c),greatest_lower_bound(b,greatest_lower_bound(a,c))) = greatest_lower_bound(a,c),
inference(substitution,[status(thm)],[c8]) ).
cnf(c10,plain,
greatest_lower_bound(a,c) = least_upper_bound(greatest_lower_bound(a,c),greatest_lower_bound(b,greatest_lower_bound(a,c))),
inference(symmetry,[status(thm)],[c9]) ).
cnf(c11,plain,
greatest_lower_bound(greatest_lower_bound(X3,X4),X2) = greatest_lower_bound(X2,greatest_lower_bound(X3,X4)),
inference(substitution,[status(thm)],[c2]) ).
cnf(c12,plain,
greatest_lower_bound(X3,greatest_lower_bound(X4,X2)) = greatest_lower_bound(greatest_lower_bound(X4,X2),X3),
inference(symmetry,[status(thm)],[c11]) ).
cnf(c13,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(c14,plain,
greatest_lower_bound(X4,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X4,X2),X3),
inference(substitution,[status(thm)],[c13]) ).
cnf(c15,plain,
greatest_lower_bound(greatest_lower_bound(X4,X2),X3) = greatest_lower_bound(X4,greatest_lower_bound(X2,X3)),
inference(symmetry,[status(thm)],[c14]) ).
cnf(c16,plain,
greatest_lower_bound(X2,X3) = greatest_lower_bound(X3,X2),
inference(substitution,[status(thm)],[c2]) ).
cnf(c17,plain,
greatest_lower_bound(X4,greatest_lower_bound(X2,X3)) = greatest_lower_bound(X4,greatest_lower_bound(X3,X2)),
inference(congruence,[status(thm)],[c16]) ).
cnf(c18,plain,
greatest_lower_bound(greatest_lower_bound(X4,X2),X3) = greatest_lower_bound(X4,greatest_lower_bound(X3,X2)),
inference(transitivity,[status(thm)],[c15,c17]) ).
cnf(c19,plain,
greatest_lower_bound(X3,greatest_lower_bound(X4,X2)) = greatest_lower_bound(X4,greatest_lower_bound(X3,X2)),
inference(transitivity,[status(thm)],[c12,c18]) ).
cnf(c20,plain,
greatest_lower_bound(b,greatest_lower_bound(a,c)) = greatest_lower_bound(a,greatest_lower_bound(b,c)),
inference(substitution,[status(thm)],[c19]) ).
cnf(c21,axiom,
greatest_lower_bound(b,c) = b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c22,plain,
greatest_lower_bound(a,greatest_lower_bound(b,c)) = greatest_lower_bound(a,b),
inference(congruence,[status(thm)],[c21]) ).
cnf(c23,axiom,
greatest_lower_bound(a,b) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',step) ).
cnf(c24,plain,
greatest_lower_bound(a,greatest_lower_bound(b,c)) = a,
inference(transitivity,[status(thm)],[c22,c23]) ).
cnf(c25,plain,
greatest_lower_bound(b,greatest_lower_bound(a,c)) = a,
inference(transitivity,[status(thm)],[c20,c24]) ).
cnf(c26,plain,
least_upper_bound(greatest_lower_bound(a,c),greatest_lower_bound(b,greatest_lower_bound(a,c))) = least_upper_bound(greatest_lower_bound(a,c),a),
inference(congruence,[status(thm)],[c25]) ).
cnf(c27,axiom,
least_upper_bound(X2,Y2) = least_upper_bound(Y2,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_lub) ).
cnf(c28,plain,
least_upper_bound(greatest_lower_bound(a,c),a) = least_upper_bound(a,greatest_lower_bound(a,c)),
inference(substitution,[status(thm)],[c27]) ).
cnf(c29,plain,
least_upper_bound(a,greatest_lower_bound(a,c)) = a,
inference(substitution,[status(thm)],[c6]) ).
cnf(c30,plain,
least_upper_bound(greatest_lower_bound(a,c),a) = a,
inference(transitivity,[status(thm)],[c28,c29]) ).
cnf(c31,plain,
least_upper_bound(greatest_lower_bound(a,c),greatest_lower_bound(b,greatest_lower_bound(a,c))) = a,
inference(transitivity,[status(thm)],[c26,c30]) ).
cnf(c32,plain,
greatest_lower_bound(a,c) = a,
inference(transitivity,[status(thm)],[c10,c31]) ).
cnf(c33,plain,
$false,
inference(resolution,[status(thm)],[c1,c32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP163-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.38 % Computer : n009.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Sun Sep 27 09:34:29 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.48 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.17/0.48
% 0.17/0.48 % SZS status Unsatisfiable
% 0.17/0.48
% 0.17/0.48 % SZS output start CNFRefutation
% See solution above
% 0.17/0.49
% 0.17/0.49 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------