TSTP Solution File: GRP177-2 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP177-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n014.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 31.04s 31.30s
% Output : CNFRefutation 31.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 13 RR)
% Number of literals : 34 ( 33 equ; 5 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 : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_29350') ).
cnf(eq_1,axiom,
identity = multiply(inverse(X),X),
file('/tmp/MaedMax_29350') ).
cnf(eq_2,axiom,
multiply(X,multiply(Y,Z)) = multiply(multiply(X,Y),Z),
file('/tmp/MaedMax_29350') ).
cnf(eq_3,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/tmp/MaedMax_29350') ).
cnf(eq_4,axiom,
greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z),
file('/tmp/MaedMax_29350') ).
cnf(eq_5,axiom,
X = greatest_lower_bound(X,X),
file('/tmp/MaedMax_29350') ).
cnf(eq_6,axiom,
multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_29350') ).
cnf(eq_7,axiom,
multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_29350') ).
cnf(eq_8,axiom,
identity = greatest_lower_bound(identity,a),
file('/tmp/MaedMax_29350') ).
cnf(eq_9,axiom,
identity = greatest_lower_bound(identity,b),
file('/tmp/MaedMax_29350') ).
cnf(eq_10,axiom,
identity = greatest_lower_bound(identity,c),
file('/tmp/MaedMax_29350') ).
cnf(eq_11,negated_conjecture,
greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) != greatest_lower_bound(a,multiply(b,c)),
file('/tmp/MaedMax_29350') ).
cnf(eq_12,negated_conjecture,
greatest_lower_bound(multiply(b,c),greatest_lower_bound(multiply(b,c),greatest_lower_bound(a,greatest_lower_bound(multiply(b,a),greatest_lower_bound(multiply(a,c),multiply(a,a)))))) != greatest_lower_bound(multiply(b,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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_11,eq_3]),eq_3]),eq_3]),eq_7]),eq_6]),eq_6]),eq_4]),eq_4]),eq_23]),eq_3]) ).
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,
multiply(identity,x102) = greatest_lower_bound(multiply(identity,x102),multiply(a,x102)),
inference(cp,[status(thm)],[eq_8,eq_7]) ).
cnf(eq_15,plain,
multiply(identity,x102) = greatest_lower_bound(multiply(identity,x102),multiply(b,x102)),
inference(cp,[status(thm)],[eq_9,eq_7]) ).
cnf(eq_16,plain,
greatest_lower_bound(X,greatest_lower_bound(greatest_lower_bound(X,Z),Z)) = greatest_lower_bound(X,Z),
inference(cp,[status(thm)],[eq_23,eq_5]) ).
cnf(eq_17,plain,
greatest_lower_bound(c,identity) = identity,
inference(cp,[status(thm)],[eq_3,eq_10]) ).
cnf(eq_18,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_4]) ).
cnf(eq_19,plain,
X = multiply(inverse(Y),multiply(Y,X)),
inference(rw,[status(thm)],[eq_13,eq_0]) ).
cnf(eq_20,plain,
greatest_lower_bound(X,Y) = greatest_lower_bound(X,greatest_lower_bound(X,Y)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_16,eq_4]),eq_5]) ).
cnf(eq_21,plain,
X = greatest_lower_bound(X,multiply(a,X)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_14,eq_0]),eq_0]) ).
cnf(eq_22,plain,
X = greatest_lower_bound(X,multiply(b,X)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_15,eq_0]),eq_0]) ).
cnf(eq_23,plain,
greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(Y,greatest_lower_bound(X,Z)),
inference(rw,[status(thm)],[eq_18,eq_4]) ).
cnf(eq_24,plain,
multiply(inverse(inverse(Y)),X) = multiply(Y,X),
inference(cp,[status(thm)],[eq_19,eq_19]) ).
cnf(eq_25,plain,
multiply(inverse(inverse(X)),identity) = X,
inference(cp,[status(thm)],[eq_1,eq_19]) ).
cnf(eq_26,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
eq_24 ).
cnf(eq_27,plain,
multiply(x100,identity) = greatest_lower_bound(multiply(x100,c),multiply(x100,identity)),
inference(cp,[status(thm)],[eq_17,eq_6]) ).
cnf(eq_28,plain,
multiply(X,identity) = X,
inference(cp,[status(thm)],[eq_26,eq_25]) ).
cnf(eq_29,plain,
X = greatest_lower_bound(X,multiply(X,c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_27,eq_28]),eq_28]),eq_3]) ).
cnf(eq_30,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(multiply(b,a),greatest_lower_bound(multiply(a,c),multiply(a,a))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_12,eq_23]),eq_23]),eq_20]),eq_3]) ).
cnf(eq_31,negated_conjecture,
greatest_lower_bound(greatest_lower_bound(multiply(b,c),greatest_lower_bound(multiply(b,a),greatest_lower_bound(multiply(a,c),multiply(a,a)))),a) != greatest_lower_bound(a,multiply(b,c)),
inference(cp,[status(thm)],[eq_3,eq_30]) ).
cnf(eq_32,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,multiply(b,c)),
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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_31,eq_4]),eq_4]),eq_4]),eq_3]),eq_21]),eq_3]),eq_29]),eq_3]),eq_22]),eq_3]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP177-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.04/0.13 % Command : run_maedmax %d %s
% 0.12/0.34 % Computer : n014.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:12:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 31.04/31.30 % SZS status Unsatisfiable
% 31.04/31.30 % SZS output start CNFRefutation for /tmp/MaedMax_29350
% See solution above
% 31.04/31.30
%------------------------------------------------------------------------------