%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP524-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/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:17 AM UTC 2026
% Result : Unsatisfiable 0.19s 5.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 4
% Syntax : Number of formulae : 51 ( 51 unt; 0 def)
% Number of atoms : 51 ( 50 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 118 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : divide(VAR_0,divide(VAR_1,divide(VAR_2,divide(VAR_0,VAR_1)))) = VAR_2,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
divide(A,divide(B,divide(C,divide(A,B)))) = C,
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_4,axiom,
multiply(a,b) != multiply(b,a),
file('theBenchmark.p',prove_these_axioms_4) ).
cnf(c_6,plain,
multiply(a,b) != multiply(b,a),
inference(clausify,[status(thm)],[prove_these_axioms_4]) ).
cnf(c_7,plain,
multiply(b,a) != multiply(a,b),
inference(copy,[status(thm)],[c_6]) ).
cnf(c_113,plain,
divide(A,inverse(C)) = multiply(A,C),
inference(paramod,[status(thm)],[c_5,c_3]) ).
cnf(c_8,plain,
multiply(A,B) = divide(A,inverse(B)),
inference(copy,[status(thm)],[c_113]) ).
cnf(c_114,plain,
divide(b,inverse(a)) != multiply(a,b),
inference(paramod,[status(thm)],[c_8,c_7]) ).
cnf(c_9,plain,
divide(b,inverse(a)) != divide(a,inverse(b)),
inference(paramod,[status(thm)],[c_8,c_114]) ).
cnf(c_10,plain,
divide(A,divide(divide(B,divide(C,divide(A,B))),divide(D,C))) = D,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_11,plain,
divide(A,divide(divide(B,divide(C,A)),B)) = C,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_115,plain,
divide(divide(A,A),divide(B,divide(C,inverse(B)))) = C,
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_12,plain,
inverse(divide(A,divide(B,inverse(A)))) = B,
inference(paramod,[status(thm)],[c_5,c_115]) ).
cnf(c_14,plain,
divide(A,inverse(divide(B,divide(A,divide(C,C))))) = B,
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_15,plain,
divide(inverse(divide(A,A)),B) = inverse(B),
inference(paramod,[status(thm)],[c_5,c_5]) ).
cnf(c_26,plain,
divide(A,divide(A,divide(B,divide(C,divide(D,divide(D,C)))))) = B,
inference(paramod,[status(thm)],[c_10,c_10]) ).
cnf(c_30,plain,
divide(inverse(inverse(divide(A,A))),B) = inverse(B),
inference(paramod,[status(thm)],[c_15,c_5]) ).
cnf(c_35,plain,
inverse(divide(A,inverse(inverse(A)))) = divide(B,B),
inference(paramod,[status(thm)],[c_5,c_12]) ).
cnf(c_38,plain,
inverse(inverse(divide(A,inverse(inverse(divide(B,B)))))) = A,
inference(paramod,[status(thm)],[c_15,c_12]) ).
cnf(c_41,plain,
divide(A,divide(divide(B,inverse(divide(A,B))),divide(C,inverse(inverse(divide(D,D)))))) = C,
inference(paramod,[status(thm)],[c_30,c_10]) ).
cnf(c_48,plain,
divide(A,divide(A,divide(B,inverse(divide(C,inverse(inverse(C))))))) = B,
inference(paramod,[status(thm)],[c_35,c_1]) ).
cnf(c_49,plain,
divide(A,divide(B,inverse(divide(C,inverse(inverse(C)))))) = divide(A,B),
inference(paramod,[status(thm)],[c_35,c_1]) ).
cnf(c_66,plain,
divide(A,divide(A,B)) = B,
inference(paramod,[status(thm)],[c_49,c_48]) ).
cnf(c_116,plain,
divide(A,divide(A,divide(B,divide(C,C)))) = B,
inference(paramod,[status(thm)],[c_66,c_26]) ).
cnf(c_67,plain,
divide(A,divide(B,B)) = A,
inference(paramod,[status(thm)],[c_66,c_116]) ).
cnf(c_72,plain,
divide(A,inverse(divide(B,A))) = B,
inference(paramod,[status(thm)],[c_67,c_14]) ).
cnf(c_117,plain,
divide(A,divide(A,divide(C,inverse(inverse(divide(D,D)))))) = C,
inference(paramod,[status(thm)],[c_72,c_41]) ).
cnf(c_74,plain,
divide(A,inverse(inverse(divide(B,B)))) = A,
inference(paramod,[status(thm)],[c_66,c_117]) ).
cnf(c_77,plain,
inverse(inverse(A)) = A,
inference(paramod,[status(thm)],[c_74,c_38]) ).
cnf(c_118,plain,
divide(A,B) = divide(divide(A,C),divide(B,C)),
inference(paramod,[status(thm)],[c_11,c_1]) ).
cnf(c_80,plain,
divide(divide(A,B),divide(C,B)) = divide(A,C),
inference(copy,[status(thm)],[c_118]) ).
cnf(c_88,plain,
divide(divide(A,B),divide(A,C)) = divide(D,divide(B,divide(C,D))),
inference(paramod,[status(thm)],[c_10,c_11]) ).
cnf(c_119,plain,
divide(A,B) = divide(C,divide(B,divide(A,C))),
inference(paramod,[status(thm)],[c_1,c_66]) ).
cnf(c_93,plain,
divide(A,divide(B,divide(C,A))) = divide(C,B),
inference(copy,[status(thm)],[c_119]) ).
cnf(c_97,plain,
divide(divide(A,B),divide(A,C)) = divide(C,B),
inference(paramod,[status(thm)],[c_93,c_88]) ).
cnf(c_103,plain,
divide(divide(A,B),inverse(B)) = A,
inference(paramod,[status(thm)],[c_66,c_72]) ).
cnf(c_120,plain,
divide(A,divide(B,inverse(C))) = divide(divide(A,C),B),
inference(paramod,[status(thm)],[c_103,c_80]) ).
cnf(c_109,plain,
divide(divide(A,B),C) = divide(A,divide(C,inverse(B))),
inference(copy,[status(thm)],[c_120]) ).
cnf(c_121,plain,
divide(A,divide(divide(A,C),inverse(B))) = divide(C,B),
inference(paramod,[status(thm)],[c_109,c_97]) ).
cnf(c_122,plain,
divide(A,divide(A,divide(inverse(B),inverse(C)))) = divide(C,B),
inference(paramod,[status(thm)],[c_109,c_121]) ).
cnf(c_110,plain,
divide(inverse(A),inverse(B)) = divide(B,A),
inference(paramod,[status(thm)],[c_66,c_122]) ).
cnf(c_123,plain,
multiply(A,B) = divide(inverse(inverse(B)),inverse(A)),
inference(paramod,[status(thm)],[c_110,c_8]) ).
cnf(c_124,plain,
divide(A,inverse(B)) = divide(inverse(inverse(B)),inverse(A)),
inference(paramod,[status(thm)],[c_8,c_123]) ).
cnf(c_111,plain,
divide(A,inverse(B)) = divide(B,inverse(A)),
inference(paramod,[status(thm)],[c_77,c_124]) ).
cnf(c_112,plain,
$false,
inference(resolve,[status(thm)],[c_111,c_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP524-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/5.45 % Computer : n001.cluster.edu
% 0.19/5.45 % Model : x86_64 x86_64
% 0.19/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.45 % Memory : 8046.5625MB
% 0.19/5.45 % OS : Linux 6.8.0-71-generic
% 0.19/5.45 % CPULimit : 300
% 0.19/5.45 % WCLimit : 300
% 0.19/5.45 % DateTime : Fri Sep 25 15:04:16 UTC 2026
% 0.19/5.45 % CPUTime :
% 0.19/5.46 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.19/5.46 % Process 3615363 was started by sandbox on n001,
% 0.19/5.46 % Fri Sep 25 15:04:16 2026
% 0.19/5.46 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.19/5.46
% 0.19/5.46 % From the command line: assign(max_seconds, 300).
% 0.19/5.49
% 0.19/5.49 % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.19/5.49
% 0.19/5.49 % SZS status Unsatisfiable for theBenchmark
% 0.19/5.49
% 0.19/5.49 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.19/5.49 % Length of proof is 35.
% 0.19/5.49 % Level of proof is 12.
% 0.19/5.49 % Maximum clause weight is 75.000.
% 0.19/5.49 % Given clauses 21.
% 0.19/5.49
% 0.19/5.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------