%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUN070+1 : TPTP v8.1.0. Released v7.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 : n026.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 : Mon Jul 18 16:33:24 EDT 2022 % Result : Theorem 0.14s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : NUN070+1 : TPTP v8.1.0. Released v7.3.0. % 0.04/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.35 % Computer : n026.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 : Thu Jun 2 09:21:27 EDT 2022 % 0.14/0.35 % 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 ~r2(X0,X1) | ~r1(X0) | ~id(X2,X1) | ~r2(X3,X4) | ~r1(X3) | ~r3(X4,X5,X2) | ~r1(X5)). % 0.14/0.36 cnf(c1, plain, % 0.14/0.36 ~r2(X0,X1) | ~r1(X0) | ~id(X2,X1) | ~r2(X3,X4) | ~r1(X3) | ~r3(X4,X5,X2) | ~r1(X5), % 0.14/0.36 inference(start, [], [c0])). % 0.14/0.36 % 0.14/0.36 cnf(c2, axiom, % 0.14/0.36 r2(X6,sK16(X7,X6))). % 0.14/0.36 cnf(a0, assumption, % 0.14/0.36 X0 = X6). % 0.14/0.36 cnf(a1, assumption, % 0.14/0.36 X1 = sK16(X7,X6)). % 0.14/0.36 cnf(c3, plain, % 0.14/0.36 ~r1(X0) | ~id(X2,X1) | ~r2(X3,X4) | ~r1(X3) | ~r3(X4,X5,X2) | ~r1(X5), % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.14/0.36 cnf(c4, plain, % 0.14/0.36 $false, % 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 r1(sK22(X8))). % 0.14/0.36 cnf(a2, assumption, % 0.14/0.36 X0 = sK22(X8)). % 0.14/0.36 cnf(c6, plain, % 0.14/0.36 ~id(X2,X1) | ~r2(X3,X4) | ~r1(X3) | ~r3(X4,X5,X2) | ~r1(X5), % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c3, c5])). % 0.14/0.36 cnf(c7, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c3, c5])). % 0.14/0.36 % 0.14/0.36 cnf(c8, axiom, % 0.14/0.36 id(sK21(X9),X9)). % 0.14/0.36 cnf(a3, assumption, % 0.14/0.36 X2 = sK21(X9)). % 0.14/0.36 cnf(a4, assumption, % 0.14/0.36 X1 = X9). % 0.14/0.36 cnf(c9, plain, % 0.14/0.36 ~r2(X3,X4) | ~r1(X3) | ~r3(X4,X5,X2) | ~r1(X5), % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])). % 0.14/0.36 cnf(c10, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a3, a4])], [c6, c8])). % 0.14/0.36 % 0.14/0.36 cnf(c11, plain, % 0.14/0.36 r2(X0,X1)). % 0.14/0.36 cnf(a5, assumption, % 0.14/0.36 X3 = X0). % 0.14/0.36 cnf(a6, assumption, % 0.14/0.36 X4 = X1). % 0.14/0.36 cnf(c12, plain, % 0.14/0.36 ~r1(X3) | ~r3(X4,X5,X2) | ~r1(X5), % 0.14/0.36 inference(predicate_reduction, [assumptions([a5, a6])], [c9, c11])). % 0.14/0.36 % 0.14/0.36 cnf(c13, plain, % 0.14/0.36 r1(X0)). % 0.14/0.36 cnf(a7, assumption, % 0.14/0.36 X3 = X0). % 0.14/0.36 cnf(c14, plain, % 0.14/0.36 ~r3(X4,X5,X2) | ~r1(X5), % 0.14/0.36 inference(predicate_reduction, [assumptions([a7])], [c12, c13])). % 0.14/0.36 % 0.14/0.36 cnf(c15, axiom, % 0.14/0.36 r3(X10,sK22(X10),sK21(X10))). % 0.14/0.36 cnf(a8, assumption, % 0.14/0.36 X4 = X10). % 0.14/0.36 cnf(a9, assumption, % 0.14/0.36 X5 = sK22(X10)). % 0.14/0.36 cnf(a10, assumption, % 0.14/0.36 X2 = sK21(X10)). % 0.14/0.36 cnf(c16, plain, % 0.14/0.36 ~r1(X5), % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c14, c15])). % 0.14/0.36 cnf(c17, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c14, c15])). % 0.14/0.36 % 0.14/0.36 cnf(c18, axiom, % 0.14/0.36 r1(sK22(X11))). % 0.14/0.36 cnf(a11, assumption, % 0.14/0.36 X5 = sK22(X11)). % 0.14/0.36 cnf(c19, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a11])], [c16, c18])). % 0.14/0.36 cnf(c20, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(strict_predicate_extension, [assumptions([a11])], [c16, c18])). % 0.14/0.36 % 0.14/0.36 cnf(c21, plain, % 0.14/0.36 $false, % 0.14/0.36 inference(constraint_solving, [ % 0.14/0.36 bind(X0, sK22(X8)), % 0.14/0.36 bind(X1, sK16(X7,X6)), % 0.14/0.36 bind(X2, sK21(X9)), % 0.14/0.36 bind(X3, sK22(X8)), % 0.14/0.36 bind(X4, sK16(X7,X6)), % 0.14/0.36 bind(X5, sK22(X10)), % 0.14/0.36 bind(X6, sK22(X8)), % 0.14/0.36 bind(X7, X7), % 0.14/0.36 bind(X8, X8), % 0.14/0.36 bind(X9, sK16(X7,X6)), % 0.14/0.36 bind(X10, sK16(X7,X6)), % 0.14/0.36 bind(X11, sK16(X7,X6)) % 0.14/0.36 ], % 0.14/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.14/0.36 % 0.14/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------