%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP581-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 : n007.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:25 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 21 unt; 0 def)
% Number of atoms : 21 ( 20 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 : 6 ( 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 : 17 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : double_divide(double_divide(VAR_0,double_divide(double_divide(identity,VAR_1),double_divide(VAR_2,double_divide(VAR_1,VAR_0)))),double_divide(identity,identity)) = VAR_2,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
double_divide(double_divide(A,double_divide(double_divide(identity,B),double_divide(C,double_divide(B,A)))),double_divide(identity,identity)) = C,
inference(clausify,[status(thm)],[single_axiom]) ).
fof(multiply,axiom,
! [VAR_0,VAR_1] : multiply(VAR_0,VAR_1) = double_divide(double_divide(VAR_1,VAR_0),identity),
file('theBenchmark.p',multiply) ).
cnf(c_2,plain,
multiply(A,B) = double_divide(double_divide(B,A),identity),
inference(clausify,[status(thm)],[multiply]) ).
fof(inverse,axiom,
! [VAR_0] : inverse(VAR_0) = double_divide(VAR_0,identity),
file('theBenchmark.p',inverse) ).
cnf(c_3,plain,
inverse(A) = double_divide(A,identity),
inference(clausify,[status(thm)],[inverse]) ).
fof(identity,axiom,
! [VAR_0] : identity = double_divide(VAR_0,inverse(VAR_0)),
file('theBenchmark.p',identity) ).
cnf(c_4,plain,
identity = double_divide(A,inverse(A)),
inference(clausify,[status(thm)],[identity]) ).
cnf(c_28,plain,
identity = double_divide(A,double_divide(A,identity)),
inference(paramod,[status(thm)],[c_3,c_4]) ).
cnf(c_5,plain,
double_divide(A,double_divide(A,identity)) = identity,
inference(copy,[status(thm)],[c_28]) ).
fof(prove_these_axioms_1,axiom,
multiply(inverse(a1),a1) != identity,
file('theBenchmark.p',prove_these_axioms_1) ).
cnf(c_6,plain,
multiply(inverse(a1),a1) != identity,
inference(clausify,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_29,plain,
multiply(double_divide(a1,identity),a1) != identity,
inference(paramod,[status(thm)],[c_3,c_6]) ).
cnf(c_30,plain,
double_divide(double_divide(a1,double_divide(a1,identity)),identity) != identity,
inference(paramod,[status(thm)],[c_2,c_29]) ).
cnf(c_7,plain,
double_divide(identity,identity) != identity,
inference(paramod,[status(thm)],[c_5,c_30]) ).
cnf(c_12,plain,
double_divide(double_divide(identity,double_divide(double_divide(identity,A),identity)),double_divide(identity,identity)) = A,
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_31,plain,
double_divide(double_divide(identity,double_divide(identity,identity)),double_divide(identity,identity)) = double_divide(identity,identity),
inference(paramod,[status(thm)],[c_5,c_12]) ).
cnf(c_32,plain,
double_divide(identity,double_divide(identity,identity)) = double_divide(identity,identity),
inference(paramod,[status(thm)],[c_5,c_31]) ).
cnf(c_33,plain,
identity = double_divide(identity,identity),
inference(paramod,[status(thm)],[c_5,c_32]) ).
cnf(c_26,plain,
double_divide(identity,identity) = identity,
inference(copy,[status(thm)],[c_33]) ).
cnf(c_27,plain,
$false,
inference(resolve,[status(thm)],[c_26,c_7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP581-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n007.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 14:58:39 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 1292630 was started by sandbox2 on n007,
% 0.08/0.36 % Fri Sep 25 14:58:39 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.13/0.36
% 0.13/0.36 % From the command line: assign(max_seconds, 300).
% 0.13/0.37
% 0.13/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.37
% 0.13/0.37 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/0.37 % Length of proof is 10.
% 0.13/0.37 % Level of proof is 4.
% 0.13/0.37 % Maximum clause weight is 17.000.
% 0.13/0.37 % Given clauses 7.
% 0.13/0.37
% 0.13/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------