%------------------------------------------------------------------------------ % File : LisaTT---0.9.1 % Problem : SWX202-1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : java -cp /export/starexec/sandbox/solver/bin/lisa-assembly-0.9.jar TPTP_Lisa tableau --input /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n018.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 Apr 29 02:35:38 PM UTC 2026 % Result : Unknown 0.21s 1.71s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : SWX202-1 : TPTP v9.3.0. Released v9.3.0. % 0.11/0.13 % Command : java -cp /export/starexec/sandbox/solver/bin/lisa-assembly-0.9.jar TPTP_Lisa tableau --input /export/starexec/sandbox/benchmark/theBenchmark.p % 0.16/0.34 % Computer : n018.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Wed Apr 29 00:46:01 EDT 2026 % 0.16/0.35 % CPUTime : % 3.86/1.68 Cannot prove ∀(lambda(Q, impl(btrue)(Q) === Q)), ∀(lambda(Xs, ∀(lambda(Z, ∀(lambda(X, count(X)(cons(Z)(Xs)) === aux4(X)(Z)(Xs)(eq(Z)(X)))))))), ∀(lambda(Y, merge(nil)(Y) === Y)), ∀(lambda(X3, ∀(lambda(X2, ∀(lambda(Y, msort(cons(Y)(cons(X2)(X3))) === aux3(Y)(X2)(X3)(splitAtNat(div2(lengthNat(cons(Y)(cons(X2)(X3)))))(cons(Y)(cons(X2)(X3)))))))))), ∀(lambda(Z, leqNat(s(Z))(z) === bfalse)), ∀(lambda(Z, splitAtNat(s(Z))(nil) === pair2(nil)(nil))), ∀(lambda(X, eq(s(X))(z) === bfalse)), ∀(lambda(X, eq(z)(s(X)) === bfalse)), ∀(lambda(N, div2(s(s(N))) === s(div2(N)))), ∀(lambda(Q, impl(bfalse)(Q) === btrue)), div2(s(z)) === z, ∀(lambda(Y, leqNat(z)(Y) === btrue)), ∀(lambda(Xs, ∀(lambda(Z, merge(cons(Z)(Xs))(nil) === cons(Z)(Xs))))), ∀(lambda(Ys, ∀(lambda(Y2, ∀(lambda(Xs, ∀(lambda(Z, aux2(Z)(Xs)(Y2)(Ys)(bfalse) === cons(Y2)(merge(cons(Z)(Xs))(Ys)))))))))), ∀(lambda(Y, msort(cons(Y)(nil)) === cons(Y)(nil))), ∀(lambda(Y, ∀(lambda(X, prop$umsort$upermutation$uwrong2(X)(Y) === impl(eq2(leqNat(count(Y)(X))(s(s(s(s(s(z)))))))(bfalse))(eq(count(s(Y))(X))(count(Y)(msort(X)))))))), ∀(lambda(Xs, ∀(lambda(Z, ∀(lambda(X, aux4(X)(Z)(Xs)(btrue) === s(count(X)(Xs)))))))), ∀(lambda(M, ∀(lambda(Z, leqNat(s(Z))(s(M)) === leqNat(Z)(M))))), ∀(lambda(X, count(X)(nil) === z)), ∀(lambda(Ys, ∀(lambda(Y2, ∀(lambda(Xs, ∀(lambda(Z, merge(cons(Z)(Xs))(cons(Y2)(Ys)) === aux2(Z)(Xs)(Y2)(Ys)(leqNat(Z)(Y2)))))))))), eq2(bfalse)(btrue) === bfalse, ∀(lambda(Y, ∀(lambda(X, !eq2(prop$umsort$upermutation$uwrong2(X)(Y))(bfalse) === btrue)))), ∀(lambda(Xs, ∀(lambda(Z, ∀(lambda(X, aux4(X)(Z)(Xs)(bfalse) === count(X)(Xs))))))), eq2(btrue)(bfalse) === bfalse, ∀(lambda(Y, ∀(lambda(X2, ∀(lambda(Zs, ∀(lambda(Ys1, ∀(lambda(X3, aux3(Y)(X2)(X3)(pair2(Ys1)(Zs)) === merge(msort(Ys1))(msort(Zs)))))))))))), lengthNat(nil) === z, ∀(lambda(Ys, ∀(lambda(Y2, ∀(lambda(Xs, ∀(lambda(Z, aux2(Z)(Xs)(Y2)(Ys)(btrue) === cons(Z)(merge(Xs)(cons(Y2)(Ys))))))))))), ∀(lambda(X3, ∀(lambda(X2, ∀(lambda(Z, splitAtNat(s(Z))(cons(X2)(X3)) === aux(Z)(X2)(X3)(splitAtNat(Z)(X3)))))))), msort(nil) === nil, ∀(lambda(X, eq(X)(X) === btrue)), ∀(lambda(Z, ∀(lambda(X2, ∀(lambda(Zs, ∀(lambda(Ys1, ∀(lambda(X3, aux(Z)(X2)(X3)(pair2(Ys1)(Zs)) === pair2(cons(X2)(Ys1))(Zs))))))))))), ∀(lambda(Xs, ∀(lambda(Y, lengthNat(cons(Y)(Xs)) === s(lengthNat(Xs)))))), ∀(lambda(Y, ∀(lambda(X, eq(s(X))(s(Y)) === eq(X)(Y))))), ∀(lambda(Y, splitAtNat(z)(Y) === pair2(nil)(Y))), ∀(lambda(X, eq2(X)(X) === btrue)), div2(z) === z |- % 3.86/1.68 % SZS status GaveUp %------------------------------------------------------------------------------