%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN364+1 : TPTP v8.1.0. Released v2.0.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n024.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 : Thu Jul 21 08:10:07 EDT 2022 % Result : Theorem 0.12s 0.34s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN364+1 : TPTP v8.1.0. Released v2.0.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n024.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 : Tue Jul 12 06:51:28 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 % SZS status Theorem % 0.12/0.34 % SZS output begin IncompleteProof % 0.12/0.34 cnf(c0, axiom, % 0.12/0.34 ~big_m(g(X0)) | ~big_q(X0)). % 0.12/0.34 cnf(c1, plain, % 0.12/0.34 ~big_m(g(X0)) | ~big_q(X0), % 0.12/0.34 inference(start, [], [c0])). % 0.12/0.34 % 0.12/0.34 cnf(c2, axiom, % 0.12/0.34 big_m(X1) | big_p(X1,sK1(X1))). % 0.12/0.34 cnf(a0, assumption, % 0.12/0.34 g(X0) = X1). % 0.12/0.34 cnf(c3, plain, % 0.12/0.34 ~big_q(X0), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.34 cnf(c4, plain, % 0.12/0.34 big_p(X1,sK1(X1)), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.34 % 0.12/0.34 cnf(c5, axiom, % 0.12/0.34 big_p(X2,X2) | ~big_p(X3,X4)). % 0.12/0.34 cnf(a1, assumption, % 0.12/0.34 X1 = X3). % 0.12/0.34 cnf(a2, assumption, % 0.12/0.34 sK1(X1) = X4). % 0.12/0.34 cnf(c6, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 0.12/0.34 cnf(c7, plain, % 0.12/0.34 big_p(X2,X2), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a1, a2])], [c4, c5])). % 0.12/0.34 % 0.12/0.34 cnf(c8, axiom, % 0.12/0.34 big_p(X5,X5) | ~big_p(X6,X7)). % 0.12/0.34 cnf(a3, assumption, % 0.12/0.34 X2 = X6). % 0.12/0.34 cnf(a4, assumption, % 0.12/0.34 X2 = X7). % 0.12/0.34 cnf(c9, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.12/0.34 cnf(c10, plain, % 0.12/0.34 big_p(X5,X5), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a3, a4])], [c7, c8])). % 0.12/0.34 % 0.12/0.34 cnf(c11, axiom, % 0.12/0.34 ~big_p(sK0,sK0) | ~big_p(g(sK0),X8)). % 0.12/0.34 cnf(a5, assumption, % 0.12/0.34 X5 = sK0). % 0.12/0.34 cnf(a6, assumption, % 0.12/0.34 X5 = sK0). % 0.12/0.34 cnf(c12, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.12/0.34 cnf(c13, plain, % 0.12/0.34 ~big_p(g(sK0),X8), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a5, a6])], [c10, c11])). % 0.12/0.34 % 0.12/0.34 cnf(c14, plain, % 0.12/0.34 big_p(X2,X2)). % 0.12/0.34 cnf(a7, assumption, % 0.12/0.34 g(sK0) = X2). % 0.12/0.34 cnf(a8, assumption, % 0.12/0.34 X8 = X2). % 0.12/0.34 cnf(c15, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a7, a8])], [c13, c14])). % 0.12/0.34 % 0.12/0.34 cnf(c16, axiom, % 0.12/0.34 big_q(f(X9,sK1(X9))) | big_p(X9,sK1(X9))). % 0.12/0.34 cnf(a9, assumption, % 0.12/0.34 X0 = f(X9,sK1(X9))). % 0.12/0.34 cnf(c17, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a9])], [c3, c16])). % 0.12/0.34 cnf(c18, plain, % 0.12/0.34 big_p(X9,sK1(X9)), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a9])], [c3, c16])). % 0.12/0.34 % 0.12/0.34 cnf(c19, axiom, % 0.12/0.34 big_p(X10,X10) | ~big_p(X11,X12)). % 0.12/0.34 cnf(a10, assumption, % 0.12/0.34 X9 = X11). % 0.12/0.34 cnf(a11, assumption, % 0.12/0.34 sK1(X9) = X12). % 0.12/0.34 cnf(c20, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a10, a11])], [c18, c19])). % 0.12/0.34 cnf(c21, plain, % 0.12/0.34 big_p(X10,X10), % 0.12/0.34 inference(strict_predicate_extension, [assumptions([a10, a11])], [c18, c19])). % 0.12/0.34 % 0.12/0.34 cnf(c22, plain, % 0.12/0.34 ~big_p(X2,X2)). % 0.12/0.34 cnf(a12, assumption, % 0.12/0.34 X10 = X2). % 0.12/0.34 cnf(a13, assumption, % 0.12/0.34 X10 = X2). % 0.12/0.34 cnf(c23, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(predicate_reduction, [assumptions([a12, a13])], [c21, c22])). % 0.12/0.34 % 0.12/0.34 cnf(c24, plain, % 0.12/0.34 $false, % 0.12/0.34 inference(constraint_solving, [ % 0.12/0.34 bind(X0, f(X9,sK1(X9))), % 0.12/0.34 bind(X1, g(X0)), % 0.12/0.34 bind(X2, g(sK0)), % 0.12/0.34 bind(X3, g(X0)), % 0.12/0.34 bind(X4, sK1(X1)), % 0.12/0.34 bind(X5, sK0), % 0.12/0.34 bind(X6, g(sK0)), % 0.12/0.34 bind(X7, g(sK0)), % 0.12/0.34 bind(X8, g(sK0)), % 0.12/0.34 bind(X9, X11), % 0.12/0.34 bind(X10, g(sK0)), % 0.12/0.34 bind(X11, X11), % 0.12/0.34 bind(X12, sK1(X9)) % 0.12/0.34 ], % 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])). % 0.12/0.34 % 0.12/0.34 % SZS output end IncompleteProof %------------------------------------------------------------------------------