TSTP Solution File: SWC372+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWC372+1 : TPTP v8.1.2. Released v2.4.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 20:55:14 EDT 2023
% Result : Theorem 16.30s 2.55s
% Output : Proof 16.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC372+1 : TPTP v8.1.2. Released v2.4.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.35 % Computer : n027.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.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 15:08:52 EDT 2023
% 0.13/0.35 % CPUTime :
% 16.30/2.55 Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 16.30/2.55
% 16.30/2.55 % SZS status Theorem
% 16.30/2.55
% 16.30/2.55 % SZS output start Proof
% 16.30/2.55 Take the following subset of the input axioms:
% 16.30/2.57 fof(ax17, axiom, ssList(nil)).
% 16.30/2.57 fof(ax28, axiom, ![U]: (ssList(U) => app(nil, U)=U)).
% 16.30/2.57 fof(ax7, axiom, ![U2]: (ssList(U2) => ![V]: (ssList(V) => (segmentP(U2, V) <=> ?[W]: (ssList(W) & ?[X]: (ssList(X) & app(app(W, V), X)=U2)))))).
% 16.30/2.57 fof(co1, conjecture, ![U2]: (ssList(U2) => ![V2]: (ssList(V2) => ![W2]: (ssList(W2) => ![X4]: (ssList(X4) => (V2!=X4 | (U2!=W2 | (![Y]: (ssList(Y) => (app(W2, Y)!=X4 | (~strictorderedP(W2) | ?[Z]: (ssItem(Z) & ?[X1]: (ssList(X1) & (app(cons(Z, nil), X1)=Y & ?[X2]: (ssItem(X2) & ?[X3]: (ssList(X3) & (app(X3, cons(X2, nil))=W2 & lt(X2, Z)))))))))) | (segmentP(V2, U2) | (nil!=X4 & nil=W2)))))))))).
% 16.30/2.57
% 16.30/2.57 Now clausify the problem and encode Horn clauses using encoding 3 of
% 16.30/2.57 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 16.30/2.57 We repeatedly replace C & s=t => u=v by the two clauses:
% 16.30/2.57 fresh(y, y, x1...xn) = u
% 16.30/2.57 C => fresh(s, t, x1...xn) = v
% 16.30/2.57 where fresh is a fresh function symbol and x1..xn are the free
% 16.30/2.57 variables of u and v.
% 16.30/2.57 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 16.30/2.57 input problem has no model of domain size 1).
% 16.30/2.57
% 16.30/2.57 The encoding turns the above axioms into the following unit equations and goals:
% 16.30/2.57
% 16.30/2.57 Axiom 1 (co1_1): u = w.
% 16.30/2.57 Axiom 2 (co1_2): v = x.
% 16.30/2.57 Axiom 3 (ax17): ssList(nil) = true2.
% 16.30/2.57 Axiom 4 (co1_5): ssList(w) = true2.
% 16.30/2.57 Axiom 5 (co1_4): ssList(v) = true2.
% 16.30/2.57 Axiom 6 (co1_7): ssList(y) = true2.
% 16.30/2.57 Axiom 7 (co1): app(w, y) = x.
% 16.30/2.57 Axiom 8 (ax28): fresh7(X, X, Y) = Y.
% 16.30/2.57 Axiom 9 (ax7): fresh31(X, X, Y, Z) = true2.
% 16.30/2.57 Axiom 10 (ax28): fresh7(ssList(X), true2, X) = app(nil, X).
% 16.30/2.57 Axiom 11 (ax7): fresh252(X, X, Y, Z, W, V) = segmentP(Y, Z).
% 16.30/2.57 Axiom 12 (ax7): fresh251(X, X, Y, Z, W, V) = fresh252(ssList(Y), true2, Y, Z, W, V).
% 16.30/2.57 Axiom 13 (ax7): fresh250(X, X, Y, Z, W, V) = fresh251(ssList(Z), true2, Y, Z, W, V).
% 16.30/2.57 Axiom 14 (ax7): fresh249(X, X, Y, Z, W, V) = fresh250(ssList(W), true2, Y, Z, W, V).
% 16.30/2.57 Axiom 15 (ax7): fresh249(ssList(X), true2, Y, Z, W, X) = fresh31(app(app(W, Z), X), Y, Y, Z).
% 16.30/2.57
% 16.30/2.57 Goal 1 (co1_11): segmentP(v, u) = true2.
% 16.30/2.57 Proof:
% 16.30/2.57 segmentP(v, u)
% 16.30/2.57 = { by axiom 1 (co1_1) }
% 16.30/2.57 segmentP(v, w)
% 16.30/2.57 = { by axiom 11 (ax7) R->L }
% 16.30/2.57 fresh252(true2, true2, v, w, nil, y)
% 16.30/2.57 = { by axiom 5 (co1_4) R->L }
% 16.30/2.57 fresh252(ssList(v), true2, v, w, nil, y)
% 16.30/2.57 = { by axiom 12 (ax7) R->L }
% 16.30/2.57 fresh251(true2, true2, v, w, nil, y)
% 16.30/2.57 = { by axiom 2 (co1_2) }
% 16.30/2.57 fresh251(true2, true2, x, w, nil, y)
% 16.30/2.57 = { by axiom 7 (co1) R->L }
% 16.30/2.57 fresh251(true2, true2, app(w, y), w, nil, y)
% 16.30/2.57 = { by axiom 4 (co1_5) R->L }
% 16.30/2.57 fresh251(ssList(w), true2, app(w, y), w, nil, y)
% 16.30/2.57 = { by axiom 13 (ax7) R->L }
% 16.30/2.57 fresh250(true2, true2, app(w, y), w, nil, y)
% 16.30/2.57 = { by axiom 3 (ax17) R->L }
% 16.30/2.57 fresh250(ssList(nil), true2, app(w, y), w, nil, y)
% 16.30/2.57 = { by axiom 14 (ax7) R->L }
% 16.30/2.57 fresh249(true2, true2, app(w, y), w, nil, y)
% 16.30/2.57 = { by axiom 6 (co1_7) R->L }
% 16.30/2.57 fresh249(ssList(y), true2, app(w, y), w, nil, y)
% 16.30/2.57 = { by axiom 8 (ax28) R->L }
% 16.30/2.57 fresh249(ssList(y), true2, app(fresh7(true2, true2, w), y), w, nil, y)
% 16.30/2.57 = { by axiom 4 (co1_5) R->L }
% 16.30/2.57 fresh249(ssList(y), true2, app(fresh7(ssList(w), true2, w), y), w, nil, y)
% 16.30/2.57 = { by axiom 10 (ax28) }
% 16.30/2.57 fresh249(ssList(y), true2, app(app(nil, w), y), w, nil, y)
% 16.30/2.57 = { by axiom 15 (ax7) }
% 16.30/2.57 fresh31(app(app(nil, w), y), app(app(nil, w), y), app(app(nil, w), y), w)
% 16.30/2.57 = { by axiom 9 (ax7) }
% 16.30/2.57 true2
% 16.30/2.57 % SZS output end Proof
% 16.30/2.57
% 16.30/2.57 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------