TSTP Solution File: SET906+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET906+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 : n017.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:06 EDT 2022
% Result : Theorem 0.14s 0.40s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET906+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34 % Computer : n017.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 10 22:06:18 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.40 % SZS status Theorem
% 0.14/0.40 % SZS output begin IncompleteProof
% 0.14/0.40 cnf(c0, axiom,
% 0.14/0.40 subset(set_union2(unordered_pair(sK9,sK10),sK11),sK11)).
% 0.14/0.40 cnf(c1, plain,
% 0.14/0.40 subset(set_union2(unordered_pair(sK9,sK10),sK11),sK11),
% 0.14/0.40 inference(start, [], [c0])).
% 0.14/0.40
% 0.14/0.40 cnf(c2, axiom,
% 0.14/0.40 in(X0,X1) | ~in(X0,X2) | ~subset(X2,X1)).
% 0.14/0.40 cnf(a0, assumption,
% 0.14/0.40 set_union2(unordered_pair(sK9,sK10),sK11) = X2).
% 0.14/0.40 cnf(a1, assumption,
% 0.14/0.40 sK11 = X1).
% 0.14/0.40 cnf(c3, plain,
% 0.14/0.40 $false,
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.40 cnf(c4, plain,
% 0.14/0.40 in(X0,X1) | ~in(X0,X2),
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.14/0.40
% 0.14/0.40 cnf(c5, axiom,
% 0.14/0.40 ~in(sK9,sK11)).
% 0.14/0.40 cnf(a2, assumption,
% 0.14/0.40 X0 = sK9).
% 0.14/0.40 cnf(a3, assumption,
% 0.14/0.40 X1 = sK11).
% 0.14/0.40 cnf(c6, plain,
% 0.14/0.40 ~in(X0,X2),
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.40 cnf(c7, plain,
% 0.14/0.40 $false,
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])).
% 0.14/0.40
% 0.14/0.40 cnf(c8, axiom,
% 0.14/0.40 in(X3,X4) | ~sP2(X5,X3,X6) | ~sP3(X6,X5,X4)).
% 0.14/0.40 cnf(a4, assumption,
% 0.14/0.40 X0 = X3).
% 0.14/0.40 cnf(a5, assumption,
% 0.14/0.40 X2 = X4).
% 0.14/0.40 cnf(c9, plain,
% 0.14/0.40 $false,
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.14/0.40 cnf(c10, plain,
% 0.14/0.40 ~sP2(X5,X3,X6) | ~sP3(X6,X5,X4),
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 0.14/0.40
% 0.14/0.40 cnf(c11, axiom,
% 0.14/0.40 sP2(X7,X8,X9) | ~in(X8,X9)).
% 0.14/0.40 cnf(a6, assumption,
% 0.14/0.40 X5 = X7).
% 0.14/0.40 cnf(a7, assumption,
% 0.14/0.40 X3 = X8).
% 0.14/0.40 cnf(a8, assumption,
% 0.14/0.40 X6 = X9).
% 0.14/0.40 cnf(c12, plain,
% 0.14/0.40 ~sP3(X6,X5,X4),
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c10, c11])).
% 0.14/0.40 cnf(c13, plain,
% 0.14/0.40 ~in(X8,X9),
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c10, c11])).
% 0.14/0.40
% 0.14/0.40 cnf(c14, axiom,
% 0.14/0.40 in(X10,X11) | ~sP0(X10,X12,X13) | ~sP1(X13,X12,X11)).
% 0.14/0.40 cnf(a9, assumption,
% 0.14/0.40 X8 = X10).
% 0.14/0.40 cnf(a10, assumption,
% 0.14/0.40 X9 = X11).
% 0.14/0.40 cnf(c15, plain,
% 0.14/0.40 $false,
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c14])).
% 0.14/0.40 cnf(c16, plain,
% 0.14/0.40 ~sP0(X10,X12,X13) | ~sP1(X13,X12,X11),
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c14])).
% 0.14/0.40
% 0.14/0.40 cnf(c17, axiom,
% 0.14/0.40 sP0(X14,X15,X14)).
% 0.14/0.40 cnf(a11, assumption,
% 0.14/0.40 X10 = X14).
% 0.14/0.40 cnf(a12, assumption,
% 0.14/0.40 X12 = X15).
% 0.14/0.40 cnf(a13, assumption,
% 0.14/0.40 X13 = X14).
% 0.14/0.40 cnf(c18, plain,
% 0.14/0.40 ~sP1(X13,X12,X11),
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c16, c17])).
% 0.14/0.40 cnf(c19, plain,
% 0.14/0.40 $false,
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c16, c17])).
% 0.14/0.40
% 0.14/0.40 cnf(c20, axiom,
% 0.14/0.40 sP1(X16,X17,unordered_pair(X16,X17))).
% 0.14/0.40 cnf(a14, assumption,
% 0.14/0.40 X13 = X16).
% 0.14/0.40 cnf(a15, assumption,
% 0.14/0.40 X12 = X17).
% 0.14/0.40 cnf(a16, assumption,
% 0.14/0.40 X11 = unordered_pair(X16,X17)).
% 0.14/0.40 cnf(c21, plain,
% 0.14/0.40 $false,
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a14, a15, a16])], [c18, c20])).
% 0.14/0.40 cnf(c22, plain,
% 0.14/0.40 $false,
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a14, a15, a16])], [c18, c20])).
% 0.14/0.40
% 0.14/0.40 cnf(c23, axiom,
% 0.14/0.40 sP3(X18,X19,set_union2(X18,X19))).
% 0.14/0.40 cnf(a17, assumption,
% 0.14/0.40 X6 = X18).
% 0.14/0.40 cnf(a18, assumption,
% 0.14/0.40 X5 = X19).
% 0.14/0.40 cnf(a19, assumption,
% 0.14/0.40 X4 = set_union2(X18,X19)).
% 0.14/0.40 cnf(c24, plain,
% 0.14/0.40 $false,
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a17, a18, a19])], [c12, c23])).
% 0.14/0.40 cnf(c25, plain,
% 0.14/0.40 $false,
% 0.14/0.40 inference(strict_predicate_extension, [assumptions([a17, a18, a19])], [c12, c23])).
% 0.14/0.40
% 0.14/0.40 cnf(c26, plain,
% 0.14/0.40 $false,
% 0.14/0.40 inference(constraint_solving, [
% 0.14/0.40 bind(X0, sK9),
% 0.14/0.40 bind(X1, sK11),
% 0.14/0.40 bind(X2, set_union2(unordered_pair(sK9,sK10),sK11)),
% 0.14/0.40 bind(X3, sK9),
% 0.14/0.40 bind(X4, set_union2(unordered_pair(sK9,sK10),sK11)),
% 0.14/0.40 bind(X5, sK11),
% 0.14/0.40 bind(X6, unordered_pair(X16,X17)),
% 0.14/0.40 bind(X7, sK11),
% 0.14/0.40 bind(X8, sK9),
% 0.14/0.40 bind(X9, unordered_pair(X16,X17)),
% 0.14/0.40 bind(X10, sK9),
% 0.14/0.40 bind(X11, unordered_pair(X16,X17)),
% 0.14/0.40 bind(X12, sK10),
% 0.14/0.40 bind(X13, sK9),
% 0.14/0.40 bind(X14, sK9),
% 0.14/0.40 bind(X15, sK10),
% 0.14/0.40 bind(X16, sK9),
% 0.14/0.40 bind(X17, sK10),
% 0.14/0.40 bind(X18, unordered_pair(X16,X17)),
% 0.14/0.40 bind(X19, sK11)
% 0.14/0.40 ],
% 0.14/0.40 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])).
% 0.14/0.40
% 0.14/0.40 % SZS output end IncompleteProof
%------------------------------------------------------------------------------