TSTP Solution File: GRP170-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP170-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n006.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:16 EDT 2022
% Result : Unsatisfiable 3.87s 4.12s
% Output : CNFRefutation 3.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% Syntax : Number of clauses : 61 ( 61 unt; 0 nHn; 23 RR)
% Number of literals : 61 ( 60 equ; 5 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 : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 70 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_19169') ).
cnf(eq_1,axiom,
identity = multiply(inverse(X),X),
file('/tmp/MaedMax_19169') ).
cnf(eq_2,axiom,
multiply(X,multiply(Y,Z)) = multiply(multiply(X,Y),Z),
file('/tmp/MaedMax_19169') ).
cnf(eq_3,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/tmp/MaedMax_19169') ).
cnf(eq_4,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/tmp/MaedMax_19169') ).
cnf(eq_5,axiom,
least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z),
file('/tmp/MaedMax_19169') ).
cnf(eq_6,axiom,
X = least_upper_bound(X,greatest_lower_bound(X,Y)),
file('/tmp/MaedMax_19169') ).
cnf(eq_7,axiom,
X = greatest_lower_bound(X,least_upper_bound(X,Y)),
file('/tmp/MaedMax_19169') ).
cnf(eq_8,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_19169') ).
cnf(eq_9,axiom,
multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_19169') ).
cnf(eq_10,axiom,
multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_19169') ).
cnf(eq_11,axiom,
multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_19169') ).
cnf(eq_12,axiom,
least_upper_bound(a,b) = b,
file('/tmp/MaedMax_19169') ).
cnf(eq_13,axiom,
least_upper_bound(c,d) = d,
file('/tmp/MaedMax_19169') ).
cnf(eq_14,negated_conjecture,
multiply(b,d) != least_upper_bound(multiply(a,c),multiply(b,d)),
file('/tmp/MaedMax_19169') ).
cnf(eq_15,plain,
multiply(identity,x102) = multiply(inverse(X),multiply(X,x102)),
inference(cp,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_16,plain,
greatest_lower_bound(a,b) = a,
inference(cp,[status(thm)],[eq_12,eq_7]) ).
cnf(eq_17,plain,
greatest_lower_bound(multiply(inverse(X),x101),identity) = multiply(inverse(X),greatest_lower_bound(x101,X)),
inference(cp,[status(thm)],[eq_1,eq_9]) ).
cnf(eq_18,plain,
greatest_lower_bound(X,multiply(x102,X)) = multiply(greatest_lower_bound(identity,x102),X),
inference(cp,[status(thm)],[eq_0,eq_11]) ).
cnf(eq_19,plain,
least_upper_bound(Y,greatest_lower_bound(X,Y)) = Y,
inference(cp,[status(thm)],[eq_3,eq_6]) ).
cnf(eq_20,plain,
least_upper_bound(least_upper_bound(Y,X),x102) = least_upper_bound(X,least_upper_bound(Y,x102)),
inference(cp,[status(thm)],[eq_4,eq_5]) ).
cnf(eq_21,plain,
least_upper_bound(d,x102) = least_upper_bound(c,least_upper_bound(d,x102)),
inference(cp,[status(thm)],[eq_13,eq_5]) ).
cnf(eq_22,plain,
least_upper_bound(d,c) = d,
inference(cp,[status(thm)],[eq_4,eq_13]) ).
cnf(eq_23,plain,
least_upper_bound(c,least_upper_bound(d,X)) = least_upper_bound(d,X),
eq_21 ).
cnf(eq_24,plain,
multiply(greatest_lower_bound(identity,X),Y) = greatest_lower_bound(Y,multiply(X,Y)),
eq_18 ).
cnf(eq_25,plain,
X = multiply(inverse(Y),multiply(Y,X)),
inference(rw,[status(thm)],[eq_15,eq_0]) ).
cnf(eq_26,plain,
least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(Y,least_upper_bound(X,Z)),
inference(rw,[status(thm)],[eq_20,eq_5]) ).
cnf(eq_27,plain,
X = least_upper_bound(X,greatest_lower_bound(Y,X)),
eq_19 ).
cnf(eq_28,plain,
multiply(inverse(X),greatest_lower_bound(Y,X)) = greatest_lower_bound(identity,multiply(inverse(X),Y)),
inference(rw,[status(thm)],[eq_17,eq_3]) ).
cnf(eq_29,plain,
least_upper_bound(X,multiply(inverse(Y),x102)) = multiply(inverse(Y),least_upper_bound(multiply(Y,X),x102)),
inference(cp,[status(thm)],[eq_25,eq_8]) ).
cnf(eq_30,plain,
least_upper_bound(multiply(x100,multiply(Y,X)),X) = multiply(least_upper_bound(x100,inverse(Y)),multiply(Y,X)),
inference(cp,[status(thm)],[eq_25,eq_10]) ).
cnf(eq_31,plain,
multiply(inverse(inverse(Y)),X) = multiply(Y,X),
inference(cp,[status(thm)],[eq_25,eq_25]) ).
cnf(eq_32,plain,
multiply(inverse(inverse(X)),identity) = X,
inference(cp,[status(thm)],[eq_1,eq_25]) ).
cnf(eq_33,plain,
greatest_lower_bound(b,a) = a,
inference(cp,[status(thm)],[eq_3,eq_16]) ).
cnf(eq_34,plain,
least_upper_bound(d,X) = least_upper_bound(d,least_upper_bound(c,X)),
inference(cp,[status(thm)],[eq_23,eq_26]) ).
cnf(eq_35,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
eq_31 ).
cnf(eq_36,plain,
multiply(least_upper_bound(X,inverse(Y)),multiply(Y,Z)) = least_upper_bound(Z,multiply(X,multiply(Y,Z))),
inference(rw,[status(thm)],[eq_30,eq_4]) ).
cnf(eq_37,plain,
multiply(inverse(X),least_upper_bound(multiply(X,Y),Z)) = least_upper_bound(Y,multiply(inverse(X),Z)),
eq_29 ).
cnf(eq_38,plain,
multiply(inverse(inverse(inverse(X))),X) = identity,
inference(cp,[status(thm)],[eq_32,eq_25]) ).
cnf(eq_39,plain,
multiply(inverse(inverse(inverse(inverse(X)))),identity) = X,
inference(cp,[status(thm)],[eq_38,eq_25]) ).
cnf(eq_40,plain,
X = inverse(inverse(X)),
inference(rw,[status(thm)],[eq_39,eq_32]) ).
cnf(eq_41,plain,
multiply(X,inverse(X)) = identity,
inference(cp,[status(thm)],[eq_35,eq_1]) ).
cnf(eq_42,plain,
multiply(X,identity) = X,
inference(cp,[status(thm)],[eq_35,eq_32]) ).
cnf(eq_43,negated_conjecture,
least_upper_bound(multiply(a,c),multiply(inverse(inverse(b)),d)) != multiply(b,d),
inference(cp,[status(thm)],[eq_35,eq_14]) ).
cnf(eq_44,plain,
multiply(inverse(a),a) = greatest_lower_bound(identity,multiply(inverse(a),b)),
inference(cp,[status(thm)],[eq_33,eq_28]) ).
cnf(eq_45,plain,
identity = greatest_lower_bound(identity,multiply(inverse(a),b)),
inference(rw,[status(thm)],[eq_44,eq_1]) ).
cnf(eq_46,plain,
multiply(identity,x101) = greatest_lower_bound(x101,multiply(multiply(inverse(a),b),x101)),
inference(cp,[status(thm)],[eq_45,eq_24]) ).
cnf(eq_47,plain,
X = greatest_lower_bound(X,multiply(inverse(a),multiply(b,X))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_46,eq_0]),eq_2]) ).
cnf(eq_48,plain,
greatest_lower_bound(inverse(b),multiply(inverse(a),identity)) = inverse(b),
inference(cp,[status(thm)],[eq_41,eq_47]) ).
cnf(eq_49,plain,
inverse(b) = greatest_lower_bound(inverse(a),inverse(b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_48,eq_42]),eq_3]) ).
cnf(eq_50,plain,
greatest_lower_bound(inverse(b),inverse(a)) = inverse(b),
inference(cp,[status(thm)],[eq_3,eq_49]) ).
cnf(eq_51,plain,
least_upper_bound(inverse(a),inverse(b)) = inverse(a),
inference(cp,[status(thm)],[eq_50,eq_27]) ).
cnf(eq_52,plain,
inverse(a) = least_upper_bound(inverse(b),inverse(a)),
inference(cp,[status(thm)],[eq_51,eq_4]) ).
cnf(eq_53,negated_conjecture,
multiply(inverse(inverse(b)),least_upper_bound(multiply(inverse(b),multiply(a,c)),d)) != multiply(b,d),
inference(cp,[status(thm)],[eq_37,eq_43]) ).
cnf(eq_54,negated_conjecture,
multiply(b,least_upper_bound(d,multiply(inverse(b),multiply(a,c)))) != multiply(b,d),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_53,eq_40]),eq_4]) ).
cnf(eq_55,plain,
multiply(inverse(a),multiply(a,x102)) = least_upper_bound(x102,multiply(inverse(b),multiply(a,x102))),
inference(cp,[status(thm)],[eq_52,eq_36]) ).
cnf(eq_56,plain,
X = least_upper_bound(X,multiply(inverse(b),multiply(a,X))),
inference(rw,[status(thm)],[eq_55,eq_25]) ).
cnf(eq_57,plain,
least_upper_bound(d,c) = least_upper_bound(d,multiply(inverse(b),multiply(a,c))),
inference(cp,[status(thm)],[eq_56,eq_34]) ).
cnf(eq_58,plain,
least_upper_bound(d,multiply(inverse(b),multiply(a,c))) = d,
inference(rw,[status(thm)],[eq_57,eq_22]) ).
cnf(eq_59,negated_conjecture,
multiply(b,d) != multiply(b,d),
inference(cp,[status(thm)],[eq_58,eq_54]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_59]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP170-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.12 % Command : run_maedmax %d %s
% 0.13/0.33 % Computer : n006.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:19:02 EDT 2022
% 0.13/0.33 % CPUTime :
% 3.87/4.12 % SZS status Unsatisfiable
% 3.87/4.12 % SZS output start CNFRefutation for /tmp/MaedMax_19169
% See solution above
% 3.87/4.12
%------------------------------------------------------------------------------