%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU155+2 : 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 : n010.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:35 EDT 2022 % Result : Theorem 38.59s 5.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : SEU155+2 : TPTP v8.1.0. Released v3.3.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.35 % Computer : n010.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Sun Jun 19 12:12:52 EDT 2022 % 0.14/0.35 % CPUTime : % 38.59/5.35 % SZS status Theorem % 38.59/5.35 % SZS output begin IncompleteProof % 38.59/5.35 cnf(c0, axiom, % 38.59/5.35 in(sK22,sK23)). % 38.59/5.35 cnf(c1, plain, % 38.59/5.35 in(sK22,sK23), % 38.59/5.35 inference(start, [], [c0])). % 38.59/5.35 % 38.59/5.35 cnf(c2, axiom, % 38.59/5.35 sP8(X0,X1) | ~in(X2,X0) | ~in(X1,X2)). % 38.59/5.35 cnf(a0, assumption, % 38.59/5.35 sK22 = X2). % 38.59/5.35 cnf(a1, assumption, % 38.59/5.35 sK23 = X0). % 38.59/5.35 cnf(c3, plain, % 38.59/5.35 $false, % 38.59/5.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 38.59/5.35 cnf(c4, plain, % 38.59/5.35 sP8(X0,X1) | ~in(X1,X2), % 38.59/5.35 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 38.59/5.35 % 38.59/5.35 cnf(c5, axiom, % 38.59/5.35 in(X3,X4) | ~sP8(X5,X3) | ~sP9(X5,X4)). % 38.59/5.35 cnf(a2, assumption, % 38.59/5.35 X0 = X5). % 38.59/5.35 cnf(a3, assumption, % 38.59/5.35 X1 = X3). % 38.59/5.35 cnf(c6, plain, % 38.59/5.35 ~in(X1,X2), % 38.59/5.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 38.59/5.35 cnf(c7, plain, % 38.59/5.35 in(X3,X4) | ~sP9(X5,X4), % 38.59/5.35 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 38.59/5.35 % 38.59/5.35 cnf(c8, axiom, % 38.59/5.35 subset(X6,X7) | ~in(sK17(X6,X7),X7)). % 38.59/5.35 cnf(a4, assumption, % 38.59/5.35 X3 = sK17(X6,X7)). % 38.59/5.35 cnf(a5, assumption, % 38.59/5.35 X4 = X7). % 38.59/5.35 cnf(c9, plain, % 38.59/5.35 ~sP9(X5,X4), % 38.59/5.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 38.59/5.35 cnf(c10, plain, % 38.59/5.35 subset(X6,X7), % 38.59/5.35 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])). % 38.59/5.35 % 38.59/5.35 cnf(c11, axiom, % 38.59/5.35 ~subset(sK22,union(sK23))). % 38.59/5.35 cnf(a6, assumption, % 38.59/5.35 X6 = sK22). % 38.59/5.35 cnf(a7, assumption, % 38.59/5.35 X7 = union(sK23)). % 38.59/5.35 cnf(c12, plain, % 38.59/5.35 $false, % 38.59/5.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 38.59/5.35 cnf(c13, plain, % 38.59/5.35 $false, % 38.59/5.35 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])). % 38.59/5.35 % 38.59/5.35 cnf(c14, axiom, % 38.59/5.35 sP9(X8,union(X8))). % 38.59/5.35 cnf(a8, assumption, % 38.59/5.35 X5 = X8). % 38.59/5.35 cnf(a9, assumption, % 38.59/5.35 X4 = union(X8)). % 38.59/5.35 cnf(c15, plain, % 38.59/5.35 $false, % 38.59/5.35 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])). % 38.59/5.35 cnf(c16, plain, % 38.59/5.35 $false, % 38.59/5.35 inference(strict_predicate_extension, [assumptions([a8, a9])], [c9, c14])). % 38.59/5.35 % 38.59/5.35 cnf(c17, axiom, % 38.59/5.35 subset(X9,X10) | in(sK17(X9,X10),X9)). % 38.59/5.35 cnf(a10, assumption, % 38.59/5.35 X1 = sK17(X9,X10)). % 38.59/5.35 cnf(a11, assumption, % 38.59/5.35 X2 = X9). % 38.59/5.35 cnf(c18, plain, % 38.59/5.35 $false, % 38.59/5.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c17])). % 38.59/5.35 cnf(c19, plain, % 38.59/5.35 subset(X9,X10), % 38.59/5.35 inference(strict_predicate_extension, [assumptions([a10, a11])], [c6, c17])). % 38.59/5.35 % 38.59/5.35 cnf(c20, plain, % 38.59/5.35 ~subset(X6,X7)). % 38.59/5.35 cnf(a12, assumption, % 38.59/5.35 X9 = X6). % 38.59/5.35 cnf(a13, assumption, % 38.59/5.35 X10 = X7). % 38.59/5.35 cnf(c21, plain, % 38.59/5.35 $false, % 38.59/5.35 inference(predicate_reduction, [assumptions([a12, a13])], [c19, c20])). % 38.59/5.35 % 38.59/5.35 cnf(c22, plain, % 38.59/5.35 $false, % 38.59/5.35 inference(constraint_solving, [ % 38.59/5.35 bind(X0, sK23), % 38.59/5.35 bind(X1, sK17(X6,X7)), % 38.59/5.35 bind(X2, sK22), % 38.59/5.35 bind(X3, sK17(X6,X7)), % 38.59/5.35 bind(X4, union(sK23)), % 38.59/5.35 bind(X5, sK23), % 38.59/5.35 bind(X6, sK22), % 38.59/5.35 bind(X7, union(sK23)), % 38.59/5.35 bind(X8, sK23), % 38.59/5.35 bind(X9, sK22), % 38.59/5.35 bind(X10, union(sK23)) % 38.59/5.35 ], % 38.59/5.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])). % 38.59/5.35 % 38.59/5.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------