%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : FLD061-1 : 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 : n020.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:01 AM UTC 2026
% Result : Unsatisfiable 6.45s 11.79s
% Output : Proof 6.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 23 unt; 0 nHn; 32 RR)
% Number of literals : 50 ( 0 equ; 20 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(commutativity_addition,axiom,
( ~ defined(Y)
| ~ defined(X)
| equalish(add(X,Y),add(Y,X)) ),
file('FLD001-0.ax',commutativity_addition) ).
cnf(transitivity_of_order_relation,axiom,
( ~ less_or_equal(Y,Z)
| ~ less_or_equal(X,Y)
| less_or_equal(X,Z) ),
file('FLD001-0.ax',transitivity_of_order_relation) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( ~ less_or_equal(X,Y)
| ~ defined(Z)
| less_or_equal(add(X,Z),add(Y,Z)) ),
file('FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( ~ equalish(X,Y)
| ~ less_or_equal(X,Z)
| less_or_equal(Y,Z) ),
file('FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('theBenchmark.p',b_is_defined) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('theBenchmark.p',c_is_defined) ).
cnf(less_or_equal_5,negated_conjecture,
less_or_equal(a,b),
file('theBenchmark.p',less_or_equal_5) ).
cnf(less_or_equal_6,negated_conjecture,
less_or_equal(c,d),
file('theBenchmark.p',less_or_equal_6) ).
cnf(not_less_or_equal_7,negated_conjecture,
~ less_or_equal(add(a,c),add(d,b)),
file('theBenchmark.p',not_less_or_equal_7) ).
cnf(t1,plain,
~ less_or_equal(add(a,c),add(d,b)),
inference(start,[status(thm),parent(0:0)],[not_less_or_equal_7]) ).
cnf(t2,plain,
( ~ less_or_equal(add(a,c),add(b,c))
| ~ less_or_equal(add(b,c),add(d,b))
| less_or_equal(add(a,c),add(d,b)) ),
inference(extension,[status(thm),parent(t1:1)],[transitivity_of_order_relation]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
( ~ less_or_equal(add(c,b),add(d,b))
| ~ equalish(add(c,b),add(b,c))
| less_or_equal(add(b,c),add(d,b)) ),
inference(extension,[status(thm),parent(t2:2)],[compatibility_of_equality_and_order_relation]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
( ~ defined(c)
| ~ defined(b)
| equalish(add(c,b),add(b,c)) ),
inference(extension,[status(thm),parent(t4:2)],[commutativity_addition]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t4:2]) ).
cnf(t8,plain,
defined(b),
inference(extension,[status(thm),parent(t6:2)],[b_is_defined]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t6:2]) ).
cnf(t10,plain,
defined(c),
inference(extension,[status(thm),parent(t6:3)],[c_is_defined]) ).
cnf(t11,plain,
$false,
inference(connection,[status(thm),parent(t10:1)],[t10:1,t6:3]) ).
cnf(t12,plain,
( ~ defined(b)
| ~ less_or_equal(c,d)
| less_or_equal(add(c,b),add(d,b)) ),
inference(extension,[status(thm),parent(t4:3)],[compatibility_of_order_relation_and_addition]) ).
cnf(t13,plain,
$false,
inference(connection,[status(thm),parent(t12:1)],[t12:1,t4:3]) ).
cnf(t14,plain,
less_or_equal(c,d),
inference(extension,[status(thm),parent(t12:2)],[less_or_equal_6]) ).
cnf(t15,plain,
$false,
inference(connection,[status(thm),parent(t14:1)],[t14:1,t12:2]) ).
cnf(t16,plain,
defined(b),
inference(extension,[status(thm),parent(t12:3)],[b_is_defined]) ).
cnf(t17,plain,
$false,
inference(connection,[status(thm),parent(t16:1)],[t16:1,t12:3]) ).
cnf(t18,plain,
( ~ defined(c)
| ~ less_or_equal(a,b)
| less_or_equal(add(a,c),add(b,c)) ),
inference(extension,[status(thm),parent(t2:3)],[compatibility_of_order_relation_and_addition]) ).
cnf(t19,plain,
$false,
inference(connection,[status(thm),parent(t18:1)],[t18:1,t2:3]) ).
cnf(t20,plain,
less_or_equal(a,b),
inference(extension,[status(thm),parent(t18:2)],[less_or_equal_5]) ).
cnf(t21,plain,
$false,
inference(connection,[status(thm),parent(t20:1)],[t20:1,t18:2]) ).
cnf(t22,plain,
defined(c),
inference(extension,[status(thm),parent(t18:3)],[c_is_defined]) ).
cnf(t23,plain,
$false,
inference(connection,[status(thm),parent(t22:1)],[t22:1,t18:3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD061-1 : 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/5.37 % Computer : n020.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Sun Sep 20 19:11:08 UTC 2026
% 0.10/5.38 % CPUTime :
% 6.45/11.79 % SZS status Unsatisfiable for theBenchmark
% 6.45/11.79 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------