%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP531-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n026.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:53 EDT 2022
% Result : Unsatisfiable 0.72s 0.90s
% Output : CNFRefutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of clauses : 51 ( 51 unt; 0 nHn; 4 RR)
% Number of literals : 51 ( 50 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 98 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = divide(divide(B,divide(C,A)),divide(B,C)),
file('/tmp/MaedMax_20369') ).
cnf(eq_1,axiom,
divide(A,divide(divide(B,B),C)) = multiply(A,C),
file('/tmp/MaedMax_20369') ).
cnf(eq_2,axiom,
divide(divide(A,A),B) = inverse(B),
file('/tmp/MaedMax_20369') ).
cnf(eq_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/tmp/MaedMax_20369') ).
cnf(eq_4,plain,
divide(A,inverse(B)) = multiply(A,B),
inference(rw,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_5,plain,
A = inverse(divide(divide(C,A),C)),
inference(cp,[status(thm)],[eq_0,eq_2]) ).
cnf(eq_6,plain,
divide(inverse(divide(A,A)),x101) = inverse(x101),
inference(cp,[status(thm)],[eq_2,eq_2]) ).
cnf(eq_7,plain,
divide(A,divide(divide(B,divide(C,A)),B)) = C,
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_8,plain,
divide(inverse(divide(x101,x102)),divide(divide(A,A),x101)) = x102,
inference(cp,[status(thm)],[eq_2,eq_0]) ).
cnf(eq_9,plain,
divide(inverse(divide(A,A)),B) = inverse(B),
eq_6 ).
cnf(eq_10,plain,
A = inverse(divide(divide(B,A),B)),
eq_5 ).
cnf(eq_11,plain,
A = divide(inverse(divide(B,A)),inverse(B)),
inference(rw,[status(thm)],[eq_8,eq_2]) ).
cnf(eq_12,plain,
A = divide(B,divide(divide(C,divide(A,B)),C)),
eq_7 ).
cnf(eq_13,plain,
A = multiply(inverse(divide(B,A)),B),
inference(cp,[status(thm)],[eq_11,eq_4]) ).
cnf(eq_14,plain,
A = inverse(divide(divide(C,divide(A,divide(x100,x100))),C)),
inference(cp,[status(thm)],[eq_12,eq_2]) ).
cnf(eq_15,plain,
A = inverse(inverse(A)),
inference(cp,[status(thm)],[eq_11,eq_9]) ).
cnf(eq_16,plain,
divide(A,inverse(divide(B,A))) = B,
inference(cp,[status(thm)],[eq_10,eq_11]) ).
cnf(eq_17,plain,
inverse(divide(multiply(A,B),A)) = inverse(B),
inference(cp,[status(thm)],[eq_4,eq_10]) ).
cnf(eq_18,plain,
A = divide(B,inverse(divide(A,B))),
eq_16 ).
cnf(eq_19,plain,
inverse(A) = inverse(divide(multiply(B,A),B)),
eq_17 ).
cnf(eq_20,plain,
divide(x100,A) = multiply(x100,inverse(A)),
inference(cp,[status(thm)],[eq_15,eq_4]) ).
cnf(eq_21,plain,
multiply(inverse(multiply(A,B)),A) = inverse(B),
inference(cp,[status(thm)],[eq_4,eq_13]) ).
cnf(eq_22,plain,
inverse(inverse(A)) = divide(multiply(B,A),B),
inference(cp,[status(thm)],[eq_19,eq_15]) ).
cnf(eq_23,plain,
A = divide(A,divide(B,B)),
inference(rw,[status(thm)],[eq_14,eq_10]) ).
cnf(eq_24,plain,
A = divide(multiply(B,A),B),
inference(rw,[status(thm)],[eq_22,eq_15]) ).
cnf(eq_25,plain,
divide(A,B) = multiply(A,inverse(B)),
eq_20 ).
cnf(eq_26,plain,
A = divide(divide(B,inverse(A)),B),
inference(rw,[status(thm)],[eq_24,eq_4]) ).
cnf(eq_27,plain,
divide(A,divide(A,B)) = B,
inference(cp,[status(thm)],[eq_23,eq_0]) ).
cnf(eq_28,plain,
A = divide(B,divide(B,A)),
eq_27 ).
cnf(eq_29,plain,
A = multiply(B,multiply(A,inverse(B))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_18,eq_25]),eq_25]),eq_15]) ).
cnf(eq_30,plain,
A = multiply(multiply(B,A),inverse(B)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_26,eq_25]),eq_15]),eq_25]) ).
cnf(eq_31,plain,
A = multiply(B,inverse(multiply(B,inverse(A)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_28,eq_25]),eq_25]) ).
cnf(eq_32,plain,
A = multiply(multiply(B,inverse(multiply(C,inverse(A)))),inverse(multiply(B,inverse(C)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_0,eq_25]),eq_25]),eq_25]),eq_25]) ).
cnf(eq_33,plain,
multiply(A,inverse(multiply(B,A))) = inverse(B),
inference(cp,[status(thm)],[eq_30,eq_30]) ).
cnf(eq_34,plain,
multiply(multiply(B,inverse(A)),A) = B,
inference(cp,[status(thm)],[eq_31,eq_29]) ).
cnf(eq_35,plain,
multiply(multiply(B,A),inverse(A)) = B,
inference(cp,[status(thm)],[eq_30,eq_31]) ).
cnf(eq_36,plain,
multiply(inverse(A),B) = inverse(multiply(A,inverse(B))),
inference(cp,[status(thm)],[eq_29,eq_21]) ).
cnf(eq_37,plain,
A = multiply(multiply(A,B),inverse(B)),
eq_35 ).
cnf(eq_38,plain,
A = multiply(multiply(A,inverse(B)),B),
eq_34 ).
cnf(eq_39,plain,
multiply(inverse(B),inverse(A)) = inverse(multiply(A,B)),
inference(cp,[status(thm)],[eq_37,eq_33]) ).
cnf(eq_40,plain,
multiply(A,B) = multiply(B,A),
inference(cp,[status(thm)],[eq_30,eq_38]) ).
cnf(eq_41,negated_conjecture,
multiply(multiply(b3,a3),c3) != multiply(a3,multiply(b3,c3)),
inference(cp,[status(thm)],[eq_40,eq_3]) ).
cnf(eq_42,plain,
inverse(multiply(A,B)) = inverse(multiply(B,A)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_39,eq_36]),eq_15]) ).
cnf(eq_43,plain,
multiply(multiply(B,A),multiply(x101,inverse(multiply(A,B)))) = x101,
inference(cp,[status(thm)],[eq_42,eq_29]) ).
cnf(eq_44,plain,
multiply(multiply(x100,inverse(multiply(inverse(A),inverse(x102)))),inverse(multiply(x100,A))) = x102,
inference(cp,[status(thm)],[eq_15,eq_32]) ).
cnf(eq_45,plain,
A = multiply(multiply(B,C),multiply(A,inverse(multiply(C,B)))),
eq_43 ).
cnf(eq_46,plain,
A = multiply(multiply(B,multiply(C,A)),inverse(multiply(B,C))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_44,eq_36]),eq_15]),eq_15]) ).
cnf(eq_47,plain,
multiply(multiply(C,B),A) = multiply(B,multiply(C,A)),
inference(cp,[status(thm)],[eq_46,eq_45]) ).
cnf(eq_48,plain,
multiply(A,multiply(B,C)) = multiply(multiply(B,A),C),
eq_47 ).
cnf(eq_49,negated_conjecture,
multiply(multiply(b3,a3),c3) != multiply(multiply(b3,a3),c3),
inference(cp,[status(thm)],[eq_48,eq_41]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP531-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : run_maedmax %d %s
% 0.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Jul 26 04:35:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.72/0.90 % SZS status Unsatisfiable
% 0.72/0.90 % SZS output start CNFRefutation for /tmp/MaedMax_20369
% See solution above
% 0.72/0.90
%------------------------------------------------------------------------------