TSTP Solution File: GRP462-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP462-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n027.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:47 EDT 2022
% Result : Unsatisfiable 0.58s 0.77s
% Output : CNFRefutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of clauses : 42 ( 42 unt; 0 nHn; 11 RR)
% Number of literals : 42 ( 41 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 64 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = divide(B,divide(divide(divide(identity,A),C),divide(divide(divide(B,B),B),C))),
file('/tmp/MaedMax_3698') ).
cnf(eq_1,axiom,
divide(A,divide(identity,B)) = multiply(A,B),
file('/tmp/MaedMax_3698') ).
cnf(eq_2,axiom,
divide(identity,A) = inverse(A),
file('/tmp/MaedMax_3698') ).
cnf(eq_3,axiom,
identity = divide(A,A),
file('/tmp/MaedMax_3698') ).
cnf(eq_4,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/tmp/MaedMax_3698') ).
cnf(eq_5,plain,
A = divide(B,divide(divide(inverse(A),C),divide(inverse(B),C))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_0,eq_2]),eq_3]),eq_2]) ).
cnf(eq_6,plain,
divide(A,inverse(B)) = multiply(A,B),
inference(rw,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_7,plain,
inverse(identity) = identity,
inference(cp,[status(thm)],[eq_2,eq_3]) ).
cnf(eq_8,plain,
A = divide(B,divide(divide(divide(identity,A),C),divide(divide(identity,B),C))),
inference(rw,[status(thm)],[eq_0,eq_3]) ).
cnf(eq_9,negated_conjecture,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_4,eq_1]),eq_1]),eq_1]),eq_1]) ).
cnf(eq_10,plain,
divide(x101,identity) = x101,
inference(cp,[status(thm)],[eq_3,eq_8]) ).
cnf(eq_11,plain,
divide(identity,divide(divide(divide(identity,x101),x102),divide(identity,x102))) = x101,
inference(cp,[status(thm)],[eq_3,eq_8]) ).
cnf(eq_12,plain,
A = divide(identity,multiply(divide(divide(identity,A),B),B)),
inference(rw,[status(thm)],[eq_11,eq_1]) ).
cnf(eq_13,plain,
A = divide(A,identity),
eq_10 ).
cnf(eq_14,plain,
A = inverse(divide(divide(inverse(A),B),inverse(B))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_12,eq_2]),eq_6]),eq_2]) ).
cnf(eq_15,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)],[inference(rw,[status(thm)],[eq_9,eq_2]),eq_2]),eq_2]),eq_2]) ).
cnf(eq_16,plain,
divide(x100,divide(inverse(x101),divide(inverse(x100),identity))) = x101,
inference(cp,[status(thm)],[eq_13,eq_5]) ).
cnf(eq_17,plain,
A = divide(B,divide(inverse(A),divide(inverse(B),identity))),
eq_16 ).
cnf(eq_18,plain,
A = divide(B,divide(inverse(A),inverse(B))),
inference(rw,[status(thm)],[eq_17,eq_13]) ).
cnf(eq_19,plain,
inverse(divide(inverse(x100),inverse(identity))) = x100,
inference(cp,[status(thm)],[eq_13,eq_14]) ).
cnf(eq_20,plain,
inverse(divide(divide(A,x101),inverse(x101))) = divide(divide(inverse(A),B),inverse(B)),
inference(cp,[status(thm)],[eq_14,eq_14]) ).
cnf(eq_21,plain,
divide(divide(inverse(A),B),inverse(B)) = inverse(divide(divide(A,C),inverse(C))),
eq_20 ).
cnf(eq_22,plain,
A = inverse(inverse(A)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_19,eq_7]),eq_13]) ).
cnf(eq_23,plain,
divide(x100,divide(A,inverse(x100))) = inverse(A),
inference(cp,[status(thm)],[eq_22,eq_18]) ).
cnf(eq_24,plain,
divide(inverse(A),divide(inverse(x101),A)) = x101,
inference(cp,[status(thm)],[eq_22,eq_18]) ).
cnf(eq_25,plain,
inverse(divide(divide(inverse(A),B),inverse(B))) = divide(divide(A,C),inverse(C)),
inference(cp,[status(thm)],[eq_21,eq_22]) ).
cnf(eq_26,plain,
divide(A,divide(B,inverse(A))) = inverse(B),
eq_23 ).
cnf(eq_27,plain,
A = divide(divide(A,B),inverse(B)),
inference(rw,[status(thm)],[eq_25,eq_14]) ).
cnf(eq_28,plain,
A = divide(inverse(B),divide(inverse(A),B)),
eq_24 ).
cnf(eq_29,plain,
divide(B,A) = inverse(divide(A,B)),
inference(cp,[status(thm)],[eq_27,eq_26]) ).
cnf(eq_30,plain,
divide(B,divide(divide(inverse(x101),divide(inverse(A),B)),A)) = x101,
inference(cp,[status(thm)],[eq_28,eq_5]) ).
cnf(eq_31,plain,
divide(inverse(divide(inverse(A),B)),A) = B,
inference(cp,[status(thm)],[eq_28,eq_28]) ).
cnf(eq_32,plain,
divide(A,B) = inverse(divide(B,A)),
eq_29 ).
cnf(eq_33,plain,
A = divide(B,divide(divide(inverse(A),divide(inverse(C),B)),C)),
eq_30 ).
cnf(eq_34,plain,
A = divide(inverse(divide(inverse(B),A)),B),
eq_31 ).
cnf(eq_35,plain,
divide(x100,divide(A,divide(inverse(x100),B))) = divide(inverse(B),A),
inference(cp,[status(thm)],[eq_34,eq_5]) ).
cnf(eq_36,plain,
divide(A,divide(B,divide(inverse(A),C))) = divide(inverse(C),B),
eq_35 ).
cnf(eq_37,negated_conjecture,
divide(a3,divide(inverse(c3),b3)) != divide(divide(a3,inverse(b3)),inverse(c3)),
inference(cp,[status(thm)],[eq_32,eq_15]) ).
cnf(eq_38,plain,
divide(x100,divide(x101,A)) = divide(inverse(divide(divide(inverse(A),divide(inverse(C),inverse(x100))),C)),x101),
inference(cp,[status(thm)],[eq_33,eq_36]) ).
cnf(eq_39,plain,
divide(A,divide(B,C)) = divide(divide(A,inverse(C)),B),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_38,eq_32]),eq_36]),eq_22]) ).
cnf(eq_40,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(divide(a3,inverse(b3)),inverse(c3)),
inference(cp,[status(thm)],[eq_39,eq_37]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_40]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP462-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.12 % Command : run_maedmax %d %s
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Tue Jul 26 04:29:50 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.58/0.77 % SZS status Unsatisfiable
% 0.58/0.77 % SZS output start CNFRefutation for /tmp/MaedMax_3698
% See solution above
% 0.58/0.77
%------------------------------------------------------------------------------