%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP461-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 : n019.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:46 AM UTC 2026
% Result : Unsatisfiable 0.18s 0.46s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% 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 : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 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 : 28 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : divide(VAR_0,divide(divide(divide(identity,VAR_1),VAR_2),divide(divide(divide(VAR_0,VAR_0),VAR_0),VAR_2))) = VAR_1,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
divide(A,divide(divide(divide(identity,B),C),divide(divide(divide(A,A),A),C))) = B,
inference(clausify,[status(thm)],[single_axiom]) ).
fof(multiply,axiom,
! [VAR_0,VAR_1] : multiply(VAR_0,VAR_1) = divide(VAR_0,divide(identity,VAR_1)),
file('theBenchmark.p',multiply) ).
cnf(c_2,plain,
multiply(A,B) = divide(A,divide(identity,B)),
inference(clausify,[status(thm)],[multiply]) ).
fof(inverse,axiom,
! [VAR_0] : inverse(VAR_0) = divide(identity,VAR_0),
file('theBenchmark.p',inverse) ).
cnf(c_3,plain,
inverse(A) = divide(identity,A),
inference(clausify,[status(thm)],[inverse]) ).
fof(identity,axiom,
! [VAR_0] : identity = divide(VAR_0,VAR_0),
file('theBenchmark.p',identity) ).
cnf(c_4,plain,
identity = divide(A,A),
inference(clausify,[status(thm)],[identity]) ).
cnf(c_5,plain,
divide(A,A) = identity,
inference(copy,[status(thm)],[c_4]) ).
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,
divide(identity,divide(identity,a2)) != a2,
inference(paramod,[status(thm)],[c_2,c_6]) ).
cnf(c_8,plain,
divide(A,divide(divide(divide(identity,B),C),divide(divide(identity,A),C))) = B,
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_23,plain,
inverse(divide(divide(divide(identity,A),B),divide(divide(identity,identity),B))) = A,
inference(paramod,[status(thm)],[c_8,c_3]) ).
cnf(c_24,plain,
inverse(divide(divide(divide(identity,A),B),divide(identity,B))) = A,
inference(paramod,[status(thm)],[c_5,c_23]) ).
cnf(c_10,plain,
divide(identity,divide(divide(divide(identity,A),B),divide(identity,B))) = A,
inference(paramod,[status(thm)],[c_3,c_24]) ).
cnf(c_14,plain,
divide(A,identity) = A,
inference(paramod,[status(thm)],[c_5,c_8]) ).
cnf(c_25,plain,
divide(identity,divide(divide(divide(identity,A),identity),identity)) = A,
inference(paramod,[status(thm)],[c_5,c_10]) ).
cnf(c_26,plain,
divide(identity,divide(divide(identity,A),identity)) = A,
inference(paramod,[status(thm)],[c_14,c_25]) ).
cnf(c_21,plain,
divide(identity,divide(identity,A)) = A,
inference(paramod,[status(thm)],[c_14,c_26]) ).
cnf(c_22,plain,
$false,
inference(resolve,[status(thm)],[c_21,c_7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP461-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.06 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.44 % Computer : n019.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % 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:55:48 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 3036224 was started by sandbox on n019,
% 0.18/0.44 % Fri Sep 25 14:55:48 2026
% 0.18/0.44 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.18/0.45
% 0.18/0.45 % From the command line: assign(max_seconds, 300).
% 0.18/0.46
% 0.18/0.46 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.46
% 0.18/0.46 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.18/0.46 % Length of proof is 12.
% 0.18/0.46 % Level of proof is 5.
% 0.18/0.46 % Maximum clause weight is 17.000.
% 0.18/0.46 % Given clauses 6.
% 0.18/0.46
% 0.18/0.46 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------