%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : RNG017-6 : 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 : n018.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 08:26:21 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.38s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of formulae : 36 ( 36 unt; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 59 ( 1 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(left_additive_identity,axiom,
! [VAR_0] : add(additive_identity,VAR_0) = VAR_0,
file('theBenchmark.p',left_additive_identity) ).
cnf(c_1,plain,
add(additive_identity,A) = A,
inference(clausify,[status(thm)],[left_additive_identity]) ).
fof(left_multiplicative_zero,axiom,
! [VAR_0] : multiply(additive_identity,VAR_0) = additive_identity,
file('theBenchmark.p',left_multiplicative_zero) ).
cnf(c_3,plain,
multiply(additive_identity,A) = additive_identity,
inference(clausify,[status(thm)],[left_multiplicative_zero]) ).
fof(right_additive_inverse,axiom,
! [VAR_0] : add(VAR_0,additive_inverse(VAR_0)) = additive_identity,
file('theBenchmark.p',right_additive_inverse) ).
cnf(c_6,plain,
add(A,additive_inverse(A)) = additive_identity,
inference(clausify,[status(thm)],[right_additive_inverse]) ).
fof(additive_inverse_additive_inverse,axiom,
! [VAR_0] : additive_inverse(additive_inverse(VAR_0)) = VAR_0,
file('theBenchmark.p',additive_inverse_additive_inverse) ).
cnf(c_7,plain,
additive_inverse(additive_inverse(A)) = A,
inference(clausify,[status(thm)],[additive_inverse_additive_inverse]) ).
fof(distribute1,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',distribute1) ).
cnf(c_8,plain,
multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)),
inference(clausify,[status(thm)],[distribute1]) ).
fof(distribute2,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',distribute2) ).
cnf(c_9,plain,
multiply(add(A,B),C) = add(multiply(A,C),multiply(B,C)),
inference(clausify,[status(thm)],[distribute2]) ).
fof(commutativity_for_addition,axiom,
! [VAR_0,VAR_1] : add(VAR_0,VAR_1) = add(VAR_1,VAR_0),
file('theBenchmark.p',commutativity_for_addition) ).
cnf(c_10,plain,
add(A,B) = add(B,A),
inference(clausify,[status(thm)],[commutativity_for_addition]) ).
fof(associativity_for_addition,axiom,
! [VAR_0,VAR_1,VAR_2] : add(VAR_0,add(VAR_1,VAR_2)) = add(add(VAR_0,VAR_1),VAR_2),
file('theBenchmark.p',associativity_for_addition) ).
cnf(c_11,plain,
add(A,add(B,C)) = add(add(A,B),C),
inference(clausify,[status(thm)],[associativity_for_addition]) ).
cnf(c_12,plain,
add(add(A,B),C) = add(A,add(B,C)),
inference(copy,[status(thm)],[c_11]) ).
fof(prove_distributivity,axiom,
multiply(additive_inverse(x),add(y,z)) != add(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))),
file('theBenchmark.p',prove_distributivity) ).
cnf(c_18,plain,
multiply(additive_inverse(x),add(y,z)) != add(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))),
inference(clausify,[status(thm)],[prove_distributivity]) ).
cnf(c_19,plain,
add(multiply(additive_inverse(x),y),multiply(additive_inverse(x),z)) != add(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))),
inference(paramod,[status(thm)],[c_8,c_18]) ).
cnf(c_70,plain,
multiply(additive_identity,A) = add(multiply(B,A),multiply(additive_inverse(B),A)),
inference(paramod,[status(thm)],[c_6,c_9]) ).
cnf(c_71,plain,
additive_identity = add(multiply(B,A),multiply(additive_inverse(B),A)),
inference(paramod,[status(thm)],[c_3,c_70]) ).
cnf(c_22,plain,
add(multiply(A,B),multiply(additive_inverse(A),B)) = additive_identity,
inference(copy,[status(thm)],[c_71]) ).
cnf(c_72,plain,
add(additive_identity,A) = add(B,add(additive_inverse(B),A)),
inference(paramod,[status(thm)],[c_6,c_12]) ).
cnf(c_73,plain,
A = add(B,add(additive_inverse(B),A)),
inference(paramod,[status(thm)],[c_1,c_72]) ).
cnf(c_25,plain,
add(A,add(additive_inverse(A),B)) = B,
inference(copy,[status(thm)],[c_73]) ).
cnf(c_45,plain,
add(A,add(B,additive_inverse(A))) = B,
inference(paramod,[status(thm)],[c_10,c_25]) ).
cnf(c_47,plain,
add(additive_inverse(A),add(B,A)) = B,
inference(paramod,[status(thm)],[c_7,c_45]) ).
cnf(c_74,plain,
add(additive_inverse(multiply(additive_inverse(A),B)),additive_identity) = multiply(A,B),
inference(paramod,[status(thm)],[c_22,c_47]) ).
cnf(c_75,plain,
add(additive_identity,additive_inverse(multiply(additive_inverse(A),B))) = multiply(A,B),
inference(paramod,[status(thm)],[c_10,c_74]) ).
cnf(c_58,plain,
additive_inverse(multiply(additive_inverse(A),B)) = multiply(A,B),
inference(paramod,[status(thm)],[c_1,c_75]) ).
cnf(c_76,plain,
additive_inverse(multiply(A,B)) = multiply(additive_inverse(A),B),
inference(paramod,[status(thm)],[c_58,c_7]) ).
cnf(c_67,plain,
multiply(additive_inverse(A),B) = additive_inverse(multiply(A,B)),
inference(copy,[status(thm)],[c_76]) ).
cnf(c_77,plain,
add(additive_inverse(multiply(x,y)),multiply(additive_inverse(x),z)) != add(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))),
inference(paramod,[status(thm)],[c_67,c_19]) ).
cnf(c_78,plain,
add(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))) != add(additive_inverse(multiply(x,y)),additive_inverse(multiply(x,z))),
inference(paramod,[status(thm)],[c_67,c_77]) ).
cnf(c_69,plain,
$false,
inference(copy,[status(thm)],[c_78]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : RNG017-6 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n018.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 05:48:07 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 3859409 was started by sandbox on n018,
% 0.10/0.36 % Sat Sep 26 05:48:07 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.37
% 0.10/0.37 % From the command line: assign(max_seconds, 300).
% 0.10/0.38
% 0.10/0.38 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.38
% 0.10/0.38 % Proof 1 at 0.00 (+ 0.01) seconds.
% 0.10/0.38 % Length of proof is 18.
% 0.10/0.38 % Level of proof is 7.
% 0.10/0.38 % Maximum clause weight is 39.000.
% 0.10/0.38 % Given clauses 24.
% 0.10/0.38
% 0.10/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------