%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP465-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 : n005.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.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 5
% Syntax : Number of formulae : 48 ( 48 unt; 0 def)
% Number of atoms : 48 ( 47 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : divide(VAR_0,divide(divide(divide(divide(VAR_0,VAR_0),VAR_1),VAR_2),divide(divide(identity,VAR_0),VAR_2))) = VAR_1,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(identity,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_3,axiom,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('theBenchmark.p',prove_these_axioms_3) ).
cnf(c_6,plain,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(clausify,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_71,plain,
multiply(divide(a3,divide(identity,b3)),c3) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_2,c_6]) ).
cnf(c_72,plain,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_2,c_71]) ).
cnf(c_73,plain,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != multiply(a3,divide(b3,divide(identity,c3))),
inference(paramod,[status(thm)],[c_2,c_72]) ).
cnf(c_7,plain,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(paramod,[status(thm)],[c_2,c_73]) ).
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_74,plain,
inverse(divide(divide(divide(identity,A),B),divide(divide(identity,identity),B))) = A,
inference(paramod,[status(thm)],[c_8,c_3]) ).
cnf(c_75,plain,
inverse(divide(divide(divide(identity,A),B),divide(identity,B))) = A,
inference(paramod,[status(thm)],[c_5,c_74]) ).
cnf(c_10,plain,
divide(identity,divide(divide(divide(identity,A),B),divide(identity,B))) = A,
inference(paramod,[status(thm)],[c_3,c_75]) ).
cnf(c_12,plain,
divide(A,divide(identity,divide(divide(identity,A),divide(identity,B)))) = B,
inference(paramod,[status(thm)],[c_5,c_8]) ).
cnf(c_13,plain,
divide(A,divide(divide(divide(identity,B),divide(identity,A)),identity)) = B,
inference(paramod,[status(thm)],[c_5,c_8]) ).
cnf(c_14,plain,
divide(A,identity) = A,
inference(paramod,[status(thm)],[c_5,c_8]) ).
cnf(c_17,plain,
divide(A,divide(divide(identity,B),divide(identity,A))) = B,
inference(paramod,[status(thm)],[c_14,c_13]) ).
cnf(c_76,plain,
divide(identity,divide(divide(divide(identity,A),identity),identity)) = A,
inference(paramod,[status(thm)],[c_5,c_10]) ).
cnf(c_77,plain,
divide(identity,divide(divide(identity,A),identity)) = A,
inference(paramod,[status(thm)],[c_14,c_76]) ).
cnf(c_19,plain,
divide(identity,divide(identity,A)) = A,
inference(paramod,[status(thm)],[c_14,c_77]) ).
cnf(c_23,plain,
divide(A,divide(divide(B,C),divide(divide(identity,A),C))) = divide(identity,B),
inference(paramod,[status(thm)],[c_19,c_8]) ).
cnf(c_28,plain,
divide(A,divide(B,divide(identity,A))) = divide(identity,B),
inference(paramod,[status(thm)],[c_19,c_17]) ).
cnf(c_30,plain,
divide(divide(identity,A),divide(B,A)) = divide(identity,B),
inference(paramod,[status(thm)],[c_19,c_28]) ).
cnf(c_78,plain,
divide(divide(identity,divide(A,B)),divide(identity,A)) = divide(identity,divide(identity,B)),
inference(paramod,[status(thm)],[c_30,c_30]) ).
cnf(c_32,plain,
divide(divide(identity,divide(A,B)),divide(identity,A)) = B,
inference(paramod,[status(thm)],[c_19,c_78]) ).
cnf(c_38,plain,
divide(divide(A,B),divide(identity,B)) = A,
inference(paramod,[status(thm)],[c_32,c_12]) ).
cnf(c_39,plain,
divide(divide(A,divide(identity,B)),B) = A,
inference(paramod,[status(thm)],[c_19,c_38]) ).
cnf(c_79,plain,
divide(A,B) = divide(identity,divide(B,A)),
inference(paramod,[status(thm)],[c_38,c_28]) ).
cnf(c_40,plain,
divide(identity,divide(A,B)) = divide(B,A),
inference(copy,[status(thm)],[c_79]) ).
cnf(c_41,plain,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,c3),b3)),
inference(paramod,[status(thm)],[c_40,c_7]) ).
cnf(c_80,plain,
divide(identity,divide(identity,A)) = divide(divide(divide(A,B),divide(divide(identity,C),B)),C),
inference(paramod,[status(thm)],[c_23,c_40]) ).
cnf(c_81,plain,
divide(A,identity) = divide(divide(divide(A,B),divide(divide(identity,C),B)),C),
inference(paramod,[status(thm)],[c_40,c_80]) ).
cnf(c_82,plain,
A = divide(divide(divide(A,B),divide(divide(identity,C),B)),C),
inference(paramod,[status(thm)],[c_14,c_81]) ).
cnf(c_49,plain,
divide(divide(divide(A,B),divide(divide(identity,C),B)),C) = A,
inference(copy,[status(thm)],[c_82]) ).
cnf(c_83,plain,
divide(A,B) = divide(identity,divide(divide(B,C),divide(divide(identity,divide(identity,A)),C))),
inference(paramod,[status(thm)],[c_49,c_28]) ).
cnf(c_84,plain,
divide(A,B) = divide(identity,divide(divide(B,C),divide(divide(A,identity),C))),
inference(paramod,[status(thm)],[c_40,c_83]) ).
cnf(c_85,plain,
divide(A,B) = divide(identity,divide(divide(B,C),divide(A,C))),
inference(paramod,[status(thm)],[c_14,c_84]) ).
cnf(c_86,plain,
divide(A,B) = divide(divide(A,C),divide(B,C)),
inference(paramod,[status(thm)],[c_40,c_85]) ).
cnf(c_61,plain,
divide(divide(A,B),divide(C,B)) = divide(A,C),
inference(copy,[status(thm)],[c_86]) ).
cnf(c_87,plain,
divide(A,divide(B,C)) = divide(divide(A,divide(identity,C)),B),
inference(paramod,[status(thm)],[c_39,c_61]) ).
cnf(c_69,plain,
divide(divide(A,divide(identity,B)),C) = divide(A,divide(C,B)),
inference(copy,[status(thm)],[c_87]) ).
cnf(c_70,plain,
$false,
inference(resolve,[status(thm)],[c_69,c_41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP465-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n005.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Fri Sep 25 14:55:17 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.17/0.44 % Process 3761970 was started by sandbox on n005,
% 0.17/0.44 % Fri Sep 25 14:55:17 2026
% 0.17/0.44 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.17/0.44
% 0.17/0.44 % From the command line: assign(max_seconds, 300).
% 0.17/0.47
% 0.17/0.47 % Assigning unary symbol inverse kb_weight 0 and highest precedence (8).
% 0.17/0.47
% 0.17/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.47
% 0.17/0.47 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.17/0.47 % Length of proof is 26.
% 0.17/0.47 % Level of proof is 13.
% 0.17/0.47 % Maximum clause weight is 77.000.
% 0.17/0.47 % Given clauses 23.
% 0.17/0.47
% 0.17/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------