TSTP Solution File: GRP600-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP600-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n015.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:58 EDT 2022
% Result : Unsatisfiable 0.80s 1.04s
% Output : CNFRefutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 4 RR)
% Number of literals : 31 ( 30 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 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 : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = double_divide(double_divide(B,C),inverse(double_divide(B,inverse(double_divide(inverse(A),C))))),
file('/tmp/MaedMax_17661') ).
cnf(eq_1,axiom,
inverse(double_divide(A,B)) = multiply(B,A),
file('/tmp/MaedMax_17661') ).
cnf(eq_2,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/tmp/MaedMax_17661') ).
cnf(eq_3,negated_conjecture,
inverse(double_divide(a,b)) != inverse(double_divide(b,a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_2,eq_1]),eq_1]) ).
cnf(eq_4,plain,
double_divide(A,inverse(double_divide(double_divide(B,C),inverse(double_divide(inverse(x102),inverse(double_divide(B,inverse(double_divide(inverse(A),C))))))))) = x102,
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_5,plain,
double_divide(double_divide(double_divide(inverse(x102),C),inverse(double_divide(inverse(A),C))),inverse(A)) = x102,
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_6,plain,
A = double_divide(B,inverse(double_divide(double_divide(C,x3),inverse(double_divide(inverse(A),inverse(double_divide(C,inverse(double_divide(inverse(B),x3))))))))),
eq_4 ).
cnf(eq_7,plain,
A = double_divide(double_divide(double_divide(inverse(A),B),inverse(double_divide(inverse(C),B))),inverse(C)),
eq_5 ).
cnf(eq_8,plain,
double_divide(A,inverse(double_divide(double_divide(double_divide(C,x3),inverse(double_divide(C,inverse(double_divide(inverse(inverse(x103)),x3))))),inverse(A)))) = x103,
inference(cp,[status(thm)],[eq_6,eq_6]) ).
cnf(eq_9,plain,
A = double_divide(B,inverse(double_divide(inverse(A),inverse(B)))),
inference(rw,[status(thm)],[eq_8,eq_0]) ).
cnf(eq_10,plain,
double_divide(double_divide(inverse(A),inverse(inverse(x101))),inverse(A)) = x101,
inference(cp,[status(thm)],[eq_9,eq_9]) ).
cnf(eq_11,plain,
double_divide(double_divide(B,inverse(B)),inverse(A)) = A,
inference(cp,[status(thm)],[eq_9,eq_0]) ).
cnf(eq_12,plain,
A = double_divide(double_divide(inverse(B),inverse(inverse(A))),inverse(B)),
eq_10 ).
cnf(eq_13,plain,
A = double_divide(B,multiply(inverse(B),inverse(A))),
inference(rw,[status(thm)],[eq_9,eq_1]) ).
cnf(eq_14,plain,
double_divide(double_divide(x100,inverse(x100)),multiply(B,A)) = double_divide(A,B),
inference(cp,[status(thm)],[eq_1,eq_11]) ).
cnf(eq_15,plain,
double_divide(A,B) = double_divide(double_divide(C,inverse(C)),multiply(B,A)),
eq_14 ).
cnf(eq_16,plain,
A = double_divide(inverse(A),inverse(double_divide(x100,inverse(x100)))),
inference(cp,[status(thm)],[eq_13,eq_15]) ).
cnf(eq_17,plain,
A = double_divide(inverse(A),multiply(inverse(B),B)),
inference(rw,[status(thm)],[eq_16,eq_1]) ).
cnf(eq_18,plain,
A = double_divide(inverse(A),inverse(double_divide(B,inverse(B)))),
inference(rw,[status(thm)],[eq_17,eq_1]) ).
cnf(eq_19,plain,
double_divide(A,inverse(x102)) = double_divide(inverse(x102),inverse(inverse(A))),
inference(cp,[status(thm)],[eq_12,eq_7]) ).
cnf(eq_20,plain,
double_divide(A,inverse(B)) = double_divide(inverse(B),inverse(inverse(A))),
eq_19 ).
cnf(eq_21,plain,
double_divide(double_divide(A,inverse(B)),inverse(B)) = A,
inference(cp,[status(thm)],[eq_20,eq_12]) ).
cnf(eq_22,plain,
A = inverse(inverse(A)),
inference(cp,[status(thm)],[eq_12,eq_21]) ).
cnf(eq_23,plain,
double_divide(A,inverse(double_divide(B,inverse(B)))) = inverse(A),
inference(cp,[status(thm)],[eq_18,eq_21]) ).
cnf(eq_24,plain,
double_divide(double_divide(x100,A),inverse(inverse(A))) = x100,
inference(cp,[status(thm)],[eq_22,eq_21]) ).
cnf(eq_25,plain,
double_divide(double_divide(A,inverse(inverse(x102))),inverse(inverse(A))) = x102,
inference(cp,[status(thm)],[eq_23,eq_0]) ).
cnf(eq_26,plain,
A = double_divide(double_divide(B,A),B),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_25,eq_22]),eq_22]) ).
cnf(eq_27,plain,
A = double_divide(double_divide(A,B),B),
inference(rw,[status(thm)],[eq_24,eq_22]) ).
cnf(eq_28,plain,
double_divide(A,B) = double_divide(B,A),
inference(cp,[status(thm)],[eq_26,eq_27]) ).
cnf(eq_29,negated_conjecture,
inverse(double_divide(b,a)) != inverse(double_divide(b,a)),
inference(cp,[status(thm)],[eq_28,eq_3]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP600-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.13 % Command : run_maedmax %d %s
% 0.13/0.33 % Computer : n015.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Jul 26 04:20:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.80/1.04 % SZS status Unsatisfiable
% 0.80/1.04 % SZS output start CNFRefutation for /tmp/MaedMax_17661
% See solution above
% 0.80/1.04
%------------------------------------------------------------------------------