TSTP Solution File: GRP178-2 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP178-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:19 EDT 2022
% Result : Unsatisfiable 10.76s 10.99s
% Output : CNFRefutation 10.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 15
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 15 RR)
% Number of literals : 46 ( 45 equ; 9 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 64 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_15788') ).
cnf(eq_1,axiom,
identity = multiply(inverse(X),X),
file('/tmp/MaedMax_15788') ).
cnf(eq_2,axiom,
multiply(X,multiply(Y,Z)) = multiply(multiply(X,Y),Z),
file('/tmp/MaedMax_15788') ).
cnf(eq_3,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/tmp/MaedMax_15788') ).
cnf(eq_4,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/tmp/MaedMax_15788') ).
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_15788') ).
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_15788') ).
cnf(eq_7,axiom,
X = least_upper_bound(X,X),
file('/tmp/MaedMax_15788') ).
cnf(eq_8,axiom,
X = least_upper_bound(X,greatest_lower_bound(X,Y)),
file('/tmp/MaedMax_15788') ).
cnf(eq_9,axiom,
X = greatest_lower_bound(X,least_upper_bound(X,Y)),
file('/tmp/MaedMax_15788') ).
cnf(eq_10,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_15788') ).
cnf(eq_11,axiom,
multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_15788') ).
cnf(eq_12,axiom,
identity = greatest_lower_bound(identity,c),
file('/tmp/MaedMax_15788') ).
cnf(eq_13,axiom,
identity = greatest_lower_bound(a,b),
file('/tmp/MaedMax_15788') ).
cnf(eq_14,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('/tmp/MaedMax_15788') ).
cnf(eq_15,plain,
multiply(inverse(X),X) = greatest_lower_bound(a,b),
inference(rw,[status(thm)],[eq_1,eq_13]) ).
cnf(eq_16,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(c,a),
inference(rw,[status(thm)],[eq_14,eq_3]) ).
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,Y)) = Y,
inference(cp,[status(thm)],[eq_3,eq_8]) ).
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,
greatest_lower_bound(x100,X) = greatest_lower_bound(X,greatest_lower_bound(x100,least_upper_bound(X,Y))),
inference(cp,[status(thm)],[eq_9,eq_24]) ).
cnf(eq_21,plain,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,greatest_lower_bound(X,least_upper_bound(Y,Z))),
eq_20 ).
cnf(eq_22,plain,
X = least_upper_bound(X,greatest_lower_bound(Y,X)),
eq_18 ).
cnf(eq_23,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_24,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_25,negated_conjecture,
greatest_lower_bound(multiply(b,c),a) != greatest_lower_bound(c,a),
inference(cp,[status(thm)],[eq_3,eq_16]) ).
cnf(eq_26,plain,
multiply(identity,x102) = multiply(inverse(X),multiply(X,x102)),
inference(cp,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_27,plain,
greatest_lower_bound(b,a) = identity,
inference(cp,[status(thm)],[eq_3,eq_13]) ).
cnf(eq_28,plain,
least_upper_bound(c,identity) = c,
inference(cp,[status(thm)],[eq_12,eq_22]) ).
cnf(eq_29,plain,
X = multiply(inverse(Y),multiply(Y,X)),
inference(rw,[status(thm)],[eq_26,eq_0]) ).
cnf(eq_30,plain,
multiply(inverse(inverse(Y)),X) = multiply(Y,X),
inference(cp,[status(thm)],[eq_29,eq_29]) ).
cnf(eq_31,plain,
multiply(inverse(inverse(X)),greatest_lower_bound(a,b)) = X,
inference(cp,[status(thm)],[eq_15,eq_29]) ).
cnf(eq_32,plain,
least_upper_bound(x100,c) = least_upper_bound(c,least_upper_bound(x100,identity)),
inference(cp,[status(thm)],[eq_28,eq_23]) ).
cnf(eq_33,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
eq_30 ).
cnf(eq_34,plain,
X = multiply(inverse(inverse(X)),greatest_lower_bound(b,a)),
inference(rw,[status(thm)],[eq_31,eq_3]) ).
cnf(eq_35,negated_conjecture,
greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),least_upper_bound(a,Z))) != greatest_lower_bound(c,a),
inference(cp,[status(thm)],[eq_21,eq_25]) ).
cnf(eq_36,negated_conjecture,
greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),least_upper_bound(a,X))) != greatest_lower_bound(a,c),
inference(rw,[status(thm)],[eq_35,eq_3]) ).
cnf(eq_37,plain,
X = multiply(X,greatest_lower_bound(b,a)),
inference(rw,[status(thm)],[eq_34,eq_33]) ).
cnf(eq_38,plain,
least_upper_bound(X,multiply(X,x102)) = multiply(X,least_upper_bound(greatest_lower_bound(b,a),x102)),
inference(cp,[status(thm)],[eq_37,eq_10]) ).
cnf(eq_39,plain,
multiply(X,least_upper_bound(greatest_lower_bound(b,a),Y)) = least_upper_bound(X,multiply(X,Y)),
eq_38 ).
cnf(eq_40,plain,
least_upper_bound(X,c) = least_upper_bound(c,least_upper_bound(X,identity)),
eq_32 ).
cnf(eq_41,negated_conjecture,
greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),multiply(a,least_upper_bound(greatest_lower_bound(b,a),Y)))) != greatest_lower_bound(a,c),
inference(cp,[status(thm)],[eq_39,eq_36]) ).
cnf(eq_42,negated_conjecture,
greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),multiply(a,least_upper_bound(greatest_lower_bound(b,a),X)))) != greatest_lower_bound(c,a),
inference(rw,[status(thm)],[eq_41,eq_3]) ).
cnf(eq_43,negated_conjecture,
greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),multiply(a,least_upper_bound(c,least_upper_bound(greatest_lower_bound(b,a),identity))))) != greatest_lower_bound(c,a),
inference(cp,[status(thm)],[eq_40,eq_42]) ).
cnf(eq_44,negated_conjecture,
greatest_lower_bound(c,a) != greatest_lower_bound(c,a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_43,eq_27]),eq_7]),eq_28]),eq_11]),eq_27]),eq_0]),eq_3]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_44]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP178-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : run_maedmax %d %s
% 0.12/0.33 % Computer : n003.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:08:56 EDT 2022
% 0.12/0.33 % CPUTime :
% 10.76/10.99 % SZS status Unsatisfiable
% 10.76/10.99 % SZS output start CNFRefutation for /tmp/MaedMax_15788
% See solution above
% 10.76/10.99
%------------------------------------------------------------------------------