%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : BOO006-4 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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:02 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.38s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 23 unt; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 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 : 29 ( 3 sgn 9 !; 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(distributivity2,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',distributivity2) ).
cnf(c_5,plain,
multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)),
inference(clausify,[status(thm)],[distributivity2]) ).
fof(additive_id1,axiom,
! [VAR_0] : add(VAR_0,additive_identity) = VAR_0,
file('theBenchmark.p',additive_id1) ).
cnf(c_6,plain,
add(A,additive_identity) = A,
inference(clausify,[status(thm)],[additive_id1]) ).
fof(multiplicative_inverse1,axiom,
! [VAR_0] : multiply(VAR_0,inverse(VAR_0)) = additive_identity,
file('theBenchmark.p',multiplicative_inverse1) ).
cnf(c_9,plain,
multiply(A,inverse(A)) = additive_identity,
inference(clausify,[status(thm)],[multiplicative_inverse1]) ).
fof(prove_right_identity,axiom,
multiply(a,additive_identity) != additive_identity,
file('theBenchmark.p',prove_right_identity) ).
cnf(c_10,plain,
multiply(a,additive_identity) != additive_identity,
inference(clausify,[status(thm)],[prove_right_identity]) ).
cnf(c_11,plain,
multiply(additive_identity,a) != additive_identity,
inference(paramod,[status(thm)],[c_2,c_10]) ).
cnf(c_68,plain,
A = add(additive_identity,A),
inference(paramod,[status(thm)],[c_6,c_1]) ).
cnf(c_14,plain,
add(additive_identity,A) = A,
inference(copy,[status(thm)],[c_68]) ).
cnf(c_69,plain,
multiply(A,B) = add(multiply(A,B),multiply(A,additive_identity)),
inference(paramod,[status(thm)],[c_6,c_5]) ).
cnf(c_15,plain,
add(multiply(A,B),multiply(A,additive_identity)) = multiply(A,B),
inference(copy,[status(thm)],[c_69]) ).
cnf(c_70,plain,
add(additive_identity,multiply(A,additive_identity)) = multiply(A,inverse(A)),
inference(paramod,[status(thm)],[c_9,c_15]) ).
cnf(c_71,plain,
multiply(A,additive_identity) = multiply(A,inverse(A)),
inference(paramod,[status(thm)],[c_14,c_70]) ).
cnf(c_62,plain,
multiply(A,additive_identity) = additive_identity,
inference(paramod,[status(thm)],[c_9,c_71]) ).
cnf(c_72,plain,
additive_identity = multiply(additive_identity,A),
inference(paramod,[status(thm)],[c_62,c_2]) ).
cnf(c_66,plain,
multiply(additive_identity,A) = additive_identity,
inference(copy,[status(thm)],[c_72]) ).
cnf(c_67,plain,
$false,
inference(resolve,[status(thm)],[c_66,c_11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : BOO006-4 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 26 22:33:59 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.36 % Process 1712008 was started by sandbox2 on n011,
% 0.09/0.36 % Sat Sep 26 22:33:59 2026
% 0.09/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.09/0.37
% 0.09/0.37 % From the command line: assign(max_seconds, 300).
% 0.09/0.38
% 0.09/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.38
% 0.09/0.38 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.09/0.38 % Length of proof is 12.
% 0.09/0.38 % Level of proof is 4.
% 0.09/0.38 % Maximum clause weight is 13.000.
% 0.09/0.38 % Given clauses 16.
% 0.09/0.38
% 0.09/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------