TSTP Solution File: GRP186-3 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP186-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n008.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:23 EDT 2022
% Result : Unsatisfiable 3.44s 3.61s
% Output : CNFRefutation 3.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 8
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 10 RR)
% Number of literals : 34 ( 33 equ; 8 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 : 48 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_26955') ).
cnf(eq_1,axiom,
identity = multiply(inverse(X),X),
file('/tmp/MaedMax_26955') ).
cnf(eq_2,axiom,
multiply(X,multiply(Y,Z)) = multiply(multiply(X,Y),Z),
file('/tmp/MaedMax_26955') ).
cnf(eq_3,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/tmp/MaedMax_26955') ).
cnf(eq_4,axiom,
least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z),
file('/tmp/MaedMax_26955') ).
cnf(eq_5,axiom,
X = least_upper_bound(X,greatest_lower_bound(X,Y)),
file('/tmp/MaedMax_26955') ).
cnf(eq_6,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_26955') ).
cnf(eq_7,negated_conjecture,
multiply(a,least_upper_bound(inverse(a),b)) != least_upper_bound(multiply(a,b),identity),
file('/tmp/MaedMax_26955') ).
cnf(eq_8,negated_conjecture,
multiply(a,least_upper_bound(b,inverse(a))) != least_upper_bound(multiply(a,b),identity),
inference(rw,[status(thm)],[eq_7,eq_3]) ).
cnf(eq_9,plain,
multiply(identity,x102) = multiply(inverse(X),multiply(X,x102)),
inference(cp,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_10,plain,
least_upper_bound(X,x102) = least_upper_bound(X,least_upper_bound(greatest_lower_bound(X,Y),x102)),
inference(cp,[status(thm)],[eq_5,eq_4]) ).
cnf(eq_11,plain,
X = multiply(inverse(Y),multiply(Y,X)),
inference(rw,[status(thm)],[eq_9,eq_0]) ).
cnf(eq_12,plain,
least_upper_bound(X,Y) = least_upper_bound(X,least_upper_bound(greatest_lower_bound(X,Z),Y)),
eq_10 ).
cnf(eq_13,plain,
multiply(inverse(inverse(Y)),X) = multiply(Y,X),
inference(cp,[status(thm)],[eq_11,eq_11]) ).
cnf(eq_14,plain,
multiply(inverse(inverse(X)),identity) = X,
inference(cp,[status(thm)],[eq_1,eq_11]) ).
cnf(eq_15,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
eq_13 ).
cnf(eq_16,plain,
X = multiply(inverse(inverse(X)),identity),
eq_14 ).
cnf(eq_17,negated_conjecture,
multiply(a,least_upper_bound(b,least_upper_bound(greatest_lower_bound(b,Z),inverse(a)))) != least_upper_bound(multiply(a,b),identity),
inference(cp,[status(thm)],[eq_12,eq_8]) ).
cnf(eq_18,negated_conjecture,
multiply(a,least_upper_bound(b,least_upper_bound(greatest_lower_bound(b,X),inverse(a)))) != least_upper_bound(multiply(a,b),identity),
eq_17 ).
cnf(eq_19,plain,
X = multiply(X,identity),
inference(rw,[status(thm)],[eq_16,eq_15]) ).
cnf(eq_20,negated_conjecture,
multiply(a,least_upper_bound(b,inverse(a))) != least_upper_bound(identity,multiply(a,b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_18,eq_12]),eq_3]) ).
cnf(eq_21,plain,
multiply(X,inverse(X)) = identity,
inference(cp,[status(thm)],[eq_15,eq_1]) ).
cnf(eq_22,plain,
X = multiply(x100,multiply(inverse(x100),X)),
inference(cp,[status(thm)],[eq_11,eq_15]) ).
cnf(eq_23,plain,
X = multiply(Y,multiply(inverse(Y),X)),
eq_22 ).
cnf(eq_24,plain,
identity = inverse(identity),
inference(cp,[status(thm)],[eq_21,eq_0]) ).
cnf(eq_25,plain,
least_upper_bound(multiply(Y,x101),X) = multiply(Y,least_upper_bound(x101,multiply(inverse(Y),X))),
inference(cp,[status(thm)],[eq_23,eq_6]) ).
cnf(eq_26,plain,
multiply(X,multiply(Y,inverse(multiply(X,Y)))) = identity,
inference(cp,[status(thm)],[eq_2,eq_21]) ).
cnf(eq_27,plain,
multiply(X,least_upper_bound(Y,multiply(inverse(X),Z))) = least_upper_bound(multiply(X,Y),Z),
eq_25 ).
cnf(eq_28,plain,
multiply(inverse(X),identity) = multiply(Y,inverse(multiply(X,Y))),
inference(cp,[status(thm)],[eq_26,eq_11]) ).
cnf(eq_29,plain,
multiply(X,inverse(multiply(Y,X))) = inverse(Y),
inference(rw,[status(thm)],[eq_28,eq_19]) ).
cnf(eq_30,negated_conjecture,
multiply(a,least_upper_bound(b,multiply(X,inverse(multiply(a,X))))) != least_upper_bound(identity,multiply(a,b)),
inference(cp,[status(thm)],[eq_29,eq_20]) ).
cnf(eq_31,negated_conjecture,
least_upper_bound(multiply(a,b),inverse(multiply(a,inverse(a)))) != least_upper_bound(identity,multiply(a,b)),
inference(cp,[status(thm)],[eq_27,eq_30]) ).
cnf(eq_32,negated_conjecture,
least_upper_bound(identity,multiply(a,b)) != least_upper_bound(identity,multiply(a,b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_31,eq_21]),eq_24]),eq_3]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP186-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : run_maedmax %d %s
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Jul 26 04:12:08 EDT 2022
% 0.14/0.35 % CPUTime :
% 3.44/3.61 % SZS status Unsatisfiable
% 3.44/3.61 % SZS output start CNFRefutation for /tmp/MaedMax_26955
% See solution above
% 3.44/3.61
%------------------------------------------------------------------------------