%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP175-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n015.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:18 EDT 2022
% Result : Unsatisfiable 0.68s 0.89s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 5 RR)
% Number of literals : 13 ( 12 equ; 3 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 : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_20167') ).
cnf(eq_1,axiom,
identity = multiply(inverse(X),X),
file('/tmp/MaedMax_20167') ).
cnf(eq_2,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_20167') ).
cnf(eq_3,axiom,
multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_20167') ).
cnf(eq_4,axiom,
least_upper_bound(identity,b) = b,
file('/tmp/MaedMax_20167') ).
cnf(eq_5,negated_conjecture,
multiply(inverse(a),multiply(b,a)) != least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),
file('/tmp/MaedMax_20167') ).
cnf(eq_6,plain,
least_upper_bound(identity,multiply(inverse(X),x102)) = multiply(inverse(X),least_upper_bound(X,x102)),
inference(cp,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_7,plain,
least_upper_bound(X,multiply(x102,X)) = multiply(least_upper_bound(identity,x102),X),
inference(cp,[status(thm)],[eq_0,eq_3]) ).
cnf(eq_8,plain,
multiply(least_upper_bound(identity,X),Y) = least_upper_bound(Y,multiply(X,Y)),
eq_7 ).
cnf(eq_9,plain,
multiply(inverse(X),least_upper_bound(X,Y)) = least_upper_bound(identity,multiply(inverse(X),Y)),
eq_6 ).
cnf(eq_10,negated_conjecture,
multiply(inverse(a),least_upper_bound(a,multiply(b,a))) != multiply(inverse(a),multiply(b,a)),
inference(cp,[status(thm)],[eq_9,eq_5]) ).
cnf(eq_11,negated_conjecture,
multiply(inverse(a),multiply(b,a)) != multiply(inverse(a),multiply(b,a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_10,eq_8]),eq_4]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP175-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : run_maedmax %d %s
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Jul 26 04:21:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.68/0.89 % SZS status Unsatisfiable
% 0.68/0.89 % SZS output start CNFRefutation for /tmp/MaedMax_20167
% See solution above
% 0.68/0.89
%------------------------------------------------------------------------------