TSTP Solution File: SET890+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET890+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 : n004.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 02:49:01 EDT 2022
% Result : Theorem 36.66s 5.18s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET890+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 09:29:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 36.66/5.18 % SZS status Theorem
% 36.66/5.18 % SZS output begin IncompleteProof
% 36.66/5.18 cnf(c0, axiom,
% 36.66/5.18 sK9 != union(singleton(sK9))).
% 36.66/5.18 cnf(c1, plain,
% 36.66/5.18 sK9 != union(singleton(sK9)),
% 36.66/5.18 inference(start, [], [c0])).
% 36.66/5.18
% 36.66/5.18 cnf(c2, axiom,
% 36.66/5.18 union(X0) = X1 | ~sP2(X0,X1)).
% 36.66/5.18 cnf(a0, assumption,
% 36.66/5.18 union(singleton(sK9)) = union(X0)).
% 36.66/5.18 cnf(c3, plain,
% 36.66/5.18 $false,
% 36.66/5.18 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 36.66/5.18 cnf(c4, plain,
% 36.66/5.18 ~sP2(X0,X1),
% 36.66/5.18 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 36.66/5.18 cnf(c5, plain,
% 36.66/5.18 X2 != X1 | sK9 != X2,
% 36.66/5.18 inference(strict_function_extension, [assumptions([a0])], [c1, c2])).
% 36.66/5.18
% 36.66/5.18 cnf(a1, assumption,
% 36.66/5.18 X2 = X1).
% 36.66/5.18 cnf(c6, plain,
% 36.66/5.18 sK9 != X2,
% 36.66/5.18 inference(reflexivity, [assumptions([a1])], [c5])).
% 36.66/5.18
% 36.66/5.18 cnf(a2, assumption,
% 36.66/5.18 sK9 = X2).
% 36.66/5.18 cnf(c7, plain,
% 36.66/5.18 $false,
% 36.66/5.18 inference(reflexivity, [assumptions([a2])], [c6])).
% 36.66/5.18
% 36.66/5.18 cnf(c8, axiom,
% 36.66/5.18 sP2(X3,X4) | sP1(X3,sK5(X3,X4)) | in(sK5(X3,X4),X4)).
% 36.66/5.18 cnf(a3, assumption,
% 36.66/5.18 X0 = X3).
% 36.66/5.18 cnf(a4, assumption,
% 36.66/5.18 X1 = X4).
% 36.66/5.18 cnf(c9, plain,
% 36.66/5.18 $false,
% 36.66/5.18 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 36.66/5.18 cnf(c10, plain,
% 36.66/5.18 sP1(X3,sK5(X3,X4)) | in(sK5(X3,X4),X4),
% 36.66/5.18 inference(strict_predicate_extension, [assumptions([a3, a4])], [c4, c8])).
% 36.66/5.18
% 36.66/5.18 cnf(c11, axiom,
% 36.66/5.18 in(sK6(X5,X6),X5) | ~sP1(X5,X6)).
% 36.66/5.18 cnf(a5, assumption,
% 36.66/5.18 X3 = X5).
% 36.66/5.18 cnf(a6, assumption,
% 36.66/5.18 sK5(X3,X4) = X6).
% 36.66/5.18 cnf(c12, plain,
% 36.66/5.18 in(sK5(X3,X4),X4),
% 36.66/5.18 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 36.66/5.18 cnf(c13, plain,
% 36.66/5.18 in(sK6(X5,X6),X5),
% 36.66/5.18 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])).
% 36.66/5.18
% 36.66/5.18 cnf(c14, axiom,
% 36.66/5.18 X7 = X8 | ~in(X8,X9) | ~sP0(X7,X9)).
% 36.66/5.18 cnf(a7, assumption,
% 36.66/5.18 sK6(X5,X6) = X8).
% 36.66/5.18 cnf(a8, assumption,
% 36.66/5.18 X5 = X9).
% 36.66/5.18 cnf(c15, plain,
% 36.66/5.18 $false,
% 36.66/5.18 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])).
% 36.66/5.18 cnf(c16, plain,
% 36.66/5.18 X7 = X8 | ~sP0(X7,X9),
% 36.66/5.18 inference(strict_predicate_extension, [assumptions([a7, a8])], [c13, c14])).
% 36.66/5.18
% 36.66/5.18 cnf(c17, axiom,
% 36.66/5.18 in(X10,sK6(X11,X10)) | ~sP1(X11,X10)).
% 36.66/5.18 cnf(a9, assumption,
% 36.66/5.18 sK6(X11,X10) = X8).
% 36.66/5.18 cnf(c18, plain,
% 36.66/5.18 ~sP0(X7,X9),
% 36.66/5.18 inference(strict_subterm_extension, [assumptions([a9])], [c16, c17])).
% 36.66/5.18 cnf(c19, plain,
% 36.66/5.18 ~sP1(X11,X10),
% 36.66/5.18 inference(strict_subterm_extension, [assumptions([a9])], [c16, c17])).
% 36.66/5.18 cnf(c20, plain,
% 36.66/5.18 in(X10,X7),
% 36.66/5.18 inference(strict_subterm_extension, [assumptions([a9])], [c16, c17])).
% 36.66/5.18
% 36.66/5.18 cnf(c21, axiom,
% 36.66/5.18 sP2(X12,X13) | ~sP1(X12,sK5(X12,X13)) | ~in(sK5(X12,X13),X13)).
% 36.66/5.18 cnf(a10, assumption,
% 36.66/5.18 X10 = sK5(X12,X13)).
% 36.66/5.18 cnf(a11, assumption,
% 36.66/5.18 X7 = X13).
% 36.66/5.18 cnf(c22, plain,
% 36.66/5.18 $false,
% 36.66/5.18 inference(strict_predicate_extension, [assumptions([a10, a11])], [c20, c21])).
% 36.66/5.18 cnf(c23, plain,
% 36.66/5.18 sP2(X12,X13) | ~sP1(X12,sK5(X12,X13)),
% 36.66/5.18 inference(strict_predicate_extension, [assumptions([a10, a11])], [c20, c21])).
% 36.66/5.18
% 36.66/5.18 cnf(c24, plain,
% 36.66/5.18 ~sP2(X0,X1)).
% 36.66/5.18 cnf(a12, assumption,
% 36.66/5.18 X12 = X0).
% 36.66/5.18 cnf(a13, assumption,
% 36.66/5.18 X13 = X1).
% 36.66/5.18 cnf(c25, plain,
% 36.66/5.18 ~sP1(X12,sK5(X12,X13)),
% 36.66/5.18 inference(predicate_reduction, [assumptions([a12, a13])], [c23, c24])).
% 36.66/5.18
% 36.66/5.18 cnf(c26, plain,
% 36.66/5.18 sP1(X3,sK5(X3,X4))).
% 36.66/5.18 cnf(a14, assumption,
% 36.66/5.18 X12 = X3).
% 36.66/5.18 cnf(a15, assumption,
% 36.66/5.18 sK5(X12,X13) = sK5(X3,X4)).
% 36.66/5.18 cnf(c27, plain,
% 36.66/5.18 $false,
% 36.66/5.18 inference(predicate_reduction, [assumptions([a14, a15])], [c25, c26])).
% 36.66/5.18
% 36.66/5.18 cnf(c28, plain,
% 36.66/5.18 sP1(X3,sK5(X3,X4))).
% 36.66/5.18 cnf(a16, assumption,
% 36.66/5.18 X11 = X3).
% 36.66/5.18 cnf(a17, assumption,
% 36.66/5.18 X10 = sK5(X3,X4)).
% 36.66/5.18 cnf(c29, plain,
% 36.66/5.18 $false,
% 36.66/5.18 inference(predicate_reduction, [assumptions([a16, a17])], [c19, c28])).
% 36.66/5.18
% 36.66/5.18 cnf(c30, axiom,
% 36.66/5.18 sP0(X14,singleton(X14))).
% 36.66/5.18 cnf(a18, assumption,
% 36.66/5.18 X7 = X14).
% 36.66/5.18 cnf(a19, assumption,
% 36.66/5.18 X9 = singleton(X14)).
% 36.66/5.18 cnf(c31, plain,
% 36.66/5.18 $false,
% 36.66/5.18 inference(strict_predicate_extension, [assumptions([a18, a19])], [c18, c30])).
% 36.66/5.18 cnf(c32, plain,
% 36.66/5.18 $false,
% 36.66/5.18 inference(strict_predicate_extension, [assumptions([a18, a19])], [c18, c30])).
% 36.66/5.18
% 36.66/5.18 cnf(c33, axiom,
% 36.66/5.18 sP1(X15,X16) | ~in(X17,X15) | ~in(X16,X17)).
% 36.66/5.18 cnf(a20, assumption,
% 36.66/5.18 sK5(X3,X4) = X16).
% 36.66/5.18 cnf(a21, assumption,
% 36.66/5.18 X4 = X17).
% 36.66/5.18 cnf(c34, plain,
% 36.66/5.18 $false,
% 36.66/5.18 inference(strict_predicate_extension, [assumptions([a20, a21])], [c12, c33])).
% 36.66/5.18 cnf(c35, plain,
% 36.66/5.18 sP1(X15,X16) | ~in(X17,X15),
% 36.66/5.18 inference(strict_predicate_extension, [assumptions([a20, a21])], [c12, c33])).
% 36.66/5.18
% 36.66/5.18 cnf(c36, plain,
% 36.66/5.18 ~sP1(X3,sK5(X3,X4))).
% 36.66/5.18 cnf(a22, assumption,
% 36.66/5.18 X15 = X3).
% 36.66/5.18 cnf(a23, assumption,
% 36.66/5.18 X16 = sK5(X3,X4)).
% 36.66/5.18 cnf(c37, plain,
% 36.66/5.18 ~in(X17,X15),
% 36.66/5.18 inference(predicate_reduction, [assumptions([a22, a23])], [c35, c36])).
% 36.66/5.18
% 36.66/5.18 cnf(c38, axiom,
% 36.66/5.18 in(X18,X19) | ~sP0(X18,X19)).
% 36.66/5.18 cnf(a24, assumption,
% 36.66/5.18 X17 = X18).
% 36.66/5.18 cnf(a25, assumption,
% 36.66/5.18 X15 = X19).
% 36.66/5.18 cnf(c39, plain,
% 36.66/5.18 $false,
% 36.66/5.18 inference(strict_predicate_extension, [assumptions([a24, a25])], [c37, c38])).
% 36.66/5.18 cnf(c40, plain,
% 36.66/5.18 ~sP0(X18,X19),
% 36.66/5.18 inference(strict_predicate_extension, [assumptions([a24, a25])], [c37, c38])).
% 36.66/5.18
% 36.66/5.18 cnf(c41, plain,
% 36.66/5.18 sP0(X7,X9)).
% 36.66/5.18 cnf(a26, assumption,
% 36.66/5.18 X18 = X7).
% 36.66/5.18 cnf(a27, assumption,
% 36.66/5.18 X19 = X9).
% 36.66/5.18 cnf(c42, plain,
% 36.66/5.18 $false,
% 36.66/5.18 inference(predicate_reduction, [assumptions([a26, a27])], [c40, c41])).
% 36.66/5.18
% 36.66/5.18 cnf(c43, plain,
% 36.66/5.18 $false,
% 36.66/5.18 inference(constraint_solving, [
% 36.66/5.18 bind(X0, singleton(sK9)),
% 36.66/5.18 bind(X1, sK9),
% 36.66/5.18 bind(X2, sK9),
% 36.66/5.18 bind(X3, singleton(sK9)),
% 36.66/5.18 bind(X4, sK9),
% 36.66/5.18 bind(X5, singleton(sK9)),
% 36.66/5.18 bind(X6, sK5(X3,X4)),
% 36.66/5.18 bind(X7, sK9),
% 36.66/5.18 bind(X8, sK6(X5,X6)),
% 36.66/5.18 bind(X9, singleton(sK9)),
% 36.66/5.18 bind(X10, sK5(X3,X4)),
% 36.66/5.18 bind(X11, singleton(sK9)),
% 36.66/5.18 bind(X12, singleton(sK9)),
% 36.66/5.18 bind(X13, sK9),
% 36.66/5.18 bind(X14, sK9),
% 36.66/5.18 bind(X15, singleton(sK9)),
% 36.66/5.18 bind(X16, sK5(X3,X4)),
% 36.66/5.18 bind(X17, sK9),
% 36.66/5.18 bind(X18, sK9),
% 36.66/5.18 bind(X19, singleton(sK9))
% 36.66/5.18 ],
% 36.66/5.18 [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])).
% 36.66/5.18
% 36.66/5.18 % SZS output end IncompleteProof
%------------------------------------------------------------------------------