TSTP Solution File: GEO585+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : GEO585+1 : TPTP v8.1.2. Released v7.5.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 : n007.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 23:29:25 EDT 2023
% Result : Theorem 4.33s 0.92s
% Output : Proof 4.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GEO585+1 : TPTP v8.1.2. Released v7.5.0.
% 0.11/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 : n007.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 29 19:52:43 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.33/0.92 Command-line arguments: --no-flatten-goal
% 4.33/0.92
% 4.33/0.92 % SZS status Theorem
% 4.33/0.92
% 4.57/0.93 % SZS output start Proof
% 4.57/0.93 Take the following subset of the input axioms:
% 4.57/0.94 fof(exemplo6GDDFULL416047, conjecture, ![A, B, C, D, O, U, V, NWPNT1]: ((circle(O, A, B, C) & (circle(O, A, D, NWPNT1) & (perp(A, B, D, U) & (perp(A, D, B, U) & (perp(B, D, A, U) & (perp(A, C, D, V) & (perp(A, D, C, V) & perp(C, D, A, V)))))))) => cyclic(A, U, D, V))).
% 4.57/0.94 fof(ruleD1, axiom, ![A2, B2, C2]: (coll(A2, B2, C2) => coll(A2, C2, B2))).
% 4.57/0.94 fof(ruleD17, axiom, ![E, B2, C2, D2, A2_2]: ((cyclic(A2_2, B2, C2, D2) & cyclic(A2_2, B2, C2, E)) => cyclic(B2, C2, D2, E))).
% 4.57/0.94 fof(ruleD19, axiom, ![P, Q, B2, C2, D2, A2_2, U2, V2]: (eqangle(A2_2, B2, C2, D2, P, Q, U2, V2) => eqangle(C2, D2, A2_2, B2, U2, V2, P, Q))).
% 4.57/0.94 fof(ruleD2, axiom, ![B2, C2, A2_2]: (coll(A2_2, B2, C2) => coll(B2, A2_2, C2))).
% 4.57/0.94 fof(ruleD21, axiom, ![B2, C2, D2, A2_2, P2, Q2, U2, V2]: (eqangle(A2_2, B2, C2, D2, P2, Q2, U2, V2) => eqangle(A2_2, B2, P2, Q2, C2, D2, U2, V2))).
% 4.57/0.94 fof(ruleD3, axiom, ![B2, C2, D2, A2_2]: ((coll(A2_2, B2, C2) & coll(A2_2, B2, D2)) => coll(C2, D2, A2_2))).
% 4.57/0.94 fof(ruleD39, axiom, ![B2, C2, D2, A2_2, P2, Q2]: (eqangle(A2_2, B2, P2, Q2, C2, D2, P2, Q2) => para(A2_2, B2, C2, D2))).
% 4.57/0.94 fof(ruleD40, axiom, ![B2, C2, D2, A2_2, P2, Q2]: (para(A2_2, B2, C2, D2) => eqangle(A2_2, B2, P2, Q2, C2, D2, P2, Q2))).
% 4.57/0.94 fof(ruleD42b, axiom, ![B2, A2_2, P2, Q2]: ((eqangle(P2, A2_2, P2, B2, Q2, A2_2, Q2, B2) & coll(P2, Q2, B2)) => cyclic(A2_2, B2, P2, Q2))).
% 4.57/0.94 fof(ruleD66, axiom, ![B2, C2, A2_2]: (para(A2_2, B2, A2_2, C2) => coll(A2_2, B2, C2))).
% 4.57/0.94 fof(ruleD8, axiom, ![B2, C2, D2, A2_2]: (perp(A2_2, B2, C2, D2) => perp(C2, D2, A2_2, B2))).
% 4.57/0.94 fof(ruleD9, axiom, ![F, B2, C2, D2, E2, A2_2]: ((perp(A2_2, B2, C2, D2) & perp(C2, D2, E2, F)) => para(A2_2, B2, E2, F))).
% 4.57/0.94
% 4.57/0.94 Now clausify the problem and encode Horn clauses using encoding 3 of
% 4.57/0.94 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 4.57/0.94 We repeatedly replace C & s=t => u=v by the two clauses:
% 4.57/0.94 fresh(y, y, x1...xn) = u
% 4.57/0.94 C => fresh(s, t, x1...xn) = v
% 4.57/0.94 where fresh is a fresh function symbol and x1..xn are the free
% 4.57/0.94 variables of u and v.
% 4.57/0.94 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 4.57/0.94 input problem has no model of domain size 1).
% 4.57/0.94
% 4.57/0.94 The encoding turns the above axioms into the following unit equations and goals:
% 4.57/0.94
% 4.57/0.94 Axiom 1 (exemplo6GDDFULL416047_4): perp(c, d, a, v) = true.
% 4.57/0.94 Axiom 2 (ruleD1): fresh146(X, X, Y, Z, W) = true.
% 4.57/0.94 Axiom 3 (ruleD2): fresh133(X, X, Y, Z, W) = true.
% 4.57/0.94 Axiom 4 (ruleD3): fresh119(X, X, Y, Z, W) = true.
% 4.57/0.94 Axiom 5 (ruleD66): fresh66(X, X, Y, Z, W) = true.
% 4.57/0.94 Axiom 6 (ruleD17): fresh136(X, X, Y, Z, W, V) = true.
% 4.57/0.94 Axiom 7 (ruleD3): fresh120(X, X, Y, Z, W, V) = coll(W, V, Y).
% 4.57/0.94 Axiom 8 (ruleD39): fresh106(X, X, Y, Z, W, V) = true.
% 4.57/0.94 Axiom 9 (ruleD42b): fresh102(X, X, Y, Z, W, V) = cyclic(Y, Z, W, V).
% 4.57/0.94 Axiom 10 (ruleD42b): fresh101(X, X, Y, Z, W, V) = true.
% 4.57/0.94 Axiom 11 (ruleD8): fresh52(X, X, Y, Z, W, V) = true.
% 4.57/0.94 Axiom 12 (ruleD9): fresh50(X, X, Y, Z, W, V) = true.
% 4.57/0.94 Axiom 13 (ruleD17): fresh137(X, X, Y, Z, W, V, U) = cyclic(Z, W, V, U).
% 4.57/0.94 Axiom 14 (ruleD1): fresh146(coll(X, Y, Z), true, X, Y, Z) = coll(X, Z, Y).
% 4.57/0.94 Axiom 15 (ruleD2): fresh133(coll(X, Y, Z), true, X, Y, Z) = coll(Y, X, Z).
% 4.57/0.94 Axiom 16 (ruleD40): fresh104(X, X, Y, Z, W, V, U, T) = true.
% 4.57/0.94 Axiom 17 (ruleD9): fresh51(X, X, Y, Z, W, V, U, T) = para(Y, Z, U, T).
% 4.57/0.94 Axiom 18 (ruleD3): fresh120(coll(X, Y, Z), true, X, Y, W, Z) = fresh119(coll(X, Y, W), true, X, W, Z).
% 4.57/0.94 Axiom 19 (ruleD66): fresh66(para(X, Y, X, Z), true, X, Y, Z) = coll(X, Y, Z).
% 4.57/0.94 Axiom 20 (ruleD19): fresh134(X, X, Y, Z, W, V, U, T, S, X2) = true.
% 4.57/0.94 Axiom 21 (ruleD21): fresh131(X, X, Y, Z, W, V, U, T, S, X2) = true.
% 4.57/0.94 Axiom 22 (ruleD8): fresh52(perp(X, Y, Z, W), true, X, Y, Z, W) = perp(Z, W, X, Y).
% 4.57/0.94 Axiom 23 (ruleD17): fresh137(cyclic(X, Y, Z, W), true, X, Y, Z, V, W) = fresh136(cyclic(X, Y, Z, V), true, Y, Z, V, W).
% 4.57/0.94 Axiom 24 (ruleD40): fresh104(para(X, Y, Z, W), true, X, Y, Z, W, V, U) = eqangle(X, Y, V, U, Z, W, V, U).
% 4.57/0.94 Axiom 25 (ruleD9): fresh51(perp(X, Y, Z, W), true, V, U, X, Y, Z, W) = fresh50(perp(V, U, X, Y), true, V, U, Z, W).
% 4.57/0.94 Axiom 26 (ruleD39): fresh106(eqangle(X, Y, Z, W, V, U, Z, W), true, X, Y, V, U) = para(X, Y, V, U).
% 4.57/0.94 Axiom 27 (ruleD42b): fresh102(eqangle(X, Y, X, Z, W, Y, W, Z), true, Y, Z, X, W) = fresh101(coll(X, W, Z), true, Y, Z, X, W).
% 4.57/0.94 Axiom 28 (ruleD19): fresh134(eqangle(X, Y, Z, W, V, U, T, S), true, X, Y, Z, W, V, U, T, S) = eqangle(Z, W, X, Y, T, S, V, U).
% 4.57/0.94 Axiom 29 (ruleD21): fresh131(eqangle(X, Y, Z, W, V, U, T, S), true, X, Y, Z, W, V, U, T, S) = eqangle(X, Y, V, U, Z, W, T, S).
% 4.57/0.94
% 4.57/0.94 Lemma 30: eqangle(a, v, X, Y, a, v, X, Y) = true.
% 4.57/0.94 Proof:
% 4.57/0.94 eqangle(a, v, X, Y, a, v, X, Y)
% 4.57/0.94 = { by axiom 24 (ruleD40) R->L }
% 4.57/0.94 fresh104(para(a, v, a, v), true, a, v, a, v, X, Y)
% 4.57/0.94 = { by axiom 17 (ruleD9) R->L }
% 4.57/0.94 fresh104(fresh51(true, true, a, v, c, d, a, v), true, a, v, a, v, X, Y)
% 4.57/0.94 = { by axiom 1 (exemplo6GDDFULL416047_4) R->L }
% 4.57/0.94 fresh104(fresh51(perp(c, d, a, v), true, a, v, c, d, a, v), true, a, v, a, v, X, Y)
% 4.57/0.94 = { by axiom 25 (ruleD9) }
% 4.57/0.94 fresh104(fresh50(perp(a, v, c, d), true, a, v, a, v), true, a, v, a, v, X, Y)
% 4.57/0.94 = { by axiom 22 (ruleD8) R->L }
% 4.57/0.94 fresh104(fresh50(fresh52(perp(c, d, a, v), true, c, d, a, v), true, a, v, a, v), true, a, v, a, v, X, Y)
% 4.57/0.94 = { by axiom 1 (exemplo6GDDFULL416047_4) }
% 4.57/0.94 fresh104(fresh50(fresh52(true, true, c, d, a, v), true, a, v, a, v), true, a, v, a, v, X, Y)
% 4.57/0.94 = { by axiom 11 (ruleD8) }
% 4.57/0.94 fresh104(fresh50(true, true, a, v, a, v), true, a, v, a, v, X, Y)
% 4.57/0.94 = { by axiom 12 (ruleD9) }
% 4.57/0.94 fresh104(true, true, a, v, a, v, X, Y)
% 4.57/0.94 = { by axiom 16 (ruleD40) }
% 4.57/0.94 true
% 4.57/0.94
% 4.57/0.94 Lemma 31: coll(X, X, Y) = true.
% 4.57/0.94 Proof:
% 4.57/0.94 coll(X, X, Y)
% 4.57/0.94 = { by axiom 14 (ruleD1) R->L }
% 4.57/0.94 fresh146(coll(X, Y, X), true, X, Y, X)
% 4.57/0.94 = { by axiom 15 (ruleD2) R->L }
% 4.57/0.94 fresh146(fresh133(coll(Y, X, X), true, Y, X, X), true, X, Y, X)
% 4.57/0.94 = { by axiom 19 (ruleD66) R->L }
% 4.57/0.94 fresh146(fresh133(fresh66(para(Y, X, Y, X), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 4.57/0.94 = { by axiom 26 (ruleD39) R->L }
% 4.57/0.94 fresh146(fresh133(fresh66(fresh106(eqangle(Y, X, a, v, Y, X, a, v), true, Y, X, Y, X), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 4.57/0.94 = { by axiom 28 (ruleD19) R->L }
% 4.57/0.94 fresh146(fresh133(fresh66(fresh106(fresh134(eqangle(a, v, Y, X, a, v, Y, X), true, a, v, Y, X, a, v, Y, X), true, Y, X, Y, X), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 4.57/0.94 = { by lemma 30 }
% 4.57/0.94 fresh146(fresh133(fresh66(fresh106(fresh134(true, true, a, v, Y, X, a, v, Y, X), true, Y, X, Y, X), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 4.57/0.94 = { by axiom 20 (ruleD19) }
% 4.57/0.94 fresh146(fresh133(fresh66(fresh106(true, true, Y, X, Y, X), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 4.57/0.94 = { by axiom 8 (ruleD39) }
% 4.57/0.94 fresh146(fresh133(fresh66(true, true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 4.57/0.94 = { by axiom 5 (ruleD66) }
% 4.57/0.94 fresh146(fresh133(true, true, Y, X, X), true, X, Y, X)
% 4.57/0.94 = { by axiom 3 (ruleD2) }
% 4.57/0.94 fresh146(true, true, X, Y, X)
% 4.57/0.94 = { by axiom 2 (ruleD1) }
% 4.57/0.94 true
% 4.57/0.94
% 4.57/0.94 Lemma 32: cyclic(v, v, a, X) = true.
% 4.57/0.94 Proof:
% 4.57/0.94 cyclic(v, v, a, X)
% 4.57/0.94 = { by axiom 9 (ruleD42b) R->L }
% 4.57/0.94 fresh102(true, true, v, v, a, X)
% 4.57/0.94 = { by axiom 21 (ruleD21) R->L }
% 4.57/0.94 fresh102(fresh131(true, true, a, v, X, v, a, v, X, v), true, v, v, a, X)
% 4.57/0.94 = { by lemma 30 R->L }
% 4.57/0.94 fresh102(fresh131(eqangle(a, v, X, v, a, v, X, v), true, a, v, X, v, a, v, X, v), true, v, v, a, X)
% 4.57/0.94 = { by axiom 29 (ruleD21) }
% 4.57/0.94 fresh102(eqangle(a, v, a, v, X, v, X, v), true, v, v, a, X)
% 4.57/0.94 = { by axiom 27 (ruleD42b) }
% 4.57/0.94 fresh101(coll(a, X, v), true, v, v, a, X)
% 4.57/0.94 = { by axiom 7 (ruleD3) R->L }
% 4.57/0.94 fresh101(fresh120(true, true, v, v, a, X), true, v, v, a, X)
% 4.57/0.94 = { by lemma 31 R->L }
% 4.57/0.94 fresh101(fresh120(coll(v, v, X), true, v, v, a, X), true, v, v, a, X)
% 4.57/0.94 = { by axiom 18 (ruleD3) }
% 4.57/0.94 fresh101(fresh119(coll(v, v, a), true, v, a, X), true, v, v, a, X)
% 4.57/0.94 = { by lemma 31 }
% 4.57/0.94 fresh101(fresh119(true, true, v, a, X), true, v, v, a, X)
% 4.57/0.94 = { by axiom 4 (ruleD3) }
% 4.57/0.94 fresh101(true, true, v, v, a, X)
% 4.57/0.94 = { by axiom 10 (ruleD42b) }
% 4.57/0.94 true
% 4.57/0.94
% 4.57/0.94 Lemma 33: cyclic(v, a, X, Y) = true.
% 4.57/0.94 Proof:
% 4.57/0.94 cyclic(v, a, X, Y)
% 4.57/0.94 = { by axiom 13 (ruleD17) R->L }
% 4.57/0.94 fresh137(true, true, v, v, a, X, Y)
% 4.57/0.94 = { by lemma 32 R->L }
% 4.57/0.94 fresh137(cyclic(v, v, a, Y), true, v, v, a, X, Y)
% 4.57/0.94 = { by axiom 23 (ruleD17) }
% 4.57/0.94 fresh136(cyclic(v, v, a, X), true, v, a, X, Y)
% 4.57/0.94 = { by lemma 32 }
% 4.57/0.94 fresh136(true, true, v, a, X, Y)
% 4.57/0.94 = { by axiom 6 (ruleD17) }
% 4.57/0.94 true
% 4.57/0.94
% 4.57/0.94 Goal 1 (exemplo6GDDFULL416047_8): cyclic(a, u, d, v) = true.
% 4.57/0.94 Proof:
% 4.57/0.94 cyclic(a, u, d, v)
% 4.57/0.94 = { by axiom 13 (ruleD17) R->L }
% 4.57/0.94 fresh137(true, true, v, a, u, d, v)
% 4.57/0.94 = { by lemma 33 R->L }
% 4.57/0.94 fresh137(cyclic(v, a, u, v), true, v, a, u, d, v)
% 4.57/0.94 = { by axiom 23 (ruleD17) }
% 4.57/0.94 fresh136(cyclic(v, a, u, d), true, a, u, d, v)
% 4.57/0.94 = { by lemma 33 }
% 4.57/0.94 fresh136(true, true, a, u, d, v)
% 4.57/0.94 = { by axiom 6 (ruleD17) }
% 4.57/0.94 true
% 4.57/0.94 % SZS output end Proof
% 4.57/0.94
% 4.57/0.94 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------