TSTP Solution File: SET849-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SET849-1 : 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 : n028.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:30 EDT 2023
% Result : Unsatisfiable 51.32s 6.98s
% Output : Proof 51.32s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET849-1 : TPTP v8.1.2. Released v3.2.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 : n028.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 : Sat Aug 26 15:37:52 EDT 2023
% 0.13/0.34 % CPUTime :
% 51.32/6.98 Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 51.32/6.98
% 51.32/6.98 % SZS status Unsatisfiable
% 51.32/6.98
% 51.32/6.99 % SZS output start Proof
% 51.32/6.99 Take the following subset of the input axioms:
% 51.32/6.99 fof(cls_Set_Osubset__refl_0, axiom, ![T_a, V_A]: c_lessequals(V_A, V_A, tc_set(T_a))).
% 51.32/6.99 fof(cls_Zorn_OTFin__UnionI_0, axiom, ![V_S, V_Y, T_a2]: (~c_lessequals(V_Y, c_Zorn_OTFin(V_S, T_a2), tc_set(tc_set(tc_set(T_a2)))) | c_in(c_Union(V_Y, tc_set(T_a2)), c_Zorn_OTFin(V_S, T_a2), tc_set(tc_set(T_a2))))).
% 51.32/6.99 fof(cls_Zorn_Oequal__succ__Union_1, axiom, ![T_a2, V_S2]: (~c_in(c_Union(c_Zorn_OTFin(V_S2, T_a2), tc_set(T_a2)), c_Zorn_OTFin(V_S2, T_a2), tc_set(tc_set(T_a2))) | c_Union(c_Zorn_OTFin(V_S2, T_a2), tc_set(T_a2))=c_Zorn_Osucc(V_S2, c_Union(c_Zorn_OTFin(V_S2, T_a2), tc_set(T_a2)), T_a2))).
% 51.32/6.99 fof(cls_conjecture_1, negated_conjecture, c_Zorn_Osucc(v_S, c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), t_a)!=c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a))).
% 51.32/6.99
% 51.32/6.99 Now clausify the problem and encode Horn clauses using encoding 3 of
% 51.32/6.99 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 51.32/6.99 We repeatedly replace C & s=t => u=v by the two clauses:
% 51.32/6.99 fresh(y, y, x1...xn) = u
% 51.32/6.99 C => fresh(s, t, x1...xn) = v
% 51.32/6.99 where fresh is a fresh function symbol and x1..xn are the free
% 51.32/6.99 variables of u and v.
% 51.32/6.99 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 51.32/6.99 input problem has no model of domain size 1).
% 51.32/6.99
% 51.32/6.99 The encoding turns the above axioms into the following unit equations and goals:
% 51.32/6.99
% 51.32/6.99 Axiom 1 (cls_Set_Osubset__refl_0): c_lessequals(X, X, tc_set(Y)) = true2.
% 51.32/6.99 Axiom 2 (cls_Zorn_Oequal__succ__Union_1): fresh970(X, X, Y, Z) = c_Union(c_Zorn_OTFin(Y, Z), tc_set(Z)).
% 51.32/6.99 Axiom 3 (cls_Zorn_OTFin__UnionI_0): fresh973(X, X, Y, Z, W) = true2.
% 51.32/6.99 Axiom 4 (cls_Zorn_OTFin__UnionI_0): fresh973(c_lessequals(X, c_Zorn_OTFin(Y, Z), tc_set(tc_set(tc_set(Z)))), true2, X, Y, Z) = c_in(c_Union(X, tc_set(Z)), c_Zorn_OTFin(Y, Z), tc_set(tc_set(Z))).
% 51.32/6.99 Axiom 5 (cls_Zorn_Oequal__succ__Union_1): fresh970(c_in(c_Union(c_Zorn_OTFin(X, Y), tc_set(Y)), c_Zorn_OTFin(X, Y), tc_set(tc_set(Y))), true2, X, Y) = c_Zorn_Osucc(X, c_Union(c_Zorn_OTFin(X, Y), tc_set(Y)), Y).
% 51.32/6.99
% 51.32/6.99 Goal 1 (cls_conjecture_1): c_Zorn_Osucc(v_S, c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), t_a) = c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)).
% 51.32/6.99 Proof:
% 51.32/6.99 c_Zorn_Osucc(v_S, c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), t_a)
% 51.32/6.99 = { by axiom 5 (cls_Zorn_Oequal__succ__Union_1) R->L }
% 51.32/6.99 fresh970(c_in(c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a)), c_Zorn_OTFin(v_S, t_a), tc_set(tc_set(t_a))), true2, v_S, t_a)
% 51.32/6.99 = { by axiom 4 (cls_Zorn_OTFin__UnionI_0) R->L }
% 51.32/6.99 fresh970(fresh973(c_lessequals(c_Zorn_OTFin(v_S, t_a), c_Zorn_OTFin(v_S, t_a), tc_set(tc_set(tc_set(t_a)))), true2, c_Zorn_OTFin(v_S, t_a), v_S, t_a), true2, v_S, t_a)
% 51.32/6.99 = { by axiom 1 (cls_Set_Osubset__refl_0) }
% 51.32/6.99 fresh970(fresh973(true2, true2, c_Zorn_OTFin(v_S, t_a), v_S, t_a), true2, v_S, t_a)
% 51.32/6.99 = { by axiom 3 (cls_Zorn_OTFin__UnionI_0) }
% 51.32/6.99 fresh970(true2, true2, v_S, t_a)
% 51.32/6.99 = { by axiom 2 (cls_Zorn_Oequal__succ__Union_1) }
% 51.32/6.99 c_Union(c_Zorn_OTFin(v_S, t_a), tc_set(t_a))
% 51.32/6.99 % SZS output end Proof
% 51.32/6.99
% 51.32/6.99 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------