%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP453-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 07:29:45 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 4
% Syntax : Number of formulae : 68 ( 68 unt; 0 def)
% Number of atoms : 68 ( 67 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 9 ( 9 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 150 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : divide(divide(divide(VAR_0,VAR_0),divide(VAR_0,divide(VAR_1,divide(divide(divide(VAR_0,VAR_0),VAR_0),VAR_2)))),VAR_2) = VAR_1,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
divide(divide(divide(A,A),divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C) = B,
inference(clausify,[status(thm)],[single_axiom]) ).
fof(multiply,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(VAR_0,VAR_1) = divide(VAR_0,divide(divide(VAR_2,VAR_2),VAR_1)),
file('theBenchmark.p',multiply) ).
cnf(c_2,plain,
multiply(A,B) = divide(A,divide(divide(C,C),B)),
inference(clausify,[status(thm)],[multiply]) ).
cnf(c_3,plain,
divide(A,divide(divide(B,B),C)) = multiply(A,C),
inference(copy,[status(thm)],[c_2]) ).
fof(inverse,axiom,
! [VAR_0,VAR_1] : inverse(VAR_0) = divide(divide(VAR_1,VAR_1),VAR_0),
file('theBenchmark.p',inverse) ).
cnf(c_4,plain,
inverse(A) = divide(divide(B,B),A),
inference(clausify,[status(thm)],[inverse]) ).
cnf(c_5,plain,
divide(divide(A,A),B) = inverse(B),
inference(copy,[status(thm)],[c_4]) ).
fof(prove_these_axioms_3,axiom,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('theBenchmark.p',prove_these_axioms_3) ).
cnf(c_6,plain,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(clausify,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_139,plain,
divide(A,inverse(C)) = multiply(A,C),
inference(paramod,[status(thm)],[c_5,c_3]) ).
cnf(c_7,plain,
multiply(A,B) = divide(A,inverse(B)),
inference(copy,[status(thm)],[c_139]) ).
cnf(c_140,plain,
divide(divide(divide(A,A),divide(A,divide(B,divide(inverse(A),C)))),C) = B,
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_8,plain,
divide(inverse(divide(A,divide(B,divide(inverse(A),C)))),C) = B,
inference(paramod,[status(thm)],[c_5,c_140]) ).
cnf(c_141,plain,
multiply(divide(a3,inverse(b3)),c3) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_7,c_6]) ).
cnf(c_142,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_7,c_141]) ).
cnf(c_143,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != multiply(a3,divide(b3,inverse(c3))),
inference(paramod,[status(thm)],[c_7,c_142]) ).
cnf(c_9,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(paramod,[status(thm)],[c_7,c_143]) ).
cnf(c_10,plain,
divide(inverse(divide(A,A)),B) = inverse(B),
inference(paramod,[status(thm)],[c_5,c_5]) ).
cnf(c_11,plain,
divide(inverse(divide(A,inverse(divide(inverse(A),B)))),B) = divide(C,C),
inference(paramod,[status(thm)],[c_5,c_8]) ).
cnf(c_144,plain,
divide(inverse(inverse(divide(A,divide(inverse(divide(B,B)),C)))),C) = A,
inference(paramod,[status(thm)],[c_5,c_8]) ).
cnf(c_12,plain,
divide(inverse(inverse(divide(A,inverse(B)))),B) = A,
inference(paramod,[status(thm)],[c_10,c_144]) ).
cnf(c_13,plain,
divide(inverse(divide(divide(A,divide(B,divide(inverse(A),C))),divide(D,B))),C) = D,
inference(paramod,[status(thm)],[c_8,c_8]) ).
cnf(c_145,plain,
divide(inverse(divide(A,B)),C) = inverse(inverse(divide(B,inverse(divide(inverse(A),C))))),
inference(paramod,[status(thm)],[c_12,c_8]) ).
cnf(c_23,plain,
inverse(inverse(divide(A,inverse(divide(inverse(B),C))))) = divide(inverse(divide(B,A)),C),
inference(copy,[status(thm)],[c_145]) ).
cnf(c_146,plain,
divide(inverse(inverse(A)),B) = inverse(inverse(divide(A,inverse(inverse(B))))),
inference(paramod,[status(thm)],[c_12,c_12]) ).
cnf(c_27,plain,
inverse(inverse(divide(A,inverse(inverse(B))))) = divide(inverse(inverse(A)),B),
inference(copy,[status(thm)],[c_146]) ).
cnf(c_40,plain,
divide(A,A) = divide(B,B),
inference(paramod,[status(thm)],[c_11,c_11]) ).
cnf(c_147,plain,
divide(A,A) = inverse(divide(B,B)),
inference(paramod,[status(thm)],[c_40,c_5]) ).
cnf(c_43,plain,
inverse(divide(A,A)) = divide(B,B),
inference(copy,[status(thm)],[c_147]) ).
cnf(c_45,plain,
divide(inverse(divide(A,divide(B,B))),C) = divide(inverse(A),C),
inference(paramod,[status(thm)],[c_40,c_8]) ).
cnf(c_50,plain,
inverse(divide(A,A)) = inverse(divide(B,B)),
inference(paramod,[status(thm)],[c_43,c_5]) ).
cnf(c_148,plain,
multiply(A,divide(B,B)) = divide(A,divide(C,C)),
inference(paramod,[status(thm)],[c_43,c_7]) ).
cnf(c_51,plain,
divide(A,inverse(divide(B,B))) = divide(A,divide(C,C)),
inference(paramod,[status(thm)],[c_7,c_148]) ).
cnf(c_149,plain,
inverse(divide(A,A)) = inverse(inverse(divide(B,B))),
inference(paramod,[status(thm)],[c_43,c_10]) ).
cnf(c_54,plain,
inverse(inverse(divide(A,A))) = inverse(divide(B,B)),
inference(copy,[status(thm)],[c_149]) ).
cnf(c_62,plain,
divide(inverse(inverse(divide(A,inverse(divide(B,B))))),divide(C,C)) = A,
inference(paramod,[status(thm)],[c_50,c_12]) ).
cnf(c_150,plain,
divide(inverse(divide(divide(A,divide(B,divide(inverse(A),C))),divide(D,D))),C) = inverse(divide(E,inverse(divide(inverse(E),B)))),
inference(paramod,[status(thm)],[c_11,c_13]) ).
cnf(c_151,plain,
divide(inverse(divide(A,divide(B,divide(inverse(A),C)))),C) = inverse(divide(E,inverse(divide(inverse(E),B)))),
inference(paramod,[status(thm)],[c_45,c_150]) ).
cnf(c_152,plain,
B = inverse(divide(E,inverse(divide(inverse(E),B)))),
inference(paramod,[status(thm)],[c_8,c_151]) ).
cnf(c_77,plain,
inverse(divide(A,inverse(divide(inverse(A),B)))) = B,
inference(copy,[status(thm)],[c_152]) ).
cnf(c_79,plain,
divide(inverse(divide(divide(A,divide(B,inverse(divide(C,C)))),divide(D,B))),inverse(A)) = D,
inference(paramod,[status(thm)],[c_43,c_13]) ).
cnf(c_153,plain,
divide(inverse(inverse(divide(A,inverse(inverse(divide(B,B)))))),divide(C,C)) = A,
inference(paramod,[status(thm)],[c_54,c_12]) ).
cnf(c_96,plain,
divide(divide(inverse(inverse(A)),divide(B,B)),divide(C,C)) = A,
inference(paramod,[status(thm)],[c_27,c_153]) ).
cnf(c_97,plain,
divide(A,inverse(inverse(inverse(divide(B,B))))) = divide(A,divide(C,C)),
inference(paramod,[status(thm)],[c_10,c_51]) ).
cnf(c_102,plain,
divide(inverse(A),divide(inverse(B),A)) = B,
inference(paramod,[status(thm)],[c_77,c_12]) ).
cnf(c_104,plain,
inverse(divide(A,inverse(divide(B,B)))) = inverse(A),
inference(paramod,[status(thm)],[c_40,c_77]) ).
cnf(c_113,plain,
divide(inverse(inverse(A)),divide(B,B)) = A,
inference(paramod,[status(thm)],[c_104,c_62]) ).
cnf(c_114,plain,
divide(A,divide(B,B)) = A,
inference(paramod,[status(thm)],[c_113,c_96]) ).
cnf(c_115,plain,
inverse(inverse(A)) = A,
inference(paramod,[status(thm)],[c_114,c_113]) ).
cnf(c_154,plain,
divide(A,inverse(divide(B,B))) = divide(A,divide(C,C)),
inference(paramod,[status(thm)],[c_115,c_97]) ).
cnf(c_116,plain,
divide(A,inverse(divide(B,B))) = A,
inference(paramod,[status(thm)],[c_114,c_154]) ).
cnf(c_155,plain,
divide(A,inverse(divide(inverse(B),C))) = divide(inverse(divide(B,A)),C),
inference(paramod,[status(thm)],[c_115,c_23]) ).
cnf(c_126,plain,
divide(inverse(divide(A,B)),C) = divide(B,inverse(divide(inverse(A),C))),
inference(copy,[status(thm)],[c_155]) ).
cnf(c_156,plain,
divide(inverse(divide(divide(A,B),divide(D,B))),inverse(A)) = D,
inference(paramod,[status(thm)],[c_116,c_79]) ).
cnf(c_157,plain,
divide(divide(D,B),inverse(divide(inverse(divide(A,B)),inverse(A)))) = D,
inference(paramod,[status(thm)],[c_126,c_156]) ).
cnf(c_158,plain,
divide(divide(D,B),inverse(divide(B,inverse(divide(inverse(A),inverse(A)))))) = D,
inference(paramod,[status(thm)],[c_126,c_157]) ).
cnf(c_127,plain,
divide(divide(A,B),inverse(B)) = A,
inference(paramod,[status(thm)],[c_116,c_158]) ).
cnf(c_133,plain,
divide(inverse(A),divide(B,A)) = inverse(B),
inference(paramod,[status(thm)],[c_115,c_102]) ).
cnf(c_159,plain,
divide(inverse(inverse(A)),B) = inverse(divide(B,A)),
inference(paramod,[status(thm)],[c_127,c_133]) ).
cnf(c_160,plain,
divide(A,B) = inverse(divide(B,A)),
inference(paramod,[status(thm)],[c_115,c_159]) ).
cnf(c_136,plain,
inverse(divide(A,B)) = divide(B,A),
inference(copy,[status(thm)],[c_160]) ).
cnf(c_161,plain,
divide(divide(B,A),C) = divide(B,inverse(divide(inverse(A),C))),
inference(paramod,[status(thm)],[c_136,c_126]) ).
cnf(c_137,plain,
divide(divide(A,B),C) = divide(A,divide(C,inverse(B))),
inference(paramod,[status(thm)],[c_136,c_161]) ).
cnf(c_162,plain,
divide(a3,divide(inverse(c3),inverse(inverse(b3)))) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(paramod,[status(thm)],[c_137,c_9]) ).
cnf(c_163,plain,
divide(a3,divide(inverse(c3),b3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(paramod,[status(thm)],[c_115,c_162]) ).
cnf(c_164,plain,
divide(a3,divide(inverse(c3),b3)) != divide(a3,divide(inverse(c3),b3)),
inference(paramod,[status(thm)],[c_136,c_163]) ).
cnf(c_138,plain,
$false,
inference(copy,[status(thm)],[c_164]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP453-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.42 % Computer : n002.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Fri Sep 25 14:57:34 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.43 % Process 3571983 was started by sandbox on n002,
% 0.17/0.43 % Fri Sep 25 14:57:34 2026
% 0.17/0.43 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.17/0.44
% 0.17/0.44 % From the command line: assign(max_seconds, 300).
% 0.17/0.49
% 0.17/0.49 % Assigning unary symbol inverse kb_weight 0 and highest precedence (7).
% 0.17/0.49
% 0.17/0.49 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.49
% 0.17/0.49 % Proof 1 at 0.03 (+ 0.02) seconds.
% 0.17/0.49 % Length of proof is 38.
% 0.17/0.49 % Level of proof is 15.
% 0.17/0.49 % Maximum clause weight is 94.000.
% 0.17/0.49 % Given clauses 24.
% 0.17/0.49
% 0.17/0.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------