%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : FLD071-4 : 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 : n011.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:04 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.40s
% Output : Proof 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 12 unt; 0 nHn; 14 RR)
% Number of literals : 20 ( 0 equ; 8 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(compatibility_of_order_relation_and_multiplication,axiom,
( ~ product(X,Y,Z)
| ~ less_or_equal(additive_identity,Y)
| ~ less_or_equal(additive_identity,X)
| less_or_equal(additive_identity,Z) ),
file('FLD002-0.ax',compatibility_of_order_relation_and_multiplication) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(additive_identity,a),
file('theBenchmark.p',less_or_equal_4) ).
cnf(less_or_equal_5,negated_conjecture,
less_or_equal(additive_identity,b),
file('theBenchmark.p',less_or_equal_5) ).
cnf(product_6,negated_conjecture,
product(a,b,u),
file('theBenchmark.p',product_6) ).
cnf(not_less_or_equal_7,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('theBenchmark.p',not_less_or_equal_7) ).
cnf(t1,plain,
~ less_or_equal(additive_identity,u),
inference(start,[status(thm),parent(0:0)],[not_less_or_equal_7]) ).
cnf(t2,plain,
( ~ less_or_equal(additive_identity,a)
| ~ less_or_equal(additive_identity,b)
| ~ product(a,b,u)
| less_or_equal(additive_identity,u) ),
inference(extension,[status(thm),parent(t1:1)],[compatibility_of_order_relation_and_multiplication]) ).
cnf(t3,plain,
$false,
inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).
cnf(t4,plain,
product(a,b,u),
inference(extension,[status(thm),parent(t2:2)],[product_6]) ).
cnf(t5,plain,
$false,
inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).
cnf(t6,plain,
less_or_equal(additive_identity,b),
inference(extension,[status(thm),parent(t2:3)],[less_or_equal_5]) ).
cnf(t7,plain,
$false,
inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).
cnf(t8,plain,
less_or_equal(additive_identity,a),
inference(extension,[status(thm),parent(t2:4)],[less_or_equal_4]) ).
cnf(t9,plain,
$false,
inference(connection,[status(thm),parent(t8:1)],[t8:1,t2:4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD071-4 : 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.37 % Computer : n011.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 19:13:10 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.40 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.40 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------