%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SET903+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 : 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:49:05 EDT 2022 % Result : Theorem 52.19s 6.93s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.11 % Problem : SET903+1 : TPTP v8.1.0. Released v3.2.0. % 0.12/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 : Sat Jul 9 17:43:41 EDT 2022 % 0.12/0.33 % CPUTime : % 52.19/6.93 % SZS status Theorem % 52.19/6.93 % SZS output begin IncompleteProof % 52.19/6.93 cnf(c0, axiom, % 52.19/6.93 singleton(sK4) = set_union2(sK5,sK6)). % 52.19/6.93 cnf(c1, plain, % 52.19/6.93 singleton(sK4) = set_union2(sK5,sK6), % 52.19/6.93 inference(start, [], [c0])). % 52.19/6.93 % 52.19/6.93 cnf(c2, axiom, % 52.19/6.93 empty_set = X0 | sP1(X0,X1,X2) | sP0(X0,X1,X2) | singleton(X1) != set_union2(X2,X0)). % 52.19/6.93 cnf(a0, assumption, % 52.19/6.93 set_union2(X2,X0) = set_union2(sK5,sK6)). % 52.19/6.93 cnf(a1, assumption, % 52.19/6.93 singleton(sK4) = X3). % 52.19/6.93 cnf(c3, plain, % 52.19/6.93 $false, % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 52.19/6.93 cnf(c4, plain, % 52.19/6.93 empty_set = X0 | sP1(X0,X1,X2) | sP0(X0,X1,X2), % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 52.19/6.93 cnf(c5, plain, % 52.19/6.93 singleton(X1) != X3, % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 52.19/6.93 % 52.19/6.93 cnf(a2, assumption, % 52.19/6.93 singleton(X1) = X3). % 52.19/6.93 cnf(c6, plain, % 52.19/6.93 $false, % 52.19/6.93 inference(reflexivity, [assumptions([a2])], [c5])). % 52.19/6.93 % 52.19/6.93 cnf(c7, axiom, % 52.19/6.93 empty_set != sK6). % 52.19/6.93 cnf(a3, assumption, % 52.19/6.93 sK6 = X0). % 52.19/6.93 cnf(a4, assumption, % 52.19/6.93 empty_set = X4). % 52.19/6.93 cnf(c8, plain, % 52.19/6.93 sP1(X0,X1,X2) | sP0(X0,X1,X2), % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a3, a4])], [c4, c7])). % 52.19/6.93 cnf(c9, plain, % 52.19/6.93 $false, % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a3, a4])], [c4, c7])). % 52.19/6.93 cnf(c10, plain, % 52.19/6.93 empty_set != X4, % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a3, a4])], [c4, c7])). % 52.19/6.93 % 52.19/6.93 cnf(a5, assumption, % 52.19/6.93 empty_set = X4). % 52.19/6.93 cnf(c11, plain, % 52.19/6.93 $false, % 52.19/6.93 inference(reflexivity, [assumptions([a5])], [c10])). % 52.19/6.93 % 52.19/6.93 cnf(c12, axiom, % 52.19/6.93 empty_set = X5 | ~sP1(X6,X7,X5)). % 52.19/6.93 cnf(a6, assumption, % 52.19/6.93 X0 = X6). % 52.19/6.93 cnf(a7, assumption, % 52.19/6.93 X1 = X7). % 52.19/6.93 cnf(a8, assumption, % 52.19/6.93 X2 = X5). % 52.19/6.93 cnf(c13, plain, % 52.19/6.93 sP0(X0,X1,X2), % 52.19/6.93 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c8, c12])). % 52.19/6.93 cnf(c14, plain, % 52.19/6.93 empty_set = X5, % 52.19/6.93 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c8, c12])). % 52.19/6.93 % 52.19/6.93 cnf(c15, axiom, % 52.19/6.93 empty_set != sK5). % 52.19/6.93 cnf(a9, assumption, % 52.19/6.93 sK5 = X5). % 52.19/6.93 cnf(a10, assumption, % 52.19/6.93 empty_set = X8). % 52.19/6.93 cnf(c16, plain, % 52.19/6.93 $false, % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a9, a10])], [c14, c15])). % 52.19/6.93 cnf(c17, plain, % 52.19/6.93 $false, % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a9, a10])], [c14, c15])). % 52.19/6.93 cnf(c18, plain, % 52.19/6.93 empty_set != X8, % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a9, a10])], [c14, c15])). % 52.19/6.93 % 52.19/6.93 cnf(a11, assumption, % 52.19/6.93 empty_set = X8). % 52.19/6.93 cnf(c19, plain, % 52.19/6.93 $false, % 52.19/6.93 inference(reflexivity, [assumptions([a11])], [c18])). % 52.19/6.93 % 52.19/6.93 cnf(c20, axiom, % 52.19/6.93 singleton(X9) = X10 | ~sP0(X10,X9,X11)). % 52.19/6.93 cnf(a12, assumption, % 52.19/6.93 X0 = X10). % 52.19/6.93 cnf(a13, assumption, % 52.19/6.93 X1 = X9). % 52.19/6.93 cnf(a14, assumption, % 52.19/6.93 X2 = X11). % 52.19/6.93 cnf(c21, plain, % 52.19/6.93 $false, % 52.19/6.93 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c13, c20])). % 52.19/6.93 cnf(c22, plain, % 52.19/6.93 singleton(X9) = X10, % 52.19/6.93 inference(strict_predicate_extension, [assumptions([a12, a13, a14])], [c13, c20])). % 52.19/6.93 % 52.19/6.93 cnf(c23, axiom, % 52.19/6.93 singleton(X12) = X13 | ~sP0(X14,X12,X13)). % 52.19/6.93 cnf(a15, assumption, % 52.19/6.93 singleton(X12) = singleton(X9)). % 52.19/6.93 cnf(c24, plain, % 52.19/6.93 $false, % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a15])], [c22, c23])). % 52.19/6.93 cnf(c25, plain, % 52.19/6.93 ~sP0(X14,X12,X13), % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a15])], [c22, c23])). % 52.19/6.93 cnf(c26, plain, % 52.19/6.93 X10 = X13, % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a15])], [c22, c23])). % 52.19/6.93 % 52.19/6.93 cnf(c27, axiom, % 52.19/6.93 sK5 != sK6). % 52.19/6.93 cnf(a16, assumption, % 52.19/6.93 sK5 = X13). % 52.19/6.93 cnf(c28, plain, % 52.19/6.93 $false, % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a16])], [c26, c27])). % 52.19/6.93 cnf(c29, plain, % 52.19/6.93 $false, % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a16])], [c26, c27])). % 52.19/6.93 cnf(c30, plain, % 52.19/6.93 X10 != sK6, % 52.19/6.93 inference(strict_subterm_extension, [assumptions([a16])], [c26, c27])). % 52.19/6.93 % 52.19/6.93 cnf(a17, assumption, % 52.19/6.93 X10 = sK6). % 52.19/6.93 cnf(c31, plain, % 52.19/6.93 $false, % 52.19/6.93 inference(reflexivity, [assumptions([a17])], [c30])). % 52.19/6.93 % 52.19/6.93 cnf(c32, plain, % 52.19/6.93 sP0(X0,X1,X2)). % 52.19/6.93 cnf(a18, assumption, % 52.19/6.93 X14 = X0). % 52.19/6.93 cnf(a19, assumption, % 52.19/6.93 X12 = X1). % 52.19/6.93 cnf(a20, assumption, % 52.19/6.93 X13 = X2). % 52.19/6.93 cnf(c33, plain, % 52.19/6.93 $false, % 52.19/6.93 inference(predicate_reduction, [assumptions([a18, a19, a20])], [c25, c32])). % 52.19/6.93 % 52.19/6.93 cnf(c34, plain, % 52.19/6.93 $false, % 52.19/6.93 inference(constraint_solving, [ % 52.19/6.93 bind(X0, sK6), % 52.19/6.93 bind(X1, sK4), % 52.19/6.93 bind(X2, sK5), % 52.19/6.93 bind(X3, singleton(sK4)), % 52.19/6.93 bind(X4, empty_set), % 52.19/6.93 bind(X5, sK5), % 52.19/6.93 bind(X6, sK6), % 52.19/6.93 bind(X7, sK4), % 52.19/6.93 bind(X8, empty_set), % 52.19/6.93 bind(X9, sK4), % 52.19/6.93 bind(X10, sK6), % 52.19/6.93 bind(X11, sK5), % 52.19/6.93 bind(X12, sK4), % 52.19/6.93 bind(X13, sK5), % 52.19/6.93 bind(X14, sK6) % 52.19/6.93 ], % 52.19/6.93 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])). % 52.19/6.93 % 52.19/6.93 % SZS output end IncompleteProof %------------------------------------------------------------------------------