%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN411+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 : n012.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:29 EDT 2022 % Result : Theorem 0.13s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN411+1 : TPTP v8.1.0. Released v2.0.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.34 % Computer : n012.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Mon Jul 11 22:21:42 EDT 2022 % 0.13/0.34 % CPUTime : % 0.13/0.35 % SZS status Theorem % 0.13/0.35 % SZS output begin IncompleteProof % 0.13/0.35 cnf(c0, axiom, % 0.13/0.35 ~f(sK0,sK1,sK2) | ~f(sK3,sK4,sK5)). % 0.13/0.35 cnf(c1, plain, % 0.13/0.35 ~f(sK0,sK1,sK2) | ~f(sK3,sK4,sK5), % 0.13/0.35 inference(start, [], [c0])). % 0.13/0.35 % 0.13/0.35 cnf(c2, axiom, % 0.13/0.35 f(X0,X1,X2) | f(X3,X4,X5)). % 0.13/0.35 cnf(a0, assumption, % 0.13/0.35 sK0 = X3). % 0.13/0.35 cnf(a1, assumption, % 0.13/0.35 sK1 = X4). % 0.13/0.35 cnf(a2, assumption, % 0.13/0.35 sK2 = X5). % 0.13/0.35 cnf(c3, plain, % 0.13/0.35 ~f(sK3,sK4,sK5), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.13/0.35 cnf(c4, plain, % 0.13/0.35 f(X0,X1,X2), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.13/0.35 % 0.13/0.35 cnf(c5, plain, % 0.13/0.35 ~f(sK0,sK1,sK2)). % 0.13/0.35 cnf(a3, assumption, % 0.13/0.35 X0 = sK0). % 0.13/0.35 cnf(a4, assumption, % 0.13/0.35 X1 = sK1). % 0.13/0.35 cnf(a5, assumption, % 0.13/0.35 X2 = sK2). % 0.13/0.35 cnf(c6, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(predicate_reduction, [assumptions([a3, a4, a5])], [c4, c5])). % 0.13/0.35 % 0.13/0.35 cnf(c7, axiom, % 0.13/0.35 f(X6,X7,X8) | f(X9,X10,X11)). % 0.13/0.35 cnf(a6, assumption, % 0.13/0.35 sK3 = X9). % 0.13/0.35 cnf(a7, assumption, % 0.13/0.35 sK4 = X10). % 0.13/0.35 cnf(a8, assumption, % 0.13/0.35 sK5 = X11). % 0.13/0.35 cnf(c8, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c3, c7])). % 0.13/0.35 cnf(c9, plain, % 0.13/0.35 f(X6,X7,X8), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a6, a7, a8])], [c3, c7])). % 0.13/0.35 % 0.13/0.35 cnf(c10, plain, % 0.13/0.35 ~f(sK3,sK4,sK5)). % 0.13/0.35 cnf(a9, assumption, % 0.13/0.35 X6 = sK3). % 0.13/0.35 cnf(a10, assumption, % 0.13/0.35 X7 = sK4). % 0.13/0.35 cnf(a11, assumption, % 0.13/0.35 X8 = sK5). % 0.13/0.35 cnf(c11, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(predicate_reduction, [assumptions([a9, a10, a11])], [c9, c10])). % 0.13/0.35 % 0.13/0.35 cnf(c12, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(constraint_solving, [ % 0.13/0.35 bind(X0, sK0), % 0.13/0.35 bind(X1, sK1), % 0.13/0.35 bind(X2, sK2), % 0.13/0.35 bind(X3, sK0), % 0.13/0.35 bind(X4, sK1), % 0.13/0.35 bind(X5, sK2), % 0.13/0.35 bind(X6, sK3), % 0.13/0.35 bind(X7, sK4), % 0.13/0.35 bind(X8, sK5), % 0.13/0.35 bind(X9, sK3), % 0.13/0.35 bind(X10, sK4), % 0.13/0.35 bind(X11, sK5) % 0.13/0.35 ], % 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11])). % 0.13/0.35 % 0.13/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------