%------------------------------------------------------------------------------
% File : Toma---0.7
% Problem : GRP148-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Jul 15 06:43:34 AM UTC 2025
% Result : Unsatisfiable 1.05s 1.23s
% Output : CNFRefutation 1.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 6 RR)
% Number of literals : 12 ( 11 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 : 14 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,negated_conjecture,
greatest_lower_bound(least_upper_bound(a,b),c) != least_upper_bound(a,b),
file('theBenchmark.p',prove_ax_lub1c) ).
cnf(c4,axiom,
least_upper_bound(a,c) = c,
file('theBenchmark.p',ax_lub1c_1) ).
cnf(c5,axiom,
least_upper_bound(b,c) = c,
file('theBenchmark.p',ax_lub1c_2) ).
cnf(c7,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('GRP004-2.ax',symmetry_of_lub) ).
cnf(c10,axiom,
greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
file('GRP004-2.ax',glb_absorbtion) ).
cnf(c17,axiom,
least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z),
file('GRP004-2.ax',associativity_of_lub) ).
cnf(c18,plain,
least_upper_bound(least_upper_bound(X,Y),Z) = least_upper_bound(X,least_upper_bound(Y,Z)),
inference(equational,[status(thm)],[c17]) ).
cnf(c151,plain,
greatest_lower_bound(least_upper_bound(X,Y),least_upper_bound(X,least_upper_bound(Y,Z))) = least_upper_bound(X,Y),
inference(equational,[status(thm)],[c10,c18]) ).
cnf(c152,plain,
greatest_lower_bound(least_upper_bound(X,a),least_upper_bound(X,c)) = least_upper_bound(X,a),
inference(equational,[status(thm)],[c4,c151]) ).
cnf(c153,plain,
greatest_lower_bound(least_upper_bound(b,a),c) = least_upper_bound(b,a),
inference(equational,[status(thm)],[c5,c152]) ).
cnf(g1,plain,
greatest_lower_bound(least_upper_bound(a,b),c) = least_upper_bound(a,b),
inference(equational,[status(thm)],[c7,c153]) ).
cnf(g2,plain,
$false,
inference(resolution,[status(thm)],[g0,g1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP148-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : run_Leo-III %s %d THM
% 0.12/0.33 % Computer : n007.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Jul 14 08:12:19 EDT 2025
% 0.12/0.33 % CPUTime :
% 1.05/1.23 % SZS status Unsatisfiable
% 1.05/1.23 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------