%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : FLD069-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 : n019.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:43 AM UTC 2026
% Result : Unsatisfiable 0.17s 5.43s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 23 ( 14 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 22 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 20 ( 0 sgn 8 !; 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(antisymmetry_of_order_relation,axiom,
! [VAR_0,VAR_1] :
( ~ less_or_equal(VAR_1,VAR_0)
| ~ less_or_equal(VAR_0,VAR_1)
| sum(additive_identity,VAR_0,VAR_1) ),
file('theBenchmark.p',antisymmetry_of_order_relation) ).
cnf(c_21,plain,
( ~ less_or_equal(B,A)
| ~ less_or_equal(A,B)
| sum(additive_identity,A,B) ),
inference(clausify,[status(thm)],[antisymmetry_of_order_relation]) ).
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(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(less_or_equal_3,axiom,
less_or_equal(additive_identity,a),
file('theBenchmark.p',less_or_equal_3) ).
cnf(c_29,plain,
less_or_equal(additive_identity,a),
inference(clausify,[status(thm)],[less_or_equal_3]) ).
fof(less_or_equal_4,axiom,
less_or_equal(additive_identity,b),
file('theBenchmark.p',less_or_equal_4) ).
cnf(c_30,plain,
less_or_equal(additive_identity,b),
inference(clausify,[status(thm)],[less_or_equal_4]) ).
fof(not_sum_5,axiom,
~ sum(additive_identity,b,additive_identity),
file('theBenchmark.p',not_sum_5) ).
cnf(c_31,plain,
~ sum(additive_identity,b,additive_identity),
inference(clausify,[status(thm)],[not_sum_5]) ).
fof(sum_6,axiom,
sum(a,b,additive_identity),
file('theBenchmark.p',sum_6) ).
cnf(c_32,plain,
sum(a,b,additive_identity),
inference(clausify,[status(thm)],[sum_6]) ).
cnf(c_117,plain,
sum(additive_identity,b,b),
inference(resolve,[status(thm)],[c_28,c_3]) ).
cnf(c_159,plain,
( ~ less_or_equal(b,additive_identity)
| sum(additive_identity,b,additive_identity) ),
inference(resolve,[status(thm)],[c_30,c_21]) ).
cnf(c_125,plain,
~ less_or_equal(b,additive_identity),
inference(resolve,[status(thm)],[c_31,c_159]) ).
cnf(c_160,plain,
( ~ sum(B,C,additive_identity)
| ~ sum(A,C,b)
| ~ less_or_equal(A,B) ),
inference(resolve,[status(thm)],[c_24,c_125]) ).
cnf(c_161,plain,
( ~ sum(a,A,additive_identity)
| ~ sum(additive_identity,A,b) ),
inference(resolve,[status(thm)],[c_160,c_29]) ).
cnf(c_162,plain,
~ sum(additive_identity,b,b),
inference(resolve,[status(thm)],[c_161,c_32]) ).
cnf(c_158,plain,
$false,
inference(resolve,[status(thm)],[c_117,c_162]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD069-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/5.39 % Computer : n019.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Sun Sep 27 02:34:54 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.40 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.11/5.40 % Process 2726771 was started by sandbox2 on n019,
% 0.11/5.40 % Sun Sep 27 02:34:54 2026
% 0.11/5.40 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.17/5.40
% 0.17/5.40 % From the command line: assign(max_seconds, 300).
% 0.17/5.43
% 0.17/5.43 % SZS status Unsatisfiable for theBenchmark
% 0.17/5.43
% 0.17/5.43 % Proof 1 at 0.01 (+ 0.01) seconds.
% 0.17/5.43 % Length of proof is 11.
% 0.17/5.43 % Level of proof is 2.
% 0.17/5.43 % Maximum clause weight is 14.000.
% 0.17/5.43 % Given clauses 57.
% 0.17/5.43
% 0.17/5.43 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------