%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET628+3 : 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 : n018.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:47:13 EDT 2022 % Result : Theorem 0.21s 0.50s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SET628+3 : TPTP v8.1.0. Released v2.2.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n018.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 Jul 11 02:29:43 EDT 2022 % 0.12/0.34 % CPUTime : % 0.21/0.50 % SZS status Theorem % 0.21/0.50 % SZS output begin IncompleteProof % 0.21/0.50 cnf(c0, axiom, % 0.21/0.50 ~not_equal(sK4,empty_set) | ~intersect(sK4,sK4)). % 0.21/0.50 cnf(c1, plain, % 0.21/0.50 ~not_equal(sK4,empty_set) | ~intersect(sK4,sK4), % 0.21/0.50 inference(start, [], [c0])). % 0.21/0.50 % 0.21/0.50 cnf(c2, axiom, % 0.21/0.50 not_equal(X0,X1) | X0 = X1). % 0.21/0.50 cnf(a0, assumption, % 0.21/0.50 sK4 = X0). % 0.21/0.50 cnf(a1, assumption, % 0.21/0.50 empty_set = X1). % 0.21/0.50 cnf(c3, plain, % 0.21/0.50 ~intersect(sK4,sK4), % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.50 cnf(c4, plain, % 0.21/0.50 X0 = X1, % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.50 % 0.21/0.50 cnf(c5, axiom, % 0.21/0.50 not_equal(sK4,empty_set) | intersect(sK4,sK4)). % 0.21/0.50 cnf(a2, assumption, % 0.21/0.50 sK4 = X0). % 0.21/0.50 cnf(c6, plain, % 0.21/0.50 $false, % 0.21/0.50 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])). % 0.21/0.50 cnf(c7, plain, % 0.21/0.50 not_equal(sK4,empty_set), % 0.21/0.50 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])). % 0.21/0.50 cnf(c8, plain, % 0.21/0.50 intersect(X1,sK4), % 0.21/0.50 inference(strict_subterm_extension, [assumptions([a2])], [c4, c5])). % 0.21/0.50 % 0.21/0.50 cnf(c9, axiom, % 0.21/0.50 member(sK1(X2,X3),X2) | ~intersect(X2,X3)). % 0.21/0.50 cnf(a3, assumption, % 0.21/0.50 X1 = X2). % 0.21/0.50 cnf(a4, assumption, % 0.21/0.50 sK4 = X3). % 0.21/0.50 cnf(c10, plain, % 0.21/0.50 $false, % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a3, a4])], [c8, c9])). % 0.21/0.50 cnf(c11, plain, % 0.21/0.50 member(sK1(X2,X3),X2), % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a3, a4])], [c8, c9])). % 0.21/0.50 % 0.21/0.50 cnf(c12, axiom, % 0.21/0.50 ~member(X4,empty_set)). % 0.21/0.50 cnf(a5, assumption, % 0.21/0.50 sK1(X2,X3) = X4). % 0.21/0.50 cnf(a6, assumption, % 0.21/0.50 X2 = empty_set). % 0.21/0.50 cnf(c13, plain, % 0.21/0.50 $false, % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a5, a6])], [c11, c12])). % 0.21/0.50 cnf(c14, plain, % 0.21/0.50 $false, % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a5, a6])], [c11, c12])). % 0.21/0.50 % 0.21/0.50 cnf(c15, plain, % 0.21/0.50 ~not_equal(sK4,empty_set)). % 0.21/0.50 cnf(a7, assumption, % 0.21/0.50 sK4 = sK4). % 0.21/0.50 cnf(a8, assumption, % 0.21/0.50 empty_set = empty_set). % 0.21/0.50 cnf(c16, plain, % 0.21/0.50 $false, % 0.21/0.50 inference(predicate_reduction, [assumptions([a7, a8])], [c7, c15])). % 0.21/0.50 % 0.21/0.50 cnf(c17, axiom, % 0.21/0.50 intersect(X5,X6) | ~member(X7,X6) | ~member(X7,X5)). % 0.21/0.50 cnf(a9, assumption, % 0.21/0.50 sK4 = X5). % 0.21/0.50 cnf(a10, assumption, % 0.21/0.50 sK4 = X6). % 0.21/0.50 cnf(c18, plain, % 0.21/0.50 $false, % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a9, a10])], [c3, c17])). % 0.21/0.50 cnf(c19, plain, % 0.21/0.50 ~member(X7,X6) | ~member(X7,X5), % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a9, a10])], [c3, c17])). % 0.21/0.50 % 0.21/0.50 cnf(c20, axiom, % 0.21/0.50 sP0(X8,X9) | member(sK2(X8,X9),X8) | member(sK2(X8,X9),X9)). % 0.21/0.50 cnf(a11, assumption, % 0.21/0.50 X7 = sK2(X8,X9)). % 0.21/0.50 cnf(a12, assumption, % 0.21/0.50 X6 = X9). % 0.21/0.50 cnf(c21, plain, % 0.21/0.50 ~member(X7,X5), % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c20])). % 0.21/0.50 cnf(c22, plain, % 0.21/0.50 sP0(X8,X9) | member(sK2(X8,X9),X8), % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a11, a12])], [c19, c20])). % 0.21/0.50 % 0.21/0.50 cnf(c23, axiom, % 0.21/0.50 X10 = X11 | ~sP0(X11,X10)). % 0.21/0.50 cnf(a13, assumption, % 0.21/0.50 X8 = X11). % 0.21/0.50 cnf(a14, assumption, % 0.21/0.50 X9 = X10). % 0.21/0.50 cnf(c24, plain, % 0.21/0.50 member(sK2(X8,X9),X8), % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a13, a14])], [c22, c23])). % 0.21/0.50 cnf(c25, plain, % 0.21/0.50 X10 = X11, % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a13, a14])], [c22, c23])). % 0.21/0.50 % 0.21/0.50 cnf(c26, plain, % 0.21/0.50 not_equal(sK4,empty_set)). % 0.21/0.50 cnf(a15, assumption, % 0.21/0.50 sK4 = X10). % 0.21/0.50 cnf(c27, plain, % 0.21/0.50 $false, % 0.21/0.50 inference(subterm_reduction, [assumptions([a15])], [c25, c26])). % 0.21/0.50 cnf(c28, plain, % 0.21/0.50 not_equal(X11,empty_set), % 0.21/0.50 inference(subterm_reduction, [assumptions([a15])], [c25, c26])). % 0.21/0.50 % 0.21/0.50 cnf(c29, axiom, % 0.21/0.50 ~not_equal(X12,X12)). % 0.21/0.50 cnf(a16, assumption, % 0.21/0.50 X11 = X12). % 0.21/0.50 cnf(a17, assumption, % 0.21/0.50 empty_set = X12). % 0.21/0.50 cnf(c30, plain, % 0.21/0.50 $false, % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a16, a17])], [c28, c29])). % 0.21/0.50 cnf(c31, plain, % 0.21/0.50 $false, % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a16, a17])], [c28, c29])). % 0.21/0.50 % 0.21/0.50 cnf(c32, axiom, % 0.21/0.50 ~member(X13,empty_set)). % 0.21/0.50 cnf(a18, assumption, % 0.21/0.50 sK2(X8,X9) = X13). % 0.21/0.50 cnf(a19, assumption, % 0.21/0.50 X8 = empty_set). % 0.21/0.50 cnf(c33, plain, % 0.21/0.50 $false, % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a18, a19])], [c24, c32])). % 0.21/0.50 cnf(c34, plain, % 0.21/0.50 $false, % 0.21/0.50 inference(strict_predicate_extension, [assumptions([a18, a19])], [c24, c32])). % 0.21/0.50 % 0.21/0.50 cnf(c35, plain, % 0.21/0.50 member(X7,X6)). % 0.21/0.50 cnf(a20, assumption, % 0.21/0.50 X7 = X7). % 0.21/0.50 cnf(a21, assumption, % 0.21/0.50 X5 = X6). % 0.21/0.50 cnf(c36, plain, % 0.21/0.50 $false, % 0.21/0.50 inference(predicate_reduction, [assumptions([a20, a21])], [c21, c35])). % 0.21/0.50 % 0.21/0.50 cnf(c37, plain, % 0.21/0.50 $false, % 0.21/0.50 inference(constraint_solving, [ % 0.21/0.50 bind(X0, sK4), % 0.21/0.50 bind(X1, empty_set), % 0.21/0.50 bind(X2, empty_set), % 0.21/0.50 bind(X3, sK4), % 0.21/0.50 bind(X4, sK1(X2,X3)), % 0.21/0.50 bind(X5, sK4), % 0.21/0.50 bind(X6, sK4), % 0.21/0.50 bind(X7, sK2(X8,X9)), % 0.21/0.50 bind(X8, empty_set), % 0.21/0.50 bind(X9, sK4), % 0.21/0.50 bind(X10, sK4), % 0.21/0.50 bind(X11, empty_set), % 0.21/0.50 bind(X12, empty_set), % 0.21/0.50 bind(X13, sK2(X8,X9)) % 0.21/0.50 ], % 0.21/0.50 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])). % 0.21/0.50 % 0.21/0.50 % SZS output end IncompleteProof %------------------------------------------------------------------------------