TSTP Solution File: GRP535-1 by MaedMax---1.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : MaedMax---1.4
% Problem : GRP535-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp
% Command : run_maedmax %d %s
% Computer : n016.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:53 EDT 2022
% Result : Unsatisfiable 0.55s 0.74s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of clauses : 37 ( 37 unt; 0 nHn; 11 RR)
% Number of literals : 37 ( 36 equ; 9 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 : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(eq_0,axiom,
A = divide(divide(B,divide(divide(B,C),A)),C),
file('/tmp/MaedMax_5486') ).
cnf(eq_1,axiom,
divide(A,divide(divide(B,B),C)) = multiply(A,C),
file('/tmp/MaedMax_5486') ).
cnf(eq_2,axiom,
divide(divide(A,A),B) = inverse(B),
file('/tmp/MaedMax_5486') ).
cnf(eq_3,axiom,
divide(A,A) = identity,
file('/tmp/MaedMax_5486') ).
cnf(eq_4,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/tmp/MaedMax_5486') ).
cnf(eq_5,plain,
divide(A,divide(identity,B)) = multiply(A,B),
inference(rw,[status(thm)],[eq_1,eq_3]) ).
cnf(eq_6,plain,
divide(identity,A) = inverse(A),
inference(rw,[status(thm)],[eq_2,eq_3]) ).
cnf(eq_7,plain,
divide(divide(B,A),divide(divide(B,C),A)) = C,
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_8,plain,
divide(divide(A,divide(identity,x102)),A) = x102,
inference(cp,[status(thm)],[eq_3,eq_0]) ).
cnf(eq_9,plain,
divide(divide(divide(B,divide(divide(B,C),A)),divide(A,x102)),C) = x102,
inference(cp,[status(thm)],[eq_0,eq_0]) ).
cnf(eq_10,plain,
A = divide(divide(divide(B,divide(divide(B,C),x3)),divide(x3,A)),C),
eq_9 ).
cnf(eq_11,plain,
A = divide(divide(B,divide(identity,A)),B),
eq_8 ).
cnf(eq_12,plain,
A = divide(divide(B,C),divide(divide(B,A),C)),
eq_7 ).
cnf(eq_13,plain,
divide(A,inverse(B)) = multiply(A,B),
inference(rw,[status(thm)],[eq_1,eq_2]) ).
cnf(eq_14,plain,
divide(divide(A,x101),divide(identity,x101)) = A,
inference(cp,[status(thm)],[eq_3,eq_12]) ).
cnf(eq_15,plain,
divide(multiply(A,B),A) = B,
inference(cp,[status(thm)],[eq_5,eq_11]) ).
cnf(eq_16,plain,
divide(A,x101) = divide(divide(B,x101),divide(B,A)),
inference(cp,[status(thm)],[eq_12,eq_10]) ).
cnf(eq_17,plain,
divide(A,divide(A,x103)) = x103,
inference(cp,[status(thm)],[eq_0,eq_10]) ).
cnf(eq_18,plain,
divide(identity,x101) = divide(divide(x100,x101),x100),
inference(cp,[status(thm)],[eq_3,eq_10]) ).
cnf(eq_19,plain,
A = divide(B,divide(B,A)),
eq_17 ).
cnf(eq_20,plain,
divide(A,B) = divide(divide(C,B),divide(C,A)),
eq_16 ).
cnf(eq_21,plain,
A = divide(multiply(B,A),B),
eq_15 ).
cnf(eq_22,plain,
divide(divide(A,B),A) = divide(identity,B),
eq_18 ).
cnf(eq_23,plain,
A = multiply(divide(A,B),B),
inference(rw,[status(thm)],[eq_14,eq_5]) ).
cnf(eq_24,plain,
divide(A,B) = divide(identity,divide(B,A)),
inference(cp,[status(thm)],[eq_19,eq_22]) ).
cnf(eq_25,plain,
multiply(A,B) = multiply(B,A),
inference(cp,[status(thm)],[eq_21,eq_23]) ).
cnf(eq_26,negated_conjecture,
multiply(a3,multiply(c3,b3)) != multiply(multiply(a3,b3),c3),
inference(cp,[status(thm)],[eq_25,eq_4]) ).
cnf(eq_27,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(c3,b3)),
eq_26 ).
cnf(eq_28,negated_conjecture,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(c3,inverse(b3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_27,eq_13]),eq_13]),eq_13]),eq_13]) ).
cnf(eq_29,plain,
divide(A,divide(B,x102)) = divide(x102,divide(B,A)),
inference(cp,[status(thm)],[eq_19,eq_20]) ).
cnf(eq_30,plain,
divide(A,divide(B,C)) = divide(C,divide(B,A)),
eq_29 ).
cnf(eq_31,negated_conjecture,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,b3),c3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_28,eq_6]),eq_6]),eq_6]),eq_6]),eq_24]) ).
cnf(eq_32,negated_conjecture,
divide(c3,divide(identity,divide(a3,divide(identity,b3)))) != divide(a3,divide(divide(identity,b3),c3)),
inference(cp,[status(thm)],[eq_30,eq_31]) ).
cnf(eq_33,negated_conjecture,
divide(a3,divide(divide(identity,b3),c3)) != divide(c3,divide(divide(identity,b3),a3)),
inference(rw,[status(thm)],[eq_32,eq_24]) ).
cnf(eq_34,negated_conjecture,
divide(a3,divide(inverse(b3),c3)) != divide(c3,divide(inverse(b3),a3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[eq_33,eq_6]),eq_6]) ).
cnf(eq_35,negated_conjecture,
divide(c3,divide(inverse(b3),a3)) != divide(c3,divide(inverse(b3),a3)),
inference(cp,[status(thm)],[eq_30,eq_34]) ).
cnf(bot,negated_conjecture,
$false,
inference(cn,[status(thm)],[eq_35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP535-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.13 % Command : run_maedmax %d %s
% 0.13/0.33 % Computer : n016.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:38:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.55/0.74 % SZS status Unsatisfiable
% 0.55/0.74 % SZS output start CNFRefutation for /tmp/MaedMax_5486
% See solution above
% 0.55/0.74
%------------------------------------------------------------------------------