%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : FLD064-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 : n026.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:41 AM UTC 2026
% Result : Unsatisfiable 0.89s 0.61s
% Output : CNFRefutation 0.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 24 ( 12 unt; 0 def)
% Number of atoms : 41 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 39 ( 22 ~; 17 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 26 ( 0 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(well_definedness_of_additive_inverse,axiom,
! [VAR_0] :
( ~ defined(VAR_0)
| defined(additive_inverse(VAR_0)) ),
file('theBenchmark.p',well_definedness_of_additive_inverse) ).
cnf(c_15,plain,
( ~ defined(A)
| defined(additive_inverse(A)) ),
inference(clausify,[status(thm)],[well_definedness_of_additive_inverse]) ).
fof(compatibility_of_order_relation_and_addition,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( ~ sum(VAR_3,VAR_4,VAR_1)
| ~ sum(VAR_2,VAR_4,VAR_0)
| ~ less_or_equal(VAR_2,VAR_3)
| less_or_equal(VAR_0,VAR_1) ),
file('theBenchmark.p',compatibility_of_order_relation_and_addition) ).
cnf(c_24,plain,
( ~ sum(D,E,B)
| ~ sum(C,E,A)
| ~ less_or_equal(C,D)
| less_or_equal(A,B) ),
inference(clausify,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
fof(a_is_defined,axiom,
defined(a),
file('theBenchmark.p',a_is_defined) ).
cnf(c_27,plain,
defined(a),
inference(clausify,[status(thm)],[a_is_defined]) ).
fof(less_or_equal_2,axiom,
less_or_equal(additive_identity,a),
file('theBenchmark.p',less_or_equal_2) ).
cnf(c_28,plain,
less_or_equal(additive_identity,a),
inference(clausify,[status(thm)],[less_or_equal_2]) ).
fof(not_less_or_equal_3,axiom,
~ less_or_equal(additive_inverse(a),additive_identity),
file('theBenchmark.p',not_less_or_equal_3) ).
cnf(c_29,plain,
~ less_or_equal(additive_inverse(a),additive_identity),
inference(clausify,[status(thm)],[not_less_or_equal_3]) ).
cnf(c_92,plain,
defined(additive_inverse(a)),
inference(resolve,[status(thm)],[c_27,c_15]) ).
cnf(c_97,plain,
sum(additive_inverse(a),a,additive_identity),
inference(resolve,[status(thm)],[c_27,c_4]) ).
cnf(c_455,plain,
sum(additive_identity,additive_inverse(a),additive_inverse(a)),
inference(resolve,[status(thm)],[c_92,c_3]) ).
cnf(c_1168,plain,
sum(a,additive_inverse(a),additive_identity),
inference(resolve,[status(thm)],[c_97,c_5]) ).
cnf(c_1526,plain,
( ~ sum(B,C,additive_identity)
| ~ sum(A,C,additive_inverse(a))
| ~ less_or_equal(A,B) ),
inference(resolve,[status(thm)],[c_24,c_29]) ).
cnf(c_1527,plain,
( ~ sum(a,A,additive_identity)
| ~ sum(additive_identity,A,additive_inverse(a)) ),
inference(resolve,[status(thm)],[c_1526,c_28]) ).
cnf(c_1528,plain,
~ sum(additive_identity,additive_inverse(a),additive_inverse(a)),
inference(resolve,[status(thm)],[c_1527,c_1168]) ).
cnf(c_1525,plain,
$false,
inference(resolve,[status(thm)],[c_455,c_1528]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : FLD064-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.44 % Computer : n026.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Sun Sep 27 02:36:11 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/0.44 % Process 2448656 was started by sandbox2 on n026,
% 0.18/0.44 % Sun Sep 27 02:36:11 2026
% 0.18/0.44 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.18/0.45
% 0.18/0.45 % From the command line: assign(max_seconds, 300).
% 0.89/0.61
% 0.89/0.61 % SZS status Unsatisfiable for theBenchmark
% 0.89/0.61
% 0.89/0.61 % Proof 1 at 0.11 (+ 0.04) seconds.
% 0.89/0.61 % Length of proof is 13.
% 0.89/0.61 % Level of proof is 3.
% 0.89/0.61 % Maximum clause weight is 16.000.
% 0.89/0.61 % Given clauses 178.
% 0.89/0.61
% 0.89/0.61 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------