TSTP Solution File: GRP553-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP553-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:54 EDT 2022
% Result : Unsatisfiable 0.39s 0.60s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 9 RR)
% Number of literals : 28 ( 27 equ; 8 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 : 56 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = divide(divide(B,inverse(divide(A,divide(B,C)))),C),
file('/tmp/MaedMax_29779') ).
cnf(eq_1,axiom,
divide(A,inverse(B)) = multiply(A,B),
file('/tmp/MaedMax_29779') ).
cnf(eq_2,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/tmp/MaedMax_29779') ).
cnf(eq_3,negated_conjecture,
divide(inverse(a1),inverse(a1)) != divide(inverse(b1),inverse(b1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_2,eq_1]),eq_1]) ).
cnf(eq_4,plain,
divide(divide(x100,inverse(A)),x102) = divide(B,inverse(divide(A,divide(B,divide(x100,x102))))),
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_5,plain,
divide(divide(divide(B,inverse(divide(A,divide(B,C)))),inverse(divide(x101,A))),C) = x101,
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_6,plain,
A = divide(divide(divide(B,inverse(divide(C,divide(B,x3)))),inverse(divide(A,C))),x3),
eq_5 ).
cnf(eq_7,plain,
divide(A,inverse(divide(B,divide(A,divide(C,x3))))) = divide(divide(C,inverse(B)),x3),
eq_4 ).
cnf(eq_8,plain,
divide(divide(divide(C,inverse(B)),x3),divide(C,x3)) = B,
inference(cp,[status(thm)],[eq_7,eq_0]) ).
cnf(eq_9,plain,
divide(A,inverse(divide(x103,A))) = x103,
inference(cp,[status(thm)],[eq_0,eq_6]) ).
cnf(eq_10,plain,
A = divide(divide(divide(B,inverse(A)),C),divide(B,C)),
eq_8 ).
cnf(eq_11,plain,
A = divide(B,inverse(divide(A,B))),
eq_9 ).
cnf(eq_12,plain,
divide(divide(B,C),inverse(A)) = divide(divide(B,inverse(A)),C),
inference(cp,[status(thm)],[eq_10,eq_11]) ).
cnf(eq_13,plain,
A = divide(C,divide(B,divide(B,inverse(divide(A,C))))),
inference(cp,[status(thm)],[eq_6,eq_10]) ).
cnf(eq_14,plain,
divide(divide(A,x102),divide(B,x102)) = divide(A,B),
inference(cp,[status(thm)],[eq_11,eq_10]) ).
cnf(eq_15,plain,
divide(divide(A,B),inverse(C)) = divide(divide(A,inverse(C)),B),
eq_12 ).
cnf(eq_16,plain,
A = divide(B,divide(C,divide(C,inverse(divide(A,B))))),
eq_13 ).
cnf(eq_17,plain,
divide(A,B) = divide(divide(A,C),divide(B,C)),
eq_14 ).
cnf(eq_18,plain,
divide(B,divide(B,A)) = A,
inference(cp,[status(thm)],[eq_11,eq_16]) ).
cnf(eq_19,plain,
divide(divide(A,C),divide(A,B)) = divide(B,C),
inference(cp,[status(thm)],[eq_17,eq_18]) ).
cnf(eq_20,plain,
divide(A,B) = divide(divide(C,B),divide(C,A)),
eq_19 ).
cnf(eq_21,negated_conjecture,
divide(divide(C,inverse(b1)),divide(C,inverse(b1))) != divide(inverse(a1),inverse(a1)),
inference(cp,[status(thm)],[eq_20,eq_3]) ).
cnf(eq_22,negated_conjecture,
divide(multiply(A,b1),multiply(A,b1)) != multiply(inverse(a1),a1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_21,eq_1]),eq_1]),eq_1]) ).
cnf(eq_23,negated_conjecture,
divide(A,A) != divide(inverse(a1),inverse(a1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_22,eq_1]),eq_1]),eq_17]),eq_1]) ).
cnf(eq_24,negated_conjecture,
divide(divide(A,divide(A,inverse(C))),inverse(C)) != divide(inverse(a1),inverse(a1)),
inference(cp,[status(thm)],[eq_15,eq_23]) ).
cnf(eq_25,negated_conjecture,
divide(inverse(A),inverse(A)) != divide(inverse(a1),inverse(a1)),
inference(rw,[status(thm)],[eq_24,eq_18]) ).
cnf(eq_26,negated_conjecture,
divide(inverse(A),inverse(A)) != divide(inverse(A),inverse(A)),
eq_25 ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP553-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/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:16:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.39/0.60 % SZS status Unsatisfiable
% 0.39/0.60 % SZS output start CNFRefutation for /tmp/MaedMax_29779
% See solution above
% 0.39/0.60
%------------------------------------------------------------------------------