%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP166-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n019.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 26 07:02:15 EDT 2022
% Result : Unsatisfiable 33.89s 34.12s
% Output : CNFRefutation 33.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 5 RR)
% Number of literals : 19 ( 18 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_22809') ).
cnf(eq_1,axiom,
identity = multiply(inverse(X),X),
file('/tmp/MaedMax_22809') ).
cnf(eq_2,axiom,
multiply(X,multiply(Y,Z)) = multiply(multiply(X,Y),Z),
file('/tmp/MaedMax_22809') ).
cnf(eq_3,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/tmp/MaedMax_22809') ).
cnf(eq_4,axiom,
multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_22809') ).
cnf(eq_5,axiom,
identity = greatest_lower_bound(b,identity),
file('/tmp/MaedMax_22809') ).
cnf(eq_6,negated_conjecture,
greatest_lower_bound(a,multiply(a,b)) != a,
file('/tmp/MaedMax_22809') ).
cnf(eq_7,plain,
multiply(x100,identity) = greatest_lower_bound(multiply(x100,b),multiply(x100,identity)),
inference(cp,[status(thm)],[eq_5,eq_4]) ).
cnf(eq_8,plain,
multiply(identity,x102) = multiply(inverse(X),multiply(X,x102)),
inference(cp,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_9,plain,
X = multiply(inverse(Y),multiply(Y,X)),
inference(rw,[status(thm)],[eq_8,eq_0]) ).
cnf(eq_10,plain,
multiply(inverse(inverse(X)),identity) = X,
inference(cp,[status(thm)],[eq_1,eq_9]) ).
cnf(eq_11,plain,
X = multiply(inverse(inverse(X)),identity),
eq_10 ).
cnf(eq_12,plain,
multiply(inverse(inverse(inverse(X))),X) = identity,
inference(cp,[status(thm)],[eq_10,eq_9]) ).
cnf(eq_13,plain,
multiply(inverse(inverse(inverse(inverse(X)))),identity) = X,
inference(cp,[status(thm)],[eq_12,eq_9]) ).
cnf(eq_14,plain,
X = inverse(inverse(X)),
inference(rw,[status(thm)],[eq_13,eq_10]) ).
cnf(eq_15,plain,
X = multiply(X,identity),
inference(rw,[status(thm)],[eq_11,eq_14]) ).
cnf(eq_16,plain,
X = greatest_lower_bound(X,multiply(X,b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_7,eq_15]),eq_15]),eq_3]) ).
cnf(eq_17,negated_conjecture,
a != a,
inference(rw,[status(thm)],[eq_6,eq_16]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP166-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : run_maedmax %d %s
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Jul 26 04:17:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 33.89/34.12 % SZS status Unsatisfiable
% 33.89/34.12 % SZS output start CNFRefutation for /tmp/MaedMax_22809
% See solution above
% 33.89/34.12
%------------------------------------------------------------------------------