%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN351+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:09:59 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 : SYN351+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 : Tue Jul 12 06:25: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 sP0(X0,X1,sK2) | sP1(sK4(X1,X0),X1,sK2,X0)). % 0.13/0.35 cnf(c1, plain, % 0.13/0.35 sP0(X0,X1,sK2) | sP1(sK4(X1,X0),X1,sK2,X0), % 0.13/0.35 inference(start, [], [c0])). % 0.13/0.35 % 0.13/0.35 cnf(c2, axiom, % 0.13/0.35 ~big_f(X2,X3,X4,X3) | ~big_f(X2,X4,X2,X3) | ~sP0(X3,X4,X2)). % 0.13/0.35 cnf(a0, assumption, % 0.13/0.35 X0 = X3). % 0.13/0.35 cnf(a1, assumption, % 0.13/0.35 X1 = X4). % 0.13/0.35 cnf(a2, assumption, % 0.13/0.35 sK2 = X2). % 0.13/0.35 cnf(c3, plain, % 0.13/0.35 sP1(sK4(X1,X0),X1,sK2,X0), % 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 ~big_f(X2,X3,X4,X3) | ~big_f(X2,X4,X2,X3), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.13/0.35 % 0.13/0.35 cnf(c5, axiom, % 0.13/0.35 big_f(sK2,X5,sK2,X6)). % 0.13/0.35 cnf(a3, assumption, % 0.13/0.35 X2 = sK2). % 0.13/0.35 cnf(a4, assumption, % 0.13/0.35 X3 = X5). % 0.13/0.35 cnf(a5, assumption, % 0.13/0.35 X4 = sK2). % 0.13/0.35 cnf(a6, assumption, % 0.13/0.35 X3 = X6). % 0.13/0.35 cnf(c6, plain, % 0.13/0.35 ~big_f(X2,X4,X2,X3), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3, a4, a5, a6])], [c4, c5])). % 0.13/0.35 cnf(c7, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a3, a4, a5, a6])], [c4, c5])). % 0.13/0.35 % 0.13/0.35 cnf(c8, axiom, % 0.13/0.35 big_f(sK2,X7,sK2,X8)). % 0.13/0.35 cnf(a7, assumption, % 0.13/0.35 X2 = sK2). % 0.13/0.35 cnf(a8, assumption, % 0.13/0.35 X4 = X7). % 0.13/0.35 cnf(a9, assumption, % 0.13/0.35 X2 = sK2). % 0.13/0.35 cnf(a10, assumption, % 0.13/0.35 X3 = X8). % 0.13/0.35 cnf(c9, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a7, a8, a9, a10])], [c6, c8])). % 0.13/0.35 cnf(c10, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a7, a8, a9, a10])], [c6, c8])). % 0.13/0.35 % 0.13/0.35 cnf(c11, axiom, % 0.13/0.35 ~big_f(X9,X10,X11,X10) | ~sP1(X10,X11,X9,X12)). % 0.13/0.35 cnf(a11, assumption, % 0.13/0.35 sK4(X1,X0) = X10). % 0.13/0.35 cnf(a12, assumption, % 0.13/0.35 X1 = X11). % 0.13/0.35 cnf(a13, assumption, % 0.13/0.35 sK2 = X9). % 0.13/0.35 cnf(a14, assumption, % 0.13/0.35 X0 = X12). % 0.13/0.35 cnf(c12, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a11, a12, a13, a14])], [c3, c11])). % 0.13/0.35 cnf(c13, plain, % 0.13/0.35 ~big_f(X9,X10,X11,X10), % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a11, a12, a13, a14])], [c3, c11])). % 0.13/0.35 % 0.13/0.35 cnf(c14, axiom, % 0.13/0.35 big_f(sK2,X13,sK2,X14)). % 0.13/0.35 cnf(a15, assumption, % 0.13/0.35 X9 = sK2). % 0.13/0.35 cnf(a16, assumption, % 0.13/0.35 X10 = X13). % 0.13/0.35 cnf(a17, assumption, % 0.13/0.35 X11 = sK2). % 0.13/0.35 cnf(a18, assumption, % 0.13/0.35 X10 = X14). % 0.13/0.35 cnf(c15, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a15, a16, a17, a18])], [c13, c14])). % 0.13/0.35 cnf(c16, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(strict_predicate_extension, [assumptions([a15, a16, a17, a18])], [c13, c14])). % 0.13/0.35 % 0.13/0.35 cnf(c17, plain, % 0.13/0.35 $false, % 0.13/0.35 inference(constraint_solving, [ % 0.13/0.35 bind(X0, X3), % 0.13/0.35 bind(X1, sK2), % 0.13/0.35 bind(X2, sK2), % 0.13/0.35 bind(X3, X3), % 0.13/0.35 bind(X4, sK2), % 0.13/0.35 bind(X5, X3), % 0.13/0.35 bind(X6, X3), % 0.13/0.35 bind(X7, sK2), % 0.13/0.35 bind(X8, X3), % 0.13/0.35 bind(X9, sK2), % 0.13/0.35 bind(X10, sK4(X1,X0)), % 0.13/0.35 bind(X11, sK2), % 0.13/0.35 bind(X12, X3), % 0.13/0.35 bind(X13, sK4(X1,X0)), % 0.13/0.35 bind(X14, sK4(X1,X0)) % 0.13/0.35 ], % 0.13/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])). % 0.13/0.35 % 0.13/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------