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