%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU126+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 : 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:18 EDT 2022 % Result : Theorem 2.75s 0.73s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SEU126+2 : TPTP v8.1.0. Released v3.3.0. % 0.04/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.34 % Computer : n006.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Mon Jun 20 10:28:55 EDT 2022 % 0.12/0.34 % CPUTime : % 2.75/0.73 % SZS status Theorem % 2.75/0.73 % SZS output begin IncompleteProof % 2.75/0.73 cnf(c0, axiom, % 2.75/0.73 sK11 != set_union2(sK10,sK11)). % 2.75/0.73 cnf(c1, plain, % 2.75/0.73 sK11 != set_union2(sK10,sK11), % 2.75/0.73 inference(start, [], [c0])). % 2.75/0.73 % 2.75/0.73 cnf(c2, axiom, % 2.75/0.73 set_union2(X0,X1) = set_union2(X1,X0)). % 2.75/0.73 cnf(a0, assumption, % 2.75/0.73 set_union2(sK10,sK11) = set_union2(X1,X0)). % 2.75/0.73 cnf(c3, plain, % 2.75/0.73 $false, % 2.75/0.73 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 2.75/0.73 cnf(c4, plain, % 2.75/0.73 $false, % 2.75/0.73 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 2.75/0.73 cnf(c5, plain, % 2.75/0.73 X2 != set_union2(X0,X1) | sK11 != X2, % 2.75/0.73 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 2.75/0.73 % 2.75/0.73 cnf(c6, axiom, % 2.75/0.73 X3 = X4 | ~subset(X4,X3) | ~subset(X3,X4)). % 2.75/0.73 cnf(a1, assumption, % 2.75/0.73 set_union2(X0,X1) = X3). % 2.75/0.73 cnf(c7, plain, % 2.75/0.73 sK11 != X2, % 2.75/0.73 inference(variable_extension, [assumptions([a1])], [c5, c6])). % 2.75/0.73 cnf(c8, plain, % 2.75/0.73 ~subset(X4,X3) | ~subset(X3,X4), % 2.75/0.73 inference(variable_extension, [assumptions([a1])], [c5, c6])). % 2.75/0.73 cnf(c9, plain, % 2.75/0.73 X4 != X5 | X2 != X5, % 2.75/0.73 inference(variable_extension, [assumptions([a1])], [c5, c6])). % 2.75/0.74 % 2.75/0.74 cnf(a2, assumption, % 2.75/0.74 X4 = X5). % 2.75/0.74 cnf(c10, plain, % 2.75/0.74 X2 != X5, % 2.75/0.74 inference(reflexivity, [assumptions([a2])], [c9])). % 2.75/0.74 % 2.75/0.74 cnf(a3, assumption, % 2.75/0.74 X2 = X5). % 2.75/0.74 cnf(c11, plain, % 2.75/0.74 $false, % 2.75/0.74 inference(reflexivity, [assumptions([a3])], [c10])). % 2.75/0.74 % 2.75/0.74 cnf(c12, axiom, % 2.75/0.74 subset(X6,set_union2(X6,X7))). % 2.75/0.74 cnf(a4, assumption, % 2.75/0.74 X4 = X6). % 2.75/0.74 cnf(a5, assumption, % 2.75/0.74 X3 = set_union2(X6,X7)). % 2.75/0.74 cnf(c13, plain, % 2.75/0.74 ~subset(X3,X4), % 2.75/0.74 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c12])). % 2.75/0.74 cnf(c14, plain, % 2.75/0.74 $false, % 2.75/0.74 inference(strict_predicate_extension, [assumptions([a4, a5])], [c8, c12])). % 2.75/0.74 % 2.75/0.74 cnf(c15, axiom, % 2.75/0.74 subset(set_union2(X8,X9),X10) | ~subset(X9,X10) | ~subset(X8,X10)). % 2.75/0.74 cnf(a6, assumption, % 2.75/0.74 X3 = set_union2(X8,X9)). % 2.75/0.74 cnf(a7, assumption, % 2.75/0.74 X4 = X10). % 2.75/0.74 cnf(c16, plain, % 2.75/0.74 $false, % 2.75/0.74 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c15])). % 2.75/0.74 cnf(c17, plain, % 2.75/0.74 ~subset(X9,X10) | ~subset(X8,X10), % 2.75/0.74 inference(strict_predicate_extension, [assumptions([a6, a7])], [c13, c15])). % 2.75/0.74 % 2.75/0.74 cnf(c18, axiom, % 2.75/0.74 subset(sK10,sK11)). % 2.75/0.74 cnf(a8, assumption, % 2.75/0.74 X9 = sK10). % 2.75/0.74 cnf(a9, assumption, % 2.75/0.74 X10 = sK11). % 2.75/0.74 cnf(c19, plain, % 2.75/0.74 ~subset(X8,X10), % 2.75/0.74 inference(strict_predicate_extension, [assumptions([a8, a9])], [c17, c18])). % 2.75/0.74 cnf(c20, plain, % 2.75/0.74 $false, % 2.75/0.74 inference(strict_predicate_extension, [assumptions([a8, a9])], [c17, c18])). % 2.75/0.74 % 2.75/0.74 cnf(c21, axiom, % 2.75/0.74 subset(X11,X11)). % 2.75/0.74 cnf(a10, assumption, % 2.75/0.74 X8 = X11). % 2.75/0.74 cnf(a11, assumption, % 2.75/0.74 X10 = X11). % 2.75/0.74 cnf(c22, plain, % 2.75/0.74 $false, % 2.75/0.74 inference(strict_predicate_extension, [assumptions([a10, a11])], [c19, c21])). % 2.75/0.74 cnf(c23, plain, % 2.75/0.74 $false, % 2.75/0.74 inference(strict_predicate_extension, [assumptions([a10, a11])], [c19, c21])). % 2.75/0.74 % 2.75/0.74 cnf(a12, assumption, % 2.75/0.74 sK11 = X2). % 2.75/0.74 cnf(c24, plain, % 2.75/0.74 $false, % 2.75/0.74 inference(reflexivity, [assumptions([a12])], [c7])). % 2.75/0.74 % 2.75/0.74 cnf(c25, plain, % 2.75/0.74 $false, % 2.75/0.74 inference(constraint_solving, [ % 2.75/0.74 bind(X0, sK11), % 2.75/0.74 bind(X1, sK10), % 2.75/0.74 bind(X2, sK11), % 2.75/0.74 bind(X3, set_union2(X0,X1)), % 2.75/0.74 bind(X4, sK11), % 2.75/0.74 bind(X5, sK11), % 2.75/0.74 bind(X6, sK11), % 2.75/0.74 bind(X7, sK10), % 2.75/0.74 bind(X8, sK11), % 2.75/0.74 bind(X9, sK10), % 2.75/0.74 bind(X10, sK11), % 2.75/0.74 bind(X11, sK11) % 2.75/0.74 ], % 2.75/0.74 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12])). % 2.75/0.74 % 2.75/0.74 % SZS output end IncompleteProof %------------------------------------------------------------------------------