TSTP Solution File: KRS013-1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : KRS013-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n026.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 : 600s
% DateTime : Sun Jul 17 03:12:48 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS013-1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 17:27:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.42 % SZS status Unsatisfiable
% 0.19/0.42 % SZS output begin IncompleteProof
% 0.19/0.42 cnf(c0, axiom,
% 0.19/0.42 e(exist)).
% 0.19/0.42 cnf(c1, plain,
% 0.19/0.42 e(exist),
% 0.19/0.42 inference(start, [], [c0])).
% 0.19/0.42
% 0.19/0.42 cnf(c2, axiom,
% 0.19/0.42 ~s2least(X0) | ~r(X1,X0) | ~e(X1) | c(X0)).
% 0.19/0.42 cnf(a0, assumption,
% 0.19/0.42 exist = X1).
% 0.19/0.42 cnf(c3, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.42 cnf(c4, plain,
% 0.19/0.42 ~s2least(X0) | ~r(X1,X0) | c(X0),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.19/0.42
% 0.19/0.42 cnf(c5, axiom,
% 0.19/0.42 ~s(X2,X3) | ~s(X2,X4) | equalish(X4,X3) | s2least(X2)).
% 0.19/0.42 cnf(a1, assumption,
% 0.19/0.42 X0 = X2).
% 0.19/0.42 cnf(c6, plain,
% 0.19/0.42 ~r(X1,X0) | c(X0),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.19/0.42 cnf(c7, plain,
% 0.19/0.42 ~s(X2,X3) | ~s(X2,X4) | equalish(X4,X3),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.19/0.42
% 0.19/0.42 cnf(c8, axiom,
% 0.19/0.42 s(X5,u7r1(X5)) | s1most(X5)).
% 0.19/0.42 cnf(a2, assumption,
% 0.19/0.42 X2 = X5).
% 0.19/0.42 cnf(a3, assumption,
% 0.19/0.42 X3 = u7r1(X5)).
% 0.19/0.42 cnf(c9, plain,
% 0.19/0.42 ~s(X2,X4) | equalish(X4,X3),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])).
% 0.19/0.42 cnf(c10, plain,
% 0.19/0.42 s1most(X5),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])).
% 0.19/0.42
% 0.19/0.42 cnf(c11, axiom,
% 0.19/0.42 ~s1most(u6r1(X6)) | f(X6)).
% 0.19/0.42 cnf(a4, assumption,
% 0.19/0.42 X5 = u6r1(X6)).
% 0.19/0.42 cnf(c12, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a4])], [c10, c11])).
% 0.19/0.42 cnf(c13, plain,
% 0.19/0.42 f(X6),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a4])], [c10, c11])).
% 0.19/0.42
% 0.19/0.42 cnf(c14, axiom,
% 0.19/0.42 ~f(exist)).
% 0.19/0.42 cnf(a5, assumption,
% 0.19/0.42 X6 = exist).
% 0.19/0.42 cnf(c15, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a5])], [c13, c14])).
% 0.19/0.42 cnf(c16, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a5])], [c13, c14])).
% 0.19/0.42
% 0.19/0.42 cnf(c17, axiom,
% 0.19/0.42 s(X7,u7r2(X7)) | s1most(X7)).
% 0.19/0.42 cnf(a6, assumption,
% 0.19/0.42 X2 = X7).
% 0.19/0.42 cnf(a7, assumption,
% 0.19/0.42 X4 = u7r2(X7)).
% 0.19/0.42 cnf(c18, plain,
% 0.19/0.42 equalish(X4,X3),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c17])).
% 0.19/0.42 cnf(c19, plain,
% 0.19/0.42 s1most(X7),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a6, a7])], [c9, c17])).
% 0.19/0.42
% 0.19/0.42 cnf(c20, plain,
% 0.19/0.42 ~s1most(X5)).
% 0.19/0.42 cnf(a8, assumption,
% 0.19/0.42 X7 = X5).
% 0.19/0.42 cnf(c21, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(predicate_reduction, [assumptions([a8])], [c19, c20])).
% 0.19/0.42
% 0.19/0.42 cnf(c22, axiom,
% 0.19/0.42 ~equalish(u7r2(X8),u7r1(X8)) | s1most(X8)).
% 0.19/0.42 cnf(a9, assumption,
% 0.19/0.42 X4 = u7r2(X8)).
% 0.19/0.42 cnf(a10, assumption,
% 0.19/0.42 X3 = u7r1(X8)).
% 0.19/0.42 cnf(c23, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a9, a10])], [c18, c22])).
% 0.19/0.42 cnf(c24, plain,
% 0.19/0.42 s1most(X8),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a9, a10])], [c18, c22])).
% 0.19/0.42
% 0.19/0.42 cnf(c25, plain,
% 0.19/0.42 ~s1most(X5)).
% 0.19/0.42 cnf(a11, assumption,
% 0.19/0.42 X8 = X5).
% 0.19/0.42 cnf(c26, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(predicate_reduction, [assumptions([a11])], [c24, c25])).
% 0.19/0.42
% 0.19/0.42 cnf(c27, axiom,
% 0.19/0.42 r(X9,u6r1(X9)) | f(X9)).
% 0.19/0.42 cnf(a12, assumption,
% 0.19/0.42 X1 = X9).
% 0.19/0.42 cnf(a13, assumption,
% 0.19/0.42 X0 = u6r1(X9)).
% 0.19/0.42 cnf(c28, plain,
% 0.19/0.42 c(X0),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c27])).
% 0.19/0.42 cnf(c29, plain,
% 0.19/0.42 f(X9),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a12, a13])], [c6, c27])).
% 0.19/0.42
% 0.19/0.42 cnf(c30, plain,
% 0.19/0.42 ~f(X6)).
% 0.19/0.42 cnf(a14, assumption,
% 0.19/0.42 X9 = X6).
% 0.19/0.42 cnf(c31, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(predicate_reduction, [assumptions([a14])], [c29, c30])).
% 0.19/0.42
% 0.19/0.42 cnf(c32, axiom,
% 0.19/0.42 ~c(X10) | t2least(X10)).
% 0.19/0.42 cnf(a15, assumption,
% 0.19/0.42 X0 = X10).
% 0.19/0.42 cnf(c33, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a15])], [c28, c32])).
% 0.19/0.42 cnf(c34, plain,
% 0.19/0.42 t2least(X10),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a15])], [c28, c32])).
% 0.19/0.42
% 0.19/0.42 cnf(c35, axiom,
% 0.19/0.42 ~t2least(X11) | t(X11,u1r1(X11))).
% 0.19/0.42 cnf(a16, assumption,
% 0.19/0.42 X10 = X11).
% 0.19/0.42 cnf(c36, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a16])], [c34, c35])).
% 0.19/0.42 cnf(c37, plain,
% 0.19/0.42 t(X11,u1r1(X11)),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a16])], [c34, c35])).
% 0.19/0.42
% 0.19/0.42 cnf(c38, axiom,
% 0.19/0.42 ~t(X12,X13) | ~t(X12,X14) | ~t1most(X12) | equalish(X14,X13)).
% 0.19/0.42 cnf(a17, assumption,
% 0.19/0.42 X11 = X12).
% 0.19/0.42 cnf(a18, assumption,
% 0.19/0.42 u1r1(X11) = X13).
% 0.19/0.42 cnf(c39, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a17, a18])], [c37, c38])).
% 0.19/0.42 cnf(c40, plain,
% 0.19/0.42 ~t(X12,X14) | ~t1most(X12) | equalish(X14,X13),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a17, a18])], [c37, c38])).
% 0.19/0.42
% 0.19/0.42 cnf(c41, axiom,
% 0.19/0.42 ~t2least(X15) | t(X15,u1r2(X15))).
% 0.19/0.42 cnf(a19, assumption,
% 0.19/0.42 X12 = X15).
% 0.19/0.42 cnf(a20, assumption,
% 0.19/0.42 X14 = u1r2(X15)).
% 0.19/0.42 cnf(c42, plain,
% 0.19/0.42 ~t1most(X12) | equalish(X14,X13),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a19, a20])], [c40, c41])).
% 0.19/0.42 cnf(c43, plain,
% 0.19/0.42 ~t2least(X15),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a19, a20])], [c40, c41])).
% 0.19/0.42
% 0.19/0.42 cnf(c44, plain,
% 0.19/0.42 t2least(X10)).
% 0.19/0.42 cnf(a21, assumption,
% 0.19/0.42 X15 = X10).
% 0.19/0.42 cnf(c45, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(predicate_reduction, [assumptions([a21])], [c43, c44])).
% 0.19/0.42
% 0.19/0.42 cnf(c46, axiom,
% 0.19/0.42 ~d(X16) | t1most(X16)).
% 0.19/0.42 cnf(a22, assumption,
% 0.19/0.42 X12 = X16).
% 0.19/0.42 cnf(c47, plain,
% 0.19/0.42 equalish(X14,X13),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a22])], [c42, c46])).
% 0.19/0.42 cnf(c48, plain,
% 0.19/0.42 ~d(X16),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a22])], [c42, c46])).
% 0.19/0.42
% 0.19/0.42 cnf(c49, axiom,
% 0.19/0.42 ~r(X17,X18) | ~e(X17) | d(X18)).
% 0.19/0.42 cnf(a23, assumption,
% 0.19/0.42 X16 = X18).
% 0.19/0.42 cnf(c50, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a23])], [c48, c49])).
% 0.19/0.42 cnf(c51, plain,
% 0.19/0.42 ~r(X17,X18) | ~e(X17),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a23])], [c48, c49])).
% 0.19/0.42
% 0.19/0.42 cnf(c52, plain,
% 0.19/0.42 r(X1,X0)).
% 0.19/0.42 cnf(a24, assumption,
% 0.19/0.42 X17 = X1).
% 0.19/0.42 cnf(a25, assumption,
% 0.19/0.42 X18 = X0).
% 0.19/0.42 cnf(c53, plain,
% 0.19/0.42 ~e(X17),
% 0.19/0.42 inference(predicate_reduction, [assumptions([a24, a25])], [c51, c52])).
% 0.19/0.42
% 0.19/0.42 cnf(c54, plain,
% 0.19/0.42 e(exist)).
% 0.19/0.42 cnf(a26, assumption,
% 0.19/0.42 X17 = exist).
% 0.19/0.42 cnf(c55, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(predicate_reduction, [assumptions([a26])], [c53, c54])).
% 0.19/0.42
% 0.19/0.42 cnf(c56, axiom,
% 0.19/0.42 ~equalish(u1r2(X19),u1r1(X19)) | ~t2least(X19)).
% 0.19/0.42 cnf(a27, assumption,
% 0.19/0.42 X14 = u1r2(X19)).
% 0.19/0.42 cnf(a28, assumption,
% 0.19/0.42 X13 = u1r1(X19)).
% 0.19/0.42 cnf(c57, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a27, a28])], [c47, c56])).
% 0.19/0.42 cnf(c58, plain,
% 0.19/0.42 ~t2least(X19),
% 0.19/0.42 inference(strict_predicate_extension, [assumptions([a27, a28])], [c47, c56])).
% 0.19/0.42
% 0.19/0.42 cnf(c59, plain,
% 0.19/0.42 t2least(X10)).
% 0.19/0.42 cnf(a29, assumption,
% 0.19/0.42 X19 = X10).
% 0.19/0.42 cnf(c60, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(predicate_reduction, [assumptions([a29])], [c58, c59])).
% 0.19/0.42
% 0.19/0.42 cnf(c61, plain,
% 0.19/0.42 $false,
% 0.19/0.42 inference(constraint_solving, [
% 0.19/0.42 bind(X0, u6r1(X6)),
% 0.19/0.42 bind(X1, exist),
% 0.19/0.42 bind(X2, u6r1(X6)),
% 0.19/0.42 bind(X3, u7r1(X5)),
% 0.19/0.42 bind(X4, u7r2(X7)),
% 0.19/0.42 bind(X5, u6r1(X6)),
% 0.19/0.42 bind(X6, exist),
% 0.19/0.42 bind(X7, u6r1(X6)),
% 0.19/0.42 bind(X8, u6r1(X6)),
% 0.19/0.42 bind(X9, exist),
% 0.19/0.42 bind(X10, u6r1(X6)),
% 0.19/0.42 bind(X11, u6r1(X6)),
% 0.19/0.42 bind(X12, u6r1(X6)),
% 0.19/0.42 bind(X13, u1r1(X11)),
% 0.19/0.42 bind(X14, u1r2(X15)),
% 0.19/0.42 bind(X15, u6r1(X6)),
% 0.19/0.42 bind(X16, u6r1(X6)),
% 0.19/0.42 bind(X17, exist),
% 0.19/0.42 bind(X18, u6r1(X6)),
% 0.19/0.42 bind(X19, u6r1(X6))
% 0.19/0.42 ],
% 0.19/0.42 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28, a29])).
% 0.19/0.42
% 0.19/0.42 % SZS output end IncompleteProof
%------------------------------------------------------------------------------