TSTP Solution File: GRP178-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP178-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n019.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 75.11s 75.30s
% Output : CNFRefutation 75.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 12 RR)
% Number of literals : 35 ( 34 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 44 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_11325') ).
cnf(eq_1,axiom,
identity = multiply(inverse(X),X),
file('/tmp/MaedMax_11325') ).
cnf(eq_2,axiom,
multiply(X,multiply(Y,Z)) = multiply(multiply(X,Y),Z),
file('/tmp/MaedMax_11325') ).
cnf(eq_3,axiom,
greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
file('/tmp/MaedMax_11325') ).
cnf(eq_4,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/tmp/MaedMax_11325') ).
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_11325') ).
cnf(eq_6,axiom,
X = greatest_lower_bound(X,least_upper_bound(X,Y)),
file('/tmp/MaedMax_11325') ).
cnf(eq_7,axiom,
multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_11325') ).
cnf(eq_8,axiom,
multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
file('/tmp/MaedMax_11325') ).
cnf(eq_9,axiom,
multiply(greatest_lower_bound(X,Y),Z) = greatest_lower_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_11325') ).
cnf(eq_10,axiom,
least_upper_bound(identity,c) = c,
file('/tmp/MaedMax_11325') ).
cnf(eq_11,axiom,
identity = greatest_lower_bound(a,b),
file('/tmp/MaedMax_11325') ).
cnf(eq_12,negated_conjecture,
greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c),
file('/tmp/MaedMax_11325') ).
cnf(eq_13,plain,
least_upper_bound(c,greatest_lower_bound(b,a)) = c,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_10,eq_11]),eq_3]),eq_4]) ).
cnf(eq_14,plain,
multiply(inverse(X),X) = greatest_lower_bound(b,a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_1,eq_11]),eq_3]) ).
cnf(eq_15,plain,
greatest_lower_bound(X,x102) = greatest_lower_bound(X,greatest_lower_bound(least_upper_bound(X,Y),x102)),
inference(cp,[status(thm)],[eq_6,eq_5]) ).
cnf(eq_16,plain,
greatest_lower_bound(X,Y) = greatest_lower_bound(X,greatest_lower_bound(least_upper_bound(X,Z),Y)),
eq_15 ).
cnf(eq_17,plain,
identity = greatest_lower_bound(b,a),
inference(rw,[status(thm)],[eq_14,eq_1]) ).
cnf(eq_18,plain,
multiply(identity,x102) = multiply(inverse(X),multiply(X,x102)),
inference(cp,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_19,plain,
least_upper_bound(greatest_lower_bound(b,a),c) = c,
inference(cp,[status(thm)],[eq_4,eq_13]) ).
cnf(eq_20,plain,
X = multiply(inverse(Y),multiply(Y,X)),
inference(rw,[status(thm)],[eq_18,eq_0]) ).
cnf(eq_21,plain,
multiply(inverse(inverse(Y)),X) = multiply(Y,X),
inference(cp,[status(thm)],[eq_20,eq_20]) ).
cnf(eq_22,plain,
multiply(inverse(inverse(X)),greatest_lower_bound(b,a)) = X,
inference(cp,[status(thm)],[eq_14,eq_20]) ).
cnf(eq_23,plain,
multiply(X,Y) = multiply(inverse(inverse(X)),Y),
eq_21 ).
cnf(eq_24,plain,
X = multiply(X,greatest_lower_bound(b,a)),
inference(rw,[status(thm)],[eq_22,eq_23]) ).
cnf(eq_25,plain,
X = multiply(X,identity),
inference(rw,[status(thm)],[eq_24,eq_17]) ).
cnf(eq_26,plain,
X = greatest_lower_bound(multiply(a,X),multiply(b,X)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_0,eq_17]),eq_3]),eq_9]) ).
cnf(eq_27,plain,
X = greatest_lower_bound(multiply(X,a),multiply(X,b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_25,eq_17]),eq_3]),eq_8]) ).
cnf(eq_28,plain,
multiply(x100,c) = least_upper_bound(multiply(x100,greatest_lower_bound(b,a)),multiply(x100,c)),
inference(cp,[status(thm)],[eq_19,eq_7]) ).
cnf(eq_29,negated_conjecture,
greatest_lower_bound(a,greatest_lower_bound(least_upper_bound(a,Z),multiply(b,c))) != greatest_lower_bound(a,c),
inference(cp,[status(thm)],[eq_16,eq_12]) ).
cnf(eq_30,negated_conjecture,
greatest_lower_bound(a,greatest_lower_bound(least_upper_bound(a,X),multiply(b,c))) != greatest_lower_bound(a,c),
eq_29 ).
cnf(eq_31,plain,
multiply(X,c) = least_upper_bound(X,multiply(X,c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_28,eq_3]),eq_8]),eq_27]) ).
cnf(eq_32,negated_conjecture,
greatest_lower_bound(a,greatest_lower_bound(multiply(a,c),multiply(b,c))) != greatest_lower_bound(a,c),
inference(cp,[status(thm)],[eq_31,eq_30]) ).
cnf(eq_33,negated_conjecture,
greatest_lower_bound(a,c) != greatest_lower_bound(a,c),
inference(rw,[status(thm)],[eq_32,eq_26]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP178-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : run_maedmax %d %s
% 0.13/0.34 % Computer : n019.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:12:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 75.11/75.30 % SZS status Unsatisfiable
% 75.11/75.30 % SZS output start CNFRefutation for /tmp/MaedMax_11325
% See solution above
% 75.11/75.30
%------------------------------------------------------------------------------