%------------------------------------------------------------------------------
% File : Toma---0.7
% Problem : GRP140-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n001.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:33 AM UTC 2025
% Result : Unsatisfiable 1.03s 1.18s
% Output : CNFRefutation 1.03s
% 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,
least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
file('theBenchmark.p',prove_ax_glb1c) ).
cnf(c4,axiom,
greatest_lower_bound(a,c) = c,
file('theBenchmark.p',ax_glb1c_1) ).
cnf(c5,axiom,
greatest_lower_bound(b,c) = c,
file('theBenchmark.p',ax_glb1c_2) ).
cnf(c6,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('GRP004-2.ax',symmetry_of_glb) ).
cnf(c9,axiom,
least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
file('GRP004-2.ax',lub_absorbtion) ).
cnf(c15,axiom,
greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z),
file('GRP004-2.ax',associativity_of_glb) ).
cnf(c16,plain,
greatest_lower_bound(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(X,greatest_lower_bound(Y,Z)),
inference(equational,[status(thm)],[c15]) ).
cnf(c138,plain,
least_upper_bound(greatest_lower_bound(X,Y),greatest_lower_bound(X,greatest_lower_bound(Y,Z))) = greatest_lower_bound(X,Y),
inference(equational,[status(thm)],[c9,c16]) ).
cnf(c139,plain,
least_upper_bound(greatest_lower_bound(X,a),greatest_lower_bound(X,c)) = greatest_lower_bound(X,a),
inference(equational,[status(thm)],[c4,c138]) ).
cnf(c140,plain,
least_upper_bound(greatest_lower_bound(b,a),c) = greatest_lower_bound(b,a),
inference(equational,[status(thm)],[c5,c139]) ).
cnf(g1,plain,
least_upper_bound(greatest_lower_bound(a,b),c) = greatest_lower_bound(a,b),
inference(equational,[status(thm)],[c6,c140]) ).
cnf(g2,plain,
$false,
inference(resolution,[status(thm)],[g0,g1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP140-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : run_Leo-III %s %d THM
% 0.12/0.34 % Computer : n001.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Jul 14 08:12:19 EDT 2025
% 0.12/0.34 % CPUTime :
% 1.03/1.18 % SZS status Unsatisfiable
% 1.03/1.18 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------