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