%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP559-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n001.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:30:22 AM UTC 2026
% Result : Unsatisfiable 0.08s 0.42s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 3
% Syntax : Number of formulae : 69 ( 69 unt; 0 def)
% Number of atoms : 69 ( 68 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 12 ( 12 ~; 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 : 160 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : divide(VAR_0,inverse(divide(divide(VAR_1,VAR_2),divide(VAR_0,VAR_2)))) = VAR_1,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B,
inference(clausify,[status(thm)],[single_axiom]) ).
fof(multiply,axiom,
! [VAR_0,VAR_1] : multiply(VAR_0,VAR_1) = divide(VAR_0,inverse(VAR_1)),
file('theBenchmark.p',multiply) ).
cnf(c_2,plain,
multiply(A,B) = divide(A,inverse(B)),
inference(clausify,[status(thm)],[multiply]) ).
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_3,plain,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(clausify,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_111,plain,
multiply(divide(a3,inverse(b3)),c3) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_2,c_3]) ).
cnf(c_112,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_2,c_111]) ).
cnf(c_113,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != multiply(a3,divide(b3,inverse(c3))),
inference(paramod,[status(thm)],[c_2,c_112]) ).
cnf(c_4,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(paramod,[status(thm)],[c_2,c_113]) ).
cnf(c_5,plain,
divide(A,inverse(divide(B,divide(A,inverse(divide(divide(B,C),divide(D,C))))))) = D,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_6,plain,
divide(A,inverse(divide(divide(B,inverse(divide(divide(C,D),divide(A,D)))),C))) = B,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_10,plain,
divide(A,inverse(divide(B,B))) = A,
inference(paramod,[status(thm)],[c_1,c_5]) ).
cnf(c_114,plain,
divide(A,inverse(divide(B,divide(A,inverse(divide(C,C)))))) = B,
inference(paramod,[status(thm)],[c_10,c_1]) ).
cnf(c_11,plain,
divide(A,inverse(divide(B,A))) = B,
inference(paramod,[status(thm)],[c_10,c_114]) ).
cnf(c_20,plain,
divide(inverse(divide(A,A)),inverse(B)) = B,
inference(paramod,[status(thm)],[c_10,c_11]) ).
cnf(c_21,plain,
divide(inverse(divide(A,B)),inverse(A)) = B,
inference(paramod,[status(thm)],[c_11,c_11]) ).
cnf(c_115,plain,
divide(A,A) = inverse(divide(B,B)),
inference(paramod,[status(thm)],[c_20,c_10]) ).
cnf(c_27,plain,
inverse(divide(A,A)) = divide(B,B),
inference(copy,[status(thm)],[c_115]) ).
cnf(c_29,plain,
divide(A,divide(B,B)) = A,
inference(paramod,[status(thm)],[c_27,c_1]) ).
cnf(c_34,plain,
divide(divide(A,A),inverse(B)) = B,
inference(paramod,[status(thm)],[c_27,c_20]) ).
cnf(c_35,plain,
divide(A,A) = divide(B,B),
inference(paramod,[status(thm)],[c_27,c_27]) ).
cnf(c_45,plain,
divide(A,inverse(divide(divide(B,C),B))) = divide(A,C),
inference(paramod,[status(thm)],[c_11,c_6]) ).
cnf(c_116,plain,
divide(A,inverse(divide(divide(B,B),C))) = inverse(divide(divide(C,D),divide(A,D))),
inference(paramod,[status(thm)],[c_35,c_6]) ).
cnf(c_50,plain,
inverse(divide(divide(A,B),divide(C,B))) = divide(C,inverse(divide(divide(D,D),A))),
inference(copy,[status(thm)],[c_116]) ).
cnf(c_117,plain,
divide(inverse(A),inverse(B)) = inverse(divide(divide(A,C),divide(B,C))),
inference(paramod,[status(thm)],[c_1,c_21]) ).
cnf(c_57,plain,
inverse(divide(divide(A,B),divide(C,B))) = divide(inverse(A),inverse(C)),
inference(copy,[status(thm)],[c_117]) ).
cnf(c_118,plain,
divide(inverse(A),inverse(B)) = inverse(divide(A,B)),
inference(paramod,[status(thm)],[c_21,c_11]) ).
cnf(c_63,plain,
inverse(divide(A,B)) = divide(inverse(A),inverse(B)),
inference(copy,[status(thm)],[c_118]) ).
cnf(c_119,plain,
divide(A,inverse(divide(B,C))) = inverse(divide(divide(divide(C,D),divide(A,D)),B)),
inference(paramod,[status(thm)],[c_21,c_6]) ).
cnf(c_120,plain,
divide(A,divide(inverse(B),inverse(C))) = inverse(divide(divide(divide(C,D),divide(A,D)),B)),
inference(paramod,[status(thm)],[c_63,c_119]) ).
cnf(c_121,plain,
divide(A,divide(inverse(B),inverse(C))) = divide(inverse(divide(divide(C,D),divide(A,D))),inverse(B)),
inference(paramod,[status(thm)],[c_63,c_120]) ).
cnf(c_122,plain,
divide(A,divide(inverse(B),inverse(C))) = divide(divide(inverse(divide(C,D)),inverse(divide(A,D))),inverse(B)),
inference(paramod,[status(thm)],[c_63,c_121]) ).
cnf(c_123,plain,
divide(A,divide(inverse(B),inverse(C))) = divide(divide(divide(inverse(C),inverse(D)),inverse(divide(A,D))),inverse(B)),
inference(paramod,[status(thm)],[c_63,c_122]) ).
cnf(c_124,plain,
divide(A,divide(inverse(B),inverse(C))) = divide(divide(divide(inverse(C),inverse(D)),divide(inverse(A),inverse(D))),inverse(B)),
inference(paramod,[status(thm)],[c_63,c_123]) ).
cnf(c_64,plain,
divide(divide(divide(inverse(A),inverse(B)),divide(inverse(C),inverse(B))),inverse(D)) = divide(C,divide(inverse(D),inverse(A))),
inference(copy,[status(thm)],[c_124]) ).
cnf(c_125,plain,
divide(inverse(divide(A,B)),inverse(divide(C,B))) = divide(C,inverse(divide(divide(D,D),A))),
inference(paramod,[status(thm)],[c_63,c_50]) ).
cnf(c_126,plain,
divide(divide(inverse(A),inverse(B)),inverse(divide(C,B))) = divide(C,inverse(divide(divide(D,D),A))),
inference(paramod,[status(thm)],[c_63,c_125]) ).
cnf(c_127,plain,
divide(divide(inverse(A),inverse(B)),divide(inverse(C),inverse(B))) = divide(C,inverse(divide(divide(D,D),A))),
inference(paramod,[status(thm)],[c_63,c_126]) ).
cnf(c_128,plain,
divide(divide(inverse(A),inverse(B)),divide(inverse(C),inverse(B))) = divide(C,divide(inverse(divide(D,D)),inverse(A))),
inference(paramod,[status(thm)],[c_63,c_127]) ).
cnf(c_129,plain,
divide(divide(inverse(A),inverse(B)),divide(inverse(C),inverse(B))) = divide(C,divide(divide(inverse(D),inverse(D)),inverse(A))),
inference(paramod,[status(thm)],[c_63,c_128]) ).
cnf(c_69,plain,
divide(divide(inverse(A),inverse(B)),divide(inverse(C),inverse(B))) = divide(C,A),
inference(paramod,[status(thm)],[c_34,c_129]) ).
cnf(c_130,plain,
divide(A,divide(inverse(divide(B,C)),inverse(divide(A,C)))) = B,
inference(paramod,[status(thm)],[c_63,c_1]) ).
cnf(c_131,plain,
divide(A,divide(divide(inverse(B),inverse(C)),inverse(divide(A,C)))) = B,
inference(paramod,[status(thm)],[c_63,c_130]) ).
cnf(c_132,plain,
divide(A,divide(divide(inverse(B),inverse(C)),divide(inverse(A),inverse(C)))) = B,
inference(paramod,[status(thm)],[c_63,c_131]) ).
cnf(c_74,plain,
divide(A,divide(A,B)) = B,
inference(paramod,[status(thm)],[c_69,c_132]) ).
cnf(c_133,plain,
divide(inverse(divide(A,B)),inverse(divide(C,B))) = divide(inverse(A),inverse(C)),
inference(paramod,[status(thm)],[c_63,c_57]) ).
cnf(c_134,plain,
divide(divide(inverse(A),inverse(B)),inverse(divide(C,B))) = divide(inverse(A),inverse(C)),
inference(paramod,[status(thm)],[c_63,c_133]) ).
cnf(c_135,plain,
divide(divide(inverse(A),inverse(B)),divide(inverse(C),inverse(B))) = divide(inverse(A),inverse(C)),
inference(paramod,[status(thm)],[c_63,c_134]) ).
cnf(c_136,plain,
divide(C,A) = divide(inverse(A),inverse(C)),
inference(paramod,[status(thm)],[c_69,c_135]) ).
cnf(c_80,plain,
divide(inverse(A),inverse(B)) = divide(B,A),
inference(copy,[status(thm)],[c_136]) ).
cnf(c_137,plain,
divide(A,divide(inverse(divide(B,C)),inverse(B))) = divide(A,C),
inference(paramod,[status(thm)],[c_63,c_45]) ).
cnf(c_83,plain,
divide(A,divide(divide(inverse(B),inverse(C)),inverse(B))) = divide(A,C),
inference(paramod,[status(thm)],[c_63,c_137]) ).
cnf(c_86,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(inverse(b3),inverse(inverse(c3)))),
inference(paramod,[status(thm)],[c_63,c_4]) ).
cnf(c_87,plain,
divide(divide(A,B),inverse(C)) = divide(A,divide(inverse(C),inverse(B))),
inference(paramod,[status(thm)],[c_69,c_64]) ).
cnf(c_138,plain,
divide(A,divide(inverse(B),divide(inverse(B),inverse(inverse(C))))) = divide(A,C),
inference(paramod,[status(thm)],[c_87,c_83]) ).
cnf(c_88,plain,
divide(A,inverse(inverse(B))) = divide(A,B),
inference(paramod,[status(thm)],[c_74,c_138]) ).
cnf(c_139,plain,
divide(a3,divide(inverse(c3),inverse(inverse(b3)))) != divide(a3,divide(inverse(b3),inverse(inverse(c3)))),
inference(paramod,[status(thm)],[c_87,c_86]) ).
cnf(c_140,plain,
divide(a3,divide(inverse(c3),b3)) != divide(a3,divide(inverse(b3),inverse(inverse(c3)))),
inference(paramod,[status(thm)],[c_88,c_139]) ).
cnf(c_89,plain,
divide(a3,divide(inverse(c3),b3)) != divide(a3,divide(inverse(b3),c3)),
inference(paramod,[status(thm)],[c_88,c_140]) ).
cnf(c_141,plain,
divide(inverse(divide(A,A)),inverse(B)) = B,
inference(paramod,[status(thm)],[c_80,c_29]) ).
cnf(c_142,plain,
divide(divide(inverse(A),inverse(A)),inverse(B)) = B,
inference(paramod,[status(thm)],[c_63,c_141]) ).
cnf(c_143,plain,
divide(inverse(A),divide(inverse(B),inverse(inverse(A)))) = B,
inference(paramod,[status(thm)],[c_87,c_142]) ).
cnf(c_99,plain,
divide(inverse(A),divide(inverse(B),A)) = B,
inference(paramod,[status(thm)],[c_88,c_143]) ).
cnf(c_105,plain,
divide(inverse(A),divide(B,A)) = inverse(B),
inference(paramod,[status(thm)],[c_80,c_74]) ).
cnf(c_106,plain,
inverse(inverse(A)) = A,
inference(paramod,[status(thm)],[c_105,c_99]) ).
cnf(c_144,plain,
divide(a3,divide(inverse(b3),inverse(inverse(c3)))) != divide(a3,divide(inverse(b3),c3)),
inference(paramod,[status(thm)],[c_80,c_89]) ).
cnf(c_145,plain,
divide(a3,divide(inverse(b3),c3)) != divide(a3,divide(inverse(b3),c3)),
inference(paramod,[status(thm)],[c_106,c_144]) ).
cnf(c_110,plain,
$false,
inference(copy,[status(thm)],[c_145]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP559-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n001.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 25 15:05:55 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 3620089 was started by sandbox2 on n001,
% 0.08/0.36 % Fri Sep 25 15:05:55 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.37
% 0.08/0.37 % From the command line: assign(max_seconds, 300).
% 0.08/0.42
% 0.08/0.42 % Assigning unary symbol inverse kb_weight 0 and highest precedence (7).
% 0.08/0.42
% 0.08/0.42 % SZS status Unsatisfiable for theBenchmark
% 0.08/0.42
% 0.08/0.42 % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.08/0.42 % Length of proof is 31.
% 0.08/0.42 % Level of proof is 13.
% 0.08/0.42 % Maximum clause weight is 72.000.
% 0.08/0.42 % Given clauses 19.
% 0.08/0.42
% 0.08/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------