%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : FLD013-5 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n016.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:27 AM UTC 2026
% Result : Unsatisfiable 0.09s 0.40s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 29 ( 17 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 53 ( 31 ~; 22 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 40 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(associativity_addition_1,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4,VAR_5] :
( ~ sum(VAR_4,VAR_5,VAR_2)
| ~ sum(VAR_3,VAR_5,VAR_1)
| ~ sum(VAR_0,VAR_3,VAR_4)
| sum(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',associativity_addition_1) ).
cnf(c_1,plain,
( ~ sum(E,F,C)
| ~ sum(D,F,B)
| ~ sum(A,D,E)
| sum(A,B,C) ),
inference(clausify,[status(thm)],[associativity_addition_1]) ).
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(commutativity_addition,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ sum(VAR_1,VAR_0,VAR_2)
| sum(VAR_0,VAR_1,VAR_2) ),
file('theBenchmark.p',commutativity_addition) ).
cnf(c_5,plain,
( ~ sum(B,A,C)
| sum(A,B,C) ),
inference(clausify,[status(thm)],[commutativity_addition]) ).
fof(u_is_defined,axiom,
defined(u),
file('theBenchmark.p',u_is_defined) ).
cnf(c_31,plain,
defined(u),
inference(clausify,[status(thm)],[u_is_defined]) ).
fof(sum_7,axiom,
sum(additive_identity,a,b),
file('theBenchmark.p',sum_7) ).
cnf(c_33,plain,
sum(additive_identity,a,b),
inference(clausify,[status(thm)],[sum_7]) ).
fof(sum_8,axiom,
sum(additive_identity,c,d),
file('theBenchmark.p',sum_8) ).
cnf(c_34,plain,
sum(additive_identity,c,d),
inference(clausify,[status(thm)],[sum_8]) ).
fof(sum_9,axiom,
sum(a,c,u),
file('theBenchmark.p',sum_9) ).
cnf(c_35,plain,
sum(a,c,u),
inference(clausify,[status(thm)],[sum_9]) ).
fof(sum_10,axiom,
sum(d,b,v),
file('theBenchmark.p',sum_10) ).
cnf(c_36,plain,
sum(d,b,v),
inference(clausify,[status(thm)],[sum_10]) ).
fof(not_sum_11,axiom,
~ sum(additive_identity,u,v),
file('theBenchmark.p',not_sum_11) ).
cnf(c_37,plain,
~ sum(additive_identity,u,v),
inference(clausify,[status(thm)],[not_sum_11]) ).
cnf(c_170,plain,
sum(additive_identity,u,u),
inference(resolve,[status(thm)],[c_31,c_3]) ).
cnf(c_322,plain,
( ~ sum(B,C,v)
| ~ sum(A,C,u)
| ~ sum(additive_identity,A,B) ),
inference(resolve,[status(thm)],[c_1,c_37]) ).
cnf(c_323,plain,
( ~ sum(d,A,v)
| ~ sum(c,A,u) ),
inference(resolve,[status(thm)],[c_322,c_34]) ).
cnf(c_237,plain,
~ sum(c,b,u),
inference(resolve,[status(thm)],[c_323,c_36]) ).
cnf(c_319,plain,
~ sum(b,c,u),
inference(resolve,[status(thm)],[c_5,c_237]) ).
cnf(c_324,plain,
( ~ sum(A,C,u)
| ~ sum(B,c,C)
| ~ sum(A,B,b) ),
inference(resolve,[status(thm)],[c_2,c_319]) ).
cnf(c_325,plain,
( ~ sum(additive_identity,A,u)
| ~ sum(a,c,A) ),
inference(resolve,[status(thm)],[c_324,c_33]) ).
cnf(c_326,plain,
~ sum(additive_identity,u,u),
inference(resolve,[status(thm)],[c_325,c_35]) ).
cnf(c_321,plain,
$false,
inference(resolve,[status(thm)],[c_170,c_326]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD013-5 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.06/0.35 % Computer : n016.cluster.edu
% 0.06/0.35 % Model : x86_64 x86_64
% 0.06/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.35 % Memory : 8046.5625MB
% 0.06/0.35 % OS : Linux 6.8.0-71-generic
% 0.06/0.35 % CPULimit : 300
% 0.06/0.35 % WCLimit : 300
% 0.06/0.35 % DateTime : Sun Sep 27 02:27:31 UTC 2026
% 0.06/0.35 % CPUTime :
% 0.06/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.06/0.35 % Process 2214482 was started by sandbox on n016,
% 0.06/0.35 % Sun Sep 27 02:27:31 2026
% 0.06/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.06/0.36
% 0.06/0.36 % From the command line: assign(max_seconds, 300).
% 0.09/0.40
% 0.09/0.40 % SZS status Unsatisfiable for theBenchmark
% 0.09/0.40
% 0.09/0.40 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.09/0.40 % Length of proof is 14.
% 0.09/0.40 % Level of proof is 3.
% 0.09/0.40 % Maximum clause weight is 21.000.
% 0.09/0.40 % Given clauses 67.
% 0.09/0.40
% 0.09/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------