TSTP Solution File: GRP175-3 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP175-3 : 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:18 EDT 2022
% Result : Unsatisfiable 2.55s 2.77s
% Output : CNFRefutation 2.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of clauses : 56 ( 56 unt; 0 nHn; 13 RR)
% Number of literals : 56 ( 55 equ; 6 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 : 86 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_14262') ).
cnf(eq_1,axiom,
identity = multiply(inverse(X),X),
file('/tmp/MaedMax_14262') ).
cnf(eq_2,axiom,
multiply(X,multiply(Y,Z)) = multiply(multiply(X,Y),Z),
file('/tmp/MaedMax_14262') ).
cnf(eq_3,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/tmp/MaedMax_14262') ).
cnf(eq_4,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/tmp/MaedMax_14262') ).
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_14262') ).
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_14262') ).
cnf(eq_7,axiom,
X = least_upper_bound(X,greatest_lower_bound(X,Y)),
file('/tmp/MaedMax_14262') ).
cnf(eq_8,axiom,
X = greatest_lower_bound(X,least_upper_bound(X,Y)),
file('/tmp/MaedMax_14262') ).
cnf(eq_9,axiom,
multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_14262') ).
cnf(eq_10,axiom,
multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_14262') ).
cnf(eq_11,axiom,
least_upper_bound(identity,b) = b,
file('/tmp/MaedMax_14262') ).
cnf(eq_12,negated_conjecture,
identity != greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))),
file('/tmp/MaedMax_14262') ).
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(Y,least_upper_bound(X,least_upper_bound(Y,Z))) = Y,
inference(cp,[status(thm)],[eq_24,eq_8]) ).
cnf(eq_15,plain,
greatest_lower_bound(identity,b) = identity,
inference(cp,[status(thm)],[eq_11,eq_8]) ).
cnf(eq_16,plain,
greatest_lower_bound(X,multiply(x102,X)) = multiply(greatest_lower_bound(identity,x102),X),
inference(cp,[status(thm)],[eq_0,eq_10]) ).
cnf(eq_17,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_18,plain,
least_upper_bound(Y,greatest_lower_bound(X,greatest_lower_bound(Y,Z))) = Y,
inference(cp,[status(thm)],[eq_26,eq_7]) ).
cnf(eq_19,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_20,plain,
least_upper_bound(b,x102) = least_upper_bound(identity,least_upper_bound(b,x102)),
inference(cp,[status(thm)],[eq_11,eq_6]) ).
cnf(eq_21,plain,
X = greatest_lower_bound(X,least_upper_bound(Y,least_upper_bound(X,Z))),
eq_14 ).
cnf(eq_22,plain,
multiply(greatest_lower_bound(identity,X),Y) = greatest_lower_bound(Y,multiply(X,Y)),
eq_16 ).
cnf(eq_23,plain,
X = multiply(inverse(Y),multiply(Y,X)),
inference(rw,[status(thm)],[eq_13,eq_0]) ).
cnf(eq_24,plain,
least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(Y,least_upper_bound(X,Z)),
inference(rw,[status(thm)],[eq_19,eq_6]) ).
cnf(eq_25,plain,
X = least_upper_bound(X,greatest_lower_bound(Y,greatest_lower_bound(X,Z))),
eq_18 ).
cnf(eq_26,plain,
greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(Y,greatest_lower_bound(X,Z)),
inference(rw,[status(thm)],[eq_17,eq_5]) ).
cnf(eq_27,plain,
least_upper_bound(b,X) = least_upper_bound(b,least_upper_bound(identity,X)),
inference(rw,[status(thm)],[eq_20,eq_24]) ).
cnf(eq_28,plain,
identity = greatest_lower_bound(b,identity),
inference(rw,[status(thm)],[eq_15,eq_3]) ).
cnf(eq_29,plain,
greatest_lower_bound(X,multiply(inverse(Y),x102)) = multiply(inverse(Y),greatest_lower_bound(multiply(Y,X),x102)),
inference(cp,[status(thm)],[eq_23,eq_9]) ).
cnf(eq_30,plain,
multiply(inverse(multiply(X,Y)),multiply(X,multiply(Y,Z))) = Z,
inference(cp,[status(thm)],[eq_2,eq_23]) ).
cnf(eq_31,plain,
multiply(inverse(inverse(X)),identity) = X,
inference(cp,[status(thm)],[eq_1,eq_23]) ).
cnf(eq_32,plain,
greatest_lower_bound(identity,least_upper_bound(b,X)) = identity,
inference(cp,[status(thm)],[eq_27,eq_21]) ).
cnf(eq_33,plain,
least_upper_bound(b,greatest_lower_bound(x101,identity)) = b,
inference(cp,[status(thm)],[eq_28,eq_25]) ).
cnf(eq_34,plain,
least_upper_bound(b,greatest_lower_bound(X,identity)) = b,
eq_33 ).
cnf(eq_35,plain,
X = multiply(inverse(multiply(Y,Z)),multiply(Y,multiply(Z,X))),
eq_30 ).
cnf(eq_36,plain,
X = multiply(inverse(inverse(X)),identity),
eq_31 ).
cnf(eq_37,plain,
multiply(inverse(X),greatest_lower_bound(multiply(X,Y),Z)) = greatest_lower_bound(Y,multiply(inverse(X),Z)),
eq_29 ).
cnf(eq_38,negated_conjecture,
greatest_lower_bound(multiply(inverse(X),X),multiply(inverse(a),multiply(b,a))) != identity,
inference(cp,[status(thm)],[eq_1,eq_12]) ).
cnf(eq_39,plain,
multiply(inverse(inverse(inverse(X))),X) = identity,
inference(cp,[status(thm)],[eq_31,eq_23]) ).
cnf(eq_40,plain,
least_upper_bound(b,greatest_lower_bound(X,greatest_lower_bound(Y,identity))) = b,
inference(cp,[status(thm)],[eq_5,eq_34]) ).
cnf(eq_41,plain,
multiply(inverse(inverse(inverse(inverse(X)))),identity) = X,
inference(cp,[status(thm)],[eq_39,eq_23]) ).
cnf(eq_42,plain,
X = inverse(inverse(X)),
inference(rw,[status(thm)],[eq_41,eq_31]) ).
cnf(eq_43,plain,
X = multiply(X,identity),
inference(rw,[status(thm)],[eq_36,eq_42]) ).
cnf(eq_44,plain,
multiply(X,inverse(X)) = identity,
inference(cp,[status(thm)],[eq_42,eq_1]) ).
cnf(eq_45,plain,
multiply(identity,x101) = greatest_lower_bound(x101,multiply(least_upper_bound(b,X),x101)),
inference(cp,[status(thm)],[eq_32,eq_22]) ).
cnf(eq_46,plain,
X = greatest_lower_bound(X,multiply(least_upper_bound(b,Y),X)),
inference(rw,[status(thm)],[eq_45,eq_0]) ).
cnf(eq_47,plain,
greatest_lower_bound(x100,multiply(b,x100)) = x100,
inference(cp,[status(thm)],[eq_40,eq_46]) ).
cnf(eq_48,plain,
X = greatest_lower_bound(X,multiply(b,X)),
eq_47 ).
cnf(eq_49,plain,
multiply(inverse(multiply(x100,X)),multiply(x100,identity)) = inverse(X),
inference(cp,[status(thm)],[eq_44,eq_35]) ).
cnf(eq_50,plain,
multiply(inverse(multiply(X,Y)),X) = inverse(Y),
inference(rw,[status(thm)],[eq_49,eq_43]) ).
cnf(eq_51,negated_conjecture,
greatest_lower_bound(multiply(inverse(x100),x100),multiply(multiply(inverse(multiply(X,a)),X),multiply(b,a))) != identity,
inference(cp,[status(thm)],[eq_50,eq_38]) ).
cnf(eq_52,negated_conjecture,
identity != greatest_lower_bound(identity,multiply(inverse(multiply(X,a)),multiply(X,multiply(b,a)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_51,eq_1]),eq_2]) ).
cnf(eq_53,negated_conjecture,
multiply(inverse(multiply(x100,a)),greatest_lower_bound(multiply(multiply(x100,a),identity),multiply(x100,multiply(b,a)))) != identity,
inference(cp,[status(thm)],[eq_37,eq_52]) ).
cnf(eq_54,negated_conjecture,
identity != identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_53,eq_2]),eq_43]),eq_9]),eq_48]),eq_1]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP175-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/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:19:11 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.55/2.77 % SZS status Unsatisfiable
% 2.55/2.77 % SZS output start CNFRefutation for /tmp/MaedMax_14262
% See solution above
% 2.55/2.77
%------------------------------------------------------------------------------