TSTP Solution File: GRP185-4 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP185-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n026.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 31.15s 31.44s
% Output : CNFRefutation 31.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 6 RR)
% Number of literals : 23 ( 22 equ; 4 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_8458') ).
cnf(eq_1,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/tmp/MaedMax_8458') ).
cnf(eq_2,axiom,
least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z),
file('/tmp/MaedMax_8458') ).
cnf(eq_3,axiom,
X = greatest_lower_bound(X,least_upper_bound(X,Y)),
file('/tmp/MaedMax_8458') ).
cnf(eq_4,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_8458') ).
cnf(eq_5,axiom,
multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_8458') ).
cnf(eq_6,axiom,
identity = inverse(identity),
file('/tmp/MaedMax_8458') ).
cnf(eq_7,axiom,
X = inverse(inverse(X)),
file('/tmp/MaedMax_8458') ).
cnf(eq_8,axiom,
multiply(inverse(X),inverse(Y)) = inverse(multiply(Y,X)),
file('/tmp/MaedMax_8458') ).
cnf(eq_9,negated_conjecture,
greatest_lower_bound(least_upper_bound(multiply(a,b),identity),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != least_upper_bound(multiply(a,b),identity),
file('/tmp/MaedMax_8458') ).
cnf(eq_10,negated_conjecture,
greatest_lower_bound(least_upper_bound(identity,multiply(a,b)),least_upper_bound(identity,least_upper_bound(b,least_upper_bound(multiply(a,identity),multiply(a,b))))) != least_upper_bound(identity,multiply(a,b)),
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)],[inference(rw,[status(thm)],[eq_9,eq_1]),eq_1]),eq_1]),eq_5]),eq_0]),eq_4]),eq_2]),eq_1]) ).
cnf(eq_11,plain,
inverse(X) = multiply(inverse(X),inverse(identity)),
inference(cp,[status(thm)],[eq_0,eq_8]) ).
cnf(eq_12,plain,
greatest_lower_bound(X,least_upper_bound(Y,X)) = X,
inference(cp,[status(thm)],[eq_1,eq_3]) ).
cnf(eq_13,plain,
least_upper_bound(least_upper_bound(Y,X),x102) = least_upper_bound(X,least_upper_bound(Y,x102)),
inference(cp,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_14,plain,
multiply(inverse(X),identity) = inverse(X),
inference(rw,[status(thm)],[eq_11,eq_6]) ).
cnf(eq_15,plain,
least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(Y,least_upper_bound(X,Z)),
inference(rw,[status(thm)],[eq_13,eq_2]) ).
cnf(eq_16,negated_conjecture,
greatest_lower_bound(least_upper_bound(identity,multiply(a,b)),least_upper_bound(b,least_upper_bound(identity,multiply(a,least_upper_bound(b,identity))))) != least_upper_bound(identity,multiply(a,b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_10,eq_4]),eq_1]),eq_15]) ).
cnf(eq_17,plain,
multiply(X,identity) = inverse(inverse(X)),
inference(cp,[status(thm)],[eq_7,eq_14]) ).
cnf(eq_18,plain,
greatest_lower_bound(Z,least_upper_bound(X,least_upper_bound(Y,Z))) = Z,
inference(cp,[status(thm)],[eq_2,eq_12]) ).
cnf(eq_19,plain,
X = multiply(X,identity),
inference(rw,[status(thm)],[eq_17,eq_7]) ).
cnf(eq_20,plain,
X = greatest_lower_bound(X,least_upper_bound(Y,least_upper_bound(Z,X))),
eq_18 ).
cnf(eq_21,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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_16,eq_4]),eq_19]),eq_1]),eq_15]),eq_15]),eq_20]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP185-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : run_maedmax %d %s
% 0.12/0.34 % Computer : n026.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Jul 26 04:43:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 31.15/31.44 % SZS status Unsatisfiable
% 31.15/31.44 % SZS output start CNFRefutation for /tmp/MaedMax_8458
% See solution above
% 31.15/31.44
%------------------------------------------------------------------------------