TSTP Solution File: SEU154+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU154+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n027.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:34 EDT 2022
% Result : Theorem 69.60s 9.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU154+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n027.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 : Sun Jun 19 12:11:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 69.60/9.34 % SZS status Theorem
% 69.60/9.34 % SZS output begin IncompleteProof
% 69.60/9.34 cnf(c0, axiom,
% 69.60/9.34 ~disjoint(singleton(sK6),sK7)).
% 69.60/9.34 cnf(c1, plain,
% 69.60/9.34 ~disjoint(singleton(sK6),sK7),
% 69.60/9.34 inference(start, [], [c0])).
% 69.60/9.34
% 69.60/9.34 cnf(c2, axiom,
% 69.60/9.34 disjoint(X0,X1) | set_intersection2(X0,X1) != empty_set).
% 69.60/9.34 cnf(a0, assumption,
% 69.60/9.34 singleton(sK6) = X0).
% 69.60/9.34 cnf(a1, assumption,
% 69.60/9.34 sK7 = X1).
% 69.60/9.34 cnf(c3, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 69.60/9.34 cnf(c4, plain,
% 69.60/9.34 set_intersection2(X0,X1) != empty_set,
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 69.60/9.34
% 69.60/9.34 cnf(c5, axiom,
% 69.60/9.34 set_intersection2(X2,X3) = X4 | ~sP2(X2,X3,X4)).
% 69.60/9.34 cnf(a2, assumption,
% 69.60/9.34 set_intersection2(X0,X1) = set_intersection2(X2,X3)).
% 69.60/9.34 cnf(c6, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(strict_function_extension, [assumptions([a2])], [c4, c5])).
% 69.60/9.34 cnf(c7, plain,
% 69.60/9.34 ~sP2(X2,X3,X4),
% 69.60/9.34 inference(strict_function_extension, [assumptions([a2])], [c4, c5])).
% 69.60/9.34 cnf(c8, plain,
% 69.60/9.34 X5 != X4 | X5 != empty_set,
% 69.60/9.34 inference(strict_function_extension, [assumptions([a2])], [c4, c5])).
% 69.60/9.34
% 69.60/9.34 cnf(a3, assumption,
% 69.60/9.34 X5 = X4).
% 69.60/9.34 cnf(c9, plain,
% 69.60/9.34 X5 != empty_set,
% 69.60/9.34 inference(reflexivity, [assumptions([a3])], [c8])).
% 69.60/9.34
% 69.60/9.34 cnf(a4, assumption,
% 69.60/9.34 X5 = empty_set).
% 69.60/9.34 cnf(c10, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(reflexivity, [assumptions([a4])], [c9])).
% 69.60/9.34
% 69.60/9.34 cnf(c11, axiom,
% 69.60/9.34 sP2(X6,X7,X8) | sP1(X7,sK5(X6,X7,X8),X6) | in(sK5(X6,X7,X8),X8)).
% 69.60/9.34 cnf(a5, assumption,
% 69.60/9.34 X2 = X6).
% 69.60/9.34 cnf(a6, assumption,
% 69.60/9.34 X3 = X7).
% 69.60/9.34 cnf(a7, assumption,
% 69.60/9.34 X4 = X8).
% 69.60/9.34 cnf(c12, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c7, c11])).
% 69.60/9.34 cnf(c13, plain,
% 69.60/9.34 sP1(X7,sK5(X6,X7,X8),X6) | in(sK5(X6,X7,X8),X8),
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a5, a6, a7])], [c7, c11])).
% 69.60/9.34
% 69.60/9.34 cnf(c14, axiom,
% 69.60/9.34 in(X9,X10) | ~sP1(X11,X9,X10)).
% 69.60/9.34 cnf(a8, assumption,
% 69.60/9.34 X7 = X11).
% 69.60/9.34 cnf(a9, assumption,
% 69.60/9.34 sK5(X6,X7,X8) = X9).
% 69.60/9.34 cnf(a10, assumption,
% 69.60/9.34 X6 = X10).
% 69.60/9.34 cnf(c15, plain,
% 69.60/9.34 in(sK5(X6,X7,X8),X8),
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c13, c14])).
% 69.60/9.34 cnf(c16, plain,
% 69.60/9.34 in(X9,X10),
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c13, c14])).
% 69.60/9.34
% 69.60/9.34 cnf(c17, axiom,
% 69.60/9.34 X12 = X13 | ~in(X13,X14) | ~sP0(X12,X14)).
% 69.60/9.34 cnf(a11, assumption,
% 69.60/9.34 X9 = X13).
% 69.60/9.34 cnf(a12, assumption,
% 69.60/9.34 X10 = X14).
% 69.60/9.34 cnf(c18, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a11, a12])], [c16, c17])).
% 69.60/9.34 cnf(c19, plain,
% 69.60/9.34 X12 = X13 | ~sP0(X12,X14),
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a11, a12])], [c16, c17])).
% 69.60/9.34
% 69.60/9.34 cnf(c20, plain,
% 69.60/9.34 sP1(X7,sK5(X6,X7,X8),X6)).
% 69.60/9.34 cnf(a13, assumption,
% 69.60/9.34 sK5(X6,X7,X8) = X13).
% 69.60/9.34 cnf(c21, plain,
% 69.60/9.34 ~sP0(X12,X14),
% 69.60/9.34 inference(subterm_reduction, [assumptions([a13])], [c19, c20])).
% 69.60/9.34 cnf(c22, plain,
% 69.60/9.34 sP1(X7,X12,X6),
% 69.60/9.34 inference(subterm_reduction, [assumptions([a13])], [c19, c20])).
% 69.60/9.34
% 69.60/9.34 cnf(c23, axiom,
% 69.60/9.34 in(X15,X16) | ~sP1(X16,X15,X17)).
% 69.60/9.34 cnf(a14, assumption,
% 69.60/9.34 X7 = X16).
% 69.60/9.34 cnf(a15, assumption,
% 69.60/9.34 X12 = X15).
% 69.60/9.34 cnf(a16, assumption,
% 69.60/9.34 X6 = X17).
% 69.60/9.34 cnf(c24, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a14, a15, a16])], [c22, c23])).
% 69.60/9.34 cnf(c25, plain,
% 69.60/9.34 in(X15,X16),
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a14, a15, a16])], [c22, c23])).
% 69.60/9.34
% 69.60/9.34 cnf(c26, axiom,
% 69.60/9.34 ~in(sK6,sK7)).
% 69.60/9.34 cnf(a17, assumption,
% 69.60/9.34 X15 = sK6).
% 69.60/9.34 cnf(a18, assumption,
% 69.60/9.34 X16 = sK7).
% 69.60/9.34 cnf(c27, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a17, a18])], [c25, c26])).
% 69.60/9.34 cnf(c28, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a17, a18])], [c25, c26])).
% 69.60/9.34
% 69.60/9.34 cnf(c29, axiom,
% 69.60/9.34 sP0(X18,singleton(X18))).
% 69.60/9.34 cnf(a19, assumption,
% 69.60/9.34 X12 = X18).
% 69.60/9.34 cnf(a20, assumption,
% 69.60/9.34 X14 = singleton(X18)).
% 69.60/9.34 cnf(c30, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a19, a20])], [c21, c29])).
% 69.60/9.34 cnf(c31, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a19, a20])], [c21, c29])).
% 69.60/9.34
% 69.60/9.34 cnf(c32, axiom,
% 69.60/9.34 in(X19,X20) | ~in(X19,X21) | ~subset(X21,X20)).
% 69.60/9.34 cnf(a21, assumption,
% 69.60/9.34 sK5(X6,X7,X8) = X19).
% 69.60/9.34 cnf(a22, assumption,
% 69.60/9.34 X8 = X21).
% 69.60/9.34 cnf(c33, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a21, a22])], [c15, c32])).
% 69.60/9.34 cnf(c34, plain,
% 69.60/9.34 in(X19,X20) | ~subset(X21,X20),
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a21, a22])], [c15, c32])).
% 69.60/9.34
% 69.60/9.34 cnf(c35, axiom,
% 69.60/9.34 ~in(X22,X23) | ~in(X23,X22)).
% 69.60/9.34 cnf(a23, assumption,
% 69.60/9.34 X19 = X23).
% 69.60/9.34 cnf(a24, assumption,
% 69.60/9.34 X20 = X22).
% 69.60/9.34 cnf(c36, plain,
% 69.60/9.34 ~subset(X21,X20),
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a23, a24])], [c34, c35])).
% 69.60/9.34 cnf(c37, plain,
% 69.60/9.34 ~in(X22,X23),
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a23, a24])], [c34, c35])).
% 69.60/9.34
% 69.60/9.34 cnf(c38, plain,
% 69.60/9.34 in(X19,X20)).
% 69.60/9.34 cnf(a25, assumption,
% 69.60/9.34 X22 = X19).
% 69.60/9.34 cnf(a26, assumption,
% 69.60/9.34 X23 = X20).
% 69.60/9.34 cnf(c39, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(predicate_reduction, [assumptions([a25, a26])], [c37, c38])).
% 69.60/9.34
% 69.60/9.34 cnf(c40, axiom,
% 69.60/9.34 subset(empty_set,X24)).
% 69.60/9.34 cnf(a27, assumption,
% 69.60/9.34 X21 = empty_set).
% 69.60/9.34 cnf(a28, assumption,
% 69.60/9.34 X20 = X24).
% 69.60/9.34 cnf(c41, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a27, a28])], [c36, c40])).
% 69.60/9.34 cnf(c42, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(strict_predicate_extension, [assumptions([a27, a28])], [c36, c40])).
% 69.60/9.34
% 69.60/9.34 cnf(c43, plain,
% 69.60/9.34 $false,
% 69.60/9.34 inference(constraint_solving, [
% 69.60/9.34 bind(X0, singleton(sK6)),
% 69.60/9.34 bind(X1, sK7),
% 69.60/9.34 bind(X2, singleton(sK6)),
% 69.60/9.34 bind(X3, sK7),
% 69.60/9.34 bind(X4, empty_set),
% 69.60/9.34 bind(X5, empty_set),
% 69.60/9.34 bind(X6, singleton(sK6)),
% 69.60/9.34 bind(X7, sK7),
% 69.60/9.34 bind(X8, empty_set),
% 69.60/9.34 bind(X9, sK5(X6,X7,X8)),
% 69.60/9.34 bind(X10, singleton(sK6)),
% 69.60/9.34 bind(X11, sK7),
% 69.60/9.34 bind(X12, sK6),
% 69.60/9.34 bind(X13, sK5(X6,X7,X8)),
% 69.60/9.34 bind(X14, singleton(sK6)),
% 69.60/9.34 bind(X15, sK6),
% 69.60/9.34 bind(X16, sK7),
% 69.60/9.34 bind(X17, singleton(sK6)),
% 69.60/9.34 bind(X18, sK6),
% 69.60/9.34 bind(X19, sK5(X6,X7,X8)),
% 69.60/9.34 bind(X20, sK5(X6,X7,X8)),
% 69.60/9.34 bind(X21, empty_set),
% 69.60/9.34 bind(X22, sK5(X6,X7,X8)),
% 69.60/9.34 bind(X23, sK5(X6,X7,X8)),
% 69.60/9.34 bind(X24, sK5(X6,X7,X8))
% 69.60/9.34 ],
% 69.60/9.34 [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])).
% 69.60/9.34
% 69.60/9.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------