TSTP Solution File: FLD060-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : FLD060-1 : TPTP v8.1.2. Bugfixed v2.1.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 : n029.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 : Wed Aug 30 22:37:07 EDT 2023
% Result : Unsatisfiable 0.20s 0.54s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD060-1 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/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 : n029.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 : Sun Aug 27 23:27:11 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.54 Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 0.20/0.54
% 0.20/0.54 % SZS status Unsatisfiable
% 0.20/0.54
% 0.20/0.54 % SZS output start Proof
% 0.20/0.54 Take the following subset of the input axioms:
% 0.20/0.54 fof(a_is_defined, hypothesis, defined(a)).
% 0.20/0.54 fof(b_is_defined, hypothesis, defined(b)).
% 0.20/0.54 fof(commutativity_addition, axiom, ![X, Y]: (equalish(add(X, Y), add(Y, X)) | (~defined(X) | ~defined(Y)))).
% 0.20/0.55 fof(compatibility_of_equality_and_order_relation, axiom, ![Z, X2, Y2]: (less_or_equal(Y2, Z) | (~less_or_equal(X2, Z) | ~equalish(X2, Y2)))).
% 0.20/0.55 fof(compatibility_of_order_relation_and_addition, axiom, ![X2, Y2, Z2]: (less_or_equal(add(X2, Z2), add(Y2, Z2)) | (~defined(Z2) | ~less_or_equal(X2, Y2)))).
% 0.20/0.55 fof(less_or_equal_3, negated_conjecture, less_or_equal(a, b)).
% 0.20/0.55 fof(not_less_or_equal_4, negated_conjecture, ~less_or_equal(add(a, a), add(b, b))).
% 0.20/0.55 fof(transitivity_of_order_relation, axiom, ![X2, Y2, Z2]: (less_or_equal(X2, Z2) | (~less_or_equal(X2, Y2) | ~less_or_equal(Y2, Z2)))).
% 0.20/0.55
% 0.20/0.55 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.55 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.55 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.55 fresh(y, y, x1...xn) = u
% 0.20/0.55 C => fresh(s, t, x1...xn) = v
% 0.20/0.55 where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.55 variables of u and v.
% 0.20/0.55 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.55 input problem has no model of domain size 1).
% 0.20/0.55
% 0.20/0.55 The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.55
% 0.20/0.55 Axiom 1 (a_is_defined): defined(a) = true.
% 0.20/0.55 Axiom 2 (b_is_defined): defined(b) = true.
% 0.20/0.55 Axiom 3 (less_or_equal_3): less_or_equal(a, b) = true.
% 0.20/0.55 Axiom 4 (commutativity_addition): fresh36(X, X, Y, Z) = true.
% 0.20/0.55 Axiom 5 (compatibility_of_equality_and_order_relation): fresh19(X, X, Y, Z) = true.
% 0.20/0.55 Axiom 6 (transitivity_of_order_relation): fresh6(X, X, Y, Z) = true.
% 0.20/0.55 Axiom 7 (commutativity_addition): fresh35(X, X, Y, Z) = fresh36(defined(Y), true, Y, Z).
% 0.20/0.55 Axiom 8 (commutativity_addition): fresh35(defined(X), true, Y, X) = equalish(add(Y, X), add(X, Y)).
% 0.20/0.55 Axiom 9 (compatibility_of_equality_and_order_relation): fresh20(X, X, Y, Z, W) = less_or_equal(Y, Z).
% 0.20/0.55 Axiom 10 (compatibility_of_order_relation_and_addition): fresh18(X, X, Y, Z, W) = less_or_equal(add(Y, Z), add(W, Z)).
% 0.20/0.55 Axiom 11 (compatibility_of_order_relation_and_addition): fresh17(X, X, Y, Z, W) = true.
% 0.20/0.55 Axiom 12 (transitivity_of_order_relation): fresh7(X, X, Y, Z, W) = less_or_equal(Y, Z).
% 0.20/0.55 Axiom 13 (compatibility_of_equality_and_order_relation): fresh20(less_or_equal(X, Y), true, Z, Y, X) = fresh19(equalish(X, Z), true, Z, Y).
% 0.20/0.55 Axiom 14 (compatibility_of_order_relation_and_addition): fresh18(less_or_equal(X, Y), true, X, Z, Y) = fresh17(defined(Z), true, X, Z, Y).
% 0.20/0.55 Axiom 15 (transitivity_of_order_relation): fresh7(less_or_equal(X, Y), true, Z, Y, X) = fresh6(less_or_equal(Z, X), true, Z, Y).
% 0.20/0.55
% 0.20/0.55 Goal 1 (not_less_or_equal_4): less_or_equal(add(a, a), add(b, b)) = true.
% 0.20/0.55 Proof:
% 0.20/0.55 less_or_equal(add(a, a), add(b, b))
% 0.20/0.55 = { by axiom 12 (transitivity_of_order_relation) R->L }
% 0.20/0.55 fresh7(true, true, add(a, a), add(b, b), add(b, a))
% 0.20/0.55 = { by axiom 5 (compatibility_of_equality_and_order_relation) R->L }
% 0.20/0.55 fresh7(fresh19(true, true, add(b, a), add(b, b)), true, add(a, a), add(b, b), add(b, a))
% 0.20/0.55 = { by axiom 4 (commutativity_addition) R->L }
% 0.20/0.55 fresh7(fresh19(fresh36(true, true, a, b), true, add(b, a), add(b, b)), true, add(a, a), add(b, b), add(b, a))
% 0.20/0.55 = { by axiom 1 (a_is_defined) R->L }
% 0.20/0.55 fresh7(fresh19(fresh36(defined(a), true, a, b), true, add(b, a), add(b, b)), true, add(a, a), add(b, b), add(b, a))
% 0.20/0.55 = { by axiom 7 (commutativity_addition) R->L }
% 0.20/0.55 fresh7(fresh19(fresh35(true, true, a, b), true, add(b, a), add(b, b)), true, add(a, a), add(b, b), add(b, a))
% 0.20/0.55 = { by axiom 2 (b_is_defined) R->L }
% 0.20/0.55 fresh7(fresh19(fresh35(defined(b), true, a, b), true, add(b, a), add(b, b)), true, add(a, a), add(b, b), add(b, a))
% 0.20/0.55 = { by axiom 8 (commutativity_addition) }
% 0.20/0.55 fresh7(fresh19(equalish(add(a, b), add(b, a)), true, add(b, a), add(b, b)), true, add(a, a), add(b, b), add(b, a))
% 0.20/0.55 = { by axiom 13 (compatibility_of_equality_and_order_relation) R->L }
% 0.20/0.55 fresh7(fresh20(less_or_equal(add(a, b), add(b, b)), true, add(b, a), add(b, b), add(a, b)), true, add(a, a), add(b, b), add(b, a))
% 0.20/0.55 = { by axiom 10 (compatibility_of_order_relation_and_addition) R->L }
% 0.20/0.55 fresh7(fresh20(fresh18(true, true, a, b, b), true, add(b, a), add(b, b), add(a, b)), true, add(a, a), add(b, b), add(b, a))
% 0.20/0.55 = { by axiom 3 (less_or_equal_3) R->L }
% 0.20/0.55 fresh7(fresh20(fresh18(less_or_equal(a, b), true, a, b, b), true, add(b, a), add(b, b), add(a, b)), true, add(a, a), add(b, b), add(b, a))
% 0.20/0.55 = { by axiom 14 (compatibility_of_order_relation_and_addition) }
% 0.20/0.55 fresh7(fresh20(fresh17(defined(b), true, a, b, b), true, add(b, a), add(b, b), add(a, b)), true, add(a, a), add(b, b), add(b, a))
% 0.20/0.55 = { by axiom 2 (b_is_defined) }
% 0.20/0.55 fresh7(fresh20(fresh17(true, true, a, b, b), true, add(b, a), add(b, b), add(a, b)), true, add(a, a), add(b, b), add(b, a))
% 0.20/0.55 = { by axiom 11 (compatibility_of_order_relation_and_addition) }
% 0.20/0.55 fresh7(fresh20(true, true, add(b, a), add(b, b), add(a, b)), true, add(a, a), add(b, b), add(b, a))
% 0.20/0.55 = { by axiom 9 (compatibility_of_equality_and_order_relation) }
% 0.20/0.55 fresh7(less_or_equal(add(b, a), add(b, b)), true, add(a, a), add(b, b), add(b, a))
% 0.20/0.55 = { by axiom 15 (transitivity_of_order_relation) }
% 0.20/0.55 fresh6(less_or_equal(add(a, a), add(b, a)), true, add(a, a), add(b, b))
% 0.20/0.55 = { by axiom 10 (compatibility_of_order_relation_and_addition) R->L }
% 0.20/0.55 fresh6(fresh18(true, true, a, a, b), true, add(a, a), add(b, b))
% 0.20/0.55 = { by axiom 3 (less_or_equal_3) R->L }
% 0.20/0.55 fresh6(fresh18(less_or_equal(a, b), true, a, a, b), true, add(a, a), add(b, b))
% 0.20/0.55 = { by axiom 14 (compatibility_of_order_relation_and_addition) }
% 0.20/0.55 fresh6(fresh17(defined(a), true, a, a, b), true, add(a, a), add(b, b))
% 0.20/0.55 = { by axiom 1 (a_is_defined) }
% 0.20/0.55 fresh6(fresh17(true, true, a, a, b), true, add(a, a), add(b, b))
% 0.20/0.55 = { by axiom 11 (compatibility_of_order_relation_and_addition) }
% 0.20/0.55 fresh6(true, true, add(a, a), add(b, b))
% 0.20/0.55 = { by axiom 6 (transitivity_of_order_relation) }
% 0.20/0.55 true
% 0.20/0.55 % SZS output end Proof
% 0.20/0.55
% 0.20/0.55 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------