%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP560-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n012.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:22 AM UTC 2026
% Result : Unsatisfiable 0.02s 0.31s
% Output : CNFRefutation 0.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 17 unt; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 8 ( 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 : 30 ( 0 sgn 5 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : divide(VAR_0,inverse(divide(divide(VAR_1,VAR_2),divide(VAR_0,VAR_2)))) = VAR_1,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B,
inference(clausify,[status(thm)],[single_axiom]) ).
fof(multiply,axiom,
! [VAR_0,VAR_1] : multiply(VAR_0,VAR_1) = divide(VAR_0,inverse(VAR_1)),
file('theBenchmark.p',multiply) ).
cnf(c_2,plain,
multiply(A,B) = divide(A,inverse(B)),
inference(clausify,[status(thm)],[multiply]) ).
fof(prove_these_axioms_4,axiom,
multiply(a,b) != multiply(b,a),
file('theBenchmark.p',prove_these_axioms_4) ).
cnf(c_3,plain,
multiply(a,b) != multiply(b,a),
inference(clausify,[status(thm)],[prove_these_axioms_4]) ).
cnf(c_59,plain,
divide(a,inverse(b)) != multiply(b,a),
inference(paramod,[status(thm)],[c_2,c_3]) ).
cnf(c_4,plain,
divide(a,inverse(b)) != divide(b,inverse(a)),
inference(paramod,[status(thm)],[c_2,c_59]) ).
cnf(c_5,plain,
divide(A,inverse(divide(B,divide(A,inverse(divide(divide(B,C),divide(D,C))))))) = D,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_10,plain,
divide(A,inverse(divide(B,B))) = A,
inference(paramod,[status(thm)],[c_1,c_5]) ).
cnf(c_60,plain,
divide(A,inverse(divide(B,divide(A,inverse(divide(C,C)))))) = B,
inference(paramod,[status(thm)],[c_10,c_1]) ).
cnf(c_13,plain,
divide(A,inverse(divide(B,A))) = B,
inference(paramod,[status(thm)],[c_10,c_60]) ).
cnf(c_22,plain,
divide(inverse(divide(A,A)),inverse(B)) = B,
inference(paramod,[status(thm)],[c_10,c_13]) ).
cnf(c_61,plain,
divide(inverse(divide(A,A)),inverse(divide(divide(B,inverse(C)),C))) = B,
inference(paramod,[status(thm)],[c_22,c_1]) ).
cnf(c_28,plain,
divide(divide(A,inverse(B)),B) = A,
inference(paramod,[status(thm)],[c_22,c_61]) ).
cnf(c_57,plain,
divide(A,inverse(B)) = divide(B,inverse(A)),
inference(paramod,[status(thm)],[c_28,c_13]) ).
cnf(c_58,plain,
$false,
inference(resolve,[status(thm)],[c_57,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : GRP560-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.02 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.29 % Computer : n012.cluster.edu
% 0.02/0.29 % Model : x86_64 x86_64
% 0.02/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.29 % Memory : 8046.5625MB
% 0.02/0.29 % OS : Linux 6.8.0-71-generic
% 0.02/0.29 % CPULimit : 300
% 0.02/0.29 % WCLimit : 300
% 0.02/0.29 % DateTime : Fri Sep 25 14:59:50 UTC 2026
% 0.02/0.30 % CPUTime :
% 0.02/0.30 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.02/0.30 % Process 2380382 was started by sandbox on n012,
% 0.02/0.30 % Fri Sep 25 14:59:50 2026
% 0.02/0.30 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.02/0.30
% 0.02/0.30 % From the command line: assign(max_seconds, 300).
% 0.02/0.31
% 0.02/0.31 % SZS status Unsatisfiable for theBenchmark
% 0.02/0.31
% 0.02/0.31 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.02/0.31 % Length of proof is 11.
% 0.02/0.31 % Level of proof is 7.
% 0.02/0.31 % Maximum clause weight is 17.000.
% 0.02/0.31 % Given clauses 10.
% 0.02/0.31
% 0.02/0.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------