%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : HEN006-4 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n008.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 : Tue Sep 29 10:18:58 AM UTC 2026
% Result : Unsatisfiable 0.17s 0.47s
% Output : Proof 0.17s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HEN006-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n008.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 27 10:50:29 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.47 Command-line arguments: --no-flatten-goal
% 0.17/0.47
% 0.17/0.47 % SZS status Unsatisfiable
% 0.17/0.47
% 0.17/0.47 % SZS output start Proof
% 0.17/0.47 Axiom 1 (zero_is_smallest): less_equal(zero, X) = true.
% 0.17/0.47 Axiom 2 (ifeq_axiom): ifeq3(X, X, Y, Z) = Y.
% 0.17/0.47 Axiom 3 (ifeq_axiom): ifeq(X, X, Y, Z) = Y.
% 0.17/0.47 Axiom 4 (ifeq_axiom): ifeq2(X, X, Y, Z) = Y.
% 0.17/0.47 Axiom 5 (quotient_smaller_than_numerator): less_equal(divide(X, Y), X) = true.
% 0.17/0.47 Axiom 6 (a_divide_b_LE_d): less_equal(divide(a, b), d) = true.
% 0.17/0.47 Axiom 7 (quotient_less_equal2): ifeq3(divide(X, Y), zero, less_equal(X, Y), true) = true.
% 0.17/0.47 Axiom 8 (quotient_less_equal1): ifeq2(less_equal(X, Y), true, divide(X, Y), zero) = zero.
% 0.17/0.47 Axiom 9 (less_equal_and_equal): ifeq2(less_equal(X, Y), true, ifeq2(less_equal(Y, X), true, Y, X), X) = X.
% 0.17/0.47 Axiom 10 (quotient_property): less_equal(divide(divide(X, Y), divide(Z, Y)), divide(divide(X, Z), Y)) = true.
% 0.17/0.47 Axiom 11 (transitivity_of_less_equal): ifeq(less_equal(X, Y), true, ifeq(less_equal(Z, X), true, less_equal(Z, Y), true), true) = true.
% 0.17/0.47
% 0.17/0.47 Goal 1 (prove_a_divide_d_LE_b): less_equal(divide(a, d), b) = true.
% 0.17/0.47 Proof:
% 0.17/0.47 less_equal(divide(a, d), b)
% 0.17/0.47 = { by axiom 3 (ifeq_axiom) R->L }
% 0.17/0.47 ifeq(true, true, less_equal(divide(a, d), b), true)
% 0.17/0.47 = { by axiom 7 (quotient_less_equal2) R->L }
% 0.17/0.47 ifeq(ifeq3(divide(divide(a, d), divide(b, d)), zero, less_equal(divide(a, d), divide(b, d)), true), true, less_equal(divide(a, d), b), true)
% 0.17/0.47 = { by axiom 9 (less_equal_and_equal) R->L }
% 0.17/0.47 ifeq(ifeq3(ifeq2(less_equal(divide(divide(a, d), divide(b, d)), zero), true, ifeq2(less_equal(zero, divide(divide(a, d), divide(b, d))), true, zero, divide(divide(a, d), divide(b, d))), divide(divide(a, d), divide(b, d))), zero, less_equal(divide(a, d), divide(b, d)), true), true, less_equal(divide(a, d), b), true)
% 0.17/0.47 = { by axiom 8 (quotient_less_equal1) R->L }
% 0.17/0.47 ifeq(ifeq3(ifeq2(less_equal(divide(divide(a, d), divide(b, d)), ifeq2(less_equal(divide(a, b), d), true, divide(divide(a, b), d), zero)), true, ifeq2(less_equal(zero, divide(divide(a, d), divide(b, d))), true, zero, divide(divide(a, d), divide(b, d))), divide(divide(a, d), divide(b, d))), zero, less_equal(divide(a, d), divide(b, d)), true), true, less_equal(divide(a, d), b), true)
% 0.17/0.47 = { by axiom 6 (a_divide_b_LE_d) }
% 0.17/0.47 ifeq(ifeq3(ifeq2(less_equal(divide(divide(a, d), divide(b, d)), ifeq2(true, true, divide(divide(a, b), d), zero)), true, ifeq2(less_equal(zero, divide(divide(a, d), divide(b, d))), true, zero, divide(divide(a, d), divide(b, d))), divide(divide(a, d), divide(b, d))), zero, less_equal(divide(a, d), divide(b, d)), true), true, less_equal(divide(a, d), b), true)
% 0.17/0.47 = { by axiom 4 (ifeq_axiom) }
% 0.17/0.47 ifeq(ifeq3(ifeq2(less_equal(divide(divide(a, d), divide(b, d)), divide(divide(a, b), d)), true, ifeq2(less_equal(zero, divide(divide(a, d), divide(b, d))), true, zero, divide(divide(a, d), divide(b, d))), divide(divide(a, d), divide(b, d))), zero, less_equal(divide(a, d), divide(b, d)), true), true, less_equal(divide(a, d), b), true)
% 0.17/0.47 = { by axiom 10 (quotient_property) }
% 0.17/0.47 ifeq(ifeq3(ifeq2(true, true, ifeq2(less_equal(zero, divide(divide(a, d), divide(b, d))), true, zero, divide(divide(a, d), divide(b, d))), divide(divide(a, d), divide(b, d))), zero, less_equal(divide(a, d), divide(b, d)), true), true, less_equal(divide(a, d), b), true)
% 0.17/0.47 = { by axiom 4 (ifeq_axiom) }
% 0.17/0.48 ifeq(ifeq3(ifeq2(less_equal(zero, divide(divide(a, d), divide(b, d))), true, zero, divide(divide(a, d), divide(b, d))), zero, less_equal(divide(a, d), divide(b, d)), true), true, less_equal(divide(a, d), b), true)
% 0.17/0.48 = { by axiom 1 (zero_is_smallest) }
% 0.17/0.48 ifeq(ifeq3(ifeq2(true, true, zero, divide(divide(a, d), divide(b, d))), zero, less_equal(divide(a, d), divide(b, d)), true), true, less_equal(divide(a, d), b), true)
% 0.17/0.48 = { by axiom 4 (ifeq_axiom) }
% 0.17/0.48 ifeq(ifeq3(zero, zero, less_equal(divide(a, d), divide(b, d)), true), true, less_equal(divide(a, d), b), true)
% 0.17/0.48 = { by axiom 2 (ifeq_axiom) }
% 0.17/0.48 ifeq(less_equal(divide(a, d), divide(b, d)), true, less_equal(divide(a, d), b), true)
% 0.17/0.48 = { by axiom 3 (ifeq_axiom) R->L }
% 0.17/0.48 ifeq(true, true, ifeq(less_equal(divide(a, d), divide(b, d)), true, less_equal(divide(a, d), b), true), true)
% 0.17/0.48 = { by axiom 5 (quotient_smaller_than_numerator) R->L }
% 0.17/0.48 ifeq(less_equal(divide(b, d), b), true, ifeq(less_equal(divide(a, d), divide(b, d)), true, less_equal(divide(a, d), b), true), true)
% 0.17/0.48 = { by axiom 11 (transitivity_of_less_equal) }
% 0.17/0.48 true
% 0.17/0.48 % SZS output end Proof
% 0.17/0.48
% 0.17/0.48 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------