%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP532-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n025.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.35s 0.61s
% Output : CNFRefutation 0.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 4
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 3 RR)
% Number of literals : 35 ( 34 equ; 2 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = divide(divide(B,divide(C,A)),divide(B,C)),
file('/tmp/MaedMax_19093') ).
cnf(eq_1,axiom,
divide(A,divide(divide(B,B),C)) = multiply(A,C),
file('/tmp/MaedMax_19093') ).
cnf(eq_2,axiom,
divide(divide(A,A),B) = inverse(B),
file('/tmp/MaedMax_19093') ).
cnf(eq_3,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/tmp/MaedMax_19093') ).
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 = inverse(divide(divide(C,divide(A,divide(x100,x100))),C)),
inference(cp,[status(thm)],[eq_12,eq_2]) ).
cnf(eq_14,plain,
A = inverse(inverse(A)),
inference(cp,[status(thm)],[eq_11,eq_9]) ).
cnf(eq_15,plain,
divide(A,inverse(divide(B,A))) = B,
inference(cp,[status(thm)],[eq_10,eq_11]) ).
cnf(eq_16,plain,
inverse(divide(multiply(A,B),A)) = inverse(B),
inference(cp,[status(thm)],[eq_4,eq_10]) ).
cnf(eq_17,plain,
A = divide(B,inverse(divide(A,B))),
eq_15 ).
cnf(eq_18,plain,
inverse(A) = inverse(divide(multiply(B,A),B)),
eq_16 ).
cnf(eq_19,plain,
divide(x100,A) = multiply(x100,inverse(A)),
inference(cp,[status(thm)],[eq_14,eq_4]) ).
cnf(eq_20,plain,
inverse(inverse(A)) = divide(multiply(B,A),B),
inference(cp,[status(thm)],[eq_18,eq_14]) ).
cnf(eq_21,plain,
A = divide(A,divide(B,B)),
inference(rw,[status(thm)],[eq_13,eq_10]) ).
cnf(eq_22,plain,
A = divide(multiply(B,A),B),
inference(rw,[status(thm)],[eq_20,eq_14]) ).
cnf(eq_23,plain,
divide(A,B) = multiply(A,inverse(B)),
eq_19 ).
cnf(eq_24,plain,
A = divide(divide(B,inverse(A)),B),
inference(rw,[status(thm)],[eq_22,eq_4]) ).
cnf(eq_25,plain,
divide(A,divide(A,B)) = B,
inference(cp,[status(thm)],[eq_21,eq_0]) ).
cnf(eq_26,plain,
A = divide(B,divide(B,A)),
eq_25 ).
cnf(eq_27,plain,
A = multiply(B,multiply(A,inverse(B))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_17,eq_23]),eq_23]),eq_14]) ).
cnf(eq_28,plain,
A = multiply(multiply(B,A),inverse(B)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_24,eq_23]),eq_14]),eq_23]) ).
cnf(eq_29,plain,
A = multiply(B,inverse(multiply(B,inverse(A)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_26,eq_23]),eq_23]) ).
cnf(eq_30,plain,
multiply(multiply(B,inverse(A)),A) = B,
inference(cp,[status(thm)],[eq_29,eq_27]) ).
cnf(eq_31,plain,
A = multiply(multiply(A,inverse(B)),B),
eq_30 ).
cnf(eq_32,plain,
multiply(A,B) = multiply(B,A),
inference(cp,[status(thm)],[eq_28,eq_31]) ).
cnf(eq_33,negated_conjecture,
multiply(a,b) != multiply(a,b),
inference(cp,[status(thm)],[eq_32,eq_3]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP532-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.06/0.12 % Command : run_maedmax %d %s
% 0.12/0.33 % Computer : n025.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 04:27:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.35/0.61 % SZS status Unsatisfiable
% 0.35/0.61 % SZS output start CNFRefutation for /tmp/MaedMax_19093
% See solution above
% 0.35/0.61
%------------------------------------------------------------------------------