%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP532-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/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:30:18 AM UTC 2026
% Result : Unsatisfiable 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 28 unt; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 1 avg)
% Maximal term depth : 5 ( 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 : 57 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : divide(divide(VAR_0,divide(VAR_1,VAR_2)),divide(VAR_0,VAR_1)) = VAR_2,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
divide(divide(A,divide(B,C)),divide(A,B)) = C,
inference(clausify,[status(thm)],[single_axiom]) ).
fof(multiply,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(VAR_0,VAR_1) = divide(VAR_0,divide(divide(VAR_2,VAR_2),VAR_1)),
file('theBenchmark.p',multiply) ).
cnf(c_2,plain,
multiply(A,B) = divide(A,divide(divide(C,C),B)),
inference(clausify,[status(thm)],[multiply]) ).
fof(inverse,axiom,
! [VAR_0,VAR_1] : inverse(VAR_0) = divide(divide(VAR_1,VAR_1),VAR_0),
file('theBenchmark.p',inverse) ).
cnf(c_3,plain,
inverse(A) = divide(divide(B,B),A),
inference(clausify,[status(thm)],[inverse]) ).
cnf(c_4,plain,
divide(divide(A,A),B) = inverse(B),
inference(copy,[status(thm)],[c_3]) ).
fof(prove_these_axioms_4,axiom,
multiply(a,b) != multiply(b,a),
file('theBenchmark.p',prove_these_axioms_4) ).
cnf(c_5,plain,
multiply(a,b) != multiply(b,a),
inference(clausify,[status(thm)],[prove_these_axioms_4]) ).
cnf(c_6,plain,
multiply(b,a) != multiply(a,b),
inference(copy,[status(thm)],[c_5]) ).
cnf(c_7,plain,
multiply(A,B) = divide(A,inverse(B)),
inference(paramod,[status(thm)],[c_4,c_2]) ).
cnf(c_67,plain,
divide(b,inverse(a)) != multiply(a,b),
inference(paramod,[status(thm)],[c_7,c_6]) ).
cnf(c_8,plain,
divide(b,inverse(a)) != divide(a,inverse(b)),
inference(paramod,[status(thm)],[c_7,c_67]) ).
cnf(c_9,plain,
divide(divide(A,B),divide(A,divide(C,divide(D,B)))) = divide(C,D),
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_10,plain,
divide(A,divide(divide(B,divide(C,A)),B)) = C,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_11,plain,
divide(divide(divide(A,divide(B,C)),divide(divide(A,B),D)),C) = D,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_14,plain,
inverse(divide(divide(A,B),A)) = B,
inference(paramod,[status(thm)],[c_4,c_1]) ).
cnf(c_17,plain,
divide(divide(A,B),divide(divide(C,D),C)) = divide(A,divide(B,D)),
inference(paramod,[status(thm)],[c_9,c_1]) ).
cnf(c_31,plain,
inverse(inverse(A)) = A,
inference(paramod,[status(thm)],[c_4,c_14]) ).
cnf(c_68,plain,
inverse(A) = divide(divide(B,A),B),
inference(paramod,[status(thm)],[c_14,c_31]) ).
cnf(c_33,plain,
divide(divide(A,B),A) = inverse(B),
inference(copy,[status(thm)],[c_68]) ).
cnf(c_36,plain,
divide(divide(A,B),inverse(C)) = divide(A,divide(B,C)),
inference(paramod,[status(thm)],[c_33,c_17]) ).
cnf(c_37,plain,
divide(A,inverse(divide(B,A))) = B,
inference(paramod,[status(thm)],[c_33,c_10]) ).
cnf(c_69,plain,
divide(divide(divide(A,divide(B,C)),inverse(B)),C) = A,
inference(paramod,[status(thm)],[c_33,c_11]) ).
cnf(c_70,plain,
divide(divide(A,divide(divide(B,C),B)),C) = A,
inference(paramod,[status(thm)],[c_36,c_69]) ).
cnf(c_52,plain,
divide(divide(A,inverse(B)),B) = A,
inference(paramod,[status(thm)],[c_33,c_70]) ).
cnf(c_65,plain,
divide(A,inverse(B)) = divide(B,inverse(A)),
inference(paramod,[status(thm)],[c_52,c_37]) ).
cnf(c_66,plain,
$false,
inference(resolve,[status(thm)],[c_65,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP532-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n005.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 14:58:47 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.13/0.36 % Process 3769501 was started by sandbox2 on n005,
% 0.13/0.36 % Fri Sep 25 14:58:47 2026
% 0.13/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.13/0.36
% 0.13/0.36 % From the command line: assign(max_seconds, 300).
% 0.13/0.38
% 0.13/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.13/0.38
% 0.13/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.13/0.38 % Length of proof is 20.
% 0.13/0.38 % Level of proof is 8.
% 0.13/0.38 % Maximum clause weight is 15.000.
% 0.13/0.38 % Given clauses 13.
% 0.13/0.38
% 0.13/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------