TSTP Solution File: GRP522-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP522-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n019.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.19s 0.52s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 4 RR)
% Number of literals : 21 ( 20 equ; 3 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = divide(B,divide(C,divide(A,divide(B,C)))),
file('/tmp/MaedMax_9233') ).
cnf(eq_1,axiom,
divide(A,divide(divide(B,B),C)) = multiply(A,C),
file('/tmp/MaedMax_9233') ).
cnf(eq_2,axiom,
divide(divide(A,A),B) = inverse(B),
file('/tmp/MaedMax_9233') ).
cnf(eq_3,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/tmp/MaedMax_9233') ).
cnf(eq_4,plain,
divide(A,inverse(B)) = multiply(A,B),
inference(rw,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_5,plain,
divide(C,divide(divide(A,divide(B,C)),A)) = B,
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_6,plain,
divide(x100,divide(x101,inverse(divide(x100,x101)))) = divide(A,A),
inference(cp,[status(thm)],[eq_2,eq_0]) ).
cnf(eq_7,plain,
divide(inverse(divide(A,A)),x101) = inverse(x101),
inference(cp,[status(thm)],[eq_2,eq_2]) ).
cnf(eq_8,plain,
divide(A,A) = divide(B,divide(C,inverse(divide(B,C)))),
eq_6 ).
cnf(eq_9,plain,
divide(inverse(divide(A,A)),B) = inverse(B),
eq_7 ).
cnf(eq_10,plain,
A = divide(B,divide(divide(C,divide(A,B)),C)),
eq_5 ).
cnf(eq_11,plain,
divide(A,A) = divide(x102,x102),
inference(cp,[status(thm)],[eq_8,eq_8]) ).
cnf(eq_12,plain,
divide(inverse(divide(B,C)),divide(divide(A,A),B)) = C,
inference(cp,[status(thm)],[eq_8,eq_10]) ).
cnf(eq_13,plain,
divide(A,A) = divide(B,B),
eq_11 ).
cnf(eq_14,plain,
A = multiply(inverse(divide(B,A)),B),
inference(rw,[status(thm)],[eq_12,eq_1]) ).
cnf(eq_15,negated_conjecture,
multiply(divide(inverse(b2),inverse(b2)),a2) != a2,
inference(cp,[status(thm)],[eq_4,eq_3]) ).
cnf(eq_16,plain,
multiply(inverse(divide(B,B)),A) = A,
inference(cp,[status(thm)],[eq_13,eq_14]) ).
cnf(eq_17,plain,
A = multiply(inverse(divide(B,B)),A),
eq_16 ).
cnf(eq_18,plain,
A = inverse(inverse(A)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_17,eq_4]),eq_9]) ).
cnf(eq_19,negated_conjecture,
a2 != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_15,eq_4]),eq_2]),eq_18]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP522-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : run_maedmax %d %s
% 0.12/0.34 % Computer : n019.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Jul 26 04:24:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.52 % SZS status Unsatisfiable
% 0.19/0.52 % SZS output start CNFRefutation for /tmp/MaedMax_9233
% See solution above
% 0.19/0.52
%------------------------------------------------------------------------------