%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : GRP535-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 : n026.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.12s 0.39s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of formulae : 53 ( 53 unt; 0 def)
% Number of atoms : 53 ( 52 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 19 ( 19 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 7 ( 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 : 69 ( 0 sgn 9 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(single_axiom,axiom,
! [VAR_0,VAR_1,VAR_2] : divide(divide(VAR_0,divide(divide(VAR_0,VAR_1),VAR_2)),VAR_1) = VAR_2,
file('theBenchmark.p',single_axiom) ).
cnf(c_1,plain,
divide(divide(A,divide(divide(A,B),C)),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(identity,axiom,
! [VAR_0] : identity = divide(VAR_0,VAR_0),
file('theBenchmark.p',identity) ).
cnf(c_5,plain,
identity = divide(A,A),
inference(clausify,[status(thm)],[identity]) ).
cnf(c_6,plain,
divide(A,A) = identity,
inference(copy,[status(thm)],[c_5]) ).
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_7,plain,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
inference(clausify,[status(thm)],[prove_these_axioms_3]) ).
cnf(c_8,plain,
multiply(A,B) = divide(A,divide(identity,B)),
inference(paramod,[status(thm)],[c_6,c_2]) ).
cnf(c_9,plain,
divide(identity,A) = inverse(A),
inference(paramod,[status(thm)],[c_6,c_4]) ).
cnf(c_65,plain,
multiply(divide(a3,divide(identity,b3)),c3) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_8,c_7]) ).
cnf(c_66,plain,
multiply(divide(a3,inverse(b3)),c3) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_9,c_65]) ).
cnf(c_67,plain,
divide(divide(a3,inverse(b3)),divide(identity,c3)) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_8,c_66]) ).
cnf(c_68,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != multiply(a3,multiply(b3,c3)),
inference(paramod,[status(thm)],[c_9,c_67]) ).
cnf(c_69,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != multiply(a3,divide(b3,divide(identity,c3))),
inference(paramod,[status(thm)],[c_8,c_68]) ).
cnf(c_70,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != multiply(a3,divide(b3,inverse(c3))),
inference(paramod,[status(thm)],[c_9,c_69]) ).
cnf(c_71,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,divide(identity,divide(b3,inverse(c3)))),
inference(paramod,[status(thm)],[c_8,c_70]) ).
cnf(c_10,plain,
divide(divide(a3,inverse(b3)),inverse(c3)) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(paramod,[status(thm)],[c_9,c_71]) ).
cnf(c_12,plain,
divide(divide(divide(A,divide(divide(A,B),C)),divide(C,D)),B) = D,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_13,plain,
divide(divide(A,B),divide(divide(A,C),B)) = C,
inference(paramod,[status(thm)],[c_1,c_1]) ).
cnf(c_72,plain,
divide(divide(A,divide(identity,B)),A) = B,
inference(paramod,[status(thm)],[c_6,c_1]) ).
cnf(c_14,plain,
divide(divide(A,inverse(B)),A) = B,
inference(paramod,[status(thm)],[c_9,c_72]) ).
cnf(c_73,plain,
divide(divide(identity,divide(inverse(A),B)),A) = B,
inference(paramod,[status(thm)],[c_9,c_1]) ).
cnf(c_16,plain,
divide(inverse(divide(inverse(A),B)),A) = B,
inference(paramod,[status(thm)],[c_9,c_73]) ).
cnf(c_22,plain,
divide(A,divide(A,B)) = B,
inference(paramod,[status(thm)],[c_1,c_12]) ).
cnf(c_74,plain,
divide(identity,A) = divide(divide(B,A),B),
inference(paramod,[status(thm)],[c_6,c_12]) ).
cnf(c_75,plain,
inverse(A) = divide(divide(B,A),B),
inference(paramod,[status(thm)],[c_9,c_74]) ).
cnf(c_24,plain,
divide(divide(A,B),A) = inverse(B),
inference(copy,[status(thm)],[c_75]) ).
cnf(c_30,plain,
inverse(inverse(A)) = A,
inference(paramod,[status(thm)],[c_24,c_14]) ).
cnf(c_32,plain,
divide(divide(A,B),C) = divide(divide(A,C),B),
inference(paramod,[status(thm)],[c_22,c_1]) ).
cnf(c_76,plain,
divide(divide(A,B),divide(identity,B)) = A,
inference(paramod,[status(thm)],[c_6,c_13]) ).
cnf(c_39,plain,
divide(divide(A,B),inverse(B)) = A,
inference(paramod,[status(thm)],[c_9,c_76]) ).
cnf(c_77,plain,
divide(A,B) = inverse(divide(B,A)),
inference(paramod,[status(thm)],[c_22,c_24]) ).
cnf(c_44,plain,
inverse(divide(A,B)) = divide(B,A),
inference(copy,[status(thm)],[c_77]) ).
cnf(c_46,plain,
divide(A,inverse(divide(B,A))) = B,
inference(paramod,[status(thm)],[c_22,c_39]) ).
cnf(c_50,plain,
inverse(divide(inverse(c3),divide(a3,inverse(b3)))) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(paramod,[status(thm)],[c_44,c_10]) ).
cnf(c_56,plain,
divide(inverse(A),B) = divide(inverse(B),A),
inference(paramod,[status(thm)],[c_22,c_16]) ).
cnf(c_60,plain,
divide(inverse(A),B) = inverse(divide(A,inverse(B))),
inference(paramod,[status(thm)],[c_46,c_16]) ).
cnf(c_78,plain,
inverse(inverse(divide(c3,inverse(divide(a3,inverse(b3)))))) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(paramod,[status(thm)],[c_60,c_50]) ).
cnf(c_61,plain,
divide(c3,inverse(divide(a3,inverse(b3)))) != divide(a3,inverse(divide(b3,inverse(c3)))),
inference(paramod,[status(thm)],[c_30,c_78]) ).
cnf(c_79,plain,
inverse(divide(A,inverse(B))) = divide(inverse(B),A),
inference(paramod,[status(thm)],[c_60,c_56]) ).
cnf(c_63,plain,
inverse(divide(A,inverse(B))) = inverse(divide(B,inverse(A))),
inference(paramod,[status(thm)],[c_60,c_79]) ).
cnf(c_80,plain,
divide(c3,inverse(divide(a3,inverse(b3)))) != inverse(divide(inverse(divide(b3,inverse(c3))),a3)),
inference(paramod,[status(thm)],[c_44,c_61]) ).
cnf(c_81,plain,
divide(c3,inverse(divide(a3,inverse(b3)))) != inverse(inverse(divide(divide(b3,inverse(c3)),inverse(a3)))),
inference(paramod,[status(thm)],[c_60,c_80]) ).
cnf(c_82,plain,
divide(c3,inverse(divide(a3,inverse(b3)))) != inverse(inverse(divide(divide(b3,inverse(a3)),inverse(c3)))),
inference(paramod,[status(thm)],[c_32,c_81]) ).
cnf(c_83,plain,
divide(c3,inverse(divide(a3,inverse(b3)))) != inverse(inverse(divide(c3,inverse(divide(b3,inverse(a3)))))),
inference(paramod,[status(thm)],[c_63,c_82]) ).
cnf(c_84,plain,
divide(c3,inverse(divide(a3,inverse(b3)))) != inverse(inverse(divide(c3,inverse(divide(a3,inverse(b3)))))),
inference(paramod,[status(thm)],[c_63,c_83]) ).
cnf(c_85,plain,
divide(c3,inverse(divide(a3,inverse(b3)))) != divide(c3,inverse(divide(a3,inverse(b3)))),
inference(paramod,[status(thm)],[c_30,c_84]) ).
cnf(c_64,plain,
$false,
inference(copy,[status(thm)],[c_85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP535-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n026.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Fri Sep 25 15:01:26 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.12/0.36 % Process 2828870 was started by sandbox2 on n026,
% 0.12/0.36 % Fri Sep 25 15:01:26 2026
% 0.12/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.12/0.37
% 0.12/0.37 % From the command line: assign(max_seconds, 300).
% 0.12/0.39
% 0.12/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.39
% 0.12/0.39 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.12/0.39 % Length of proof is 27.
% 0.12/0.39 % Level of proof is 7.
% 0.12/0.39 % Maximum clause weight is 16.000.
% 0.12/0.39 % Given clauses 17.
% 0.12/0.39
% 0.12/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------