TSTP Solution File: GRP527-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP527-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n003.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:52 EDT 2022
% Result : Unsatisfiable 0.89s 1.10s
% Output : CNFRefutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of clauses : 51 ( 51 unt; 0 nHn; 9 RR)
% Number of literals : 51 ( 50 equ; 8 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 82 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = divide(B,divide(divide(B,C),divide(A,C))),
file('/tmp/MaedMax_23228') ).
cnf(eq_1,axiom,
divide(A,divide(divide(B,B),C)) = multiply(A,C),
file('/tmp/MaedMax_23228') ).
cnf(eq_2,axiom,
divide(divide(A,A),B) = inverse(B),
file('/tmp/MaedMax_23228') ).
cnf(eq_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/tmp/MaedMax_23228') ).
cnf(eq_4,plain,
divide(A,inverse(B)) = multiply(A,B),
inference(rw,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_5,plain,
divide(A,inverse(divide(x102,A))) = x102,
inference(cp,[status(thm)],[eq_2,eq_0]) ).
cnf(eq_6,plain,
divide(x100,A) = divide(divide(x100,divide(A,C)),C),
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_7,plain,
divide(x100,divide(divide(x100,B),inverse(B))) = divide(A,A),
inference(cp,[status(thm)],[eq_2,eq_0]) ).
cnf(eq_8,plain,
A = inverse(divide(divide(divide(x100,x100),C),divide(A,C))),
inference(cp,[status(thm)],[eq_0,eq_2]) ).
cnf(eq_9,plain,
divide(inverse(divide(A,A)),x101) = inverse(x101),
inference(cp,[status(thm)],[eq_2,eq_2]) ).
cnf(eq_10,plain,
A = inverse(divide(inverse(B),divide(A,B))),
inference(rw,[status(thm)],[eq_8,eq_2]) ).
cnf(eq_11,plain,
divide(inverse(divide(A,A)),B) = inverse(B),
eq_9 ).
cnf(eq_12,plain,
divide(A,A) = divide(B,divide(divide(B,C),inverse(C))),
eq_7 ).
cnf(eq_13,plain,
divide(A,B) = divide(divide(A,divide(B,C)),C),
eq_6 ).
cnf(eq_14,plain,
A = divide(B,inverse(divide(A,B))),
eq_5 ).
cnf(eq_15,plain,
A = multiply(B,divide(A,B)),
inference(cp,[status(thm)],[eq_14,eq_4]) ).
cnf(eq_16,plain,
divide(A,A) = divide(x102,x102),
inference(cp,[status(thm)],[eq_12,eq_12]) ).
cnf(eq_17,plain,
divide(divide(A,B),A) = inverse(B),
inference(cp,[status(thm)],[eq_10,eq_14]) ).
cnf(eq_18,plain,
divide(C,inverse(divide(A,B))) = divide(A,divide(B,C)),
inference(cp,[status(thm)],[eq_13,eq_14]) ).
cnf(eq_19,plain,
inverse(A) = divide(inverse(divide(A,C)),C),
inference(cp,[status(thm)],[eq_0,eq_10]) ).
cnf(eq_20,plain,
divide(A,divide(B,C)) = divide(C,inverse(divide(A,B))),
eq_18 ).
cnf(eq_21,plain,
divide(A,A) = divide(B,B),
eq_16 ).
cnf(eq_22,plain,
divide(inverse(divide(A,B)),B) = inverse(A),
eq_19 ).
cnf(eq_23,negated_conjecture,
divide(a3,inverse(multiply(b3,c3))) != multiply(multiply(a3,b3),c3),
inference(cp,[status(thm)],[eq_4,eq_3]) ).
cnf(eq_24,plain,
divide(divide(x102,B),inverse(B)) = x102,
inference(cp,[status(thm)],[eq_17,eq_0]) ).
cnf(eq_25,plain,
divide(x100,divide(B,B)) = x100,
inference(cp,[status(thm)],[eq_21,eq_0]) ).
cnf(eq_26,plain,
divide(C,B) = inverse(divide(B,C)),
inference(cp,[status(thm)],[eq_13,eq_17]) ).
cnf(eq_27,plain,
multiply(A,inverse(B)) = divide(A,B),
inference(cp,[status(thm)],[eq_17,eq_15]) ).
cnf(eq_28,plain,
A = multiply(divide(A,B),B),
inference(rw,[status(thm)],[eq_24,eq_4]) ).
cnf(eq_29,plain,
A = divide(A,divide(B,B)),
eq_25 ).
cnf(eq_30,plain,
divide(A,B) = multiply(A,inverse(B)),
eq_27 ).
cnf(eq_31,plain,
divide(A,B) = inverse(divide(B,A)),
eq_26 ).
cnf(eq_32,plain,
A = divide(divide(A,B),inverse(B)),
inference(rw,[status(thm)],[eq_28,eq_4]) ).
cnf(eq_33,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_23,eq_4]),eq_4]),eq_4]) ).
cnf(eq_34,plain,
inverse(divide(inverse(divide(B,B)),A)) = A,
inference(cp,[status(thm)],[eq_29,eq_10]) ).
cnf(eq_35,plain,
A = inverse(inverse(A)),
inference(rw,[status(thm)],[eq_34,eq_11]) ).
cnf(eq_36,plain,
A = multiply(B,multiply(A,inverse(B))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_14,eq_30]),eq_30]),eq_35]) ).
cnf(eq_37,plain,
A = multiply(multiply(A,inverse(B)),B),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_32,eq_30]),eq_30]),eq_35]) ).
cnf(eq_38,plain,
multiply(x100,A) = multiply(A,inverse(inverse(x100))),
inference(cp,[status(thm)],[eq_37,eq_36]) ).
cnf(eq_39,plain,
multiply(multiply(x100,A),inverse(A)) = x100,
inference(cp,[status(thm)],[eq_35,eq_37]) ).
cnf(eq_40,plain,
A = multiply(multiply(A,B),inverse(B)),
eq_39 ).
cnf(eq_41,plain,
multiply(A,B) = multiply(B,A),
inference(rw,[status(thm)],[eq_38,eq_35]) ).
cnf(eq_42,plain,
A = divide(divide(A,inverse(B)),B),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_40,eq_4]),eq_4]),eq_35]) ).
cnf(eq_43,plain,
divide(A,inverse(B)) = divide(B,inverse(A)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_41,eq_4]),eq_4]) ).
cnf(eq_44,plain,
divide(inverse(A),B) = inverse(divide(A,inverse(B))),
inference(cp,[status(thm)],[eq_42,eq_22]) ).
cnf(eq_45,negated_conjecture,
divide(c3,inverse(divide(a3,inverse(b3)))) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(cp,[status(thm)],[eq_43,eq_33]) ).
cnf(eq_46,negated_conjecture,
divide(a3,inverse(divide(b3,inverse(c3)))) != divide(c3,inverse(divide(a3,inverse(b3)))),
eq_45 ).
cnf(eq_47,negated_conjecture,
divide(a3,divide(inverse(c3),b3)) != divide(c3,divide(inverse(b3),a3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_46,eq_31]),eq_31]) ).
cnf(eq_48,negated_conjecture,
divide(a3,inverse(divide(c3,inverse(b3)))) != divide(a3,divide(inverse(c3),b3)),
inference(cp,[status(thm)],[eq_20,eq_47]) ).
cnf(eq_49,negated_conjecture,
divide(a3,inverse(divide(c3,inverse(b3)))) != divide(a3,inverse(divide(c3,inverse(b3)))),
inference(rw,[status(thm)],[eq_48,eq_44]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_49]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP527-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.12 % Command : run_maedmax %d %s
% 0.12/0.33 % Computer : n003.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:22:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.89/1.10 % SZS status Unsatisfiable
% 0.89/1.10 % SZS output start CNFRefutation for /tmp/MaedMax_23228
% See solution above
% 0.89/1.10
%------------------------------------------------------------------------------