%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : FLD043-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n012.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:11:35 AM UTC 2026
% Result : Unsatisfiable 0.03s 0.34s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 26 ( 13 unt; 0 def)
% Number of atoms : 53 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 58 ( 31 ~; 27 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 45 ( 4 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(associativity_addition_2,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
( ~ sum(VAR_3,VAR_5,VAR_2)
| ~ sum(VAR_4,VAR_1,VAR_5)
| ~ sum(VAR_3,VAR_4,VAR_0)
| sum(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',associativity_addition_2) ).
cnf(c_2,plain,
( ~ sum(D,F,C)
| ~ sum(E,B,F)
| ~ sum(D,E,A)
| sum(A,B,C) ),
inference(clausify,[status(thm)],[associativity_addition_2]) ).
fof(existence_of_identity_addition,axiom,
! [VAR_0] :
( ~ defined(VAR_0)
| sum(additive_identity,VAR_0,VAR_0) ),
file('theBenchmark.p',existence_of_identity_addition) ).
cnf(c_3,plain,
( ~ defined(A)
| sum(additive_identity,A,A) ),
inference(clausify,[status(thm)],[existence_of_identity_addition]) ).
fof(existence_of_inverse_addition,axiom,
! [VAR_0] :
( ~ defined(VAR_0)
| sum(additive_inverse(VAR_0),VAR_0,additive_identity) ),
file('theBenchmark.p',existence_of_inverse_addition) ).
cnf(c_4,plain,
( ~ defined(A)
| sum(additive_inverse(A),A,additive_identity) ),
inference(clausify,[status(thm)],[existence_of_inverse_addition]) ).
fof(distributivity_1,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5,VAR_6] :
( ~ product(VAR_4,VAR_6,VAR_1)
| ~ product(VAR_3,VAR_6,VAR_0)
| ~ product(VAR_5,VAR_6,VAR_2)
| ~ sum(VAR_3,VAR_4,VAR_5)
| sum(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',distributivity_1) ).
cnf(c_11,plain,
( ~ product(E,V6,B)
| ~ product(D,V6,A)
| ~ product(F,V6,C)
| ~ sum(D,E,F)
| sum(A,B,C) ),
inference(clausify,[status(thm)],[distributivity_1]) ).
fof(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('theBenchmark.p',well_definedness_of_additive_identity) ).
cnf(c_14,plain,
defined(additive_identity),
inference(clausify,[status(thm)],[well_definedness_of_additive_identity]) ).
fof(b_is_defined,axiom,
defined(b),
file('theBenchmark.p',b_is_defined) ).
cnf(c_28,plain,
defined(b),
inference(clausify,[status(thm)],[b_is_defined]) ).
fof(product_3,axiom,
product(additive_identity,a,b),
file('theBenchmark.p',product_3) ).
cnf(c_29,plain,
product(additive_identity,a,b),
inference(clausify,[status(thm)],[product_3]) ).
fof(not_sum_4,axiom,
~ sum(additive_identity,b,additive_identity),
file('theBenchmark.p',not_sum_4) ).
cnf(c_30,plain,
~ sum(additive_identity,b,additive_identity),
inference(clausify,[status(thm)],[not_sum_4]) ).
cnf(c_33,plain,
( ~ sum(D,B,D)
| ~ sum(C,D,A)
| sum(A,B,A) ),
inference(factor,[status(thm)],[c_2]) ).
cnf(c_39,plain,
( ~ product(D,E,B)
| ~ product(C,E,A)
| ~ sum(C,D,C)
| sum(A,B,A) ),
inference(factor,[status(thm)],[c_11]) ).
cnf(c_52,plain,
( ~ product(B,C,A)
| ~ sum(B,B,B)
| sum(A,A,A) ),
inference(factor,[status(thm)],[c_39]) ).
cnf(c_59,plain,
sum(additive_identity,additive_identity,additive_identity),
inference(resolve,[status(thm)],[c_14,c_3]) ).
cnf(c_114,plain,
sum(additive_inverse(b),b,additive_identity),
inference(resolve,[status(thm)],[c_28,c_4]) ).
cnf(c_412,plain,
( ~ sum(additive_identity,additive_identity,additive_identity)
| sum(b,b,b) ),
inference(resolve,[status(thm)],[c_52,c_29]) ).
cnf(c_156,plain,
sum(b,b,b),
inference(resolve,[status(thm)],[c_59,c_412]) ).
cnf(c_413,plain,
( ~ sum(B,b,B)
| ~ sum(A,B,additive_identity) ),
inference(resolve,[status(thm)],[c_33,c_30]) ).
cnf(c_410,plain,
~ sum(A,b,additive_identity),
inference(resolve,[status(thm)],[c_413,c_156]) ).
cnf(c_411,plain,
$false,
inference(resolve,[status(thm)],[c_410,c_114]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : FLD043-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.02 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Sun Sep 27 02:26:19 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.03/0.30 % Process 1967202 was started by sandbox2 on n012,
% 0.03/0.30 % Sun Sep 27 02:26:19 2026
% 0.03/0.30 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.03/0.30
% 0.03/0.30 % From the command line: assign(max_seconds, 300).
% 0.03/0.34
% 0.03/0.34 % SZS status Unsatisfiable for theBenchmark
% 0.03/0.34
% 0.03/0.34 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.03/0.34 % Length of proof is 16.
% 0.03/0.34 % Level of proof is 5.
% 0.03/0.34 % Maximum clause weight is 25.000.
% 0.03/0.34 % Given clauses 84.
% 0.03/0.34
% 0.03/0.34 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------