TSTP Solution File: GRP466-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP466-1 : TPTP v8.1.0. Released v2.6.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:47 EDT 2022
% Result : Unsatisfiable 0.20s 0.52s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 8 RR)
% Number of literals : 13 ( 12 equ; 7 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 : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = divide(divide(B,B),divide(C,divide(divide(A,divide(D,C)),inverse(D)))),
file('/tmp/MaedMax_31480') ).
cnf(eq_1,axiom,
divide(A,inverse(B)) = multiply(A,B),
file('/tmp/MaedMax_31480') ).
cnf(eq_2,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/tmp/MaedMax_31480') ).
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,x100),divide(divide(divide(A,divide(D,C)),inverse(D)),divide(A,inverse(C)))) = divide(B,B),
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_5,plain,
divide(A,A) = divide(divide(B,B),divide(divide(divide(C,divide(D,x4)),inverse(D)),divide(C,inverse(x4)))),
eq_4 ).
cnf(eq_6,plain,
divide(A,A) = divide(divide(B,B),divide(multiply(divide(C,divide(D,x4)),D),multiply(C,x4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_5,eq_1]),eq_1]) ).
cnf(eq_7,negated_conjecture,
divide(divide(B,B),divide(divide(divide(C,divide(D,x4)),inverse(D)),divide(C,inverse(x4)))) != divide(inverse(a1),inverse(a1)),
inference(cp,[status(thm)],[eq_5,eq_3]) ).
cnf(eq_8,negated_conjecture,
divide(divide(A,A),divide(divide(divide(B,divide(C,D)),inverse(C)),divide(B,inverse(D)))) != divide(inverse(a1),inverse(a1)),
eq_7 ).
cnf(eq_9,negated_conjecture,
divide(divide(B,B),divide(multiply(divide(C,divide(D,x4)),D),multiply(C,x4))) != divide(divide(x100,x100),divide(divide(divide(x101,divide(x102,x103)),inverse(x102)),divide(x101,inverse(x103)))),
inference(cp,[status(thm)],[eq_6,eq_8]) ).
cnf(eq_10,negated_conjecture,
divide(divide(A,A),divide(multiply(divide(B,divide(C,D)),C),multiply(B,D))) != divide(divide(x4,x4),divide(multiply(divide(x5,divide(x6,x7)),x6),multiply(x5,x7))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_9,eq_1]),eq_1]) ).
cnf(eq_11,negated_conjecture,
divide(divide(A,A),divide(multiply(divide(B,divide(C,D)),C),multiply(B,D))) != divide(divide(A,A),divide(multiply(divide(B,divide(C,D)),C),multiply(B,D))),
eq_10 ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP466-1 : TPTP v8.1.0. Released v2.6.0.
% 0.13/0.13 % Command : run_maedmax %d %s
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Jul 26 04:32:40 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.52 % SZS status Unsatisfiable
% 0.20/0.52 % SZS output start CNFRefutation for /tmp/MaedMax_31480
% See solution above
% 0.20/0.52
%------------------------------------------------------------------------------