%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP491-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.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:52 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.59s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 31 unt; 0 def)
% Number of atoms : 31 ( 30 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 7 ( 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 : 27 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : double_divide(double_divide(identity,VAR_0),double_divide(identity,double_divide(double_divide(double_divide(VAR_0,VAR_1),identity),double_divide(VAR_2,VAR_1)))) = VAR_2,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
double_divide(double_divide(identity,A),double_divide(identity,double_divide(double_divide(double_divide(A,B),identity),double_divide(C,B)))) = 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_30,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_30]) ).
fof(prove_these_axioms_2,axiom,
multiply(identity,a2) != a2,
file('theBenchmark.p',prove_these_axioms_2) ).
cnf(c_6,plain,
multiply(identity,a2) != a2,
inference(clausify,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_7,plain,
double_divide(double_divide(a2,identity),identity) != a2,
inference(paramod,[status(thm)],[c_2,c_6]) ).
cnf(c_8,plain,
double_divide(identity,double_divide(identity,double_divide(double_divide(double_divide(double_divide(identity,identity),A),identity),double_divide(B,A)))) = B,
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_9,plain,
double_divide(double_divide(identity,A),double_divide(identity,double_divide(double_divide(identity,identity),double_divide(B,double_divide(A,identity))))) = B,
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_11,plain,
double_divide(double_divide(identity,A),double_divide(identity,identity)) = double_divide(double_divide(A,identity),identity),
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_31,plain,
double_divide(identity,double_divide(identity,identity)) = double_divide(double_divide(double_divide(identity,identity),identity),identity),
inference(paramod,[status(thm)],[c_5,c_8]) ).
cnf(c_32,plain,
identity = double_divide(double_divide(double_divide(identity,identity),identity),identity),
inference(paramod,[status(thm)],[c_5,c_31]) ).
cnf(c_14,plain,
double_divide(double_divide(double_divide(identity,identity),identity),identity) = identity,
inference(copy,[status(thm)],[c_32]) ).
cnf(c_15,plain,
double_divide(double_divide(identity,A),double_divide(identity,double_divide(double_divide(identity,identity),identity))) = A,
inference(paramod,[status(thm)],[c_5,c_9]) ).
cnf(c_33,plain,
double_divide(identity,double_divide(identity,double_divide(double_divide(double_divide(double_divide(identity,identity),identity),identity),identity))) = double_divide(double_divide(identity,identity),identity),
inference(paramod,[status(thm)],[c_14,c_8]) ).
cnf(c_34,plain,
double_divide(identity,double_divide(identity,double_divide(identity,identity))) = double_divide(double_divide(identity,identity),identity),
inference(paramod,[status(thm)],[c_14,c_33]) ).
cnf(c_35,plain,
double_divide(identity,identity) = double_divide(double_divide(identity,identity),identity),
inference(paramod,[status(thm)],[c_5,c_34]) ).
cnf(c_20,plain,
double_divide(double_divide(identity,identity),identity) = double_divide(identity,identity),
inference(copy,[status(thm)],[c_35]) ).
cnf(c_36,plain,
double_divide(double_divide(identity,A),double_divide(identity,double_divide(identity,identity))) = A,
inference(paramod,[status(thm)],[c_20,c_15]) ).
cnf(c_23,plain,
double_divide(double_divide(identity,A),identity) = A,
inference(paramod,[status(thm)],[c_5,c_36]) ).
cnf(c_24,plain,
double_divide(identity,identity) = identity,
inference(paramod,[status(thm)],[c_23,c_14]) ).
cnf(c_37,plain,
double_divide(double_divide(identity,A),identity) = double_divide(double_divide(A,identity),identity),
inference(paramod,[status(thm)],[c_24,c_11]) ).
cnf(c_38,plain,
A = double_divide(double_divide(A,identity),identity),
inference(paramod,[status(thm)],[c_23,c_37]) ).
cnf(c_28,plain,
double_divide(double_divide(A,identity),identity) = A,
inference(copy,[status(thm)],[c_38]) ).
cnf(c_29,plain,
$false,
inference(resolve,[status(thm)],[c_28,c_7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP491-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.57 % Computer : n020.cluster.edu
% 0.10/0.57 % Model : x86_64 x86_64
% 0.10/0.57 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.57 % Memory : 8046.5625MB
% 0.10/0.57 % OS : Linux 6.8.0-71-generic
% 0.10/0.57 % CPULimit : 300
% 0.10/0.57 % WCLimit : 300
% 0.10/0.57 % DateTime : Fri Sep 25 14:57:49 UTC 2026
% 0.10/0.57 % CPUTime :
% 0.10/0.57 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.57 % Process 3204221 was started by sandbox on n020,
% 0.10/0.57 % Fri Sep 25 14:57:49 2026
% 0.10/0.57 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.58
% 0.10/0.58 % From the command line: assign(max_seconds, 300).
% 0.10/0.59
% 0.10/0.59 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.59
% 0.10/0.59 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.59 % Length of proof is 17.
% 0.10/0.59 % Level of proof is 8.
% 0.10/0.59 % Maximum clause weight is 82.000.
% 0.10/0.59 % Given clauses 9.
% 0.10/0.59
% 0.10/0.59 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------