%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : BOO009-1 : 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 : n010.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.79s 0.55s
% Output : CNFRefutation 0.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 31 ( 16 unt; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 88 ( 46 ~; 42 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 92 ( 1 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(closure_of_addition,axiom,
! [VAR_0,VAR_1] : sum(VAR_0,VAR_1,add(VAR_0,VAR_1)),
file('theBenchmark.p',closure_of_addition) ).
cnf(c_1,plain,
sum(A,B,add(A,B)),
inference(clausify,[status(thm)],[closure_of_addition]) ).
fof(closure_of_multiplication,axiom,
! [VAR_0,VAR_1] : product(VAR_0,VAR_1,multiply(VAR_0,VAR_1)),
file('theBenchmark.p',closure_of_multiplication) ).
cnf(c_2,plain,
product(A,B,multiply(A,B)),
inference(clausify,[status(thm)],[closure_of_multiplication]) ).
fof(additive_identity1,axiom,
! [VAR_0] : sum(additive_identity,VAR_0,VAR_0),
file('theBenchmark.p',additive_identity1) ).
cnf(c_5,plain,
sum(additive_identity,A,A),
inference(clausify,[status(thm)],[additive_identity1]) ).
fof(additive_identity2,axiom,
! [VAR_0] : sum(VAR_0,additive_identity,VAR_0),
file('theBenchmark.p',additive_identity2) ).
cnf(c_6,plain,
sum(A,additive_identity,A),
inference(clausify,[status(thm)],[additive_identity2]) ).
fof(distributivity3,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5,VAR_6] :
( sum(VAR_2,VAR_4,VAR_6)
| ~ product(VAR_5,VAR_1,VAR_6)
| ~ sum(VAR_0,VAR_3,VAR_5)
| ~ product(VAR_3,VAR_1,VAR_4)
| ~ product(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',distributivity3) ).
cnf(c_11,plain,
( sum(C,E,V6)
| ~ product(F,B,V6)
| ~ sum(A,D,F)
| ~ product(D,B,E)
| ~ product(A,B,C) ),
inference(clausify,[status(thm)],[distributivity3]) ).
fof(distributivity5,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5,VAR_6] :
( product(VAR_2,VAR_4,VAR_6)
| ~ sum(VAR_0,VAR_5,VAR_6)
| ~ product(VAR_1,VAR_3,VAR_5)
| ~ sum(VAR_0,VAR_3,VAR_4)
| ~ sum(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',distributivity5) ).
cnf(c_13,plain,
( product(C,E,V6)
| ~ sum(A,F,V6)
| ~ product(B,D,F)
| ~ sum(A,D,E)
| ~ sum(A,B,C) ),
inference(clausify,[status(thm)],[distributivity5]) ).
fof(distributivity7,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5,VAR_6] :
( product(VAR_2,VAR_4,VAR_6)
| ~ sum(VAR_5,VAR_1,VAR_6)
| ~ product(VAR_0,VAR_3,VAR_5)
| ~ sum(VAR_3,VAR_1,VAR_4)
| ~ sum(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',distributivity7) ).
cnf(c_15,plain,
( product(C,E,V6)
| ~ sum(F,B,V6)
| ~ product(A,D,F)
| ~ sum(D,B,E)
| ~ sum(A,B,C) ),
inference(clausify,[status(thm)],[distributivity7]) ).
fof(multiplicative_inverse1,axiom,
! [VAR_0] : product(inverse(VAR_0),VAR_0,additive_identity),
file('theBenchmark.p',multiplicative_inverse1) ).
cnf(c_19,plain,
product(inverse(A),A,additive_identity),
inference(clausify,[status(thm)],[multiplicative_inverse1]) ).
fof(prove_equations,axiom,
~ product(x,add(x,y),x),
file('theBenchmark.p',prove_equations) ).
cnf(c_23,plain,
~ product(x,add(x,y),x),
inference(clausify,[status(thm)],[prove_equations]) ).
cnf(c_989,plain,
( sum(multiply(D,B),C,F)
| ~ product(E,B,F)
| ~ sum(D,A,E)
| ~ product(A,B,C) ),
inference(resolve,[status(thm)],[c_11,c_2]) ).
cnf(c_990,plain,
( sum(multiply(A,B),additive_identity,D)
| ~ product(C,B,D)
| ~ sum(A,inverse(B),C) ),
inference(resolve,[status(thm)],[c_989,c_19]) ).
cnf(c_991,plain,
( sum(multiply(additive_identity,A),additive_identity,B)
| ~ product(inverse(A),A,B) ),
inference(resolve,[status(thm)],[c_990,c_5]) ).
cnf(c_582,plain,
sum(multiply(additive_identity,A),additive_identity,additive_identity),
inference(resolve,[status(thm)],[c_991,c_19]) ).
cnf(c_992,plain,
( product(A,C,E)
| ~ sum(A,D,E)
| ~ product(additive_identity,B,D)
| ~ sum(A,B,C) ),
inference(resolve,[status(thm)],[c_13,c_6]) ).
cnf(c_993,plain,
( product(C,add(C,A),D)
| ~ sum(C,B,D)
| ~ product(additive_identity,A,B) ),
inference(resolve,[status(thm)],[c_992,c_1]) ).
cnf(c_994,plain,
( product(B,add(B,A),B)
| ~ product(additive_identity,A,additive_identity) ),
inference(resolve,[status(thm)],[c_993,c_6]) ).
cnf(c_849,plain,
~ product(additive_identity,y,additive_identity),
inference(resolve,[status(thm)],[c_994,c_23]) ).
cnf(c_995,plain,
( product(C,B,E)
| ~ sum(D,additive_identity,E)
| ~ product(C,A,D)
| ~ sum(A,additive_identity,B) ),
inference(resolve,[status(thm)],[c_15,c_6]) ).
cnf(c_996,plain,
( product(A,B,D)
| ~ sum(C,additive_identity,D)
| ~ product(A,B,C) ),
inference(resolve,[status(thm)],[c_995,c_6]) ).
cnf(c_997,plain,
( product(A,B,C)
| ~ sum(multiply(A,B),additive_identity,C) ),
inference(resolve,[status(thm)],[c_996,c_2]) ).
cnf(c_987,plain,
~ sum(multiply(additive_identity,y),additive_identity,additive_identity),
inference(resolve,[status(thm)],[c_997,c_849]) ).
cnf(c_988,plain,
$false,
inference(resolve,[status(thm)],[c_987,c_582]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO009-1 : 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.37 % Computer : n010.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 26 22:35:00 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.37 % Process 188678 was started by sandbox on n010,
% 0.09/0.37 % Sat Sep 26 22:35:00 2026
% 0.09/0.37 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.38
% 0.09/0.38 % From the command line: assign(max_seconds, 300).
% 0.79/0.55
% 0.79/0.55 % SZS status Unsatisfiable for theBenchmark
% 0.79/0.55
% 0.79/0.55 % Proof 1 at 0.09 (+ 0.03) seconds.
% 0.79/0.55 % Length of proof is 13.
% 0.79/0.55 % Level of proof is 3.
% 0.79/0.55 % Maximum clause weight is 20.000.
% 0.79/0.55 % Given clauses 25.
% 0.79/0.55
% 0.79/0.55 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------