TSTP Solution File: GRP515-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP515-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n024.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:51 EDT 2022
% Result : Unsatisfiable 1.08s 1.25s
% Output : CNFRefutation 1.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 2
% Syntax : Number of clauses : 33 ( 33 unt; 0 nHn; 7 RR)
% Number of literals : 33 ( 32 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = multiply(B,multiply(multiply(A,C),inverse(multiply(B,C)))),
file('/tmp/MaedMax_19252') ).
cnf(eq_1,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/tmp/MaedMax_19252') ).
cnf(eq_2,plain,
multiply(x100,multiply(A,inverse(multiply(x100,multiply(multiply(A,C),inverse(multiply(B,C))))))) = B,
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_3,plain,
multiply(B,multiply(multiply(x101,multiply(multiply(A,C),inverse(multiply(B,C)))),inverse(A))) = x101,
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_4,plain,
A = multiply(B,multiply(multiply(A,multiply(multiply(C,x3),inverse(multiply(B,x3)))),inverse(C))),
eq_3 ).
cnf(eq_5,plain,
A = multiply(B,multiply(C,inverse(multiply(B,multiply(multiply(C,x3),inverse(multiply(A,x3))))))),
eq_2 ).
cnf(eq_6,plain,
multiply(B,multiply(A,inverse(A))) = B,
inference(cp,[status(thm)],[eq_0,eq_5]) ).
cnf(eq_7,plain,
multiply(x100,multiply(multiply(x101,multiply(A,inverse(multiply(x100,multiply(multiply(A,C),inverse(multiply(B,C))))))),inverse(B))) = x101,
inference(cp,[status(thm)],[eq_0,eq_4]) ).
cnf(eq_8,plain,
multiply(B,multiply(multiply(x101,multiply(multiply(x102,multiply(multiply(A,multiply(multiply(C,x3),inverse(multiply(B,x3)))),inverse(C))),inverse(A))),inverse(x102))) = x101,
inference(cp,[status(thm)],[eq_4,eq_4]) ).
cnf(eq_9,plain,
A = multiply(B,multiply(multiply(A,multiply(C,inverse(multiply(B,multiply(multiply(C,x3),inverse(multiply(x4,x3))))))),inverse(x4))),
eq_7 ).
cnf(eq_10,plain,
A = multiply(A,multiply(B,inverse(B))),
eq_6 ).
cnf(eq_11,plain,
A = multiply(B,multiply(multiply(A,multiply(multiply(C,multiply(multiply(x3,multiply(multiply(x4,x5),inverse(multiply(B,x5)))),inverse(x4))),inverse(x3))),inverse(C))),
eq_8 ).
cnf(eq_12,plain,
multiply(B,multiply(multiply(x101,multiply(A,inverse(A))),inverse(B))) = x101,
inference(cp,[status(thm)],[eq_0,eq_9]) ).
cnf(eq_13,plain,
multiply(B,multiply(multiply(x101,multiply(multiply(x102,multiply(A,inverse(A))),inverse(B))),inverse(x102))) = x101,
inference(cp,[status(thm)],[eq_0,eq_11]) ).
cnf(eq_14,plain,
A = multiply(B,multiply(multiply(A,multiply(C,inverse(B))),inverse(C))),
inference(rw,[status(thm)],[eq_13,eq_10]) ).
cnf(eq_15,plain,
A = multiply(B,multiply(A,inverse(B))),
inference(rw,[status(thm)],[eq_12,eq_10]) ).
cnf(eq_16,plain,
multiply(x100,multiply(multiply(x102,x103),inverse(x102))) = multiply(x100,x103),
inference(cp,[status(thm)],[eq_15,eq_4]) ).
cnf(eq_17,plain,
multiply(multiply(B,C),multiply(A,inverse(multiply(A,C)))) = B,
inference(cp,[status(thm)],[eq_0,eq_14]) ).
cnf(eq_18,plain,
multiply(A,B) = multiply(A,multiply(multiply(C,B),inverse(C))),
eq_16 ).
cnf(eq_19,plain,
A = multiply(multiply(A,B),multiply(C,inverse(multiply(C,B)))),
eq_17 ).
cnf(eq_20,plain,
multiply(multiply(C,B),multiply(A,inverse(C))) = multiply(A,B),
inference(cp,[status(thm)],[eq_19,eq_14]) ).
cnf(eq_21,plain,
multiply(multiply(x100,multiply(C,inverse(multiply(C,B)))),multiply(multiply(A,B),inverse(A))) = x100,
inference(cp,[status(thm)],[eq_19,eq_19]) ).
cnf(eq_22,plain,
A = multiply(multiply(A,multiply(B,inverse(multiply(B,C)))),C),
inference(rw,[status(thm)],[eq_21,eq_18]) ).
cnf(eq_23,plain,
multiply(multiply(C,x102),B) = multiply(multiply(C,B),x102),
inference(cp,[status(thm)],[eq_20,eq_18]) ).
cnf(eq_24,plain,
multiply(multiply(B,inverse(B)),A) = A,
inference(cp,[status(thm)],[eq_22,eq_14]) ).
cnf(eq_25,plain,
multiply(multiply(A,B),C) = multiply(multiply(A,C),B),
eq_23 ).
cnf(eq_26,plain,
multiply(A,x102) = multiply(multiply(multiply(B,inverse(B)),x102),A),
inference(cp,[status(thm)],[eq_24,eq_25]) ).
cnf(eq_27,plain,
multiply(A,B) = multiply(B,A),
inference(rw,[status(thm)],[eq_26,eq_24]) ).
cnf(eq_28,negated_conjecture,
multiply(multiply(b3,c3),a3) != multiply(multiply(a3,b3),c3),
inference(cp,[status(thm)],[eq_27,eq_1]) ).
cnf(eq_29,negated_conjecture,
multiply(multiply(b3,a3),c3) != multiply(multiply(a3,b3),c3),
inference(cp,[status(thm)],[eq_25,eq_28]) ).
cnf(eq_30,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(multiply(b3,a3),c3),
eq_29 ).
cnf(eq_31,negated_conjecture,
multiply(multiply(b3,a3),c3) != multiply(multiply(b3,a3),c3),
inference(cp,[status(thm)],[eq_27,eq_30]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP515-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : run_maedmax %d %s
% 0.12/0.34 % Computer : n024.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:19:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.08/1.25 % SZS status Unsatisfiable
% 1.08/1.25 % SZS output start CNFRefutation for /tmp/MaedMax_19252
% See solution above
% 1.08/1.25
%------------------------------------------------------------------------------