TSTP Solution File: GRP192-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP192-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n015.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:24 EDT 2022
% Result : Unsatisfiable 0.46s 0.69s
% Output : CNFRefutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 7 RR)
% Number of literals : 21 ( 20 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 : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 20 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
X = multiply(identity,X),
file('/tmp/MaedMax_15212') ).
cnf(eq_1,axiom,
identity = multiply(inverse(X),X),
file('/tmp/MaedMax_15212') ).
cnf(eq_2,axiom,
least_upper_bound(X,Y) = least_upper_bound(Y,X),
file('/tmp/MaedMax_15212') ).
cnf(eq_3,axiom,
multiply(least_upper_bound(X,Y),Z) = least_upper_bound(multiply(X,Z),multiply(Y,Z)),
file('/tmp/MaedMax_15212') ).
cnf(eq_4,axiom,
X = least_upper_bound(identity,X),
file('/tmp/MaedMax_15212') ).
cnf(eq_5,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/tmp/MaedMax_15212') ).
cnf(eq_6,plain,
least_upper_bound(X,multiply(x102,X)) = multiply(least_upper_bound(identity,x102),X),
inference(cp,[status(thm)],[eq_0,eq_3]) ).
cnf(eq_7,plain,
least_upper_bound(identity,multiply(x102,X)) = multiply(least_upper_bound(inverse(X),x102),X),
inference(cp,[status(thm)],[eq_1,eq_3]) ).
cnf(eq_8,plain,
X = least_upper_bound(X,identity),
inference(cp,[status(thm)],[eq_4,eq_2]) ).
cnf(eq_9,plain,
multiply(X,Y) = least_upper_bound(Y,multiply(X,Y)),
inference(rw,[status(thm)],[eq_6,eq_4]) ).
cnf(eq_10,plain,
multiply(X,Y) = multiply(least_upper_bound(inverse(Y),X),Y),
inference(rw,[status(thm)],[eq_7,eq_4]) ).
cnf(eq_11,plain,
least_upper_bound(X,identity) = multiply(inverse(X),X),
inference(cp,[status(thm)],[eq_1,eq_9]) ).
cnf(eq_12,plain,
identity = least_upper_bound(X,identity),
inference(rw,[status(thm)],[eq_11,eq_1]) ).
cnf(eq_13,negated_conjecture,
multiply(least_upper_bound(inverse(a),b),a) != multiply(a,b),
inference(cp,[status(thm)],[eq_10,eq_5]) ).
cnf(eq_14,negated_conjecture,
multiply(least_upper_bound(b,inverse(a)),a) != multiply(a,b),
inference(rw,[status(thm)],[eq_13,eq_2]) ).
cnf(eq_15,plain,
X = identity,
inference(rw,[status(thm)],[eq_12,eq_8]) ).
cnf(eq_16,plain,
identity = multiply(x101,x100),
inference(cp,[status(thm)],[eq_15,eq_10]) ).
cnf(eq_17,plain,
identity = multiply(X,Y),
eq_16 ).
cnf(eq_18,negated_conjecture,
identity != multiply(a,b),
inference(cp,[status(thm)],[eq_15,eq_14]) ).
cnf(eq_19,negated_conjecture,
identity != identity,
inference(rw,[status(thm)],[eq_18,eq_17]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP192-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : run_maedmax %d %s
% 0.12/0.34 % Computer : n015.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:41:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.46/0.69 % SZS status Unsatisfiable
% 0.46/0.69 % SZS output start CNFRefutation for /tmp/MaedMax_15212
% See solution above
% 0.46/0.69
%------------------------------------------------------------------------------