%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : FLD067-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /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 : Thu Sep 24 08:39:03 AM UTC 2026
% Result : Unsatisfiable 0.56s 0.82s
% Output : Proof 0.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 9
% Syntax : Number of clauses : 28 ( 18 unt; 0 nHn; 28 RR)
% Number of literals : 44 ( 0 equ; 18 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(existence_of_inverse_addition,axiom,
( ~ defined(X)
| sum(additive_inverse(X),X,additive_identity) ),
file('FLD002-0.ax',existence_of_inverse_addition) ).
cnf(commutativity_addition,axiom,
( ~ sum(X,Y,Z)
| sum(Y,X,Z) ),
file('FLD002-0.ax',commutativity_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( ~ defined(X)
| defined(additive_inverse(X)) ),
file('FLD002-0.ax',well_definedness_of_additive_inverse) ).
cnf(totality_of_addition,axiom,
( ~ defined(Y)
| ~ defined(X)
| sum(X,Y,add(X,Y)) ),
file('FLD002-0.ax',totality_of_addition) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( ~ sum(Y,Z,V)
| ~ sum(X,Z,U)
| ~ less_or_equal(X,Y)
| less_or_equal(U,V) ),
file('FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('theBenchmark.p',a_is_defined) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('theBenchmark.p',b_is_defined) ).
cnf(less_or_equal_3,negated_conjecture,
less_or_equal(a,b),
file('theBenchmark.p',less_or_equal_3) ).
cnf(not_less_or_equal_4,negated_conjecture,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
file('theBenchmark.p',not_less_or_equal_4) ).
cnf(t1,plain,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
inference(start,[status(thm),parent(0:0)],[not_less_or_equal_4]) ).
cnf(t2,plain,
( ~ less_or_equal(a,b)
| ~ sum(a,additive_inverse(a),additive_identity)
| ~ sum(b,additive_inverse(a),add(b,additive_inverse(a)))
| less_or_equal(additive_identity,add(b,additive_inverse(a))) ),
inference(extension,[status(thm),parent(t1:1)],[compatibility_of_order_relation_and_addition]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ defined(b)
| ~ defined(additive_inverse(a))
| sum(b,additive_inverse(a),add(b,additive_inverse(a))) ),
inference(extension,[status(thm),parent(t2:2)],[totality_of_addition]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ defined(a)
| defined(additive_inverse(a)) ),
inference(extension,[status(thm),parent(t4:2)],[well_definedness_of_additive_inverse]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
defined(a),
inference(extension,[status(thm),parent(t6:2)],[a_is_defined]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
defined(b),
inference(extension,[status(thm),parent(t4:3)],[b_is_defined]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t4:3]) ).
cnf(t12,plain,
( ~ sum(additive_inverse(a),a,additive_identity)
| sum(a,additive_inverse(a),additive_identity) ),
inference(extension,[status(thm),parent(t2:3)],[commutativity_addition]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t2:3]) ).
cnf(t14,plain,
( ~ defined(a)
| sum(additive_inverse(a),a,additive_identity) ),
inference(extension,[status(thm),parent(t12:2)],[existence_of_inverse_addition]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
defined(a),
inference(extension,[status(thm),parent(t14:2)],[a_is_defined]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t14:2]) ).
cnf(t18,plain,
less_or_equal(a,b),
inference(extension,[status(thm),parent(t2:4)],[less_or_equal_3]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t2:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD067-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.03 This is a CNF_UNS_RFO_NEQ_NHN problem
% 0.00/0.04 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n026.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 19:11:37 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.56/0.82 % SZS status Unsatisfiable for theBenchmark
% 0.56/0.82 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------