%------------------------------------------------------------------------------
% File : Toma---0.7
% Problem : GRP169-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n012.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:37 AM UTC 2025
% Result : Unsatisfiable 1.03s 1.18s
% Output : CNFRefutation 1.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 7 RR)
% Number of literals : 21 ( 20 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,negated_conjecture,
least_upper_bound(a,b) != a,
file('theBenchmark.p',prove_p02a) ).
cnf(c3,axiom,
multiply(identity,X) = X,
file('GRP004-0.ax',left_identity) ).
cnf(c5,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('GRP004-2.ax',symmetry_of_lub) ).
cnf(c6,axiom,
multiply(inverse(X),X) = identity,
file('GRP004-0.ax',left_inverse) ).
cnf(c11,axiom,
least_upper_bound(inverse(a),inverse(b)) = inverse(b),
file('theBenchmark.p',p02a_1) ).
cnf(c12,plain,
least_upper_bound(inverse(b),inverse(a)) = inverse(b),
inference(equational,[status(thm)],[c5,c11]) ).
cnf(c15,axiom,
multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
file('GRP004-0.ax',associativity) ).
cnf(c22,plain,
multiply(inverse(X),multiply(X,Y)) = Y,
inference(equational,[status(thm)],[c3,c6,c15]) ).
cnf(c24,plain,
multiply(inverse(inverse(X)),identity) = X,
inference(equational,[status(thm)],[c6,c22]) ).
cnf(c27,plain,
multiply(inverse(inverse(X)),Y) = multiply(X,Y),
inference(equational,[status(thm)],[c22]) ).
cnf(c28,plain,
multiply(X,identity) = X,
inference(equational,[status(thm)],[c24,c27]) ).
cnf(c30,plain,
inverse(inverse(X)) = X,
inference(equational,[status(thm)],[c24,c28]) ).
cnf(c31,plain,
multiply(X,inverse(X)) = identity,
inference(equational,[status(thm)],[c6,c27]) ).
cnf(c34,axiom,
multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
file('GRP004-2.ax',monotony_lub2) ).
cnf(c37,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('GRP004-2.ax',monotony_lub1) ).
cnf(c100,plain,
least_upper_bound(multiply(X,inverse(b)),multiply(X,inverse(a))) = multiply(X,inverse(b)),
inference(equational,[status(thm)],[c12,c37]) ).
cnf(c101,plain,
least_upper_bound(identity,multiply(b,inverse(a))) = identity,
inference(equational,[status(thm)],[c6,c30,c31,c100]) ).
cnf(c106,plain,
least_upper_bound(X,multiply(b,multiply(inverse(a),X))) = X,
inference(equational,[status(thm)],[c3,c15,c34,c101]) ).
cnf(c107,plain,
least_upper_bound(b,a) = a,
inference(equational,[status(thm)],[c5,c6,c28,c106]) ).
cnf(g1,plain,
least_upper_bound(a,b) = a,
inference(equational,[status(thm)],[c5,c107]) ).
cnf(g2,plain,
$false,
inference(resolution,[status(thm)],[g0,g1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP169-1 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.10/0.11 % Command : run_Leo-III %s %d THM
% 0.12/0.31 % Computer : n012.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Mon Jul 14 08:13:19 EDT 2025
% 0.12/0.31 % CPUTime :
% 1.03/1.18 % SZS status Unsatisfiable
% 1.03/1.18 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------