%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP497-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 : n011.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:53 AM UTC 2026
% Result : Unsatisfiable 0.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 32 ( 32 unt; 0 def)
% Number of atoms : 32 ( 31 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 : 39 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : double_divide(double_divide(identity,double_divide(VAR_0,double_divide(VAR_1,identity))),double_divide(double_divide(VAR_1,double_divide(VAR_2,VAR_0)),identity)) = VAR_2,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
double_divide(double_divide(identity,double_divide(A,double_divide(B,identity))),double_divide(double_divide(B,double_divide(C,A)),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_86,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_86]) ).
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_9,plain,
double_divide(double_divide(identity,double_divide(double_divide(double_divide(A,double_divide(B,C)),identity),double_divide(D,identity))),double_divide(double_divide(D,B),identity)) = double_divide(identity,double_divide(C,double_divide(A,identity))),
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_11,plain,
double_divide(double_divide(identity,identity),double_divide(double_divide(A,double_divide(B,A)),identity)) = B,
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_13,plain,
double_divide(double_divide(identity,double_divide(identity,double_divide(A,identity))),double_divide(identity,identity)) = A,
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_87,plain,
identity = double_divide(identity,identity),
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_14,plain,
double_divide(identity,identity) = identity,
inference(copy,[status(thm)],[c_87]) ).
cnf(c_15,plain,
double_divide(double_divide(identity,double_divide(identity,double_divide(A,identity))),identity) = A,
inference(paramod,[status(thm)],[c_14,c_13]) ).
cnf(c_16,plain,
double_divide(identity,double_divide(double_divide(A,double_divide(B,A)),identity)) = B,
inference(paramod,[status(thm)],[c_14,c_11]) ).
cnf(c_88,plain,
double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(identity,identity))),A) = identity,
inference(paramod,[status(thm)],[c_15,c_1]) ).
cnf(c_34,plain,
double_divide(double_divide(identity,double_divide(double_divide(A,identity),identity)),A) = identity,
inference(paramod,[status(thm)],[c_14,c_88]) ).
cnf(c_38,plain,
double_divide(double_divide(identity,double_divide(identity,A)),identity) = double_divide(identity,double_divide(identity,double_divide(A,identity))),
inference(paramod,[status(thm)],[c_15,c_15]) ).
cnf(c_39,plain,
double_divide(identity,double_divide(identity,double_divide(double_divide(A,identity),identity))) = A,
inference(paramod,[status(thm)],[c_38,c_15]) ).
cnf(c_42,plain,
double_divide(identity,double_divide(double_divide(double_divide(A,identity),identity),identity)) = A,
inference(paramod,[status(thm)],[c_5,c_16]) ).
cnf(c_47,plain,
double_divide(double_divide(identity,double_divide(A,double_divide(B,identity))),double_divide(double_divide(B,identity),identity)) = double_divide(identity,double_divide(double_divide(A,identity),identity)),
inference(paramod,[status(thm)],[c_34,c_1]) ).
cnf(c_89,plain,
double_divide(double_divide(identity,double_divide(double_divide(double_divide(A,identity),identity),double_divide(B,identity))),double_divide(double_divide(B,identity),identity)) = double_divide(identity,double_divide(identity,double_divide(A,identity))),
inference(paramod,[status(thm)],[c_14,c_9]) ).
cnf(c_90,plain,
double_divide(identity,double_divide(double_divide(double_divide(double_divide(A,identity),identity),identity),identity)) = double_divide(identity,double_divide(identity,double_divide(A,identity))),
inference(paramod,[status(thm)],[c_47,c_89]) ).
cnf(c_91,plain,
double_divide(A,identity) = double_divide(identity,double_divide(identity,double_divide(A,identity))),
inference(paramod,[status(thm)],[c_42,c_90]) ).
cnf(c_67,plain,
double_divide(identity,double_divide(identity,double_divide(A,identity))) = double_divide(A,identity),
inference(copy,[status(thm)],[c_91]) ).
cnf(c_84,plain,
double_divide(double_divide(A,identity),identity) = A,
inference(paramod,[status(thm)],[c_67,c_39]) ).
cnf(c_85,plain,
$false,
inference(resolve,[status(thm)],[c_84,c_7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP497-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.43 % Computer : n011.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Fri Sep 25 14:57:29 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.44 % Process 2297725 was started by sandbox2 on n011,
% 0.18/0.44 % Fri Sep 25 14:57:29 2026
% 0.18/0.44 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.18/0.45
% 0.18/0.45 % From the command line: assign(max_seconds, 300).
% 0.18/0.48
% 0.18/0.48 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.48
% 0.18/0.48 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.18/0.48 % Length of proof is 21.
% 0.18/0.48 % Level of proof is 8.
% 0.18/0.48 % Maximum clause weight is 27.000.
% 0.18/0.48 % Given clauses 11.
% 0.18/0.48
% 0.18/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------