TSTP Solution File: SEU118+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU118+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n007.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 : Tue Jul 19 11:53:13 EDT 2022
% Result : Theorem 2.41s 0.72s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU118+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.35 % Computer : n007.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 : 600
% 0.13/0.35 % DateTime : Sat Jun 18 22:08:43 EDT 2022
% 0.13/0.35 % CPUTime :
% 2.41/0.72 % SZS status Theorem
% 2.41/0.72 % SZS output begin IncompleteProof
% 2.41/0.72 cnf(c0, axiom,
% 2.41/0.72 finite(sK16)).
% 2.41/0.72 cnf(c1, plain,
% 2.41/0.72 finite(sK16),
% 2.41/0.72 inference(start, [], [c0])).
% 2.41/0.72
% 2.41/0.72 cnf(c2, axiom,
% 2.41/0.72 finite(X0) | ~element(X0,powerset(X1)) | ~finite(X1)).
% 2.41/0.72 cnf(a0, assumption,
% 2.41/0.72 sK16 = X1).
% 2.41/0.72 cnf(c3, plain,
% 2.41/0.72 $false,
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 2.41/0.72 cnf(c4, plain,
% 2.41/0.72 finite(X0) | ~element(X0,powerset(X1)),
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 2.41/0.72
% 2.41/0.72 cnf(c5, axiom,
% 2.41/0.72 sP0(X2,X3) | ~finite(X2) | ~subset(X2,X3)).
% 2.41/0.72 cnf(a1, assumption,
% 2.41/0.72 X0 = X2).
% 2.41/0.72 cnf(c6, plain,
% 2.41/0.72 ~element(X0,powerset(X1)),
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 2.41/0.72 cnf(c7, plain,
% 2.41/0.72 sP0(X2,X3) | ~subset(X2,X3),
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 2.41/0.72
% 2.41/0.72 cnf(c8, axiom,
% 2.41/0.72 in(X4,X5) | ~sP0(X4,X6) | ~sP1(X6,X5)).
% 2.41/0.72 cnf(a2, assumption,
% 2.41/0.72 X2 = X4).
% 2.41/0.72 cnf(a3, assumption,
% 2.41/0.72 X3 = X6).
% 2.41/0.72 cnf(c9, plain,
% 2.41/0.72 ~subset(X2,X3),
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])).
% 2.41/0.72 cnf(c10, plain,
% 2.41/0.72 in(X4,X5) | ~sP1(X6,X5),
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a2, a3])], [c7, c8])).
% 2.41/0.72
% 2.41/0.72 cnf(c11, axiom,
% 2.41/0.72 element(X7,X8) | ~in(X7,X8)).
% 2.41/0.72 cnf(a4, assumption,
% 2.41/0.72 X4 = X7).
% 2.41/0.72 cnf(a5, assumption,
% 2.41/0.72 X5 = X8).
% 2.41/0.72 cnf(c12, plain,
% 2.41/0.72 ~sP1(X6,X5),
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])).
% 2.41/0.72 cnf(c13, plain,
% 2.41/0.72 element(X7,X8),
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])).
% 2.41/0.72
% 2.41/0.72 cnf(c14, axiom,
% 2.41/0.72 ~element(sK17,finite_subsets(sK16))).
% 2.41/0.72 cnf(a6, assumption,
% 2.41/0.72 X7 = sK17).
% 2.41/0.72 cnf(a7, assumption,
% 2.41/0.72 X8 = finite_subsets(sK16)).
% 2.41/0.72 cnf(c15, plain,
% 2.41/0.72 $false,
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c14])).
% 2.41/0.72 cnf(c16, plain,
% 2.41/0.72 $false,
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c14])).
% 2.41/0.72
% 2.41/0.72 cnf(c17, axiom,
% 2.41/0.72 sP1(X9,finite_subsets(X9)) | ~sP2(finite_subsets(X9),X9)).
% 2.41/0.72 cnf(a8, assumption,
% 2.41/0.72 X6 = X9).
% 2.41/0.72 cnf(a9, assumption,
% 2.41/0.72 X5 = finite_subsets(X9)).
% 2.41/0.72 cnf(c18, plain,
% 2.41/0.72 $false,
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c17])).
% 2.41/0.72 cnf(c19, plain,
% 2.41/0.72 ~sP2(finite_subsets(X9),X9),
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a8, a9])], [c12, c17])).
% 2.41/0.72
% 2.41/0.72 cnf(c20, axiom,
% 2.41/0.72 sP2(X10,X11) | ~preboolean(X10)).
% 2.41/0.72 cnf(a10, assumption,
% 2.41/0.72 finite_subsets(X9) = X10).
% 2.41/0.72 cnf(a11, assumption,
% 2.41/0.72 X9 = X11).
% 2.41/0.72 cnf(c21, plain,
% 2.41/0.72 $false,
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a10, a11])], [c19, c20])).
% 2.41/0.72 cnf(c22, plain,
% 2.41/0.72 ~preboolean(X10),
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a10, a11])], [c19, c20])).
% 2.41/0.72
% 2.41/0.72 cnf(c23, axiom,
% 2.41/0.72 preboolean(finite_subsets(X12))).
% 2.41/0.72 cnf(a12, assumption,
% 2.41/0.72 X10 = finite_subsets(X12)).
% 2.41/0.72 cnf(c24, plain,
% 2.41/0.72 $false,
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a12])], [c22, c23])).
% 2.41/0.72 cnf(c25, plain,
% 2.41/0.72 $false,
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a12])], [c22, c23])).
% 2.41/0.72
% 2.41/0.72 cnf(c26, axiom,
% 2.41/0.72 subset(X13,X14) | ~element(X13,powerset(X14))).
% 2.41/0.72 cnf(a13, assumption,
% 2.41/0.72 X2 = X13).
% 2.41/0.72 cnf(a14, assumption,
% 2.41/0.72 X3 = X14).
% 2.41/0.72 cnf(c27, plain,
% 2.41/0.72 $false,
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a13, a14])], [c9, c26])).
% 2.41/0.72 cnf(c28, plain,
% 2.41/0.72 ~element(X13,powerset(X14)),
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a13, a14])], [c9, c26])).
% 2.41/0.72
% 2.41/0.72 cnf(c29, axiom,
% 2.41/0.72 element(sK17,powerset(sK16))).
% 2.41/0.72 cnf(a15, assumption,
% 2.41/0.72 X13 = sK17).
% 2.41/0.72 cnf(a16, assumption,
% 2.41/0.72 powerset(X14) = powerset(sK16)).
% 2.41/0.72 cnf(c30, plain,
% 2.41/0.72 $false,
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a15, a16])], [c28, c29])).
% 2.41/0.72 cnf(c31, plain,
% 2.41/0.72 $false,
% 2.41/0.72 inference(strict_predicate_extension, [assumptions([a15, a16])], [c28, c29])).
% 2.41/0.72
% 2.41/0.72 cnf(c32, plain,
% 2.41/0.72 element(X13,powerset(X14))).
% 2.41/0.72 cnf(a17, assumption,
% 2.41/0.72 X0 = X13).
% 2.41/0.72 cnf(a18, assumption,
% 2.41/0.72 powerset(X1) = powerset(X14)).
% 2.41/0.72 cnf(c33, plain,
% 2.41/0.72 $false,
% 2.41/0.72 inference(predicate_reduction, [assumptions([a17, a18])], [c6, c32])).
% 2.41/0.72
% 2.41/0.72 cnf(c34, plain,
% 2.41/0.72 $false,
% 2.41/0.72 inference(constraint_solving, [
% 2.41/0.72 bind(X0, sK17),
% 2.41/0.72 bind(X1, sK16),
% 2.41/0.72 bind(X2, sK17),
% 2.41/0.72 bind(X3, sK16),
% 2.41/0.72 bind(X4, sK17),
% 2.41/0.72 bind(X5, finite_subsets(sK16)),
% 2.41/0.72 bind(X6, sK16),
% 2.41/0.72 bind(X7, sK17),
% 2.41/0.72 bind(X8, finite_subsets(sK16)),
% 2.41/0.72 bind(X9, sK16),
% 2.41/0.72 bind(X10, finite_subsets(X9)),
% 2.41/0.72 bind(X11, sK16),
% 2.41/0.72 bind(X12, sK16),
% 2.41/0.72 bind(X13, sK17),
% 2.41/0.72 bind(X14, sK16)
% 2.41/0.72 ],
% 2.41/0.72 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])).
% 2.41/0.72
% 2.41/0.72 % SZS output end IncompleteProof
%------------------------------------------------------------------------------