TSTP Solution File: GRP167-5 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP167-5 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n011.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 0.97s 1.17s
% Output : CNFRefutation 0.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of clauses : 53 ( 53 unt; 0 nHn; 7 RR)
% Number of literals : 53 ( 52 equ; 2 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 : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 67 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_5195') ).
cnf(eq_1,axiom,
identity = multiply(inverse(X),X),
file('/tmp/MaedMax_5195') ).
cnf(eq_2,axiom,
multiply(X,multiply(Y,Z)) = multiply(multiply(X,Y),Z),
file('/tmp/MaedMax_5195') ).
cnf(eq_3,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/tmp/MaedMax_5195') ).
cnf(eq_4,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/tmp/MaedMax_5195') ).
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_5195') ).
cnf(eq_6,axiom,
X = least_upper_bound(X,X),
file('/tmp/MaedMax_5195') ).
cnf(eq_7,axiom,
X = greatest_lower_bound(X,least_upper_bound(X,Y)),
file('/tmp/MaedMax_5195') ).
cnf(eq_8,axiom,
multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_5195') ).
cnf(eq_9,axiom,
multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_5195') ).
cnf(eq_10,axiom,
inverse(least_upper_bound(X,Y)) = greatest_lower_bound(inverse(X),inverse(Y)),
file('/tmp/MaedMax_5195') ).
cnf(eq_11,axiom,
least_upper_bound(X,identity) = positive_part(X),
file('/tmp/MaedMax_5195') ).
cnf(eq_12,axiom,
greatest_lower_bound(X,identity) = negative_part(X),
file('/tmp/MaedMax_5195') ).
cnf(eq_13,axiom,
greatest_lower_bound(least_upper_bound(X,Y),least_upper_bound(X,Z)) = least_upper_bound(X,greatest_lower_bound(Y,Z)),
file('/tmp/MaedMax_5195') ).
cnf(eq_14,negated_conjecture,
multiply(positive_part(a),negative_part(a)) != a,
file('/tmp/MaedMax_5195') ).
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(multiply(x100,X),X) = multiply(greatest_lower_bound(x100,identity),X),
inference(cp,[status(thm)],[eq_0,eq_9]) ).
cnf(eq_17,plain,
greatest_lower_bound(least_upper_bound(X,x101),X) = least_upper_bound(X,greatest_lower_bound(x101,X)),
inference(cp,[status(thm)],[eq_6,eq_13]) ).
cnf(eq_18,plain,
positive_part(identity) = identity,
inference(cp,[status(thm)],[eq_11,eq_6]) ).
cnf(eq_19,plain,
least_upper_bound(identity,X) = positive_part(X),
inference(cp,[status(thm)],[eq_4,eq_11]) ).
cnf(eq_20,plain,
least_upper_bound(X,least_upper_bound(Y,identity)) = positive_part(least_upper_bound(X,Y)),
inference(cp,[status(thm)],[eq_5,eq_11]) ).
cnf(eq_21,plain,
least_upper_bound(multiply(x100,X),X) = multiply(least_upper_bound(x100,identity),X),
inference(cp,[status(thm)],[eq_0,eq_8]) ).
cnf(eq_22,plain,
negative_part(X) = greatest_lower_bound(identity,X),
inference(cp,[status(thm)],[eq_12,eq_3]) ).
cnf(eq_23,plain,
X = least_upper_bound(X,greatest_lower_bound(Y,X)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_17,eq_3]),eq_7]) ).
cnf(eq_24,plain,
greatest_lower_bound(identity,X) = negative_part(X),
eq_22 ).
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,positive_part(Y)) = positive_part(least_upper_bound(X,Y)),
inference(rw,[status(thm)],[eq_20,eq_11]) ).
cnf(eq_27,plain,
multiply(negative_part(X),Y) = greatest_lower_bound(Y,multiply(X,Y)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_16,eq_3]),eq_12]) ).
cnf(eq_28,plain,
multiply(positive_part(X),Y) = least_upper_bound(Y,multiply(X,Y)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_21,eq_4]),eq_11]) ).
cnf(eq_29,plain,
multiply(inverse(identity),X) = X,
inference(cp,[status(thm)],[eq_0,eq_25]) ).
cnf(eq_30,plain,
multiply(inverse(inverse(X)),identity) = X,
inference(cp,[status(thm)],[eq_1,eq_25]) ).
cnf(eq_31,plain,
positive_part(greatest_lower_bound(x101,identity)) = identity,
inference(cp,[status(thm)],[eq_19,eq_23]) ).
cnf(eq_32,plain,
least_upper_bound(x100,identity) = positive_part(least_upper_bound(x100,identity)),
inference(cp,[status(thm)],[eq_18,eq_26]) ).
cnf(eq_33,plain,
positive_part(X) = positive_part(positive_part(X)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_32,eq_11]),eq_11]) ).
cnf(eq_34,plain,
identity = positive_part(negative_part(X)),
inference(rw,[status(thm)],[eq_31,eq_12]) ).
cnf(eq_35,plain,
inverse(positive_part(X)) = greatest_lower_bound(inverse(identity),inverse(X)),
inference(cp,[status(thm)],[eq_19,eq_10]) ).
cnf(eq_36,plain,
multiply(inverse(inverse(identity)),X) = X,
inference(cp,[status(thm)],[eq_29,eq_25]) ).
cnf(eq_37,plain,
multiply(inverse(inverse(inverse(X))),X) = identity,
inference(cp,[status(thm)],[eq_30,eq_25]) ).
cnf(eq_38,plain,
greatest_lower_bound(X,identity) = multiply(negative_part(inverse(X)),X),
inference(cp,[status(thm)],[eq_1,eq_27]) ).
cnf(eq_39,plain,
least_upper_bound(X,identity) = multiply(positive_part(inverse(X)),X),
inference(cp,[status(thm)],[eq_1,eq_28]) ).
cnf(eq_40,plain,
multiply(positive_part(inverse(X)),X) = positive_part(X),
inference(rw,[status(thm)],[eq_39,eq_11]) ).
cnf(eq_41,plain,
multiply(negative_part(inverse(X)),X) = negative_part(X),
inference(rw,[status(thm)],[eq_38,eq_12]) ).
cnf(eq_42,plain,
multiply(positive_part(X),x102) = multiply(positive_part(inverse(X)),multiply(X,x102)),
inference(cp,[status(thm)],[eq_40,eq_2]) ).
cnf(eq_43,plain,
inverse(identity) = identity,
inference(cp,[status(thm)],[eq_36,eq_1]) ).
cnf(eq_44,plain,
multiply(positive_part(X),Y) = multiply(positive_part(inverse(X)),multiply(X,Y)),
eq_42 ).
cnf(eq_45,plain,
multiply(inverse(inverse(inverse(inverse(X)))),identity) = X,
inference(cp,[status(thm)],[eq_37,eq_25]) ).
cnf(eq_46,plain,
X = inverse(inverse(X)),
inference(rw,[status(thm)],[eq_45,eq_30]) ).
cnf(eq_47,plain,
multiply(positive_part(inverse(negative_part(inverse(X)))),negative_part(X)) = multiply(positive_part(negative_part(inverse(X))),X),
inference(cp,[status(thm)],[eq_41,eq_44]) ).
cnf(eq_48,plain,
inverse(positive_part(X)) = negative_part(inverse(X)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_35,eq_43]),eq_24]) ).
cnf(eq_49,plain,
inverse(negative_part(inverse(X))) = positive_part(X),
inference(cp,[status(thm)],[eq_48,eq_46]) ).
cnf(eq_50,plain,
X = multiply(positive_part(X),negative_part(X)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_47,eq_49]),eq_33]),eq_34]),eq_0]) ).
cnf(eq_51,negated_conjecture,
a != a,
inference(cp,[status(thm)],[eq_50,eq_14]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP167-5 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : run_maedmax %d %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Jul 26 04:21:54 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.97/1.17 % SZS status Unsatisfiable
% 0.97/1.17 % SZS output start CNFRefutation for /tmp/MaedMax_5195
% See solution above
% 0.97/1.17
%------------------------------------------------------------------------------