TSTP Solution File: GRP175-2 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP175-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n027.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 4.64s 4.82s
% Output : CNFRefutation 4.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of clauses : 49 ( 49 unt; 0 nHn; 12 RR)
% Number of literals : 49 ( 48 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 85 ( 25 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_21129') ).
cnf(eq_1,axiom,
identity = multiply(inverse(X),X),
file('/tmp/MaedMax_21129') ).
cnf(eq_2,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/tmp/MaedMax_21129') ).
cnf(eq_3,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/tmp/MaedMax_21129') ).
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_21129') ).
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_21129') ).
cnf(eq_6,axiom,
X = least_upper_bound(X,X),
file('/tmp/MaedMax_21129') ).
cnf(eq_7,axiom,
X = least_upper_bound(X,greatest_lower_bound(X,Y)),
file('/tmp/MaedMax_21129') ).
cnf(eq_8,axiom,
X = greatest_lower_bound(X,least_upper_bound(X,Y)),
file('/tmp/MaedMax_21129') ).
cnf(eq_9,axiom,
multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_21129') ).
cnf(eq_10,axiom,
multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_21129') ).
cnf(eq_11,axiom,
identity = greatest_lower_bound(identity,b),
file('/tmp/MaedMax_21129') ).
cnf(eq_12,negated_conjecture,
identity != greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))),
file('/tmp/MaedMax_21129') ).
cnf(eq_13,plain,
greatest_lower_bound(X,least_upper_bound(Y,X)) = X,
inference(cp,[status(thm)],[eq_3,eq_8]) ).
cnf(eq_14,plain,
greatest_lower_bound(Y,least_upper_bound(X,least_upper_bound(Y,Z))) = Y,
inference(cp,[status(thm)],[eq_26,eq_8]) ).
cnf(eq_15,plain,
greatest_lower_bound(b,identity) = identity,
inference(cp,[status(thm)],[eq_2,eq_11]) ).
cnf(eq_16,plain,
greatest_lower_bound(identity,multiply(inverse(X),x102)) = multiply(inverse(X),greatest_lower_bound(X,x102)),
inference(cp,[status(thm)],[eq_1,eq_9]) ).
cnf(eq_17,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_18,plain,
greatest_lower_bound(X,x102) = greatest_lower_bound(X,greatest_lower_bound(least_upper_bound(X,Y),x102)),
inference(cp,[status(thm)],[eq_8,eq_4]) ).
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_3,eq_5]) ).
cnf(eq_20,plain,
multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Z),multiply(X,Y)),
inference(cp,[status(thm)],[eq_9,eq_2]) ).
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(inverse(X),greatest_lower_bound(X,Y)) = greatest_lower_bound(identity,multiply(inverse(X),Y)),
eq_16 ).
cnf(eq_23,plain,
multiply(greatest_lower_bound(identity,X),Y) = greatest_lower_bound(Y,multiply(X,Y)),
eq_17 ).
cnf(eq_24,plain,
greatest_lower_bound(X,Y) = greatest_lower_bound(X,greatest_lower_bound(least_upper_bound(X,Z),Y)),
eq_18 ).
cnf(eq_25,plain,
multiply(X,greatest_lower_bound(Y,Z)) = multiply(X,greatest_lower_bound(Z,Y)),
inference(rw,[status(thm)],[eq_20,eq_9]) ).
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_19,eq_5]) ).
cnf(eq_27,plain,
greatest_lower_bound(X,x102) = greatest_lower_bound(X,greatest_lower_bound(least_upper_bound(Y,least_upper_bound(X,Z)),x102)),
inference(cp,[status(thm)],[eq_21,eq_4]) ).
cnf(eq_28,plain,
greatest_lower_bound(X,x102) = greatest_lower_bound(X,greatest_lower_bound(least_upper_bound(Y,X),x102)),
inference(cp,[status(thm)],[eq_13,eq_4]) ).
cnf(eq_29,plain,
least_upper_bound(b,identity) = b,
inference(cp,[status(thm)],[eq_15,eq_7]) ).
cnf(eq_30,plain,
greatest_lower_bound(X,Y) = greatest_lower_bound(X,greatest_lower_bound(least_upper_bound(Z,least_upper_bound(X,x3)),Y)),
eq_27 ).
cnf(eq_31,plain,
greatest_lower_bound(X,Y) = greatest_lower_bound(X,greatest_lower_bound(least_upper_bound(Z,X),Y)),
eq_28 ).
cnf(eq_32,plain,
multiply(inverse(greatest_lower_bound(Y,Z)),greatest_lower_bound(Z,Y)) = identity,
inference(cp,[status(thm)],[eq_25,eq_1]) ).
cnf(eq_33,plain,
identity = multiply(inverse(greatest_lower_bound(X,Y)),greatest_lower_bound(Y,X)),
eq_32 ).
cnf(eq_34,negated_conjecture,
greatest_lower_bound(identity,greatest_lower_bound(least_upper_bound(identity,Z),multiply(inverse(a),multiply(b,a)))) != identity,
inference(cp,[status(thm)],[eq_24,eq_12]) ).
cnf(eq_35,negated_conjecture,
identity != greatest_lower_bound(identity,greatest_lower_bound(least_upper_bound(identity,X),multiply(inverse(a),multiply(b,a)))),
eq_34 ).
cnf(eq_36,negated_conjecture,
greatest_lower_bound(identity,greatest_lower_bound(least_upper_bound(X,least_upper_bound(identity,Z)),multiply(inverse(a),multiply(b,a)))) != identity,
inference(cp,[status(thm)],[eq_26,eq_35]) ).
cnf(eq_37,negated_conjecture,
identity != greatest_lower_bound(identity,greatest_lower_bound(least_upper_bound(X,least_upper_bound(identity,Y)),multiply(inverse(a),multiply(b,a)))),
eq_36 ).
cnf(eq_38,plain,
multiply(identity,x101) = greatest_lower_bound(x101,multiply(least_upper_bound(Y,identity),x101)),
inference(cp,[status(thm)],[eq_13,eq_23]) ).
cnf(eq_39,plain,
X = greatest_lower_bound(X,multiply(least_upper_bound(Y,identity),X)),
inference(rw,[status(thm)],[eq_38,eq_0]) ).
cnf(eq_40,plain,
greatest_lower_bound(x100,multiply(b,x100)) = x100,
inference(cp,[status(thm)],[eq_29,eq_39]) ).
cnf(eq_41,plain,
X = greatest_lower_bound(X,multiply(b,X)),
eq_40 ).
cnf(eq_42,plain,
greatest_lower_bound(x100,least_upper_bound(x101,x100)) = greatest_lower_bound(x100,multiply(b,least_upper_bound(x101,x100))),
inference(cp,[status(thm)],[eq_41,eq_31]) ).
cnf(eq_43,plain,
X = greatest_lower_bound(X,multiply(b,least_upper_bound(Y,X))),
inference(rw,[status(thm)],[eq_42,eq_13]) ).
cnf(eq_44,plain,
multiply(inverse(X),greatest_lower_bound(multiply(b,least_upper_bound(Y,X)),X)) = identity,
inference(cp,[status(thm)],[eq_43,eq_33]) ).
cnf(eq_45,plain,
identity = greatest_lower_bound(identity,multiply(inverse(X),multiply(b,least_upper_bound(Y,X)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_44,eq_2]),eq_22]) ).
cnf(eq_46,plain,
greatest_lower_bound(identity,multiply(inverse(X),multiply(b,X))) = identity,
inference(cp,[status(thm)],[eq_6,eq_45]) ).
cnf(eq_47,negated_conjecture,
identity != identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_37,eq_30]),eq_46]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_47]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP175-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : run_maedmax %d %s
% 0.12/0.33 % Computer : n027.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:26:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 4.64/4.82 % SZS status Unsatisfiable
% 4.64/4.82 % SZS output start CNFRefutation for /tmp/MaedMax_21129
% See solution above
% 4.64/4.82
%------------------------------------------------------------------------------