TSTP Solution File: SWC043+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : SWC043+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 : n010.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:53:35 EDT 2023
% Result : Theorem 4.21s 0.94s
% Output : Proof 4.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWC043+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.15 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.15/0.36 % Computer : n010.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Aug 28 18:19:19 EDT 2023
% 0.15/0.36 % CPUTime :
% 4.21/0.94 Command-line arguments: --no-flatten-goal
% 4.21/0.94
% 4.21/0.94 % SZS status Theorem
% 4.21/0.94
% 4.21/0.94 % SZS output start Proof
% 4.21/0.94 Take the following subset of the input axioms:
% 4.21/0.95 fof(ax83, axiom, ![U]: (ssList(U) => ![V]: (ssList(V) => (nil=app(U, V) <=> (nil=V & nil=U))))).
% 4.21/0.95 fof(co1, conjecture, ![U2]: (ssList(U2) => ![V2]: (ssList(V2) => ![W]: (ssList(W) => ![X]: (ssList(X) => (nil!=V2 | (V2!=X | (U2!=W | (nil=U2 | (![Y]: (ssList(Y) => (app(W, Y)!=X | (~strictorderedP(W) | ?[Z]: (ssItem(Z) & ?[X1]: (ssList(X1) & (app(cons(Z, nil), X1)=Y & ?[X2]: (ssItem(X2) & ?[X3]: (ssList(X3) & (app(X3, cons(X2, nil))=W & lt(X2, Z)))))))))) | (nil!=X & nil=W))))))))))).
% 4.21/0.95
% 4.21/0.95 Now clausify the problem and encode Horn clauses using encoding 3 of
% 4.21/0.95 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 4.21/0.95 We repeatedly replace C & s=t => u=v by the two clauses:
% 4.21/0.95 fresh(y, y, x1...xn) = u
% 4.21/0.95 C => fresh(s, t, x1...xn) = v
% 4.21/0.95 where fresh is a fresh function symbol and x1..xn are the free
% 4.21/0.95 variables of u and v.
% 4.21/0.95 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 4.21/0.95 input problem has no model of domain size 1).
% 4.21/0.95
% 4.21/0.95 The encoding turns the above axioms into the following unit equations and goals:
% 4.21/0.95
% 4.21/0.95 Axiom 1 (co1_3): v = x.
% 4.21/0.95 Axiom 2 (co1_2): u = w.
% 4.21/0.95 Axiom 3 (co1_1): nil = v.
% 4.21/0.95 Axiom 4 (co1_4): ssList(u) = true2.
% 4.21/0.95 Axiom 5 (co1_8): ssList(y) = true2.
% 4.21/0.95 Axiom 6 (co1): app(w, y) = x.
% 4.21/0.95 Axiom 7 (ax83_1): fresh116(X, X, Y) = Y.
% 4.21/0.95 Axiom 8 (ax83_1): fresh22(X, X, Y, Z) = nil.
% 4.21/0.95 Axiom 9 (ax83_1): fresh115(X, X, Y, Z) = fresh116(nil, app(Y, Z), Y).
% 4.21/0.95 Axiom 10 (ax83_1): fresh115(ssList(X), true2, Y, X) = fresh22(ssList(Y), true2, Y, X).
% 4.21/0.95
% 4.21/0.95 Goal 1 (co1_11): nil = u.
% 4.21/0.95 Proof:
% 4.21/0.95 nil
% 4.21/0.95 = { by axiom 8 (ax83_1) R->L }
% 4.21/0.95 fresh22(true2, true2, u, y)
% 4.21/0.95 = { by axiom 4 (co1_4) R->L }
% 4.21/0.95 fresh22(ssList(u), true2, u, y)
% 4.21/0.95 = { by axiom 10 (ax83_1) R->L }
% 4.21/0.95 fresh115(ssList(y), true2, u, y)
% 4.21/0.95 = { by axiom 5 (co1_8) }
% 4.21/0.95 fresh115(true2, true2, u, y)
% 4.21/0.95 = { by axiom 9 (ax83_1) }
% 4.21/0.95 fresh116(nil, app(u, y), u)
% 4.21/0.95 = { by axiom 3 (co1_1) }
% 4.21/0.95 fresh116(v, app(u, y), u)
% 4.21/0.95 = { by axiom 2 (co1_2) }
% 4.21/0.95 fresh116(v, app(w, y), u)
% 4.21/0.95 = { by axiom 6 (co1) }
% 4.21/0.95 fresh116(v, x, u)
% 4.21/0.95 = { by axiom 1 (co1_3) R->L }
% 4.21/0.95 fresh116(v, v, u)
% 4.21/0.95 = { by axiom 7 (ax83_1) }
% 4.21/0.95 u
% 4.21/0.95 % SZS output end Proof
% 4.21/0.95
% 4.21/0.95 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------