TSTP Solution File: SET864-2 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SET864-2 : TPTP v8.1.2. Released v3.2.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 : n011.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:33:35 EDT 2023
% Result : Unsatisfiable 0.14s 0.40s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET864-2 : TPTP v8.1.2. Released v3.2.0.
% 0.08/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 : n011.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 14:59:24 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.14/0.40 Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.14/0.40
% 0.14/0.40 % SZS status Unsatisfiable
% 0.14/0.40
% 0.14/0.40 % SZS output start Proof
% 0.14/0.40 Take the following subset of the input axioms:
% 0.20/0.40 fof(cls_Zorn_Omaxchain__Zorn_0, axiom, ![V_u, V_S, T_a, V_c]: (~c_in(V_u, V_S, tc_set(T_a)) | (~c_in(V_c, c_Zorn_Omaxchain(V_S, T_a), tc_set(tc_set(T_a))) | (~c_lessequals(c_Union(V_c, T_a), V_u, tc_set(T_a)) | c_Union(V_c, T_a)=V_u)))).
% 0.20/0.40 fof(cls_conjecture_0, negated_conjecture, c_in(v_c, c_Zorn_Omaxchain(v_S, t_a), tc_set(tc_set(t_a)))).
% 0.20/0.40 fof(cls_conjecture_2, negated_conjecture, c_in(c_Union(v_c, t_a), v_S, tc_set(t_a))).
% 0.20/0.40 fof(cls_conjecture_3, negated_conjecture, ![V_U]: (c_in(v_x(V_U), v_S, tc_set(t_a)) | ~c_in(V_U, v_S, tc_set(t_a)))).
% 0.20/0.40 fof(cls_conjecture_4, negated_conjecture, ![V_U2]: (c_lessequals(V_U2, v_x(V_U2), tc_set(t_a)) | ~c_in(V_U2, v_S, tc_set(t_a)))).
% 0.20/0.40 fof(cls_conjecture_5, negated_conjecture, ![V_U2]: (V_U2!=v_x(V_U2) | ~c_in(V_U2, v_S, tc_set(t_a)))).
% 0.20/0.40
% 0.20/0.40 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.40 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.40 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.40 fresh(y, y, x1...xn) = u
% 0.20/0.40 C => fresh(s, t, x1...xn) = v
% 0.20/0.40 where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.40 variables of u and v.
% 0.20/0.40 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.40 input problem has no model of domain size 1).
% 0.20/0.40
% 0.20/0.40 The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.40
% 0.20/0.40 Axiom 1 (cls_conjecture_4): fresh(X, X, Y) = true2.
% 0.20/0.40 Axiom 2 (cls_conjecture_3): fresh2(X, X, Y) = true2.
% 0.20/0.40 Axiom 3 (cls_Zorn_Omaxchain__Zorn_0): fresh5(X, X, Y, Z, W) = Y.
% 0.20/0.40 Axiom 4 (cls_Zorn_Omaxchain__Zorn_0): fresh3(X, X, Y, Z, W, V) = c_Union(V, W).
% 0.20/0.40 Axiom 5 (cls_conjecture_2): c_in(c_Union(v_c, t_a), v_S, tc_set(t_a)) = true2.
% 0.20/0.40 Axiom 6 (cls_conjecture_4): fresh(c_in(X, v_S, tc_set(t_a)), true2, X) = c_lessequals(X, v_x(X), tc_set(t_a)).
% 0.20/0.40 Axiom 7 (cls_conjecture_3): fresh2(c_in(X, v_S, tc_set(t_a)), true2, X) = c_in(v_x(X), v_S, tc_set(t_a)).
% 0.20/0.40 Axiom 8 (cls_conjecture_0): c_in(v_c, c_Zorn_Omaxchain(v_S, t_a), tc_set(tc_set(t_a))) = true2.
% 0.20/0.40 Axiom 9 (cls_Zorn_Omaxchain__Zorn_0): fresh4(X, X, Y, Z, W, V) = fresh5(c_in(Y, Z, tc_set(W)), true2, Y, W, V).
% 0.20/0.40 Axiom 10 (cls_Zorn_Omaxchain__Zorn_0): fresh4(c_lessequals(c_Union(X, Y), Z, tc_set(Y)), true2, Z, W, Y, X) = fresh3(c_in(X, c_Zorn_Omaxchain(W, Y), tc_set(tc_set(Y))), true2, Z, W, Y, X).
% 0.20/0.40
% 0.20/0.40 Goal 1 (cls_conjecture_5): tuple(X, c_in(X, v_S, tc_set(t_a))) = tuple(v_x(X), true2).
% 0.20/0.40 The goal is true when:
% 0.20/0.40 X = c_Union(v_c, t_a)
% 0.20/0.40
% 0.20/0.40 Proof:
% 0.20/0.40 tuple(c_Union(v_c, t_a), c_in(c_Union(v_c, t_a), v_S, tc_set(t_a)))
% 0.20/0.40 = { by axiom 5 (cls_conjecture_2) }
% 0.20/0.40 tuple(c_Union(v_c, t_a), true2)
% 0.20/0.40 = { by axiom 4 (cls_Zorn_Omaxchain__Zorn_0) R->L }
% 0.20/0.40 tuple(fresh3(true2, true2, v_x(c_Union(v_c, t_a)), v_S, t_a, v_c), true2)
% 0.20/0.40 = { by axiom 8 (cls_conjecture_0) R->L }
% 0.20/0.40 tuple(fresh3(c_in(v_c, c_Zorn_Omaxchain(v_S, t_a), tc_set(tc_set(t_a))), true2, v_x(c_Union(v_c, t_a)), v_S, t_a, v_c), true2)
% 0.20/0.40 = { by axiom 10 (cls_Zorn_Omaxchain__Zorn_0) R->L }
% 0.20/0.40 tuple(fresh4(c_lessequals(c_Union(v_c, t_a), v_x(c_Union(v_c, t_a)), tc_set(t_a)), true2, v_x(c_Union(v_c, t_a)), v_S, t_a, v_c), true2)
% 0.20/0.40 = { by axiom 6 (cls_conjecture_4) R->L }
% 0.20/0.41 tuple(fresh4(fresh(c_in(c_Union(v_c, t_a), v_S, tc_set(t_a)), true2, c_Union(v_c, t_a)), true2, v_x(c_Union(v_c, t_a)), v_S, t_a, v_c), true2)
% 0.20/0.41 = { by axiom 5 (cls_conjecture_2) }
% 0.20/0.41 tuple(fresh4(fresh(true2, true2, c_Union(v_c, t_a)), true2, v_x(c_Union(v_c, t_a)), v_S, t_a, v_c), true2)
% 0.20/0.41 = { by axiom 1 (cls_conjecture_4) }
% 0.20/0.41 tuple(fresh4(true2, true2, v_x(c_Union(v_c, t_a)), v_S, t_a, v_c), true2)
% 0.20/0.41 = { by axiom 9 (cls_Zorn_Omaxchain__Zorn_0) }
% 0.20/0.41 tuple(fresh5(c_in(v_x(c_Union(v_c, t_a)), v_S, tc_set(t_a)), true2, v_x(c_Union(v_c, t_a)), t_a, v_c), true2)
% 0.20/0.41 = { by axiom 7 (cls_conjecture_3) R->L }
% 0.20/0.41 tuple(fresh5(fresh2(c_in(c_Union(v_c, t_a), v_S, tc_set(t_a)), true2, c_Union(v_c, t_a)), true2, v_x(c_Union(v_c, t_a)), t_a, v_c), true2)
% 0.20/0.41 = { by axiom 5 (cls_conjecture_2) }
% 0.20/0.41 tuple(fresh5(fresh2(true2, true2, c_Union(v_c, t_a)), true2, v_x(c_Union(v_c, t_a)), t_a, v_c), true2)
% 0.20/0.41 = { by axiom 2 (cls_conjecture_3) }
% 0.20/0.41 tuple(fresh5(true2, true2, v_x(c_Union(v_c, t_a)), t_a, v_c), true2)
% 0.20/0.41 = { by axiom 3 (cls_Zorn_Omaxchain__Zorn_0) }
% 0.20/0.41 tuple(v_x(c_Union(v_c, t_a)), true2)
% 0.20/0.41 % SZS output end Proof
% 0.20/0.41
% 0.20/0.41 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------