TSTP Solution File: HEN008-4 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : HEN008-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% Computer : n005.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 01:56:59 EDT 2023
% Result : Unsatisfiable 0.20s 0.41s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HEN008-4 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 13:22:53 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.41 Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.20/0.41
% 0.20/0.41 % SZS status Unsatisfiable
% 0.20/0.41
% 0.20/0.43 % SZS output start Proof
% 0.20/0.43 Take the following subset of the input axioms:
% 0.20/0.43 fof(a_LE_b, hypothesis, less_equal(a, b)).
% 0.20/0.43 fof(less_equal_and_equal, axiom, ![X, Y]: (~less_equal(X, Y) | (~less_equal(Y, X) | X=Y))).
% 0.20/0.43 fof(property_of_divide1, axiom, ![Z, X2, Y2]: (~less_equal(divide(X2, Y2), Z) | less_equal(divide(X2, Z), Y2))).
% 0.20/0.43 fof(prove_a_divide_c_LE_b_divide_c, negated_conjecture, ~less_equal(divide(a, c), divide(b, c))).
% 0.20/0.43 fof(quotient_less_equal1, axiom, ![X2, Y2]: (~less_equal(X2, Y2) | divide(X2, Y2)=zero)).
% 0.20/0.43 fof(quotient_less_equal2, axiom, ![X2, Y2]: (divide(X2, Y2)!=zero | less_equal(X2, Y2))).
% 0.20/0.43 fof(quotient_property, axiom, ![X2, Y2, Z2]: less_equal(divide(divide(X2, Z2), divide(Y2, Z2)), divide(divide(X2, Y2), Z2))).
% 0.20/0.43 fof(quotient_smaller_than_numerator, axiom, ![X2, Y2]: less_equal(divide(X2, Y2), X2)).
% 0.20/0.43 fof(x_divide_x_is_zero, axiom, ![X2]: divide(X2, X2)=zero).
% 0.20/0.43 fof(zero_divide_anything_is_zero, axiom, ![X2]: divide(zero, X2)=zero).
% 0.20/0.43 fof(zero_is_smallest, axiom, ![X2]: less_equal(zero, X2)).
% 0.20/0.43
% 0.20/0.43 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.43 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.43 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.43 fresh(y, y, x1...xn) = u
% 0.20/0.43 C => fresh(s, t, x1...xn) = v
% 0.20/0.43 where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.43 variables of u and v.
% 0.20/0.43 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.43 input problem has no model of domain size 1).
% 0.20/0.43
% 0.20/0.43 The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.43
% 0.20/0.43 Axiom 1 (a_LE_b): less_equal(a, b) = true.
% 0.20/0.43 Axiom 2 (zero_is_smallest): less_equal(zero, X) = true.
% 0.20/0.43 Axiom 3 (x_divide_x_is_zero): divide(X, X) = zero.
% 0.20/0.43 Axiom 4 (zero_divide_anything_is_zero): divide(zero, X) = zero.
% 0.20/0.43 Axiom 5 (less_equal_and_equal): fresh(X, X, Y, Z) = Z.
% 0.20/0.43 Axiom 6 (quotient_less_equal1): fresh6(X, X, Y, Z) = zero.
% 0.20/0.43 Axiom 7 (quotient_less_equal2): fresh5(X, X, Y, Z) = true.
% 0.20/0.43 Axiom 8 (less_equal_and_equal): fresh2(X, X, Y, Z) = Y.
% 0.20/0.43 Axiom 9 (quotient_smaller_than_numerator): less_equal(divide(X, Y), X) = true.
% 0.20/0.43 Axiom 10 (property_of_divide1): fresh7(X, X, Y, Z, W) = true.
% 0.20/0.43 Axiom 11 (quotient_less_equal1): fresh6(less_equal(X, Y), true, X, Y) = divide(X, Y).
% 0.20/0.43 Axiom 12 (quotient_less_equal2): fresh5(divide(X, Y), zero, X, Y) = less_equal(X, Y).
% 0.20/0.43 Axiom 13 (less_equal_and_equal): fresh2(less_equal(X, Y), true, Y, X) = fresh(less_equal(Y, X), true, Y, X).
% 0.20/0.43 Axiom 14 (property_of_divide1): fresh7(less_equal(divide(X, Y), Z), true, X, Y, Z) = less_equal(divide(X, Z), Y).
% 0.20/0.43 Axiom 15 (quotient_property): less_equal(divide(divide(X, Y), divide(Z, Y)), divide(divide(X, Z), Y)) = true.
% 0.20/0.43
% 0.20/0.43 Goal 1 (prove_a_divide_c_LE_b_divide_c): less_equal(divide(a, c), divide(b, c)) = true.
% 0.20/0.43 Proof:
% 0.20/0.43 less_equal(divide(a, c), divide(b, c))
% 0.20/0.43 = { by axiom 5 (less_equal_and_equal) R->L }
% 0.20/0.43 less_equal(fresh(true, true, divide(divide(a, c), zero), divide(a, c)), divide(b, c))
% 0.20/0.44 = { by axiom 9 (quotient_smaller_than_numerator) R->L }
% 0.20/0.44 less_equal(fresh(less_equal(divide(divide(a, c), zero), divide(a, c)), true, divide(divide(a, c), zero), divide(a, c)), divide(b, c))
% 0.20/0.44 = { by axiom 13 (less_equal_and_equal) R->L }
% 0.20/0.44 less_equal(fresh2(less_equal(divide(a, c), divide(divide(a, c), zero)), true, divide(divide(a, c), zero), divide(a, c)), divide(b, c))
% 0.20/0.44 = { by axiom 12 (quotient_less_equal2) R->L }
% 0.20/0.44 less_equal(fresh2(fresh5(divide(divide(a, c), divide(divide(a, c), zero)), zero, divide(a, c), divide(divide(a, c), zero)), true, divide(divide(a, c), zero), divide(a, c)), divide(b, c))
% 0.20/0.44 = { by axiom 8 (less_equal_and_equal) R->L }
% 0.20/0.44 less_equal(fresh2(fresh5(fresh2(true, true, divide(divide(a, c), divide(divide(a, c), zero)), zero), zero, divide(a, c), divide(divide(a, c), zero)), true, divide(divide(a, c), zero), divide(a, c)), divide(b, c))
% 0.20/0.44 = { by axiom 2 (zero_is_smallest) R->L }
% 0.20/0.44 less_equal(fresh2(fresh5(fresh2(less_equal(zero, divide(divide(a, c), divide(divide(a, c), zero))), true, divide(divide(a, c), divide(divide(a, c), zero)), zero), zero, divide(a, c), divide(divide(a, c), zero)), true, divide(divide(a, c), zero), divide(a, c)), divide(b, c))
% 0.20/0.44 = { by axiom 13 (less_equal_and_equal) }
% 0.20/0.44 less_equal(fresh2(fresh5(fresh(less_equal(divide(divide(a, c), divide(divide(a, c), zero)), zero), true, divide(divide(a, c), divide(divide(a, c), zero)), zero), zero, divide(a, c), divide(divide(a, c), zero)), true, divide(divide(a, c), zero), divide(a, c)), divide(b, c))
% 0.20/0.44 = { by axiom 14 (property_of_divide1) R->L }
% 0.20/0.44 less_equal(fresh2(fresh5(fresh(fresh7(less_equal(divide(divide(a, c), zero), divide(divide(a, c), zero)), true, divide(a, c), zero, divide(divide(a, c), zero)), true, divide(divide(a, c), divide(divide(a, c), zero)), zero), zero, divide(a, c), divide(divide(a, c), zero)), true, divide(divide(a, c), zero), divide(a, c)), divide(b, c))
% 0.20/0.44 = { by axiom 12 (quotient_less_equal2) R->L }
% 0.20/0.44 less_equal(fresh2(fresh5(fresh(fresh7(fresh5(divide(divide(divide(a, c), zero), divide(divide(a, c), zero)), zero, divide(divide(a, c), zero), divide(divide(a, c), zero)), true, divide(a, c), zero, divide(divide(a, c), zero)), true, divide(divide(a, c), divide(divide(a, c), zero)), zero), zero, divide(a, c), divide(divide(a, c), zero)), true, divide(divide(a, c), zero), divide(a, c)), divide(b, c))
% 0.20/0.44 = { by axiom 3 (x_divide_x_is_zero) }
% 0.20/0.44 less_equal(fresh2(fresh5(fresh(fresh7(fresh5(zero, zero, divide(divide(a, c), zero), divide(divide(a, c), zero)), true, divide(a, c), zero, divide(divide(a, c), zero)), true, divide(divide(a, c), divide(divide(a, c), zero)), zero), zero, divide(a, c), divide(divide(a, c), zero)), true, divide(divide(a, c), zero), divide(a, c)), divide(b, c))
% 0.20/0.44 = { by axiom 7 (quotient_less_equal2) }
% 0.20/0.44 less_equal(fresh2(fresh5(fresh(fresh7(true, true, divide(a, c), zero, divide(divide(a, c), zero)), true, divide(divide(a, c), divide(divide(a, c), zero)), zero), zero, divide(a, c), divide(divide(a, c), zero)), true, divide(divide(a, c), zero), divide(a, c)), divide(b, c))
% 0.20/0.44 = { by axiom 10 (property_of_divide1) }
% 0.20/0.44 less_equal(fresh2(fresh5(fresh(true, true, divide(divide(a, c), divide(divide(a, c), zero)), zero), zero, divide(a, c), divide(divide(a, c), zero)), true, divide(divide(a, c), zero), divide(a, c)), divide(b, c))
% 0.20/0.44 = { by axiom 5 (less_equal_and_equal) }
% 0.20/0.44 less_equal(fresh2(fresh5(zero, zero, divide(a, c), divide(divide(a, c), zero)), true, divide(divide(a, c), zero), divide(a, c)), divide(b, c))
% 0.20/0.44 = { by axiom 7 (quotient_less_equal2) }
% 0.20/0.44 less_equal(fresh2(true, true, divide(divide(a, c), zero), divide(a, c)), divide(b, c))
% 0.20/0.44 = { by axiom 8 (less_equal_and_equal) }
% 0.20/0.44 less_equal(divide(divide(a, c), zero), divide(b, c))
% 0.20/0.45 = { by axiom 14 (property_of_divide1) R->L }
% 0.20/0.45 fresh7(less_equal(divide(divide(a, c), divide(b, c)), zero), true, divide(a, c), divide(b, c), zero)
% 0.20/0.45 = { by axiom 4 (zero_divide_anything_is_zero) R->L }
% 0.20/0.45 fresh7(less_equal(divide(divide(a, c), divide(b, c)), divide(zero, c)), true, divide(a, c), divide(b, c), zero)
% 0.20/0.45 = { by axiom 6 (quotient_less_equal1) R->L }
% 0.20/0.45 fresh7(less_equal(divide(divide(a, c), divide(b, c)), divide(fresh6(true, true, a, b), c)), true, divide(a, c), divide(b, c), zero)
% 0.20/0.45 = { by axiom 1 (a_LE_b) R->L }
% 0.20/0.45 fresh7(less_equal(divide(divide(a, c), divide(b, c)), divide(fresh6(less_equal(a, b), true, a, b), c)), true, divide(a, c), divide(b, c), zero)
% 0.20/0.45 = { by axiom 11 (quotient_less_equal1) }
% 0.20/0.45 fresh7(less_equal(divide(divide(a, c), divide(b, c)), divide(divide(a, b), c)), true, divide(a, c), divide(b, c), zero)
% 0.20/0.45 = { by axiom 15 (quotient_property) }
% 0.20/0.45 fresh7(true, true, divide(a, c), divide(b, c), zero)
% 0.20/0.45 = { by axiom 10 (property_of_divide1) }
% 0.20/0.45 true
% 0.20/0.45 % SZS output end Proof
% 0.20/0.45
% 0.20/0.45 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------