%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU130+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 : 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 11:53:19 EDT 2022 % Result : Theorem 5.00s 1.01s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SEU130+1 : TPTP v8.1.0. Released v3.3.0. % 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n006.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 : Mon Jun 20 03:30:40 EDT 2022 % 0.12/0.33 % CPUTime : % 5.00/1.01 % SZS status Theorem % 5.00/1.01 % SZS output begin IncompleteProof % 5.00/1.01 cnf(c0, axiom, % 5.00/1.01 subset(sK6,sK7)). % 5.00/1.01 cnf(c1, plain, % 5.00/1.01 subset(sK6,sK7), % 5.00/1.01 inference(start, [], [c0])). % 5.00/1.01 % 5.00/1.01 cnf(c2, axiom, % 5.00/1.01 in(X0,X1) | ~in(X0,X2) | ~subset(X2,X1)). % 5.00/1.01 cnf(a0, assumption, % 5.00/1.01 sK6 = X2). % 5.00/1.01 cnf(a1, assumption, % 5.00/1.01 sK7 = X1). % 5.00/1.01 cnf(c3, plain, % 5.00/1.01 $false, % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 5.00/1.01 cnf(c4, plain, % 5.00/1.01 in(X0,X1) | ~in(X0,X2), % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 5.00/1.01 % 5.00/1.01 cnf(c5, axiom, % 5.00/1.01 sP0(X3,X4,X5) | ~in(X4,X3) | ~in(X4,X5)). % 5.00/1.01 cnf(a2, assumption, % 5.00/1.01 X0 = X4). % 5.00/1.01 cnf(a3, assumption, % 5.00/1.01 X1 = X3). % 5.00/1.01 cnf(c6, plain, % 5.00/1.01 ~in(X0,X2), % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 5.00/1.01 cnf(c7, plain, % 5.00/1.01 sP0(X3,X4,X5) | ~in(X4,X5), % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 5.00/1.01 % 5.00/1.01 cnf(c8, axiom, % 5.00/1.01 in(X6,X7) | ~sP0(X8,X6,X9) | ~sP1(X9,X8,X7)). % 5.00/1.01 cnf(a4, assumption, % 5.00/1.01 X3 = X8). % 5.00/1.01 cnf(a5, assumption, % 5.00/1.01 X4 = X6). % 5.00/1.01 cnf(a6, assumption, % 5.00/1.01 X5 = X9). % 5.00/1.01 cnf(c9, plain, % 5.00/1.01 ~in(X4,X5), % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])). % 5.00/1.01 cnf(c10, plain, % 5.00/1.01 in(X6,X7) | ~sP1(X9,X8,X7), % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])). % 5.00/1.01 % 5.00/1.01 cnf(c11, axiom, % 5.00/1.01 subset(X10,X11) | ~in(sK2(X10,X11),X11)). % 5.00/1.01 cnf(a7, assumption, % 5.00/1.01 X6 = sK2(X10,X11)). % 5.00/1.01 cnf(a8, assumption, % 5.00/1.01 X7 = X11). % 5.00/1.01 cnf(c12, plain, % 5.00/1.01 ~sP1(X9,X8,X7), % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])). % 5.00/1.01 cnf(c13, plain, % 5.00/1.01 subset(X10,X11), % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])). % 5.00/1.01 % 5.00/1.01 cnf(c14, axiom, % 5.00/1.01 X12 = X13 | ~subset(X13,X12) | ~subset(X12,X13)). % 5.00/1.01 cnf(a9, assumption, % 5.00/1.01 X10 = X13). % 5.00/1.01 cnf(a10, assumption, % 5.00/1.01 X11 = X12). % 5.00/1.01 cnf(c15, plain, % 5.00/1.01 $false, % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c14])). % 5.00/1.01 cnf(c16, plain, % 5.00/1.01 X12 = X13 | ~subset(X12,X13), % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a9, a10])], [c13, c14])). % 5.00/1.01 % 5.00/1.01 cnf(c17, axiom, % 5.00/1.01 sK6 != set_intersection2(sK6,sK7)). % 5.00/1.01 cnf(a11, assumption, % 5.00/1.01 set_intersection2(sK6,sK7) = X12). % 5.00/1.01 cnf(c18, plain, % 5.00/1.01 ~subset(X12,X13), % 5.00/1.01 inference(strict_subterm_extension, [assumptions([a11])], [c16, c17])). % 5.00/1.01 cnf(c19, plain, % 5.00/1.01 $false, % 5.00/1.01 inference(strict_subterm_extension, [assumptions([a11])], [c16, c17])). % 5.00/1.01 cnf(c20, plain, % 5.00/1.01 sK6 != X13, % 5.00/1.01 inference(strict_subterm_extension, [assumptions([a11])], [c16, c17])). % 5.00/1.01 % 5.00/1.01 cnf(a12, assumption, % 5.00/1.01 sK6 = X13). % 5.00/1.01 cnf(c21, plain, % 5.00/1.01 $false, % 5.00/1.01 inference(reflexivity, [assumptions([a12])], [c20])). % 5.00/1.01 % 5.00/1.01 cnf(c22, axiom, % 5.00/1.01 subset(set_intersection2(X14,X15),X14)). % 5.00/1.01 cnf(a13, assumption, % 5.00/1.01 X12 = set_intersection2(X14,X15)). % 5.00/1.01 cnf(a14, assumption, % 5.00/1.01 X13 = X14). % 5.00/1.01 cnf(c23, plain, % 5.00/1.01 $false, % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a13, a14])], [c18, c22])). % 5.00/1.01 cnf(c24, plain, % 5.00/1.01 $false, % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a13, a14])], [c18, c22])). % 5.00/1.01 % 5.00/1.01 cnf(c25, axiom, % 5.00/1.01 sP1(X16,X17,set_intersection2(X16,X17))). % 5.00/1.01 cnf(a15, assumption, % 5.00/1.01 X9 = X16). % 5.00/1.01 cnf(a16, assumption, % 5.00/1.01 X8 = X17). % 5.00/1.01 cnf(a17, assumption, % 5.00/1.01 X7 = set_intersection2(X16,X17)). % 5.00/1.01 cnf(c26, plain, % 5.00/1.01 $false, % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a15, a16, a17])], [c12, c25])). % 5.00/1.01 cnf(c27, plain, % 5.00/1.01 $false, % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a15, a16, a17])], [c12, c25])). % 5.00/1.01 % 5.00/1.01 cnf(c28, axiom, % 5.00/1.01 subset(X18,X19) | in(sK2(X18,X19),X18)). % 5.00/1.01 cnf(a18, assumption, % 5.00/1.01 X4 = sK2(X18,X19)). % 5.00/1.01 cnf(a19, assumption, % 5.00/1.01 X5 = X18). % 5.00/1.01 cnf(c29, plain, % 5.00/1.01 $false, % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a18, a19])], [c9, c28])). % 5.00/1.01 cnf(c30, plain, % 5.00/1.01 subset(X18,X19), % 5.00/1.01 inference(strict_predicate_extension, [assumptions([a18, a19])], [c9, c28])). % 5.00/1.01 % 5.00/1.01 cnf(c31, plain, % 5.00/1.01 ~subset(X10,X11)). % 5.00/1.01 cnf(a20, assumption, % 5.00/1.01 X18 = X10). % 5.00/1.01 cnf(a21, assumption, % 5.00/1.01 X19 = X11). % 5.00/1.01 cnf(c32, plain, % 5.00/1.01 $false, % 5.00/1.01 inference(predicate_reduction, [assumptions([a20, a21])], [c30, c31])). % 5.00/1.01 % 5.00/1.01 cnf(c33, plain, % 5.00/1.01 in(X4,X5)). % 5.00/1.01 cnf(a22, assumption, % 5.00/1.01 X0 = X4). % 5.00/1.01 cnf(a23, assumption, % 5.00/1.01 X2 = X5). % 5.00/1.01 cnf(c34, plain, % 5.00/1.01 $false, % 5.00/1.01 inference(predicate_reduction, [assumptions([a22, a23])], [c6, c33])). % 5.00/1.01 % 5.00/1.01 cnf(c35, plain, % 5.00/1.01 $false, % 5.00/1.01 inference(constraint_solving, [ % 5.00/1.01 bind(X0, sK2(X10,X11)), % 5.00/1.01 bind(X1, sK7), % 5.00/1.01 bind(X2, sK6), % 5.00/1.01 bind(X3, sK7), % 5.00/1.01 bind(X4, sK2(X10,X11)), % 5.00/1.01 bind(X5, sK6), % 5.00/1.01 bind(X6, sK2(X10,X11)), % 5.00/1.01 bind(X7, set_intersection2(sK6,sK7)), % 5.00/1.01 bind(X8, sK7), % 5.00/1.01 bind(X9, sK6), % 5.00/1.01 bind(X10, sK6), % 5.00/1.01 bind(X11, set_intersection2(sK6,sK7)), % 5.00/1.01 bind(X12, set_intersection2(sK6,sK7)), % 5.00/1.01 bind(X13, sK6), % 5.00/1.01 bind(X14, sK6), % 5.00/1.01 bind(X15, sK7), % 5.00/1.01 bind(X16, sK6), % 5.00/1.01 bind(X17, sK7), % 5.00/1.01 bind(X18, sK6), % 5.00/1.01 bind(X19, set_intersection2(sK6,sK7)) % 5.00/1.01 ], % 5.00/1.01 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23])). % 5.00/1.01 % 5.00/1.01 % SZS output end IncompleteProof %------------------------------------------------------------------------------