%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP451-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 : n014.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.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 32 unt; 0 def)
% Number of atoms : 32 ( 31 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 : 11 ( 3 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 : 66 ( 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]) ).
fof(inverse,axiom,
! [VAR_0,VAR_1] : inverse(VAR_0) = divide(divide(VAR_1,VAR_1),VAR_0),
file('theBenchmark.p',inverse) ).
cnf(c_3,plain,
inverse(A) = divide(divide(B,B),A),
inference(clausify,[status(thm)],[inverse]) ).
cnf(c_4,plain,
divide(divide(A,A),B) = inverse(B),
inference(copy,[status(thm)],[c_3]) ).
fof(prove_these_axioms_1,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('theBenchmark.p',prove_these_axioms_1) ).
cnf(c_5,plain,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(clausify,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_6,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(copy,[status(thm)],[c_5]) ).
cnf(c_7,plain,
multiply(A,B) = divide(A,inverse(B)),
inference(paramod,[status(thm)],[c_4,c_2]) ).
cnf(c_45,plain,
divide(divide(divide(A,A),divide(A,divide(B,divide(inverse(A),C)))),C) = B,
inference(paramod,[status(thm)],[c_4,c_1]) ).
cnf(c_8,plain,
divide(inverse(divide(A,divide(B,divide(inverse(A),C)))),C) = B,
inference(paramod,[status(thm)],[c_4,c_45]) ).
cnf(c_46,plain,
divide(inverse(b1),inverse(b1)) != multiply(inverse(a1),a1),
inference(paramod,[status(thm)],[c_7,c_6]) ).
cnf(c_9,plain,
divide(inverse(b1),inverse(b1)) != divide(inverse(a1),inverse(a1)),
inference(paramod,[status(thm)],[c_7,c_46]) ).
cnf(c_10,plain,
divide(inverse(divide(A,A)),B) = inverse(B),
inference(paramod,[status(thm)],[c_4,c_4]) ).
cnf(c_47,plain,
divide(inverse(inverse(divide(A,divide(inverse(divide(B,B)),C)))),C) = A,
inference(paramod,[status(thm)],[c_4,c_8]) ).
cnf(c_12,plain,
divide(inverse(inverse(divide(A,inverse(B)))),B) = A,
inference(paramod,[status(thm)],[c_10,c_47]) ).
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_18,plain,
divide(inverse(inverse(inverse(inverse(A)))),A) = divide(B,B),
inference(paramod,[status(thm)],[c_4,c_12]) ).
cnf(c_20,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,
divide(inverse(inverse(A)),B) = inverse(inverse(divide(A,inverse(inverse(B))))),
inference(paramod,[status(thm)],[c_12,c_12]) ).
cnf(c_48,plain,
inverse(inverse(divide(divide(D,B),inverse(divide(inverse(divide(A,divide(B,divide(inverse(A),C)))),C))))) = D,
inference(paramod,[status(thm)],[c_20,c_13]) ).
cnf(c_27,plain,
inverse(inverse(divide(divide(A,B),inverse(inverse(inverse(divide(divide(B,divide(inverse(C),D)),inverse(divide(inverse(C),D))))))))) = A,
inference(paramod,[status(thm)],[c_20,c_48]) ).
cnf(c_30,plain,
inverse(inverse(divide(divide(A,divide(inverse(B),C)),inverse(divide(inverse(B),C))))) = A,
inference(paramod,[status(thm)],[c_20,c_8]) ).
cnf(c_49,plain,
inverse(inverse(divide(inverse(inverse(A)),inverse(inverse(A))))) = divide(B,B),
inference(paramod,[status(thm)],[c_23,c_18]) ).
cnf(c_33,plain,
inverse(inverse(inverse(inverse(divide(A,inverse(inverse(inverse(inverse(A))))))))) = divide(B,B),
inference(paramod,[status(thm)],[c_23,c_49]) ).
cnf(c_36,plain,
inverse(inverse(divide(divide(A,B),inverse(B)))) = A,
inference(paramod,[status(thm)],[c_30,c_27]) ).
cnf(c_39,plain,
inverse(inverse(inverse(inverse(A)))) = A,
inference(paramod,[status(thm)],[c_4,c_36]) ).
cnf(c_50,plain,
inverse(inverse(inverse(inverse(divide(A,A))))) = divide(B,B),
inference(paramod,[status(thm)],[c_39,c_33]) ).
cnf(c_43,plain,
divide(A,A) = divide(B,B),
inference(paramod,[status(thm)],[c_39,c_50]) ).
cnf(c_44,plain,
$false,
inference(resolve,[status(thm)],[c_43,c_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP451-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.42 % Computer : n014.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.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Fri Sep 25 14:54:47 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 505211 was started by sandbox2 on n014,
% 0.17/0.43 % Fri Sep 25 14:54:47 2026
% 0.17/0.43 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/0.44
% 0.17/0.44 % From the command line: assign(max_seconds, 300).
% 0.17/0.45
% 0.17/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.45
% 0.17/0.45 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.17/0.45 % Length of proof is 22.
% 0.17/0.45 % Level of proof is 9.
% 0.17/0.45 % Maximum clause weight is 23.000.
% 0.17/0.45 % Given clauses 8.
% 0.17/0.45
% 0.17/0.45 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------