%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP455-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 : n017.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:45 AM UTC 2026
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 25 unt; 0 def)
% Number of atoms : 25 ( 24 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 : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : divide(divide(identity,divide(VAR_0,divide(VAR_1,divide(divide(divide(VAR_0,VAR_0),VAR_0),VAR_2)))),VAR_2) = VAR_1,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
divide(divide(identity,divide(A,divide(B,divide(divide(divide(A,A),A),C)))),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(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(divide(identity,divide(A,divide(B,divide(divide(identity,A),C)))),C) = B,
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_9,plain,
divide(divide(identity,divide(identity,divide(A,divide(identity,B)))),B) = A,
inference(paramod,[status(thm)],[c_5,c_8]) ).
cnf(c_11,plain,
divide(divide(identity,divide(A,identity)),B) = divide(divide(identity,A),B),
inference(paramod,[status(thm)],[c_5,c_8]) ).
cnf(c_14,plain,
divide(divide(identity,divide(identity,divide(A,identity))),identity) = A,
inference(paramod,[status(thm)],[c_5,c_9]) ).
cnf(c_33,plain,
divide(divide(identity,divide(A,divide(divide(identity,B),divide(divide(identity,A),C)))),C) = divide(identity,divide(B,identity)),
inference(paramod,[status(thm)],[c_11,c_8]) ).
cnf(c_34,plain,
divide(identity,B) = divide(identity,divide(B,identity)),
inference(paramod,[status(thm)],[c_8,c_33]) ).
cnf(c_21,plain,
divide(identity,divide(A,identity)) = divide(identity,A),
inference(copy,[status(thm)],[c_34]) ).
cnf(c_24,plain,
divide(divide(identity,divide(identity,A)),identity) = A,
inference(paramod,[status(thm)],[c_21,c_14]) ).
cnf(c_35,plain,
divide(A,divide(divide(identity,identity),identity)) = A,
inference(paramod,[status(thm)],[c_24,c_8]) ).
cnf(c_36,plain,
divide(A,divide(identity,identity)) = A,
inference(paramod,[status(thm)],[c_5,c_35]) ).
cnf(c_30,plain,
divide(A,identity) = A,
inference(paramod,[status(thm)],[c_5,c_36]) ).
cnf(c_37,plain,
divide(divide(identity,divide(identity,A)),identity) = divide(A,identity),
inference(paramod,[status(thm)],[c_21,c_24]) ).
cnf(c_38,plain,
divide(identity,divide(identity,A)) = divide(A,identity),
inference(paramod,[status(thm)],[c_30,c_37]) ).
cnf(c_31,plain,
divide(identity,divide(identity,A)) = A,
inference(paramod,[status(thm)],[c_30,c_38]) ).
cnf(c_32,plain,
$false,
inference(resolve,[status(thm)],[c_31,c_7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : GRP455-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.15/0.42 % Computer : n017.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Fri Sep 25 14:50:17 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.43 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.15/0.43 % Process 2561414 was started by sandbox2 on n017,
% 0.15/0.43 % Fri Sep 25 14:50:17 2026
% 0.15/0.43 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.15/0.43
% 0.15/0.43 % From the command line: assign(max_seconds, 300).
% 0.15/0.44
% 0.15/0.44 % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.15/0.44
% 0.15/0.44 % SZS status Unsatisfiable for theBenchmark
% 0.15/0.44
% 0.15/0.44 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.15/0.44 % Length of proof is 15.
% 0.15/0.44 % Level of proof is 8.
% 0.15/0.44 % Maximum clause weight is 87.000.
% 0.15/0.44 % Given clauses 9.
% 0.15/0.44
% 0.15/0.44 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------