TSTP Solution File: SET162+4 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET162+4 : TPTP v8.1.0. Released v2.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 : n006.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:44:21 EDT 2022
% Result : Theorem 10.99s 1.78s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET162+4 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.35 % Computer : n006.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Mon Jul 11 10:18:50 EDT 2022
% 0.15/0.36 % CPUTime :
% 10.99/1.78 % SZS status Theorem
% 10.99/1.78 % SZS output begin IncompleteProof
% 10.99/1.78 cnf(c0, axiom,
% 10.99/1.78 ~equal_set(union(sK3,empty_set),sK3)).
% 10.99/1.78 cnf(c1, plain,
% 10.99/1.78 ~equal_set(union(sK3,empty_set),sK3),
% 10.99/1.78 inference(start, [], [c0])).
% 10.99/1.78
% 10.99/1.78 cnf(c2, axiom,
% 10.99/1.78 equal_set(X0,X1) | ~subset(X1,X0) | ~subset(X0,X1)).
% 10.99/1.78 cnf(a0, assumption,
% 10.99/1.78 union(sK3,empty_set) = X0).
% 10.99/1.78 cnf(a1, assumption,
% 10.99/1.78 sK3 = X1).
% 10.99/1.78 cnf(c3, plain,
% 10.99/1.78 $false,
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 10.99/1.78 cnf(c4, plain,
% 10.99/1.78 ~subset(X1,X0) | ~subset(X0,X1),
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 10.99/1.78
% 10.99/1.78 cnf(c5, axiom,
% 10.99/1.78 subset(X2,X3) | ~member(sK0(X2,X3),X3)).
% 10.99/1.78 cnf(a2, assumption,
% 10.99/1.78 X1 = X2).
% 10.99/1.78 cnf(a3, assumption,
% 10.99/1.78 X0 = X3).
% 10.99/1.78 cnf(c6, plain,
% 10.99/1.78 ~subset(X0,X1),
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 10.99/1.78 cnf(c7, plain,
% 10.99/1.78 ~member(sK0(X2,X3),X3),
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 10.99/1.78
% 10.99/1.78 cnf(c8, axiom,
% 10.99/1.78 member(X4,union(X5,X6)) | ~member(X4,X5)).
% 10.99/1.78 cnf(a4, assumption,
% 10.99/1.78 sK0(X2,X3) = X4).
% 10.99/1.78 cnf(a5, assumption,
% 10.99/1.78 X3 = union(X5,X6)).
% 10.99/1.78 cnf(c9, plain,
% 10.99/1.78 $false,
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 10.99/1.78 cnf(c10, plain,
% 10.99/1.78 ~member(X4,X5),
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 10.99/1.78
% 10.99/1.78 cnf(c11, axiom,
% 10.99/1.78 subset(X7,X8) | member(sK0(X7,X8),X7)).
% 10.99/1.78 cnf(a6, assumption,
% 10.99/1.78 X4 = sK0(X7,X8)).
% 10.99/1.78 cnf(a7, assumption,
% 10.99/1.78 X5 = X7).
% 10.99/1.78 cnf(c12, plain,
% 10.99/1.78 $false,
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 10.99/1.78 cnf(c13, plain,
% 10.99/1.78 subset(X7,X8),
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 10.99/1.78
% 10.99/1.78 cnf(c14, plain,
% 10.99/1.78 ~subset(X1,X0)).
% 10.99/1.78 cnf(a8, assumption,
% 10.99/1.78 X7 = X1).
% 10.99/1.78 cnf(a9, assumption,
% 10.99/1.78 X8 = X0).
% 10.99/1.78 cnf(c15, plain,
% 10.99/1.78 $false,
% 10.99/1.78 inference(predicate_reduction, [assumptions([a8, a9])], [c13, c14])).
% 10.99/1.78
% 10.99/1.78 cnf(c16, axiom,
% 10.99/1.78 subset(X9,X10) | member(sK0(X9,X10),X9)).
% 10.99/1.78 cnf(a10, assumption,
% 10.99/1.78 X0 = X9).
% 10.99/1.78 cnf(a11, assumption,
% 10.99/1.78 X1 = X10).
% 10.99/1.78 cnf(c17, plain,
% 10.99/1.78 $false,
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c16])).
% 10.99/1.78 cnf(c18, plain,
% 10.99/1.78 member(sK0(X9,X10),X9),
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c16])).
% 10.99/1.78
% 10.99/1.78 cnf(c19, axiom,
% 10.99/1.78 member(X11,X12) | member(X11,X13) | ~member(X11,union(X13,X12))).
% 10.99/1.78 cnf(a12, assumption,
% 10.99/1.78 sK0(X9,X10) = X11).
% 10.99/1.78 cnf(a13, assumption,
% 10.99/1.78 X9 = union(X13,X12)).
% 10.99/1.78 cnf(c20, plain,
% 10.99/1.78 $false,
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c19])).
% 10.99/1.78 cnf(c21, plain,
% 10.99/1.78 member(X11,X12) | member(X11,X13),
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a12, a13])], [c18, c19])).
% 10.99/1.78
% 10.99/1.78 cnf(c22, axiom,
% 10.99/1.78 ~member(X14,empty_set)).
% 10.99/1.78 cnf(a14, assumption,
% 10.99/1.78 X11 = X14).
% 10.99/1.78 cnf(a15, assumption,
% 10.99/1.78 X12 = empty_set).
% 10.99/1.78 cnf(c23, plain,
% 10.99/1.78 member(X11,X13),
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])).
% 10.99/1.78 cnf(c24, plain,
% 10.99/1.78 $false,
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a14, a15])], [c21, c22])).
% 10.99/1.78
% 10.99/1.78 cnf(c25, axiom,
% 10.99/1.78 subset(X15,X16) | ~member(sK0(X15,X16),X16)).
% 10.99/1.78 cnf(a16, assumption,
% 10.99/1.78 X11 = sK0(X15,X16)).
% 10.99/1.78 cnf(a17, assumption,
% 10.99/1.78 X13 = X16).
% 10.99/1.78 cnf(c26, plain,
% 10.99/1.78 $false,
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c25])).
% 10.99/1.78 cnf(c27, plain,
% 10.99/1.78 subset(X15,X16),
% 10.99/1.78 inference(strict_predicate_extension, [assumptions([a16, a17])], [c23, c25])).
% 10.99/1.78
% 10.99/1.78 cnf(c28, plain,
% 10.99/1.78 ~subset(X0,X1)).
% 10.99/1.78 cnf(a18, assumption,
% 10.99/1.78 X15 = X0).
% 10.99/1.78 cnf(a19, assumption,
% 10.99/1.78 X16 = X1).
% 10.99/1.78 cnf(c29, plain,
% 10.99/1.78 $false,
% 10.99/1.78 inference(predicate_reduction, [assumptions([a18, a19])], [c27, c28])).
% 10.99/1.78
% 10.99/1.78 cnf(c30, plain,
% 10.99/1.78 $false,
% 10.99/1.78 inference(constraint_solving, [
% 10.99/1.78 bind(X0, union(sK3,empty_set)),
% 10.99/1.78 bind(X1, sK3),
% 10.99/1.78 bind(X2, sK3),
% 10.99/1.78 bind(X3, union(sK3,empty_set)),
% 10.99/1.78 bind(X4, sK0(X2,X3)),
% 10.99/1.78 bind(X5, sK3),
% 10.99/1.78 bind(X6, empty_set),
% 10.99/1.78 bind(X7, sK3),
% 10.99/1.78 bind(X8, union(sK3,empty_set)),
% 10.99/1.78 bind(X9, union(sK3,empty_set)),
% 10.99/1.78 bind(X10, sK3),
% 10.99/1.78 bind(X11, sK0(X9,X10)),
% 10.99/1.78 bind(X12, empty_set),
% 10.99/1.78 bind(X13, sK3),
% 10.99/1.78 bind(X14, sK0(X9,X10)),
% 10.99/1.78 bind(X15, union(sK3,empty_set)),
% 10.99/1.78 bind(X16, sK3)
% 10.99/1.78 ],
% 10.99/1.78 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])).
% 10.99/1.78
% 10.99/1.78 % SZS output end IncompleteProof
%------------------------------------------------------------------------------