TSTP Solution File: SET204-6 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SET204-6 : 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 : n027.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 15:31:40 EDT 2023
% Result : Unsatisfiable 0.20s 0.59s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET204-6 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.14 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 15:34:35 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.59 Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 0.20/0.59
% 0.20/0.59 % SZS status Unsatisfiable
% 0.20/0.59
% 0.20/0.59 % SZS output start Proof
% 0.20/0.59 Take the following subset of the input axioms:
% 0.20/0.59 fof(cartesian_product1, axiom, ![X, Y, U, V]: (~member(ordered_pair(U, V), cross_product(X, Y)) | member(U, X))).
% 0.20/0.59 fof(cartesian_product2, axiom, ![X2, Y2, U2, V2]: (~member(ordered_pair(U2, V2), cross_product(X2, Y2)) | member(V2, Y2))).
% 0.20/0.59 fof(cartesian_product3, axiom, ![X2, Y2, U2, V2]: (~member(U2, X2) | (~member(V2, Y2) | member(ordered_pair(U2, V2), cross_product(X2, Y2))))).
% 0.20/0.59 fof(prove_cross_product_property2_1, negated_conjecture, member(ordered_pair(u, v), cross_product(x, y))).
% 0.20/0.59 fof(prove_cross_product_property2_2, negated_conjecture, ~member(ordered_pair(v, u), cross_product(y, x))).
% 0.20/0.59
% 0.20/0.59 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.59 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.59 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.59 fresh(y, y, x1...xn) = u
% 0.20/0.59 C => fresh(s, t, x1...xn) = v
% 0.20/0.59 where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.59 variables of u and v.
% 0.20/0.59 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.59 input problem has no model of domain size 1).
% 0.20/0.59
% 0.20/0.59 The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.59
% 0.20/0.59 Axiom 1 (prove_cross_product_property2_1): member(ordered_pair(u, v), cross_product(x, y)) = true2.
% 0.20/0.59 Axiom 2 (cartesian_product1): fresh77(X, X, Y, Z) = true2.
% 0.20/0.59 Axiom 3 (cartesian_product2): fresh76(X, X, Y, Z) = true2.
% 0.20/0.59 Axiom 4 (cartesian_product3): fresh75(X, X, Y, Z, W, V) = member(ordered_pair(Y, W), cross_product(Z, V)).
% 0.20/0.59 Axiom 5 (cartesian_product3): fresh74(X, X, Y, Z, W, V) = true2.
% 0.20/0.59 Axiom 6 (cartesian_product1): fresh77(member(ordered_pair(X, Y), cross_product(Z, W)), true2, X, Z) = member(X, Z).
% 0.20/0.59 Axiom 7 (cartesian_product2): fresh76(member(ordered_pair(X, Y), cross_product(Z, W)), true2, Y, W) = member(Y, W).
% 0.20/0.60 Axiom 8 (cartesian_product3): fresh75(member(X, Y), true2, Z, W, X, Y) = fresh74(member(Z, W), true2, Z, W, X, Y).
% 0.20/0.60
% 0.20/0.60 Goal 1 (prove_cross_product_property2_2): member(ordered_pair(v, u), cross_product(y, x)) = true2.
% 0.20/0.60 Proof:
% 0.20/0.60 member(ordered_pair(v, u), cross_product(y, x))
% 0.20/0.60 = { by axiom 4 (cartesian_product3) R->L }
% 0.20/0.60 fresh75(true2, true2, v, y, u, x)
% 0.20/0.60 = { by axiom 2 (cartesian_product1) R->L }
% 0.20/0.60 fresh75(fresh77(true2, true2, u, x), true2, v, y, u, x)
% 0.20/0.60 = { by axiom 1 (prove_cross_product_property2_1) R->L }
% 0.20/0.60 fresh75(fresh77(member(ordered_pair(u, v), cross_product(x, y)), true2, u, x), true2, v, y, u, x)
% 0.20/0.60 = { by axiom 6 (cartesian_product1) }
% 0.20/0.60 fresh75(member(u, x), true2, v, y, u, x)
% 0.20/0.60 = { by axiom 8 (cartesian_product3) }
% 0.20/0.60 fresh74(member(v, y), true2, v, y, u, x)
% 0.20/0.60 = { by axiom 7 (cartesian_product2) R->L }
% 0.20/0.60 fresh74(fresh76(member(ordered_pair(u, v), cross_product(x, y)), true2, v, y), true2, v, y, u, x)
% 0.20/0.60 = { by axiom 1 (prove_cross_product_property2_1) }
% 0.20/0.60 fresh74(fresh76(true2, true2, v, y), true2, v, y, u, x)
% 0.20/0.60 = { by axiom 3 (cartesian_product2) }
% 0.20/0.60 fresh74(true2, true2, v, y, u, x)
% 0.20/0.60 = { by axiom 5 (cartesian_product3) }
% 0.20/0.60 true2
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60
% 0.20/0.60 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------