TSTP Solution File: GRP185-3 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP185-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n017.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:22 EDT 2022
% Result : Unsatisfiable 31.57s 31.73s
% Output : CNFRefutation 31.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 10 RR)
% Number of literals : 43 ( 42 equ; 9 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 : 74 ( 17 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_8352') ).
cnf(eq_1,axiom,
identity = multiply(inverse(X),X),
file('/tmp/MaedMax_8352') ).
cnf(eq_2,axiom,
multiply(X,multiply(Y,Z)) = multiply(multiply(X,Y),Z),
file('/tmp/MaedMax_8352') ).
cnf(eq_3,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/tmp/MaedMax_8352') ).
cnf(eq_4,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/tmp/MaedMax_8352') ).
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_8352') ).
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_8352') ).
cnf(eq_7,axiom,
X = greatest_lower_bound(X,X),
file('/tmp/MaedMax_8352') ).
cnf(eq_8,axiom,
X = least_upper_bound(X,greatest_lower_bound(X,Y)),
file('/tmp/MaedMax_8352') ).
cnf(eq_9,axiom,
X = greatest_lower_bound(X,least_upper_bound(X,Y)),
file('/tmp/MaedMax_8352') ).
cnf(eq_10,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_8352') ).
cnf(eq_11,axiom,
multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_8352') ).
cnf(eq_12,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_8352') ).
cnf(eq_13,plain,
multiply(identity,x102) = multiply(inverse(X),multiply(X,x102)),
inference(cp,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_14,plain,
greatest_lower_bound(Y,least_upper_bound(X,least_upper_bound(Y,Z))) = Y,
inference(cp,[status(thm)],[eq_22,eq_9]) ).
cnf(eq_15,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_16,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_17,plain,
greatest_lower_bound(x100,X) = greatest_lower_bound(X,greatest_lower_bound(x100,X)),
inference(cp,[status(thm)],[eq_7,eq_24]) ).
cnf(eq_18,plain,
least_upper_bound(x100,X) = least_upper_bound(X,least_upper_bound(x100,greatest_lower_bound(X,Y))),
inference(cp,[status(thm)],[eq_8,eq_22]) ).
cnf(eq_19,plain,
least_upper_bound(X,Y) = least_upper_bound(Y,least_upper_bound(X,greatest_lower_bound(Y,Z))),
eq_18 ).
cnf(eq_20,plain,
X = greatest_lower_bound(X,least_upper_bound(Y,least_upper_bound(X,Z))),
eq_14 ).
cnf(eq_21,plain,
X = multiply(inverse(Y),multiply(Y,X)),
inference(rw,[status(thm)],[eq_13,eq_0]) ).
cnf(eq_22,plain,
least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(Y,least_upper_bound(X,Z)),
inference(rw,[status(thm)],[eq_16,eq_6]) ).
cnf(eq_23,plain,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,greatest_lower_bound(X,Y)),
eq_17 ).
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_15,eq_5]) ).
cnf(eq_25,plain,
multiply(inverse(inverse(Y)),X) = multiply(Y,X),
inference(cp,[status(thm)],[eq_21,eq_21]) ).
cnf(eq_26,plain,
multiply(inverse(inverse(X)),identity) = X,
inference(cp,[status(thm)],[eq_1,eq_21]) ).
cnf(eq_27,plain,
greatest_lower_bound(Y,least_upper_bound(x101,least_upper_bound(X,Y))) = Y,
inference(cp,[status(thm)],[eq_19,eq_20]) ).
cnf(eq_28,plain,
least_upper_bound(Y,least_upper_bound(x101,greatest_lower_bound(X,Y))) = least_upper_bound(x101,Y),
inference(cp,[status(thm)],[eq_23,eq_19]) ).
cnf(eq_29,plain,
least_upper_bound(X,Y) = least_upper_bound(Y,least_upper_bound(X,greatest_lower_bound(Z,Y))),
eq_28 ).
cnf(eq_30,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
eq_25 ).
cnf(eq_31,plain,
X = greatest_lower_bound(X,least_upper_bound(Y,least_upper_bound(Z,X))),
eq_27 ).
cnf(eq_32,plain,
X = multiply(inverse(inverse(X)),identity),
eq_26 ).
cnf(eq_33,negated_conjecture,
greatest_lower_bound(least_upper_bound(identity,least_upper_bound(multiply(a,b),greatest_lower_bound(identity,Z))),multiply(least_upper_bound(a,identity),least_upper_bound(b,identity))) != least_upper_bound(multiply(a,b),identity),
inference(cp,[status(thm)],[eq_19,eq_12]) ).
cnf(eq_34,negated_conjecture,
greatest_lower_bound(least_upper_bound(identity,least_upper_bound(multiply(a,b),greatest_lower_bound(identity,X))),least_upper_bound(b,least_upper_bound(identity,least_upper_bound(multiply(a,b),multiply(a,identity))))) != 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_33,eq_4]),eq_11]),eq_0]),eq_10]),eq_6]),eq_4]) ).
cnf(eq_35,plain,
X = multiply(X,identity),
inference(rw,[status(thm)],[eq_32,eq_30]) ).
cnf(eq_36,negated_conjecture,
greatest_lower_bound(least_upper_bound(identity,least_upper_bound(multiply(a,b),greatest_lower_bound(X,identity))),least_upper_bound(b,least_upper_bound(identity,least_upper_bound(multiply(a,b),multiply(a,identity))))) != least_upper_bound(identity,multiply(a,b)),
inference(cp,[status(thm)],[eq_3,eq_34]) ).
cnf(eq_37,negated_conjecture,
greatest_lower_bound(least_upper_bound(identity,least_upper_bound(multiply(a,b),greatest_lower_bound(x100,identity))),least_upper_bound(b,least_upper_bound(identity,least_upper_bound(multiply(a,b),a)))) != least_upper_bound(identity,multiply(a,b)),
inference(cp,[status(thm)],[eq_35,eq_36]) ).
cnf(eq_38,negated_conjecture,
greatest_lower_bound(least_upper_bound(b,least_upper_bound(identity,least_upper_bound(a,multiply(a,b)))),least_upper_bound(identity,least_upper_bound(multiply(a,b),greatest_lower_bound(X,identity)))) != least_upper_bound(identity,multiply(a,b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_37,eq_4]),eq_3]) ).
cnf(eq_39,negated_conjecture,
greatest_lower_bound(least_upper_bound(identity,multiply(a,b)),least_upper_bound(identity,least_upper_bound(a,least_upper_bound(b,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)],[eq_38,eq_22]),eq_29]),eq_22]),eq_4]),eq_3]) ).
cnf(eq_40,negated_conjecture,
greatest_lower_bound(least_upper_bound(identity,multiply(a,b)),least_upper_bound(a,least_upper_bound(identity,least_upper_bound(b,multiply(a,b))))) != least_upper_bound(identity,multiply(a,b)),
inference(cp,[status(thm)],[eq_22,eq_39]) ).
cnf(eq_41,negated_conjecture,
least_upper_bound(multiply(a,b),identity) != least_upper_bound(multiply(a,b),identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_40,eq_4]),eq_22]),eq_4]),eq_31]),eq_4]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP185-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.12 % Command : run_maedmax %d %s
% 0.13/0.34 % Computer : n017.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 03:33:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 31.57/31.73 % SZS status Unsatisfiable
% 31.57/31.73 % SZS output start CNFRefutation for /tmp/MaedMax_8352
% See solution above
% 31.57/31.73
%------------------------------------------------------------------------------