%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : HEN008-3 : TPTP v9.3.1. Released v1.0.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 : n016.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:42:30 AM UTC 2026
% Result : Unsatisfiable 249.25s 249.52s
% Output : Proof 249.51s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
cnf(quotient_less_equal1,axiom,
( divide(X,Y) = zero
| ~ less_equal(X,Y) ),
file('HEN002-0.ax',quotient_less_equal1) ).
cnf(quotient_less_equal2,axiom,
( less_equal(X,Y)
| divide(X,Y) != zero ),
file('HEN002-0.ax',quotient_less_equal2) ).
cnf(quotient_smaller_than_numerator,axiom,
less_equal(divide(X,Y),X),
file('HEN002-0.ax',quotient_smaller_than_numerator) ).
cnf(quotient_property,axiom,
less_equal(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)),
file('HEN002-0.ax',quotient_property) ).
cnf(zero_is_smallest,axiom,
less_equal(zero,X),
file('HEN002-0.ax',zero_is_smallest) ).
cnf(less_equal_and_equal,axiom,
( X = Y
| ~ less_equal(Y,X)
| ~ less_equal(X,Y) ),
file('HEN002-0.ax',less_equal_and_equal) ).
cnf(identity_is_largest,axiom,
less_equal(X,identity),
file('HEN002-0.ax',identity_is_largest) ).
cnf(a_LE_b,hypothesis,
less_equal(a,b),
file('theBenchmark.p',a_LE_b) ).
cnf(prove_a_divide_c_LE_b_divide_c,negated_conjecture,
~ less_equal(divide(a,c),divide(b,c)),
file('theBenchmark.p',prove_a_divide_c_LE_b_divide_c) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( divide(Eq_x_0,Eq_x_1) = divide(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( less_equal(Eq_y_0,Eq_y_1)
| ~ less_equal(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HEN008-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 This is a CNF_UNS_RFO_SEQ_HRN problem
% 0.00/0.03 % Command : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n016.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sat Sep 19 10:45:38 UTC 2026
% 0.09/0.36 % CPUTime :
% 249.25/249.52 % SZS status Unsatisfiable for theBenchmark
% 249.25/249.52 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------