%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP613-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 : n014.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:30:29 AM UTC 2026
% Result : Unsatisfiable 0.11s 0.39s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 27 unt; 0 def)
% Number of atoms : 27 ( 26 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 11 ( 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 : 50 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : double_divide(inverse(double_divide(inverse(double_divide(VAR_0,inverse(VAR_1))),VAR_2)),double_divide(VAR_0,VAR_2)) = VAR_1,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
double_divide(inverse(double_divide(inverse(double_divide(A,inverse(B))),C)),double_divide(A,C)) = B,
inference(clausify,[status(thm)],[single_axiom]) ).
fof(multiply,axiom,
! [VAR_0,VAR_1] : multiply(VAR_0,VAR_1) = inverse(double_divide(VAR_1,VAR_0)),
file('theBenchmark.p',multiply) ).
cnf(c_2,plain,
multiply(A,B) = inverse(double_divide(B,A)),
inference(clausify,[status(thm)],[multiply]) ).
fof(prove_these_axioms_1,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('theBenchmark.p',prove_these_axioms_1) ).
cnf(c_3,plain,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(clausify,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_97,plain,
inverse(double_divide(a1,inverse(a1))) != multiply(inverse(b1),b1),
inference(paramod,[status(thm)],[c_2,c_3]) ).
cnf(c_98,plain,
inverse(double_divide(a1,inverse(a1))) != inverse(double_divide(b1,inverse(b1))),
inference(paramod,[status(thm)],[c_2,c_97]) ).
cnf(c_4,plain,
inverse(double_divide(b1,inverse(b1))) != inverse(double_divide(a1,inverse(a1))),
inference(copy,[status(thm)],[c_98]) ).
cnf(c_5,plain,
double_divide(inverse(A),double_divide(inverse(double_divide(B,inverse(A))),double_divide(B,inverse(C)))) = C,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_6,plain,
double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(A,inverse(B))),C)),inverse(D))),double_divide(A,C))),B) = D,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_8,plain,
double_divide(inverse(double_divide(inverse(double_divide(inverse(A),inverse(B))),double_divide(inverse(double_divide(C,inverse(A))),double_divide(C,inverse(D))))),D) = B,
inference(paramod,[status(thm)],[c_5,c_1]) ).
cnf(c_99,plain,
double_divide(inverse(double_divide(inverse(A),double_divide(inverse(B),double_divide(inverse(double_divide(C,inverse(B))),double_divide(C,inverse(inverse(D))))))),A) = D,
inference(paramod,[status(thm)],[c_8,c_6]) ).
cnf(c_13,plain,
double_divide(inverse(double_divide(inverse(A),inverse(B))),A) = B,
inference(paramod,[status(thm)],[c_5,c_99]) ).
cnf(c_15,plain,
double_divide(inverse(A),double_divide(inverse(B),B)) = A,
inference(paramod,[status(thm)],[c_13,c_1]) ).
cnf(c_36,plain,
double_divide(inverse(double_divide(inverse(A),A)),inverse(B)) = B,
inference(paramod,[status(thm)],[c_15,c_13]) ).
cnf(c_100,plain,
double_divide(inverse(A),double_divide(inverse(A),double_divide(inverse(double_divide(inverse(B),B)),inverse(C)))) = C,
inference(paramod,[status(thm)],[c_36,c_5]) ).
cnf(c_39,plain,
double_divide(inverse(A),double_divide(inverse(A),B)) = B,
inference(paramod,[status(thm)],[c_36,c_100]) ).
cnf(c_55,plain,
double_divide(inverse(A),A) = double_divide(inverse(B),B),
inference(paramod,[status(thm)],[c_15,c_39]) ).
cnf(c_56,plain,
double_divide(inverse(double_divide(inverse(A),A)),B) = inverse(B),
inference(paramod,[status(thm)],[c_36,c_39]) ).
cnf(c_68,plain,
inverse(inverse(A)) = A,
inference(paramod,[status(thm)],[c_56,c_36]) ).
cnf(c_101,plain,
double_divide(A,inverse(A)) = double_divide(inverse(B),B),
inference(paramod,[status(thm)],[c_68,c_55]) ).
cnf(c_93,plain,
double_divide(inverse(A),A) = double_divide(B,inverse(B)),
inference(copy,[status(thm)],[c_101]) ).
cnf(c_102,plain,
multiply(A,inverse(A)) = inverse(double_divide(B,inverse(B))),
inference(paramod,[status(thm)],[c_93,c_2]) ).
cnf(c_95,plain,
inverse(double_divide(inverse(A),A)) = inverse(double_divide(B,inverse(B))),
inference(paramod,[status(thm)],[c_2,c_102]) ).
cnf(c_103,plain,
inverse(double_divide(inverse(A),A)) != inverse(double_divide(a1,inverse(a1))),
inference(paramod,[status(thm)],[c_93,c_4]) ).
cnf(c_96,plain,
$false,
inference(resolve,[status(thm)],[c_95,c_103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP613-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n014.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Fri Sep 25 15:02:03 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 524990 was started by sandbox2 on n014,
% 0.08/0.35 % Fri Sep 25 15:02:03 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.36
% 0.08/0.36 % From the command line: assign(max_seconds, 300).
% 0.11/0.39
% 0.11/0.39 % Assigning unary symbol inverse kb_weight 0 and highest precedence (6).
% 0.11/0.39
% 0.11/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.11/0.39
% 0.11/0.39 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.11/0.39 % Length of proof is 17.
% 0.11/0.39 % Level of proof is 11.
% 0.11/0.39 % Maximum clause weight is 81.000.
% 0.11/0.39 % Given clauses 15.
% 0.11/0.39
% 0.11/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------