TSTP Solution File: GRP191-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP191-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n020.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:24 EDT 2022
% Result : Unsatisfiable 1.46s 1.70s
% Output : CNFRefutation 1.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 10
% Syntax : Number of clauses : 44 ( 44 unt; 0 nHn; 9 RR)
% Number of literals : 44 ( 43 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 61 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_14853') ).
cnf(eq_1,axiom,
identity = multiply(inverse(X),X),
file('/tmp/MaedMax_14853') ).
cnf(eq_2,axiom,
multiply(X,multiply(Y,Z)) = multiply(multiply(X,Y),Z),
file('/tmp/MaedMax_14853') ).
cnf(eq_3,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/tmp/MaedMax_14853') ).
cnf(eq_4,axiom,
greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z),
file('/tmp/MaedMax_14853') ).
cnf(eq_5,axiom,
X = greatest_lower_bound(X,X),
file('/tmp/MaedMax_14853') ).
cnf(eq_6,axiom,
multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_14853') ).
cnf(eq_7,axiom,
multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_14853') ).
cnf(eq_8,axiom,
greatest_lower_bound(a,b) = b,
file('/tmp/MaedMax_14853') ).
cnf(eq_9,negated_conjecture,
inverse(a) != greatest_lower_bound(inverse(a),inverse(b)),
file('/tmp/MaedMax_14853') ).
cnf(eq_10,plain,
multiply(identity,x102) = multiply(inverse(X),multiply(X,x102)),
inference(cp,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_11,plain,
greatest_lower_bound(multiply(inverse(X),x101),identity) = multiply(inverse(X),greatest_lower_bound(x101,X)),
inference(cp,[status(thm)],[eq_1,eq_6]) ).
cnf(eq_12,plain,
greatest_lower_bound(X,multiply(x102,X)) = multiply(greatest_lower_bound(identity,x102),X),
inference(cp,[status(thm)],[eq_0,eq_7]) ).
cnf(eq_13,plain,
greatest_lower_bound(greatest_lower_bound(X,Y),x102) = greatest_lower_bound(Y,greatest_lower_bound(X,x102)),
inference(cp,[status(thm)],[eq_3,eq_4]) ).
cnf(eq_14,plain,
greatest_lower_bound(b,a) = b,
inference(cp,[status(thm)],[eq_3,eq_8]) ).
cnf(eq_15,plain,
greatest_lower_bound(x100,X) = greatest_lower_bound(X,greatest_lower_bound(x100,X)),
inference(cp,[status(thm)],[eq_5,eq_20]) ).
cnf(eq_16,plain,
multiply(greatest_lower_bound(identity,X),Y) = greatest_lower_bound(Y,multiply(X,Y)),
eq_12 ).
cnf(eq_17,plain,
X = multiply(inverse(Y),multiply(Y,X)),
inference(rw,[status(thm)],[eq_10,eq_0]) ).
cnf(eq_18,plain,
multiply(inverse(X),greatest_lower_bound(Y,X)) = greatest_lower_bound(identity,multiply(inverse(X),Y)),
inference(rw,[status(thm)],[eq_11,eq_3]) ).
cnf(eq_19,plain,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,greatest_lower_bound(X,Y)),
eq_15 ).
cnf(eq_20,plain,
greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(Y,greatest_lower_bound(X,Z)),
inference(rw,[status(thm)],[eq_13,eq_4]) ).
cnf(eq_21,plain,
multiply(inverse(inverse(X)),identity) = X,
inference(cp,[status(thm)],[eq_1,eq_17]) ).
cnf(eq_22,plain,
X = multiply(inverse(inverse(X)),identity),
eq_21 ).
cnf(eq_23,plain,
multiply(inverse(inverse(inverse(X))),X) = identity,
inference(cp,[status(thm)],[eq_21,eq_17]) ).
cnf(eq_24,plain,
multiply(inverse(inverse(inverse(inverse(X)))),identity) = X,
inference(cp,[status(thm)],[eq_23,eq_17]) ).
cnf(eq_25,plain,
X = inverse(inverse(X)),
inference(rw,[status(thm)],[eq_24,eq_21]) ).
cnf(eq_26,plain,
X = multiply(X,identity),
inference(rw,[status(thm)],[eq_22,eq_25]) ).
cnf(eq_27,plain,
multiply(X,inverse(X)) = identity,
inference(cp,[status(thm)],[eq_25,eq_1]) ).
cnf(eq_28,plain,
multiply(X,multiply(inverse(X),x101)) = x101,
inference(cp,[status(thm)],[eq_25,eq_17]) ).
cnf(eq_29,plain,
X = multiply(Y,multiply(inverse(Y),X)),
eq_28 ).
cnf(eq_30,plain,
multiply(X,multiply(Y,inverse(multiply(X,Y)))) = identity,
inference(cp,[status(thm)],[eq_2,eq_27]) ).
cnf(eq_31,plain,
multiply(inverse(greatest_lower_bound(X,Y)),greatest_lower_bound(X,Y)) = greatest_lower_bound(identity,multiply(inverse(greatest_lower_bound(X,Y)),Y)),
inference(cp,[status(thm)],[eq_19,eq_18]) ).
cnf(eq_32,plain,
identity = greatest_lower_bound(identity,multiply(inverse(greatest_lower_bound(X,Y)),Y)),
inference(rw,[status(thm)],[eq_31,eq_1]) ).
cnf(eq_33,plain,
multiply(inverse(X),identity) = multiply(Y,inverse(multiply(X,Y))),
inference(cp,[status(thm)],[eq_30,eq_17]) ).
cnf(eq_34,plain,
greatest_lower_bound(identity,multiply(inverse(b),a)) = identity,
inference(cp,[status(thm)],[eq_14,eq_32]) ).
cnf(eq_35,plain,
multiply(X,inverse(multiply(Y,X))) = inverse(Y),
inference(rw,[status(thm)],[eq_33,eq_26]) ).
cnf(eq_36,plain,
multiply(inverse(multiply(Y,X)),inverse(inverse(Y))) = inverse(X),
inference(cp,[status(thm)],[eq_35,eq_35]) ).
cnf(eq_37,plain,
multiply(inverse(multiply(X,Y)),X) = inverse(Y),
inference(rw,[status(thm)],[eq_36,eq_25]) ).
cnf(eq_38,plain,
multiply(inverse(X),Y) = inverse(multiply(inverse(Y),X)),
inference(cp,[status(thm)],[eq_29,eq_37]) ).
cnf(eq_39,negated_conjecture,
greatest_lower_bound(inverse(a),multiply(inverse(multiply(X,b)),X)) != inverse(a),
inference(cp,[status(thm)],[eq_37,eq_9]) ).
cnf(eq_40,negated_conjecture,
multiply(greatest_lower_bound(identity,inverse(multiply(inverse(a),b))),inverse(a)) != inverse(a),
inference(cp,[status(thm)],[eq_16,eq_39]) ).
cnf(eq_41,negated_conjecture,
multiply(greatest_lower_bound(identity,inverse(inverse(multiply(inverse(b),a)))),inverse(a)) != inverse(a),
inference(cp,[status(thm)],[eq_38,eq_40]) ).
cnf(eq_42,negated_conjecture,
inverse(a) != inverse(a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_41,eq_25]),eq_34]),eq_0]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP191-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.13 % Command : run_maedmax %d %s
% 0.13/0.34 % Computer : n020.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:18:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.46/1.70 % SZS status Unsatisfiable
% 1.46/1.70 % SZS output start CNFRefutation for /tmp/MaedMax_14853
% See solution above
% 1.46/1.70
%------------------------------------------------------------------------------