TSTP Solution File: SET914+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET914+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 : n016.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:10 EDT 2022
% Result : Theorem 2.05s 0.61s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET914+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34 % Computer : n016.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 15:44:41 EDT 2022
% 0.14/0.34 % CPUTime :
% 2.05/0.61 % SZS status Theorem
% 2.05/0.61 % SZS output begin IncompleteProof
% 2.05/0.61 cnf(c0, axiom,
% 2.05/0.61 disjoint(unordered_pair(sK9,sK10),sK11)).
% 2.05/0.61 cnf(c1, plain,
% 2.05/0.61 disjoint(unordered_pair(sK9,sK10),sK11),
% 2.05/0.61 inference(start, [], [c0])).
% 2.05/0.61
% 2.05/0.61 cnf(c2, axiom,
% 2.05/0.61 set_intersection2(X0,X1) = empty_set | ~disjoint(X0,X1)).
% 2.05/0.61 cnf(a0, assumption,
% 2.05/0.61 unordered_pair(sK9,sK10) = X0).
% 2.05/0.61 cnf(a1, assumption,
% 2.05/0.61 sK11 = X1).
% 2.05/0.61 cnf(c3, plain,
% 2.05/0.61 $false,
% 2.05/0.61 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.05/0.61 cnf(c4, plain,
% 2.05/0.61 set_intersection2(X0,X1) = empty_set,
% 2.05/0.61 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 2.05/0.61
% 2.05/0.61 cnf(c5, axiom,
% 2.05/0.61 sP3(X2,X3,set_intersection2(X2,X3))).
% 2.05/0.61 cnf(a2, assumption,
% 2.05/0.61 set_intersection2(X2,X3) = set_intersection2(X0,X1)).
% 2.05/0.61 cnf(a3, assumption,
% 2.05/0.61 empty_set = X4).
% 2.05/0.61 cnf(c6, plain,
% 2.05/0.61 $false,
% 2.05/0.61 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.05/0.61 cnf(c7, plain,
% 2.05/0.61 $false,
% 2.05/0.61 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.05/0.61 cnf(c8, plain,
% 2.05/0.61 sP3(X2,X3,X4),
% 2.05/0.61 inference(strict_subterm_extension, [assumptions([a2, a3])], [c4, c5])).
% 2.05/0.61
% 2.05/0.61 cnf(c9, axiom,
% 2.05/0.61 in(X5,X6) | ~sP2(X7,X5,X8) | ~sP3(X8,X7,X6)).
% 2.05/0.61 cnf(a4, assumption,
% 2.05/0.61 X2 = X8).
% 2.05/0.61 cnf(a5, assumption,
% 2.05/0.61 X3 = X7).
% 2.05/0.61 cnf(a6, assumption,
% 2.05/0.61 X4 = X6).
% 2.05/0.61 cnf(c10, plain,
% 2.05/0.61 $false,
% 2.05/0.61 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c8, c9])).
% 2.05/0.61 cnf(c11, plain,
% 2.05/0.61 in(X5,X6) | ~sP2(X7,X5,X8),
% 2.05/0.61 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c8, c9])).
% 2.05/0.61
% 2.05/0.61 cnf(c12, axiom,
% 2.05/0.61 ~in(X9,empty_set)).
% 2.05/0.61 cnf(a7, assumption,
% 2.05/0.61 X5 = X9).
% 2.05/0.61 cnf(a8, assumption,
% 2.05/0.61 X6 = empty_set).
% 2.05/0.61 cnf(c13, plain,
% 2.05/0.61 ~sP2(X7,X5,X8),
% 2.05/0.61 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c12])).
% 2.05/0.61 cnf(c14, plain,
% 2.05/0.61 $false,
% 2.05/0.61 inference(strict_predicate_extension, [assumptions([a7, a8])], [c11, c12])).
% 2.05/0.61
% 2.05/0.61 cnf(c15, axiom,
% 2.05/0.61 sP2(X10,X11,X12) | ~in(X11,X10) | ~in(X11,X12)).
% 2.05/0.61 cnf(a9, assumption,
% 2.05/0.61 X7 = X10).
% 2.05/0.61 cnf(a10, assumption,
% 2.05/0.61 X5 = X11).
% 2.05/0.61 cnf(a11, assumption,
% 2.05/0.61 X8 = X12).
% 2.05/0.61 cnf(c16, plain,
% 2.05/0.61 $false,
% 2.05/0.61 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c13, c15])).
% 2.05/0.61 cnf(c17, plain,
% 2.05/0.62 ~in(X11,X10) | ~in(X11,X12),
% 2.05/0.62 inference(strict_predicate_extension, [assumptions([a9, a10, a11])], [c13, c15])).
% 2.05/0.62
% 2.05/0.62 cnf(c18, axiom,
% 2.05/0.62 in(sK9,sK11)).
% 2.05/0.62 cnf(a12, assumption,
% 2.05/0.62 X11 = sK9).
% 2.05/0.62 cnf(a13, assumption,
% 2.05/0.62 X10 = sK11).
% 2.05/0.62 cnf(c19, plain,
% 2.05/0.62 ~in(X11,X12),
% 2.05/0.62 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c18])).
% 2.05/0.62 cnf(c20, plain,
% 2.05/0.62 $false,
% 2.05/0.62 inference(strict_predicate_extension, [assumptions([a12, a13])], [c17, c18])).
% 2.05/0.62
% 2.05/0.62 cnf(c21, axiom,
% 2.05/0.62 in(X13,X14) | ~sP0(X13,X15,X16) | ~sP1(X16,X15,X14)).
% 2.05/0.62 cnf(a14, assumption,
% 2.05/0.62 X11 = X13).
% 2.05/0.62 cnf(a15, assumption,
% 2.05/0.62 X12 = X14).
% 2.05/0.62 cnf(c22, plain,
% 2.05/0.62 $false,
% 2.05/0.62 inference(strict_predicate_extension, [assumptions([a14, a15])], [c19, c21])).
% 2.05/0.62 cnf(c23, plain,
% 2.05/0.62 ~sP0(X13,X15,X16) | ~sP1(X16,X15,X14),
% 2.05/0.62 inference(strict_predicate_extension, [assumptions([a14, a15])], [c19, c21])).
% 2.05/0.62
% 2.05/0.62 cnf(c24, axiom,
% 2.05/0.62 sP0(X17,X18,X17)).
% 2.05/0.62 cnf(a16, assumption,
% 2.05/0.62 X13 = X17).
% 2.05/0.62 cnf(a17, assumption,
% 2.05/0.62 X15 = X18).
% 2.05/0.62 cnf(a18, assumption,
% 2.05/0.62 X16 = X17).
% 2.05/0.62 cnf(c25, plain,
% 2.05/0.62 ~sP1(X16,X15,X14),
% 2.05/0.62 inference(strict_predicate_extension, [assumptions([a16, a17, a18])], [c23, c24])).
% 2.05/0.62 cnf(c26, plain,
% 2.05/0.62 $false,
% 2.05/0.62 inference(strict_predicate_extension, [assumptions([a16, a17, a18])], [c23, c24])).
% 2.05/0.62
% 2.05/0.62 cnf(c27, axiom,
% 2.05/0.62 sP1(X19,X20,unordered_pair(X19,X20))).
% 2.05/0.62 cnf(a19, assumption,
% 2.05/0.62 X16 = X19).
% 2.05/0.62 cnf(a20, assumption,
% 2.05/0.62 X15 = X20).
% 2.05/0.62 cnf(a21, assumption,
% 2.05/0.62 X14 = unordered_pair(X19,X20)).
% 2.05/0.62 cnf(c28, plain,
% 2.05/0.62 $false,
% 2.05/0.62 inference(strict_predicate_extension, [assumptions([a19, a20, a21])], [c25, c27])).
% 2.05/0.62 cnf(c29, plain,
% 2.05/0.62 $false,
% 2.05/0.62 inference(strict_predicate_extension, [assumptions([a19, a20, a21])], [c25, c27])).
% 2.05/0.62
% 2.05/0.62 cnf(c30, plain,
% 2.05/0.62 $false,
% 2.05/0.62 inference(constraint_solving, [
% 2.05/0.62 bind(X0, unordered_pair(sK9,sK10)),
% 2.05/0.62 bind(X1, sK11),
% 2.05/0.62 bind(X2, unordered_pair(sK9,sK10)),
% 2.05/0.62 bind(X3, sK11),
% 2.05/0.62 bind(X4, empty_set),
% 2.05/0.62 bind(X5, sK9),
% 2.05/0.62 bind(X6, empty_set),
% 2.05/0.62 bind(X7, sK11),
% 2.05/0.62 bind(X8, unordered_pair(sK9,sK10)),
% 2.05/0.62 bind(X9, sK9),
% 2.05/0.62 bind(X10, sK11),
% 2.05/0.62 bind(X11, sK9),
% 2.05/0.62 bind(X12, unordered_pair(sK9,sK10)),
% 2.05/0.62 bind(X13, sK9),
% 2.05/0.62 bind(X14, unordered_pair(sK9,sK10)),
% 2.05/0.62 bind(X15, sK10),
% 2.05/0.62 bind(X16, sK9),
% 2.05/0.62 bind(X17, sK9),
% 2.05/0.62 bind(X18, sK10),
% 2.05/0.62 bind(X19, sK9),
% 2.05/0.62 bind(X20, sK10)
% 2.05/0.62 ],
% 2.05/0.62 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])).
% 2.05/0.62
% 2.05/0.62 % SZS output end IncompleteProof
%------------------------------------------------------------------------------