TSTP Solution File: TOP005-2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : TOP005-2 : TPTP v8.1.0. Released v1.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 : n020.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 : Thu Jul 21 21:31:28 EDT 2022
% Result : Unsatisfiable 3.42s 0.80s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : TOP005-2 : TPTP v8.1.0. Released v1.0.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.34 % Computer : n020.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 : Sun May 29 12:27:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 3.42/0.80 % SZS status Unsatisfiable
% 3.42/0.80 % SZS output begin IncompleteProof
% 3.42/0.80 cnf(c0, axiom,
% 3.42/0.80 ~element_of_collection(union_of_members(g),top_of_basis(f))).
% 3.42/0.80 cnf(c1, plain,
% 3.42/0.80 ~element_of_collection(union_of_members(g),top_of_basis(f)),
% 3.42/0.80 inference(start, [], [c0])).
% 3.42/0.80
% 3.42/0.80 cnf(c2, axiom,
% 3.42/0.80 element_of_set(f11(X0,X1),X1) | element_of_collection(X1,top_of_basis(X0))).
% 3.42/0.80 cnf(a0, assumption,
% 3.42/0.80 union_of_members(g) = X1).
% 3.42/0.80 cnf(a1, assumption,
% 3.42/0.80 top_of_basis(f) = top_of_basis(X0)).
% 3.42/0.80 cnf(c3, plain,
% 3.42/0.80 $false,
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 3.42/0.80 cnf(c4, plain,
% 3.42/0.80 element_of_set(f11(X0,X1),X1),
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 3.42/0.80
% 3.42/0.80 cnf(c5, axiom,
% 3.42/0.80 element_of_set(X2,f1(X3,X2)) | ~element_of_set(X2,union_of_members(X3))).
% 3.42/0.80 cnf(a2, assumption,
% 3.42/0.80 f11(X0,X1) = X2).
% 3.42/0.80 cnf(a3, assumption,
% 3.42/0.80 X1 = union_of_members(X3)).
% 3.42/0.80 cnf(c6, plain,
% 3.42/0.80 $false,
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 3.42/0.80 cnf(c7, plain,
% 3.42/0.80 element_of_set(X2,f1(X3,X2)),
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 3.42/0.80
% 3.42/0.80 cnf(c8, axiom,
% 3.42/0.80 element_of_set(X4,f10(X5,X6,X4)) | ~element_of_set(X4,X6) | ~element_of_collection(X6,top_of_basis(X5))).
% 3.42/0.80 cnf(a4, assumption,
% 3.42/0.80 X2 = X4).
% 3.42/0.80 cnf(a5, assumption,
% 3.42/0.80 f1(X3,X2) = X6).
% 3.42/0.80 cnf(c9, plain,
% 3.42/0.80 $false,
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 3.42/0.80 cnf(c10, plain,
% 3.42/0.80 element_of_set(X4,f10(X5,X6,X4)) | ~element_of_collection(X6,top_of_basis(X5)),
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 3.42/0.80
% 3.42/0.80 cnf(c11, axiom,
% 3.42/0.80 ~subset_sets(X7,X8) | ~element_of_collection(X7,X9) | ~element_of_set(f11(X9,X8),X7) | element_of_collection(X8,top_of_basis(X9))).
% 3.42/0.80 cnf(a6, assumption,
% 3.42/0.80 X4 = f11(X9,X8)).
% 3.42/0.80 cnf(a7, assumption,
% 3.42/0.80 f10(X5,X6,X4) = X7).
% 3.42/0.80 cnf(c12, plain,
% 3.42/0.80 ~element_of_collection(X6,top_of_basis(X5)),
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 3.42/0.80 cnf(c13, plain,
% 3.42/0.80 ~subset_sets(X7,X8) | ~element_of_collection(X7,X9) | element_of_collection(X8,top_of_basis(X9)),
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 3.42/0.80
% 3.42/0.80 cnf(c14, axiom,
% 3.42/0.80 subset_sets(X10,union_of_members(X11)) | ~element_of_collection(X12,X11) | ~subset_sets(X10,X12)).
% 3.42/0.80 cnf(a8, assumption,
% 3.42/0.80 X7 = X10).
% 3.42/0.80 cnf(a9, assumption,
% 3.42/0.80 X8 = union_of_members(X11)).
% 3.42/0.80 cnf(c15, plain,
% 3.42/0.80 ~element_of_collection(X7,X9) | element_of_collection(X8,top_of_basis(X9)),
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 3.42/0.80 cnf(c16, plain,
% 3.42/0.80 ~element_of_collection(X12,X11) | ~subset_sets(X10,X12),
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a8, a9])], [c13, c14])).
% 3.42/0.80
% 3.42/0.80 cnf(c17, axiom,
% 3.42/0.80 element_of_collection(f1(X13,X14),X13) | ~element_of_set(X14,union_of_members(X13))).
% 3.42/0.80 cnf(a10, assumption,
% 3.42/0.80 X12 = f1(X13,X14)).
% 3.42/0.80 cnf(a11, assumption,
% 3.42/0.80 X11 = X13).
% 3.42/0.80 cnf(c18, plain,
% 3.42/0.80 ~subset_sets(X10,X12),
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 3.42/0.80 cnf(c19, plain,
% 3.42/0.80 ~element_of_set(X14,union_of_members(X13)),
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a10, a11])], [c16, c17])).
% 3.42/0.80
% 3.42/0.80 cnf(c20, plain,
% 3.42/0.80 element_of_set(f11(X0,X1),X1)).
% 3.42/0.80 cnf(a12, assumption,
% 3.42/0.80 X14 = f11(X0,X1)).
% 3.42/0.80 cnf(a13, assumption,
% 3.42/0.80 union_of_members(X13) = X1).
% 3.42/0.80 cnf(c21, plain,
% 3.42/0.80 $false,
% 3.42/0.80 inference(predicate_reduction, [assumptions([a12, a13])], [c19, c20])).
% 3.42/0.80
% 3.42/0.80 cnf(c22, axiom,
% 3.42/0.80 subset_sets(f10(X15,X16,X17),X16) | ~element_of_set(X17,X16) | ~element_of_collection(X16,top_of_basis(X15))).
% 3.42/0.80 cnf(a14, assumption,
% 3.42/0.80 X10 = f10(X15,X16,X17)).
% 3.42/0.80 cnf(a15, assumption,
% 3.42/0.80 X12 = X16).
% 3.42/0.80 cnf(c23, plain,
% 3.42/0.80 $false,
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a14, a15])], [c18, c22])).
% 3.42/0.80 cnf(c24, plain,
% 3.42/0.80 ~element_of_set(X17,X16) | ~element_of_collection(X16,top_of_basis(X15)),
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a14, a15])], [c18, c22])).
% 3.42/0.80
% 3.42/0.80 cnf(c25, plain,
% 3.42/0.80 element_of_set(X2,f1(X3,X2))).
% 3.42/0.80 cnf(a16, assumption,
% 3.42/0.80 X17 = X2).
% 3.42/0.80 cnf(a17, assumption,
% 3.42/0.80 X16 = f1(X3,X2)).
% 3.42/0.80 cnf(c26, plain,
% 3.42/0.80 ~element_of_collection(X16,top_of_basis(X15)),
% 3.42/0.80 inference(predicate_reduction, [assumptions([a16, a17])], [c24, c25])).
% 3.42/0.80
% 3.42/0.80 cnf(c27, axiom,
% 3.42/0.80 element_of_collection(X18,X19) | ~element_of_collection(X18,X20) | ~subset_collections(X20,X19)).
% 3.42/0.80 cnf(a18, assumption,
% 3.42/0.80 X16 = X18).
% 3.42/0.80 cnf(a19, assumption,
% 3.42/0.80 top_of_basis(X15) = X19).
% 3.42/0.80 cnf(c28, plain,
% 3.42/0.80 $false,
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a18, a19])], [c26, c27])).
% 3.42/0.80 cnf(c29, plain,
% 3.42/0.80 ~element_of_collection(X18,X20) | ~subset_collections(X20,X19),
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a18, a19])], [c26, c27])).
% 3.42/0.80
% 3.42/0.80 cnf(c30, plain,
% 3.42/0.80 element_of_collection(X12,X11)).
% 3.42/0.80 cnf(a20, assumption,
% 3.42/0.80 X18 = X12).
% 3.42/0.80 cnf(a21, assumption,
% 3.42/0.80 X20 = X11).
% 3.42/0.80 cnf(c31, plain,
% 3.42/0.80 ~subset_collections(X20,X19),
% 3.42/0.80 inference(predicate_reduction, [assumptions([a20, a21])], [c29, c30])).
% 3.42/0.80
% 3.42/0.80 cnf(c32, axiom,
% 3.42/0.80 subset_collections(g,top_of_basis(f))).
% 3.42/0.80 cnf(a22, assumption,
% 3.42/0.80 X20 = g).
% 3.42/0.80 cnf(a23, assumption,
% 3.42/0.80 X19 = top_of_basis(f)).
% 3.42/0.80 cnf(c33, plain,
% 3.42/0.80 $false,
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a22, a23])], [c31, c32])).
% 3.42/0.80 cnf(c34, plain,
% 3.42/0.80 $false,
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a22, a23])], [c31, c32])).
% 3.42/0.80
% 3.42/0.80 cnf(c35, axiom,
% 3.42/0.80 element_of_collection(f10(X21,X22,X23),X21) | ~element_of_set(X23,X22) | ~element_of_collection(X22,top_of_basis(X21))).
% 3.42/0.80 cnf(a24, assumption,
% 3.42/0.80 X7 = f10(X21,X22,X23)).
% 3.42/0.80 cnf(a25, assumption,
% 3.42/0.80 X9 = X21).
% 3.42/0.80 cnf(c36, plain,
% 3.42/0.80 element_of_collection(X8,top_of_basis(X9)),
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a24, a25])], [c15, c35])).
% 3.42/0.80 cnf(c37, plain,
% 3.42/0.80 ~element_of_set(X23,X22) | ~element_of_collection(X22,top_of_basis(X21)),
% 3.42/0.80 inference(strict_predicate_extension, [assumptions([a24, a25])], [c15, c35])).
% 3.42/0.80
% 3.42/0.80 cnf(c38, plain,
% 3.42/0.80 element_of_set(X2,f1(X3,X2))).
% 3.42/0.80 cnf(a26, assumption,
% 3.42/0.80 X23 = X2).
% 3.42/0.80 cnf(a27, assumption,
% 3.42/0.80 X22 = f1(X3,X2)).
% 3.42/0.80 cnf(c39, plain,
% 3.42/0.80 ~element_of_collection(X22,top_of_basis(X21)),
% 3.42/0.80 inference(predicate_reduction, [assumptions([a26, a27])], [c37, c38])).
% 3.42/0.80
% 3.42/0.80 cnf(c40, plain,
% 3.42/0.80 element_of_collection(X16,top_of_basis(X15))).
% 3.42/0.80 cnf(a28, assumption,
% 3.42/0.80 X22 = X16).
% 3.42/0.80 cnf(a29, assumption,
% 3.42/0.80 top_of_basis(X21) = top_of_basis(X15)).
% 3.42/0.80 cnf(c41, plain,
% 3.42/0.80 $false,
% 3.42/0.80 inference(predicate_reduction, [assumptions([a28, a29])], [c39, c40])).
% 3.42/0.80
% 3.42/0.80 cnf(c42, plain,
% 3.42/0.80 ~element_of_collection(union_of_members(g),top_of_basis(f))).
% 3.42/0.80 cnf(a30, assumption,
% 3.42/0.80 X8 = union_of_members(g)).
% 3.42/0.80 cnf(a31, assumption,
% 3.42/0.80 top_of_basis(X9) = top_of_basis(f)).
% 3.42/0.80 cnf(c43, plain,
% 3.42/0.80 $false,
% 3.42/0.80 inference(predicate_reduction, [assumptions([a30, a31])], [c36, c42])).
% 3.42/0.80
% 3.42/0.80 cnf(c44, plain,
% 3.42/0.80 element_of_collection(X16,top_of_basis(X15))).
% 3.42/0.80 cnf(a32, assumption,
% 3.42/0.80 X6 = X16).
% 3.42/0.80 cnf(a33, assumption,
% 3.42/0.80 top_of_basis(X5) = top_of_basis(X15)).
% 3.42/0.80 cnf(c45, plain,
% 3.42/0.80 $false,
% 3.42/0.80 inference(predicate_reduction, [assumptions([a32, a33])], [c12, c44])).
% 3.42/0.80
% 3.42/0.80 cnf(c46, plain,
% 3.42/0.80 $false,
% 3.42/0.80 inference(constraint_solving, [
% 3.42/0.80 bind(X0, f),
% 3.42/0.80 bind(X1, union_of_members(g)),
% 3.42/0.80 bind(X2, f11(X0,X1)),
% 3.42/0.80 bind(X3, g),
% 3.42/0.80 bind(X4, f11(X0,X1)),
% 3.42/0.80 bind(X5, f),
% 3.42/0.80 bind(X6, f1(X3,X2)),
% 3.42/0.80 bind(X7, f10(X5,X6,X4)),
% 3.42/0.80 bind(X8, union_of_members(g)),
% 3.42/0.80 bind(X9, f),
% 3.42/0.80 bind(X10, f10(X5,X6,X4)),
% 3.42/0.80 bind(X11, g),
% 3.42/0.80 bind(X12, f1(X13,X14)),
% 3.42/0.80 bind(X13, g),
% 3.42/0.80 bind(X14, f11(X0,X1)),
% 3.42/0.80 bind(X15, f),
% 3.42/0.80 bind(X16, f1(X3,X2)),
% 3.42/0.80 bind(X17, f11(X0,X1)),
% 3.42/0.80 bind(X18, f1(X3,X2)),
% 3.42/0.80 bind(X19, top_of_basis(X15)),
% 3.42/0.80 bind(X20, g),
% 3.42/0.80 bind(X21, f),
% 3.42/0.80 bind(X22, f1(X3,X2)),
% 3.42/0.80 bind(X23, f11(X0,X1))
% 3.42/0.80 ],
% 3.42/0.80 [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, a30, a31, a32, a33])).
% 3.42/0.80
% 3.42/0.80 % SZS output end IncompleteProof
%------------------------------------------------------------------------------