%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : FLD070-4 : 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 : n003.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.12s 0.37s
% Output : CNFRefutation 0.12s
% 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 : 39 ( 23 ~; 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 : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 23 ( 0 sgn 9 !; 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(transitivity_of_order_relation,axiom,
! [VAR_0,VAR_1,VAR_2] :
( ~ less_or_equal(VAR_2,VAR_1)
| ~ less_or_equal(VAR_0,VAR_2)
| less_or_equal(VAR_0,VAR_1) ),
file('theBenchmark.p',transitivity_of_order_relation) ).
cnf(c_22,plain,
( ~ less_or_equal(C,B)
| ~ less_or_equal(A,C)
| less_or_equal(A,B) ),
inference(clausify,[status(thm)],[transitivity_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_4,axiom,
less_or_equal(additive_identity,a),
file('theBenchmark.p',less_or_equal_4) ).
cnf(c_30,plain,
less_or_equal(additive_identity,a),
inference(clausify,[status(thm)],[less_or_equal_4]) ).
fof(less_or_equal_5,axiom,
less_or_equal(additive_identity,b),
file('theBenchmark.p',less_or_equal_5) ).
cnf(c_31,plain,
less_or_equal(additive_identity,b),
inference(clausify,[status(thm)],[less_or_equal_5]) ).
fof(sum_6,axiom,
sum(a,b,c),
file('theBenchmark.p',sum_6) ).
cnf(c_32,plain,
sum(a,b,c),
inference(clausify,[status(thm)],[sum_6]) ).
fof(not_less_or_equal_7,axiom,
~ less_or_equal(additive_identity,c),
file('theBenchmark.p',not_less_or_equal_7) ).
cnf(c_33,plain,
~ less_or_equal(additive_identity,c),
inference(clausify,[status(thm)],[not_less_or_equal_7]) ).
cnf(c_118,plain,
sum(additive_identity,b,b),
inference(resolve,[status(thm)],[c_28,c_3]) ).
cnf(c_190,plain,
( ~ less_or_equal(A,c)
| ~ less_or_equal(additive_identity,A) ),
inference(resolve,[status(thm)],[c_22,c_33]) ).
cnf(c_158,plain,
~ less_or_equal(b,c),
inference(resolve,[status(thm)],[c_190,c_31]) ).
cnf(c_191,plain,
( ~ sum(B,C,c)
| ~ sum(A,C,b)
| ~ less_or_equal(A,B) ),
inference(resolve,[status(thm)],[c_24,c_158]) ).
cnf(c_192,plain,
( ~ sum(a,A,c)
| ~ sum(additive_identity,A,b) ),
inference(resolve,[status(thm)],[c_191,c_30]) ).
cnf(c_193,plain,
~ sum(additive_identity,b,b),
inference(resolve,[status(thm)],[c_192,c_32]) ).
cnf(c_189,plain,
$false,
inference(resolve,[status(thm)],[c_118,c_193]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD070-4 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.34 % Computer : n003.cluster.edu
% 0.08/0.34 % Model : x86_64 x86_64
% 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34 % Memory : 8046.5625MB
% 0.08/0.34 % OS : Linux 6.8.0-71-generic
% 0.08/0.34 % CPULimit : 300
% 0.08/0.34 % WCLimit : 300
% 0.08/0.34 % DateTime : Sun Sep 27 02:36:25 UTC 2026
% 0.08/0.34 % CPUTime :
% 0.08/0.35 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.35 % Process 106758 was started by sandbox on n003,
% 0.08/0.35 % Sun Sep 27 02:36:25 2026
% 0.08/0.35 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/0.35
% 0.08/0.35 % From the command line: assign(max_seconds, 300).
% 0.12/0.37
% 0.12/0.37 % SZS status Unsatisfiable for theBenchmark
% 0.12/0.37
% 0.12/0.37 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.12/0.37 % Length of proof is 11.
% 0.12/0.37 % Level of proof is 2.
% 0.12/0.37 % Maximum clause weight is 14.000.
% 0.12/0.37 % Given clauses 58.
% 0.12/0.37
% 0.12/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------