TSTP Solution File: GEO569+1 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : GEO569+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 : n019.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:21 EDT 2023

% Result   : Theorem 9.84s 1.62s
% Output   : Proof 10.27s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GEO569+1 : TPTP v8.1.2. Released v7.5.0.
% 0.07/0.14  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.13/0.35  % Computer : n019.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.20/0.35  % CPULimit : 300
% 0.20/0.35  % WCLimit  : 300
% 0.20/0.35  % DateTime : Tue Aug 29 23:47:42 EDT 2023
% 0.20/0.35  % CPUTime  : 
% 9.84/1.62  Command-line arguments: --ground-connectedness --complete-subsets
% 9.84/1.62  
% 9.84/1.62  % SZS status Theorem
% 9.84/1.62  
% 9.84/1.66  % SZS output start Proof
% 9.84/1.66  Take the following subset of the input axioms:
% 10.27/1.67    fof(exemplo6GDDFULL214031, conjecture, ![A, B, C, O, P, Q, C1, B1]: ((circle(O, A, B, C) & (midp(C1, B, A) & (midp(B1, C, A) & (coll(P, O, C1) & (coll(P, A, C) & (coll(Q, O, B1) & coll(Q, A, B))))))) => cyclic(Q, B, C, P))).
% 10.27/1.67    fof(ruleD1, axiom, ![A2, B2, C2]: (coll(A2, B2, C2) => coll(A2, C2, B2))).
% 10.27/1.67    fof(ruleD11, axiom, ![M, B2, A2_2]: (midp(M, B2, A2_2) => midp(M, A2_2, B2))).
% 10.27/1.67    fof(ruleD17, axiom, ![D, E, B2, C2, A2_2]: ((cyclic(A2_2, B2, C2, D) & cyclic(A2_2, B2, C2, E)) => cyclic(B2, C2, D, E))).
% 10.27/1.67    fof(ruleD19, axiom, ![U, V, B2, C2, D2, P2, Q2, A2_2]: (eqangle(A2_2, B2, C2, D2, P2, Q2, U, V) => eqangle(C2, D2, A2_2, B2, U, V, P2, Q2))).
% 10.27/1.67    fof(ruleD2, axiom, ![B2, C2, A2_2]: (coll(A2_2, B2, C2) => coll(B2, A2_2, C2))).
% 10.27/1.67    fof(ruleD21, axiom, ![B2, C2, D2, P2, Q2, U2, V2, A2_2]: (eqangle(A2_2, B2, C2, D2, P2, Q2, U2, V2) => eqangle(A2_2, B2, P2, Q2, C2, D2, U2, V2))).
% 10.27/1.67    fof(ruleD3, axiom, ![B2, C2, D2, A2_2]: ((coll(A2_2, B2, C2) & coll(A2_2, B2, D2)) => coll(C2, D2, A2_2))).
% 10.27/1.67    fof(ruleD4, axiom, ![B2, C2, D2, A2_2]: (para(A2_2, B2, C2, D2) => para(A2_2, B2, D2, C2))).
% 10.27/1.67    fof(ruleD40, axiom, ![B2, C2, D2, P2, Q2, A2_2]: (para(A2_2, B2, C2, D2) => eqangle(A2_2, B2, P2, Q2, C2, D2, P2, Q2))).
% 10.27/1.67    fof(ruleD42b, axiom, ![B2, P2, Q2, A2_2]: ((eqangle(P2, A2_2, P2, B2, Q2, A2_2, Q2, B2) & coll(P2, Q2, B2)) => cyclic(A2_2, B2, P2, Q2))).
% 10.27/1.67    fof(ruleD44, axiom, ![F, B2, C2, A2_2, E2]: ((midp(E2, A2_2, B2) & midp(F, A2_2, C2)) => para(E2, F, B2, C2))).
% 10.27/1.67    fof(ruleD63, axiom, ![B2, C2, D2, A2_2, M2]: ((midp(M2, A2_2, B2) & midp(M2, C2, D2)) => para(A2_2, C2, B2, D2))).
% 10.27/1.67    fof(ruleD66, axiom, ![B2, C2, A2_2]: (para(A2_2, B2, A2_2, C2) => coll(A2_2, B2, C2))).
% 10.27/1.67    fof(ruleD73, axiom, ![B2, C2, D2, P2, Q2, U2, V2, A2_2]: ((eqangle(A2_2, B2, C2, D2, P2, Q2, U2, V2) & para(P2, Q2, U2, V2)) => para(A2_2, B2, C2, D2))).
% 10.27/1.67  
% 10.27/1.67  Now clausify the problem and encode Horn clauses using encoding 3 of
% 10.27/1.67  http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 10.27/1.67  We repeatedly replace C & s=t => u=v by the two clauses:
% 10.27/1.67    fresh(y, y, x1...xn) = u
% 10.27/1.67    C => fresh(s, t, x1...xn) = v
% 10.27/1.67  where fresh is a fresh function symbol and x1..xn are the free
% 10.27/1.67  variables of u and v.
% 10.27/1.67  A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 10.27/1.67  input problem has no model of domain size 1).
% 10.27/1.67  
% 10.27/1.67  The encoding turns the above axioms into the following unit equations and goals:
% 10.27/1.67  
% 10.27/1.67  Axiom 1 (exemplo6GDDFULL214031_4): midp(c1, b, a) = true.
% 10.27/1.67  Axiom 2 (ruleD1): fresh146(X, X, Y, Z, W) = true.
% 10.27/1.67  Axiom 3 (ruleD11): fresh144(X, X, Y, Z, W) = true.
% 10.27/1.67  Axiom 4 (ruleD2): fresh133(X, X, Y, Z, W) = true.
% 10.27/1.67  Axiom 5 (ruleD3): fresh119(X, X, Y, Z, W) = true.
% 10.27/1.67  Axiom 6 (ruleD66): fresh66(X, X, Y, Z, W) = true.
% 10.27/1.67  Axiom 7 (ruleD17): fresh136(X, X, Y, Z, W, V) = true.
% 10.27/1.67  Axiom 8 (ruleD3): fresh120(X, X, Y, Z, W, V) = coll(W, V, Y).
% 10.27/1.67  Axiom 9 (ruleD4): fresh105(X, X, Y, Z, W, V) = true.
% 10.27/1.67  Axiom 10 (ruleD42b): fresh102(X, X, Y, Z, W, V) = cyclic(Y, Z, W, V).
% 10.27/1.67  Axiom 11 (ruleD42b): fresh101(X, X, Y, Z, W, V) = true.
% 10.27/1.67  Axiom 12 (ruleD44): fresh99(X, X, Y, Z, W, V) = true.
% 10.27/1.67  Axiom 13 (ruleD63): fresh69(X, X, Y, Z, W, V) = true.
% 10.27/1.67  Axiom 14 (ruleD73): fresh57(X, X, Y, Z, W, V) = true.
% 10.27/1.67  Axiom 15 (ruleD17): fresh137(X, X, Y, Z, W, V, U) = cyclic(Z, W, V, U).
% 10.27/1.67  Axiom 16 (ruleD44): fresh100(X, X, Y, Z, W, V, U) = para(V, U, Z, W).
% 10.27/1.67  Axiom 17 (ruleD63): fresh70(X, X, Y, Z, W, V, U) = para(Y, W, Z, V).
% 10.27/1.67  Axiom 18 (ruleD1): fresh146(coll(X, Y, Z), true, X, Y, Z) = coll(X, Z, Y).
% 10.27/1.67  Axiom 19 (ruleD11): fresh144(midp(X, Y, Z), true, Z, Y, X) = midp(X, Z, Y).
% 10.27/1.67  Axiom 20 (ruleD2): fresh133(coll(X, Y, Z), true, X, Y, Z) = coll(Y, X, Z).
% 10.27/1.67  Axiom 21 (ruleD40): fresh104(X, X, Y, Z, W, V, U, T) = true.
% 10.27/1.67  Axiom 22 (ruleD3): fresh120(coll(X, Y, Z), true, X, Y, W, Z) = fresh119(coll(X, Y, W), true, X, W, Z).
% 10.27/1.67  Axiom 23 (ruleD66): fresh66(para(X, Y, X, Z), true, X, Y, Z) = coll(X, Y, Z).
% 10.27/1.67  Axiom 24 (ruleD19): fresh134(X, X, Y, Z, W, V, U, T, S, X2) = true.
% 10.27/1.67  Axiom 25 (ruleD21): fresh131(X, X, Y, Z, W, V, U, T, S, X2) = true.
% 10.27/1.67  Axiom 26 (ruleD4): fresh105(para(X, Y, Z, W), true, X, Y, Z, W) = para(X, Y, W, Z).
% 10.27/1.67  Axiom 27 (ruleD44): fresh100(midp(X, Y, Z), true, Y, W, Z, V, X) = fresh99(midp(V, Y, W), true, W, Z, V, X).
% 10.27/1.67  Axiom 28 (ruleD63): fresh70(midp(X, Y, Z), true, W, V, Y, Z, X) = fresh69(midp(X, W, V), true, W, V, Y, Z).
% 10.27/1.67  Axiom 29 (ruleD73): fresh58(X, X, Y, Z, W, V, U, T, S, X2) = para(Y, Z, W, V).
% 10.27/1.67  Axiom 30 (ruleD17): fresh137(cyclic(X, Y, Z, W), true, X, Y, Z, V, W) = fresh136(cyclic(X, Y, Z, V), true, Y, Z, V, W).
% 10.27/1.67  Axiom 31 (ruleD40): fresh104(para(X, Y, Z, W), true, X, Y, Z, W, V, U) = eqangle(X, Y, V, U, Z, W, V, U).
% 10.27/1.67  Axiom 32 (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).
% 10.27/1.67  Axiom 33 (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).
% 10.27/1.67  Axiom 34 (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).
% 10.27/1.67  Axiom 35 (ruleD73): fresh58(eqangle(X, Y, Z, W, V, U, T, S), true, X, Y, Z, W, V, U, T, S) = fresh57(para(V, U, T, S), true, X, Y, Z, W).
% 10.27/1.67  
% 10.27/1.67  Lemma 36: para(c1, c1, a, a) = true.
% 10.27/1.67  Proof:
% 10.27/1.67    para(c1, c1, a, a)
% 10.27/1.67  = { by axiom 16 (ruleD44) R->L }
% 10.27/1.67    fresh100(true, true, b, a, a, c1, c1)
% 10.27/1.67  = { by axiom 1 (exemplo6GDDFULL214031_4) R->L }
% 10.27/1.67    fresh100(midp(c1, b, a), true, b, a, a, c1, c1)
% 10.27/1.67  = { by axiom 27 (ruleD44) }
% 10.27/1.67    fresh99(midp(c1, b, a), true, a, a, c1, c1)
% 10.27/1.67  = { by axiom 1 (exemplo6GDDFULL214031_4) }
% 10.27/1.67    fresh99(true, true, a, a, c1, c1)
% 10.27/1.67  = { by axiom 12 (ruleD44) }
% 10.27/1.67    true
% 10.27/1.67  
% 10.27/1.67  Lemma 37: coll(X, X, Y) = true.
% 10.27/1.67  Proof:
% 10.27/1.67    coll(X, X, Y)
% 10.27/1.67  = { by axiom 18 (ruleD1) R->L }
% 10.27/1.67    fresh146(coll(X, Y, X), true, X, Y, X)
% 10.27/1.67  = { by axiom 20 (ruleD2) R->L }
% 10.27/1.67    fresh146(fresh133(coll(Y, X, X), true, Y, X, X), true, X, Y, X)
% 10.27/1.67  = { by axiom 23 (ruleD66) R->L }
% 10.27/1.67    fresh146(fresh133(fresh66(para(Y, X, Y, X), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 10.27/1.67  = { by axiom 29 (ruleD73) R->L }
% 10.27/1.67    fresh146(fresh133(fresh66(fresh58(true, true, Y, X, Y, X, c1, c1, a, a), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 10.27/1.67  = { by axiom 25 (ruleD21) R->L }
% 10.27/1.67    fresh146(fresh133(fresh66(fresh58(fresh131(true, true, Y, X, c1, c1, Y, X, a, a), true, Y, X, Y, X, c1, c1, a, a), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 10.27/1.67  = { by axiom 24 (ruleD19) R->L }
% 10.27/1.67    fresh146(fresh133(fresh66(fresh58(fresh131(fresh134(true, true, c1, c1, Y, X, a, a, Y, X), true, Y, X, c1, c1, Y, X, a, a), true, Y, X, Y, X, c1, c1, a, a), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 10.27/1.67  = { by axiom 21 (ruleD40) R->L }
% 10.27/1.67    fresh146(fresh133(fresh66(fresh58(fresh131(fresh134(fresh104(true, true, c1, c1, a, a, Y, X), true, c1, c1, Y, X, a, a, Y, X), true, Y, X, c1, c1, Y, X, a, a), true, Y, X, Y, X, c1, c1, a, a), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 10.27/1.67  = { by lemma 36 R->L }
% 10.27/1.67    fresh146(fresh133(fresh66(fresh58(fresh131(fresh134(fresh104(para(c1, c1, a, a), true, c1, c1, a, a, Y, X), true, c1, c1, Y, X, a, a, Y, X), true, Y, X, c1, c1, Y, X, a, a), true, Y, X, Y, X, c1, c1, a, a), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 10.27/1.68  = { by axiom 31 (ruleD40) }
% 10.27/1.68    fresh146(fresh133(fresh66(fresh58(fresh131(fresh134(eqangle(c1, c1, Y, X, a, a, Y, X), true, c1, c1, Y, X, a, a, Y, X), true, Y, X, c1, c1, Y, X, a, a), true, Y, X, Y, X, c1, c1, a, a), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 10.27/1.68  = { by axiom 33 (ruleD19) }
% 10.27/1.68    fresh146(fresh133(fresh66(fresh58(fresh131(eqangle(Y, X, c1, c1, Y, X, a, a), true, Y, X, c1, c1, Y, X, a, a), true, Y, X, Y, X, c1, c1, a, a), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 10.27/1.68  = { by axiom 34 (ruleD21) }
% 10.27/1.68    fresh146(fresh133(fresh66(fresh58(eqangle(Y, X, Y, X, c1, c1, a, a), true, Y, X, Y, X, c1, c1, a, a), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 10.27/1.68  = { by axiom 35 (ruleD73) }
% 10.27/1.68    fresh146(fresh133(fresh66(fresh57(para(c1, c1, a, a), true, Y, X, Y, X), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 10.27/1.68  = { by lemma 36 }
% 10.27/1.68    fresh146(fresh133(fresh66(fresh57(true, true, Y, X, Y, X), true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 10.27/1.68  = { by axiom 14 (ruleD73) }
% 10.27/1.68    fresh146(fresh133(fresh66(true, true, Y, X, X), true, Y, X, X), true, X, Y, X)
% 10.27/1.68  = { by axiom 6 (ruleD66) }
% 10.27/1.68    fresh146(fresh133(true, true, Y, X, X), true, X, Y, X)
% 10.27/1.68  = { by axiom 4 (ruleD2) }
% 10.27/1.68    fresh146(true, true, X, Y, X)
% 10.27/1.68  = { by axiom 2 (ruleD1) }
% 10.27/1.68    true
% 10.27/1.68  
% 10.27/1.68  Lemma 38: cyclic(b, b, a, X) = true.
% 10.27/1.68  Proof:
% 10.27/1.68    cyclic(b, b, a, X)
% 10.27/1.68  = { by axiom 10 (ruleD42b) R->L }
% 10.27/1.68    fresh102(true, true, b, b, a, X)
% 10.27/1.68  = { by axiom 25 (ruleD21) R->L }
% 10.27/1.68    fresh102(fresh131(true, true, a, b, X, b, a, b, X, b), true, b, b, a, X)
% 10.27/1.68  = { by axiom 21 (ruleD40) R->L }
% 10.27/1.68    fresh102(fresh131(fresh104(true, true, a, b, a, b, X, b), true, a, b, X, b, a, b, X, b), true, b, b, a, X)
% 10.27/1.68  = { by axiom 9 (ruleD4) R->L }
% 10.27/1.68    fresh102(fresh131(fresh104(fresh105(true, true, a, b, b, a), true, a, b, a, b, X, b), true, a, b, X, b, a, b, X, b), true, b, b, a, X)
% 10.27/1.68  = { by axiom 13 (ruleD63) R->L }
% 10.27/1.68    fresh102(fresh131(fresh104(fresh105(fresh69(true, true, a, b, b, a), true, a, b, b, a), true, a, b, a, b, X, b), true, a, b, X, b, a, b, X, b), true, b, b, a, X)
% 10.27/1.68  = { by axiom 3 (ruleD11) R->L }
% 10.27/1.68    fresh102(fresh131(fresh104(fresh105(fresh69(fresh144(true, true, a, b, c1), true, a, b, b, a), true, a, b, b, a), true, a, b, a, b, X, b), true, a, b, X, b, a, b, X, b), true, b, b, a, X)
% 10.27/1.68  = { by axiom 1 (exemplo6GDDFULL214031_4) R->L }
% 10.27/1.68    fresh102(fresh131(fresh104(fresh105(fresh69(fresh144(midp(c1, b, a), true, a, b, c1), true, a, b, b, a), true, a, b, b, a), true, a, b, a, b, X, b), true, a, b, X, b, a, b, X, b), true, b, b, a, X)
% 10.27/1.68  = { by axiom 19 (ruleD11) }
% 10.27/1.68    fresh102(fresh131(fresh104(fresh105(fresh69(midp(c1, a, b), true, a, b, b, a), true, a, b, b, a), true, a, b, a, b, X, b), true, a, b, X, b, a, b, X, b), true, b, b, a, X)
% 10.27/1.68  = { by axiom 28 (ruleD63) R->L }
% 10.27/1.68    fresh102(fresh131(fresh104(fresh105(fresh70(midp(c1, b, a), true, a, b, b, a, c1), true, a, b, b, a), true, a, b, a, b, X, b), true, a, b, X, b, a, b, X, b), true, b, b, a, X)
% 10.27/1.68  = { by axiom 1 (exemplo6GDDFULL214031_4) }
% 10.27/1.68    fresh102(fresh131(fresh104(fresh105(fresh70(true, true, a, b, b, a, c1), true, a, b, b, a), true, a, b, a, b, X, b), true, a, b, X, b, a, b, X, b), true, b, b, a, X)
% 10.27/1.68  = { by axiom 17 (ruleD63) }
% 10.27/1.68    fresh102(fresh131(fresh104(fresh105(para(a, b, b, a), true, a, b, b, a), true, a, b, a, b, X, b), true, a, b, X, b, a, b, X, b), true, b, b, a, X)
% 10.27/1.68  = { by axiom 26 (ruleD4) }
% 10.27/1.68    fresh102(fresh131(fresh104(para(a, b, a, b), true, a, b, a, b, X, b), true, a, b, X, b, a, b, X, b), true, b, b, a, X)
% 10.27/1.68  = { by axiom 31 (ruleD40) }
% 10.27/1.68    fresh102(fresh131(eqangle(a, b, X, b, a, b, X, b), true, a, b, X, b, a, b, X, b), true, b, b, a, X)
% 10.27/1.68  = { by axiom 34 (ruleD21) }
% 10.27/1.68    fresh102(eqangle(a, b, a, b, X, b, X, b), true, b, b, a, X)
% 10.27/1.68  = { by axiom 32 (ruleD42b) }
% 10.27/1.68    fresh101(coll(a, X, b), true, b, b, a, X)
% 10.27/1.68  = { by axiom 8 (ruleD3) R->L }
% 10.27/1.68    fresh101(fresh120(true, true, b, b, a, X), true, b, b, a, X)
% 10.27/1.68  = { by lemma 37 R->L }
% 10.27/1.68    fresh101(fresh120(coll(b, b, X), true, b, b, a, X), true, b, b, a, X)
% 10.27/1.68  = { by axiom 22 (ruleD3) }
% 10.27/1.68    fresh101(fresh119(coll(b, b, a), true, b, a, X), true, b, b, a, X)
% 10.27/1.68  = { by lemma 37 }
% 10.27/1.68    fresh101(fresh119(true, true, b, a, X), true, b, b, a, X)
% 10.27/1.68  = { by axiom 5 (ruleD3) }
% 10.27/1.68    fresh101(true, true, b, b, a, X)
% 10.27/1.68  = { by axiom 11 (ruleD42b) }
% 10.27/1.68    true
% 10.27/1.68  
% 10.27/1.68  Lemma 39: cyclic(b, a, X, Y) = true.
% 10.27/1.68  Proof:
% 10.27/1.68    cyclic(b, a, X, Y)
% 10.27/1.68  = { by axiom 15 (ruleD17) R->L }
% 10.27/1.68    fresh137(true, true, b, b, a, X, Y)
% 10.27/1.68  = { by lemma 38 R->L }
% 10.27/1.68    fresh137(cyclic(b, b, a, Y), true, b, b, a, X, Y)
% 10.27/1.68  = { by axiom 30 (ruleD17) }
% 10.27/1.68    fresh136(cyclic(b, b, a, X), true, b, a, X, Y)
% 10.27/1.68  = { by lemma 38 }
% 10.27/1.68    fresh136(true, true, b, a, X, Y)
% 10.27/1.68  = { by axiom 7 (ruleD17) }
% 10.27/1.68    true
% 10.27/1.68  
% 10.27/1.68  Lemma 40: cyclic(a, X, Y, Z) = true.
% 10.27/1.68  Proof:
% 10.27/1.68    cyclic(a, X, Y, Z)
% 10.27/1.68  = { by axiom 15 (ruleD17) R->L }
% 10.27/1.68    fresh137(true, true, b, a, X, Y, Z)
% 10.27/1.68  = { by lemma 39 R->L }
% 10.27/1.68    fresh137(cyclic(b, a, X, Z), true, b, a, X, Y, Z)
% 10.27/1.68  = { by axiom 30 (ruleD17) }
% 10.27/1.68    fresh136(cyclic(b, a, X, Y), true, a, X, Y, Z)
% 10.27/1.68  = { by lemma 39 }
% 10.27/1.68    fresh136(true, true, a, X, Y, Z)
% 10.27/1.68  = { by axiom 7 (ruleD17) }
% 10.27/1.68    true
% 10.27/1.68  
% 10.27/1.68  Goal 1 (exemplo6GDDFULL214031_7): cyclic(q, b, c, p) = true.
% 10.27/1.68  Proof:
% 10.27/1.68    cyclic(q, b, c, p)
% 10.27/1.68  = { by axiom 15 (ruleD17) R->L }
% 10.27/1.68    fresh137(true, true, a, q, b, c, p)
% 10.27/1.68  = { by lemma 40 R->L }
% 10.27/1.68    fresh137(cyclic(a, q, b, p), true, a, q, b, c, p)
% 10.27/1.68  = { by axiom 30 (ruleD17) }
% 10.27/1.68    fresh136(cyclic(a, q, b, c), true, q, b, c, p)
% 10.27/1.68  = { by lemma 40 }
% 10.27/1.68    fresh136(true, true, q, b, c, p)
% 10.27/1.68  = { by axiom 7 (ruleD17) }
% 10.27/1.68    true
% 10.27/1.68  % SZS output end Proof
% 10.27/1.68  
% 10.27/1.68  RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------