%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SEU124+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 : n017.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:17 EDT 2022 % Result : Theorem 0.14s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : SEU124+2 : TPTP v8.1.0. Released v3.3.0. % 0.06/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.34 % Computer : n017.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Mon Jun 20 09:24:59 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.36 % SZS status Theorem % 0.14/0.36 % SZS output begin IncompleteProof % 0.14/0.36 cnf(c0, axiom, % 0.14/0.36 ~subset(sK12,set_union2(sK12,sK13))). % 0.14/0.36 cnf(c1, plain, % 0.14/0.36 ~subset(sK12,set_union2(sK12,sK13)), % 0.14/0.36 inference(start, [], [c0])). % 0.14/0.36 % 0.14/0.36 cnf(c2, axiom, % 0.14/0.36 subset(X0,X1) | in(sK6(X0,X1),X0)). % 0.14/0.36 cnf(a0, assumption, % 0.14/0.36 sK12 = X0). % 0.14/0.36 cnf(a1, assumption, % 0.14/0.36 set_union2(sK12,sK13) = X1). % 0.14/0.36 cnf(c3, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.14/0.36 cnf(c4, plain, % 0.14/0.36 in(sK6(X0,X1),X0), % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.14/0.36 % 0.14/0.36 cnf(c5, axiom, % 0.14/0.36 sP0(X2,X3,X4) | ~in(X3,X4)). % 0.14/0.36 cnf(a2, assumption, % 0.14/0.36 sK6(X0,X1) = X3). % 0.14/0.36 cnf(a3, assumption, % 0.14/0.36 X0 = X4). % 0.14/0.36 cnf(c6, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.14/0.36 cnf(c7, plain, % 0.14/0.36 sP0(X2,X3,X4), % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.14/0.36 % 0.14/0.36 cnf(c8, axiom, % 0.14/0.36 in(X5,X6) | ~sP0(X7,X5,X8) | ~sP1(X8,X7,X6)). % 0.14/0.36 cnf(a4, assumption, % 0.14/0.36 X2 = X7). % 0.14/0.36 cnf(a5, assumption, % 0.14/0.36 X3 = X5). % 0.14/0.36 cnf(a6, assumption, % 0.14/0.36 X4 = X8). % 0.14/0.36 cnf(c9, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])). % 0.14/0.37 cnf(c10, plain, % 0.14/0.37 in(X5,X6) | ~sP1(X8,X7,X6), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a4, a5, a6])], [c7, c8])). % 0.14/0.37 % 0.14/0.37 cnf(c11, axiom, % 0.14/0.37 subset(X9,X10) | ~in(sK6(X9,X10),X10)). % 0.14/0.37 cnf(a7, assumption, % 0.14/0.37 X5 = sK6(X9,X10)). % 0.14/0.37 cnf(a8, assumption, % 0.14/0.37 X6 = X10). % 0.14/0.37 cnf(c12, plain, % 0.14/0.37 ~sP1(X8,X7,X6), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])). % 0.14/0.37 cnf(c13, plain, % 0.14/0.37 subset(X9,X10), % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a7, a8])], [c10, c11])). % 0.14/0.37 % 0.14/0.37 cnf(c14, plain, % 0.14/0.37 ~subset(sK12,set_union2(sK12,sK13))). % 0.14/0.37 cnf(a9, assumption, % 0.14/0.37 X9 = sK12). % 0.14/0.37 cnf(a10, assumption, % 0.14/0.37 X10 = set_union2(sK12,sK13)). % 0.14/0.37 cnf(c15, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(predicate_reduction, [assumptions([a9, a10])], [c13, c14])). % 0.14/0.37 % 0.14/0.37 cnf(c16, axiom, % 0.14/0.37 sP1(X11,X12,set_union2(X11,X12))). % 0.14/0.37 cnf(a11, assumption, % 0.14/0.37 X8 = X11). % 0.14/0.37 cnf(a12, assumption, % 0.14/0.37 X7 = X12). % 0.14/0.37 cnf(a13, assumption, % 0.14/0.37 X6 = set_union2(X11,X12)). % 0.14/0.37 cnf(c17, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c12, c16])). % 0.14/0.37 cnf(c18, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c12, c16])). % 0.14/0.37 % 0.14/0.37 cnf(c19, plain, % 0.14/0.37 $false, % 0.14/0.37 inference(constraint_solving, [ % 0.14/0.37 bind(X0, sK12), % 0.14/0.37 bind(X1, set_union2(sK12,sK13)), % 0.14/0.37 bind(X2, sK13), % 0.14/0.37 bind(X3, sK6(X0,X1)), % 0.14/0.37 bind(X4, sK12), % 0.14/0.37 bind(X5, sK6(X0,X1)), % 0.14/0.37 bind(X6, set_union2(sK12,sK13)), % 0.14/0.37 bind(X7, sK13), % 0.14/0.37 bind(X8, sK12), % 0.14/0.37 bind(X9, sK12), % 0.14/0.37 bind(X10, set_union2(sK12,sK13)), % 0.14/0.37 bind(X11, sK12), % 0.14/0.37 bind(X12, sK13) % 0.14/0.37 ], % 0.14/0.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])). % 0.14/0.37 % 0.14/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------