%------------------------------------------------------------------------------
% File : Toma---0.7
% Problem : GRP170-4 : TPTP v9.0.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_Leo-III %s %d THM
% Computer : n011.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:38 AM UTC 2025
% Result : Unsatisfiable 2.24s 2.40s
% Output : CNFRefutation 2.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 6 RR)
% Number of literals : 18 ( 17 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 26 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(g0,negated_conjecture,
least_upper_bound(multiply(a,c),multiply(b,d)) != multiply(b,d),
file('theBenchmark.p',prove_p03d) ).
cnf(c4,axiom,
least_upper_bound(a,b) = b,
file('theBenchmark.p',p03d_1) ).
cnf(c5,axiom,
greatest_lower_bound(c,d) = c,
file('theBenchmark.p',p03d_2) ).
cnf(c6,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('GRP004-2.ax',symmetry_of_glb) ).
cnf(c7,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('GRP004-2.ax',symmetry_of_lub) ).
cnf(c10,axiom,
least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
file('GRP004-2.ax',lub_absorbtion) ).
cnf(c18,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(c19,plain,
least_upper_bound(least_upper_bound(X,Y),Z) = least_upper_bound(X,least_upper_bound(Y,Z)),
inference(equational,[status(thm)],[c18]) ).
cnf(c28,plain,
least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(Y,least_upper_bound(X,Z)),
inference(equational,[status(thm)],[c7,c19]) ).
cnf(c56,axiom,
multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
file('GRP004-2.ax',monotony_glb1) ).
cnf(c57,axiom,
multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
file('GRP004-2.ax',monotony_lub2) ).
cnf(c72,plain,
least_upper_bound(multiply(a,X),multiply(b,X)) = multiply(b,X),
inference(equational,[status(thm)],[c4,c57]) ).
cnf(c73,plain,
greatest_lower_bound(multiply(X,d),multiply(X,c)) = multiply(X,c),
inference(equational,[status(thm)],[c5,c6,c56]) ).
cnf(c97,plain,
least_upper_bound(multiply(X,d),multiply(X,c)) = multiply(X,d),
inference(equational,[status(thm)],[c10,c73]) ).
cnf(c381,plain,
least_upper_bound(multiply(a,X),least_upper_bound(Y,multiply(b,X))) = least_upper_bound(Y,multiply(b,X)),
inference(equational,[status(thm)],[c28,c72]) ).
cnf(c382,plain,
least_upper_bound(multiply(a,c),multiply(b,d)) = multiply(b,d),
inference(equational,[status(thm)],[c97,c381]) ).
cnf(g1,plain,
least_upper_bound(multiply(a,c),multiply(b,d)) = multiply(b,d),
inference(equational,[status(thm)],[c382]) ).
cnf(g2,plain,
$false,
inference(resolution,[status(thm)],[g0,g1]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP170-4 : TPTP v9.0.0. Bugfixed v1.2.1.
% 0.07/0.11 % Command : run_Leo-III %s %d THM
% 0.11/0.32 % Computer : n011.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Jul 14 08:13:49 EDT 2025
% 0.11/0.32 % CPUTime :
% 2.24/2.40 % SZS status Unsatisfiable
% 2.24/2.40 % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------