%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : BOO010-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/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 06:55:03 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.39s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 12
% Syntax : Number of formulae : 70 ( 70 unt; 0 def)
% Number of atoms : 70 ( 69 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 111 ( 15 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(commutativity_of_add,axiom,
! [VAR_0,VAR_1] : add(VAR_0,VAR_1) = add(VAR_1,VAR_0),
file('theBenchmark.p',commutativity_of_add) ).
cnf(c_1,plain,
add(A,B) = add(B,A),
inference(clausify,[status(thm)],[commutativity_of_add]) ).
fof(commutativity_of_multiply,axiom,
! [VAR_0,VAR_1] : multiply(VAR_0,VAR_1) = multiply(VAR_1,VAR_0),
file('theBenchmark.p',commutativity_of_multiply) ).
cnf(c_2,plain,
multiply(A,B) = multiply(B,A),
inference(clausify,[status(thm)],[commutativity_of_multiply]) ).
fof(distributivity1,axiom,
! [VAR_0,VAR_1,VAR_2] : add(multiply(VAR_0,VAR_1),VAR_2) = multiply(add(VAR_0,VAR_2),add(VAR_1,VAR_2)),
file('theBenchmark.p',distributivity1) ).
cnf(c_3,plain,
add(multiply(A,B),C) = multiply(add(A,C),add(B,C)),
inference(clausify,[status(thm)],[distributivity1]) ).
cnf(c_4,plain,
multiply(add(A,B),add(C,B)) = add(multiply(A,C),B),
inference(copy,[status(thm)],[c_3]) ).
fof(distributivity3,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(add(VAR_0,VAR_1),VAR_2) = add(multiply(VAR_0,VAR_2),multiply(VAR_1,VAR_2)),
file('theBenchmark.p',distributivity3) ).
cnf(c_7,plain,
multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)),
inference(clausify,[status(thm)],[distributivity3]) ).
fof(distributivity4,axiom,
! [VAR_0,VAR_1,VAR_2] : multiply(VAR_0,add(VAR_1,VAR_2)) = add(multiply(VAR_0,VAR_1),multiply(VAR_0,VAR_2)),
file('theBenchmark.p',distributivity4) ).
cnf(c_8,plain,
multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)),
inference(clausify,[status(thm)],[distributivity4]) ).
fof(additive_inverse1,axiom,
! [VAR_0] : add(VAR_0,inverse(VAR_0)) = multiplicative_identity,
file('theBenchmark.p',additive_inverse1) ).
cnf(c_9,plain,
add(A,inverse(A)) = multiplicative_identity,
inference(clausify,[status(thm)],[additive_inverse1]) ).
fof(multiplicative_inverse1,axiom,
! [VAR_0] : multiply(VAR_0,inverse(VAR_0)) = additive_identity,
file('theBenchmark.p',multiplicative_inverse1) ).
cnf(c_11,plain,
multiply(A,inverse(A)) = additive_identity,
inference(clausify,[status(thm)],[multiplicative_inverse1]) ).
fof(multiplicative_id1,axiom,
! [VAR_0] : multiply(VAR_0,multiplicative_identity) = VAR_0,
file('theBenchmark.p',multiplicative_id1) ).
cnf(c_13,plain,
multiply(A,multiplicative_identity) = A,
inference(clausify,[status(thm)],[multiplicative_id1]) ).
fof(multiplicative_id2,axiom,
! [VAR_0] : multiply(multiplicative_identity,VAR_0) = VAR_0,
file('theBenchmark.p',multiplicative_id2) ).
cnf(c_14,plain,
multiply(multiplicative_identity,A) = A,
inference(clausify,[status(thm)],[multiplicative_id2]) ).
fof(additive_id1,axiom,
! [VAR_0] : add(VAR_0,additive_identity) = VAR_0,
file('theBenchmark.p',additive_id1) ).
cnf(c_15,plain,
add(A,additive_identity) = A,
inference(clausify,[status(thm)],[additive_id1]) ).
fof(additive_id2,axiom,
! [VAR_0] : add(additive_identity,VAR_0) = VAR_0,
file('theBenchmark.p',additive_id2) ).
cnf(c_16,plain,
add(additive_identity,A) = A,
inference(clausify,[status(thm)],[additive_id2]) ).
fof(prove_a_plus_ab_is_a,axiom,
add(a,multiply(a,b)) != a,
file('theBenchmark.p',prove_a_plus_ab_is_a) ).
cnf(c_17,plain,
add(a,multiply(a,b)) != a,
inference(clausify,[status(thm)],[prove_a_plus_ab_is_a]) ).
cnf(c_94,plain,
add(multiply(add(A,B),C),multiply(add(A,B),B)) = add(multiply(A,C),B),
inference(paramod,[status(thm)],[c_8,c_4]) ).
cnf(c_95,plain,
add(add(multiply(A,C),multiply(B,C)),multiply(add(A,B),B)) = add(multiply(A,C),B),
inference(paramod,[status(thm)],[c_7,c_94]) ).
cnf(c_96,plain,
add(add(multiply(A,C),multiply(B,C)),multiply(B,add(A,B))) = add(multiply(A,C),B),
inference(paramod,[status(thm)],[c_2,c_95]) ).
cnf(c_19,plain,
add(add(multiply(A,B),multiply(C,B)),add(multiply(C,A),multiply(C,C))) = add(multiply(A,B),C),
inference(paramod,[status(thm)],[c_8,c_96]) ).
cnf(c_97,plain,
multiply(multiplicative_identity,A) = add(multiply(B,A),multiply(inverse(B),A)),
inference(paramod,[status(thm)],[c_9,c_7]) ).
cnf(c_98,plain,
A = add(multiply(B,A),multiply(inverse(B),A)),
inference(paramod,[status(thm)],[c_14,c_97]) ).
cnf(c_20,plain,
add(multiply(A,B),multiply(inverse(A),B)) = B,
inference(copy,[status(thm)],[c_98]) ).
cnf(c_99,plain,
multiply(A,multiplicative_identity) = add(multiply(A,B),multiply(A,inverse(B))),
inference(paramod,[status(thm)],[c_9,c_8]) ).
cnf(c_100,plain,
A = add(multiply(A,B),multiply(A,inverse(B))),
inference(paramod,[status(thm)],[c_13,c_99]) ).
cnf(c_21,plain,
add(multiply(A,B),multiply(A,inverse(B))) = A,
inference(copy,[status(thm)],[c_100]) ).
cnf(c_101,plain,
additive_identity = add(multiply(A,inverse(add(A,B))),multiply(B,inverse(add(A,B)))),
inference(paramod,[status(thm)],[c_11,c_7]) ).
cnf(c_22,plain,
add(multiply(A,inverse(add(A,B))),multiply(B,inverse(add(A,B)))) = additive_identity,
inference(copy,[status(thm)],[c_101]) ).
cnf(c_28,plain,
inverse(additive_identity) = multiplicative_identity,
inference(paramod,[status(thm)],[c_16,c_9]) ).
cnf(c_102,plain,
add(additive_identity,multiply(inverse(A),inverse(A))) = inverse(A),
inference(paramod,[status(thm)],[c_11,c_20]) ).
cnf(c_47,plain,
multiply(inverse(A),inverse(A)) = inverse(A),
inference(paramod,[status(thm)],[c_16,c_102]) ).
cnf(c_103,plain,
add(multiply(A,inverse(inverse(A))),additive_identity) = inverse(inverse(A)),
inference(paramod,[status(thm)],[c_11,c_20]) ).
cnf(c_104,plain,
add(additive_identity,multiply(A,inverse(inverse(A)))) = inverse(inverse(A)),
inference(paramod,[status(thm)],[c_1,c_103]) ).
cnf(c_48,plain,
multiply(A,inverse(inverse(A))) = inverse(inverse(A)),
inference(paramod,[status(thm)],[c_16,c_104]) ).
cnf(c_105,plain,
add(A,add(multiply(inverse(B),B),multiply(inverse(B),inverse(B)))) = add(multiply(B,A),inverse(B)),
inference(paramod,[status(thm)],[c_20,c_19]) ).
cnf(c_106,plain,
add(A,add(multiply(B,inverse(B)),multiply(inverse(B),inverse(B)))) = add(multiply(B,A),inverse(B)),
inference(paramod,[status(thm)],[c_2,c_105]) ).
cnf(c_107,plain,
add(A,add(additive_identity,multiply(inverse(B),inverse(B)))) = add(multiply(B,A),inverse(B)),
inference(paramod,[status(thm)],[c_11,c_106]) ).
cnf(c_108,plain,
add(A,add(additive_identity,inverse(B))) = add(multiply(B,A),inverse(B)),
inference(paramod,[status(thm)],[c_47,c_107]) ).
cnf(c_109,plain,
add(A,inverse(B)) = add(multiply(B,A),inverse(B)),
inference(paramod,[status(thm)],[c_16,c_108]) ).
cnf(c_50,plain,
add(multiply(A,B),inverse(A)) = add(B,inverse(A)),
inference(copy,[status(thm)],[c_109]) ).
cnf(c_110,plain,
add(additive_identity,multiply(A,inverse(inverse(A)))) = A,
inference(paramod,[status(thm)],[c_11,c_21]) ).
cnf(c_111,plain,
add(additive_identity,inverse(inverse(A))) = A,
inference(paramod,[status(thm)],[c_48,c_110]) ).
cnf(c_54,plain,
inverse(inverse(A)) = A,
inference(paramod,[status(thm)],[c_16,c_111]) ).
cnf(c_112,plain,
add(multiply(A,inverse(A)),multiply(additive_identity,inverse(add(A,additive_identity)))) = additive_identity,
inference(paramod,[status(thm)],[c_15,c_22]) ).
cnf(c_113,plain,
add(additive_identity,multiply(additive_identity,inverse(add(A,additive_identity)))) = additive_identity,
inference(paramod,[status(thm)],[c_11,c_112]) ).
cnf(c_114,plain,
add(additive_identity,multiply(additive_identity,inverse(A))) = additive_identity,
inference(paramod,[status(thm)],[c_15,c_113]) ).
cnf(c_73,plain,
multiply(additive_identity,inverse(A)) = additive_identity,
inference(paramod,[status(thm)],[c_16,c_114]) ).
cnf(c_115,plain,
add(additive_identity,multiply(additive_identity,inverse(inverse(A)))) = additive_identity,
inference(paramod,[status(thm)],[c_73,c_21]) ).
cnf(c_116,plain,
add(additive_identity,multiply(additive_identity,A)) = additive_identity,
inference(paramod,[status(thm)],[c_54,c_115]) ).
cnf(c_78,plain,
multiply(additive_identity,A) = additive_identity,
inference(paramod,[status(thm)],[c_16,c_116]) ).
cnf(c_117,plain,
add(multiply(additive_identity,A),multiplicative_identity) = add(A,inverse(additive_identity)),
inference(paramod,[status(thm)],[c_28,c_50]) ).
cnf(c_118,plain,
add(additive_identity,multiplicative_identity) = add(A,inverse(additive_identity)),
inference(paramod,[status(thm)],[c_78,c_117]) ).
cnf(c_119,plain,
multiplicative_identity = add(A,inverse(additive_identity)),
inference(paramod,[status(thm)],[c_16,c_118]) ).
cnf(c_120,plain,
multiplicative_identity = add(A,multiplicative_identity),
inference(paramod,[status(thm)],[c_28,c_119]) ).
cnf(c_88,plain,
add(A,multiplicative_identity) = multiplicative_identity,
inference(copy,[status(thm)],[c_120]) ).
cnf(c_121,plain,
multiply(A,multiplicative_identity) = add(multiply(A,B),multiply(A,multiplicative_identity)),
inference(paramod,[status(thm)],[c_88,c_8]) ).
cnf(c_122,plain,
A = add(multiply(A,B),multiply(A,multiplicative_identity)),
inference(paramod,[status(thm)],[c_13,c_121]) ).
cnf(c_123,plain,
A = add(multiply(A,B),A),
inference(paramod,[status(thm)],[c_13,c_122]) ).
cnf(c_124,plain,
A = add(A,multiply(A,B)),
inference(paramod,[status(thm)],[c_1,c_123]) ).
cnf(c_92,plain,
add(A,multiply(A,B)) = A,
inference(copy,[status(thm)],[c_124]) ).
cnf(c_93,plain,
$false,
inference(resolve,[status(thm)],[c_92,c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO010-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n026.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.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Sat Sep 26 22:38:12 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.36 % Process 2108255 was started by sandbox on n026,
% 0.10/0.36 % Sat Sep 26 22:38:12 2026
% 0.10/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.36
% 0.10/0.36 % From the command line: assign(max_seconds, 300).
% 0.10/0.39
% 0.10/0.39 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.39
% 0.10/0.39 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.10/0.39 % Length of proof is 27.
% 0.10/0.39 % Level of proof is 7.
% 0.10/0.39 % Maximum clause weight is 33.000.
% 0.10/0.39 % Given clauses 27.
% 0.10/0.39
% 0.10/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------