%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP597-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 : n015.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:27 AM UTC 2026
% Result : Unsatisfiable 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 20 unt; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 35 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : double_divide(double_divide(VAR_0,VAR_1),inverse(double_divide(VAR_0,inverse(double_divide(inverse(VAR_2),VAR_1))))) = VAR_2,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(inverse(C),B))))) = C,
inference(clausify,[status(thm)],[single_axiom]) ).
fof(multiply,axiom,
! [VAR_0,VAR_1] : multiply(VAR_0,VAR_1) = inverse(double_divide(VAR_1,VAR_0)),
file('theBenchmark.p',multiply) ).
cnf(c_2,plain,
multiply(A,B) = inverse(double_divide(B,A)),
inference(clausify,[status(thm)],[multiply]) ).
fof(prove_these_axioms_1,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('theBenchmark.p',prove_these_axioms_1) ).
cnf(c_3,plain,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(clausify,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_92,plain,
inverse(double_divide(a1,inverse(a1))) != multiply(inverse(b1),b1),
inference(paramod,[status(thm)],[c_2,c_3]) ).
cnf(c_93,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
inference(paramod,[status(thm)],[c_2,c_92]) ).
cnf(c_4,plain,
inverse(double_divide(b1,inverse(b1))) != inverse(double_divide(a1,inverse(a1))),
inference(copy,[status(thm)],[c_93]) ).
cnf(c_5,plain,
double_divide(A,inverse(double_divide(double_divide(B,C),inverse(double_divide(inverse(D),inverse(double_divide(B,inverse(double_divide(inverse(A),C))))))))) = D,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_94,plain,
double_divide(A,inverse(double_divide(double_divide(double_divide(B,C),inverse(double_divide(B,inverse(double_divide(inverse(inverse(D)),C))))),inverse(A)))) = D,
inference(paramod,[status(thm)],[c_5,c_5]) ).
cnf(c_12,plain,
double_divide(A,inverse(double_divide(inverse(B),inverse(A)))) = B,
inference(paramod,[status(thm)],[c_1,c_94]) ).
cnf(c_15,plain,
double_divide(double_divide(A,inverse(A)),inverse(B)) = B,
inference(paramod,[status(thm)],[c_12,c_1]) ).
cnf(c_23,plain,
double_divide(inverse(A),inverse(double_divide(B,inverse(B)))) = A,
inference(paramod,[status(thm)],[c_15,c_12]) ).
cnf(c_95,plain,
double_divide(A,inverse(double_divide(inverse(A),inverse(double_divide(inverse(B),inverse(double_divide(C,inverse(C)))))))) = B,
inference(paramod,[status(thm)],[c_23,c_1]) ).
cnf(c_24,plain,
double_divide(A,inverse(double_divide(inverse(A),inverse(B)))) = B,
inference(paramod,[status(thm)],[c_23,c_95]) ).
cnf(c_41,plain,
double_divide(A,inverse(A)) = double_divide(B,inverse(B)),
inference(paramod,[status(thm)],[c_23,c_24]) ).
cnf(c_96,plain,
multiply(inverse(A),A) = inverse(double_divide(B,inverse(B))),
inference(paramod,[status(thm)],[c_41,c_2]) ).
cnf(c_90,plain,
inverse(double_divide(A,inverse(A))) = inverse(double_divide(B,inverse(B))),
inference(paramod,[status(thm)],[c_2,c_96]) ).
cnf(c_91,plain,
$false,
inference(resolve,[status(thm)],[c_90,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP597-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.16/0.43 % Computer : n015.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.44 % CPULimit : 300
% 0.16/0.44 % WCLimit : 300
% 0.16/0.44 % DateTime : Fri Sep 25 15:04:43 UTC 2026
% 0.16/0.44 % CPUTime :
% 0.16/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.16/0.44 % Process 1678886 was started by sandbox2 on n015,
% 0.16/0.44 % Fri Sep 25 15:04:43 2026
% 0.16/0.44 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.16/0.45
% 0.16/0.45 % From the command line: assign(max_seconds, 300).
% 0.16/0.47
% 0.16/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.16/0.47
% 0.16/0.47 % Proof 1 at 0.02 (+ 0.01) seconds.
% 0.16/0.47 % Length of proof is 12.
% 0.16/0.47 % Level of proof is 8.
% 0.16/0.47 % Maximum clause weight is 21.000.
% 0.16/0.47 % Given clauses 17.
% 0.16/0.47
% 0.16/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------