TSTP Solution File: BOO071-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : BOO071-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n004.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 06:57:53 EDT 2022
% Result : Unsatisfiable 0.56s 0.75s
% Output : CNFRefutation 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 2
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 3 RR)
% Number of literals : 28 ( 27 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 11 con; 0-3 aty)
% Number of variables : 82 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = multiply(multiply(B,inverse(B),A),inverse(multiply(multiply(C,D,E),F,multiply(C,D,G))),multiply(D,multiply(G,F,E),C)),
file('/tmp/MaedMax_553') ).
cnf(eq_1,negated_conjecture,
multiply(inverse(b),b,a) != a,
file('/tmp/MaedMax_553') ).
cnf(eq_2,plain,
multiply(multiply(C,D,G),inverse(multiply(multiply(x102,x103,x104),x105,multiply(x102,x103,x106))),multiply(x103,multiply(x106,x105,x104),x102)) = multiply(D,multiply(G,inverse(multiply(C,D,E)),E),C),
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_3,plain,
multiply(A,multiply(B,inverse(multiply(C,A,D)),D),C) = multiply(multiply(C,A,B),inverse(multiply(multiply(E,F,G),x7,multiply(E,F,x8))),multiply(F,multiply(x8,x7,G),E)),
eq_2 ).
cnf(eq_4,plain,
multiply(inverse(C),multiply(B,inverse(multiply(C,inverse(C),D)),D),C) = B,
inference(cp,[status(thm)],[eq_3,eq_0]) ).
cnf(eq_5,plain,
A = multiply(inverse(B),multiply(A,inverse(multiply(B,inverse(B),C)),C),B),
eq_4 ).
cnf(eq_6,plain,
multiply(multiply(x100,inverse(x100),x101),inverse(multiply(multiply(x102,x103,B),multiply(A,inverse(multiply(B,inverse(B),C)),C),multiply(x102,x103,inverse(B)))),multiply(x103,A,x102)) = x101,
inference(cp,[status(thm)],[eq_5,eq_0]) ).
cnf(eq_7,plain,
A = multiply(multiply(B,inverse(B),A),inverse(multiply(multiply(C,D,E),multiply(F,inverse(multiply(E,inverse(E),G)),G),multiply(C,D,inverse(E)))),multiply(D,F,C)),
eq_6 ).
cnf(eq_8,plain,
multiply(multiply(x100,inverse(x100),x101),inverse(A),multiply(inverse(D),multiply(C,inverse(multiply(multiply(C,D,E),multiply(inverse(D),inverse(multiply(E,inverse(E),G)),G),multiply(C,D,inverse(E)))),A),D)) = x101,
inference(cp,[status(thm)],[eq_7,eq_0]) ).
cnf(eq_9,plain,
A = multiply(multiply(B,inverse(B),A),inverse(C),multiply(inverse(D),multiply(E,inverse(multiply(multiply(E,D,F),multiply(inverse(D),inverse(multiply(F,inverse(F),G)),G),multiply(E,D,inverse(F)))),C),D)),
eq_8 ).
cnf(eq_10,plain,
multiply(multiply(x100,inverse(x100),x101),inverse(multiply(D,inverse(D),multiply(B,inverse(B),A))),multiply(inverse(D),A,D)) = x101,
inference(cp,[status(thm)],[eq_7,eq_9]) ).
cnf(eq_11,plain,
A = multiply(multiply(B,inverse(B),A),inverse(multiply(C,inverse(C),multiply(D,inverse(D),E))),multiply(inverse(C),E,C)),
eq_10 ).
cnf(eq_12,plain,
multiply(multiply(D,inverse(D),E),inverse(multiply(multiply(x102,x103,x104),multiply(x105,inverse(multiply(x104,inverse(x104),x106)),x106),multiply(x102,x103,inverse(x104)))),multiply(x103,x105,x102)) = multiply(inverse(C),E,C),
inference(cp,[status(thm)],[eq_11,eq_7]) ).
cnf(eq_13,plain,
A = multiply(inverse(B),A,B),
inference(rw,[status(thm)],[eq_12,eq_7]) ).
cnf(eq_14,plain,
A = multiply(A,inverse(multiply(B,inverse(B),C)),C),
inference(rw,[status(thm)],[eq_5,eq_13]) ).
cnf(eq_15,plain,
inverse(C) = inverse(multiply(B,inverse(B),C)),
inference(cp,[status(thm)],[eq_14,eq_13]) ).
cnf(eq_16,plain,
inverse(A) = inverse(multiply(B,inverse(B),A)),
eq_15 ).
cnf(eq_17,plain,
inverse(multiply(multiply(B,inverse(B),A),inverse(A),x101)) = inverse(x101),
inference(cp,[status(thm)],[eq_16,eq_16]) ).
cnf(eq_18,plain,
multiply(x100,inverse(A),A) = x100,
inference(cp,[status(thm)],[eq_16,eq_14]) ).
cnf(eq_19,plain,
A = multiply(A,inverse(B),B),
eq_18 ).
cnf(eq_20,plain,
inverse(A) = inverse(multiply(multiply(B,inverse(B),C),inverse(C),A)),
eq_17 ).
cnf(eq_21,plain,
multiply(multiply(x100,inverse(x100),x101),inverse(multiply(B,inverse(B),x106)),multiply(inverse(B),multiply(x106,inverse(C),C),B)) = x101,
inference(cp,[status(thm)],[eq_20,eq_0]) ).
cnf(eq_22,plain,
A = multiply(B,inverse(B),A),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_21,eq_19]),eq_13]),eq_14]) ).
cnf(eq_23,plain,
A = inverse(inverse(A)),
inference(cp,[status(thm)],[eq_22,eq_13]) ).
cnf(eq_24,plain,
multiply(inverse(A),A,x101) = x101,
inference(cp,[status(thm)],[eq_23,eq_22]) ).
cnf(eq_25,plain,
A = multiply(inverse(B),B,A),
eq_24 ).
cnf(eq_26,negated_conjecture,
a != a,
inference(rw,[status(thm)],[eq_1,eq_25]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : BOO071-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : run_maedmax %d %s
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Jul 26 03:20:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.56/0.75 % SZS status Unsatisfiable
% 0.56/0.75 % SZS output start CNFRefutation for /tmp/MaedMax_553
% See solution above
% 0.56/0.75
%------------------------------------------------------------------------------