%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN354+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 : n025.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:01 EDT 2022 % Result : Theorem 0.08s 0.29s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.05/0.09 % Problem : SYN354+1 : TPTP v8.1.0. Released v2.0.0. % 0.05/0.09 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.08/0.29 % Computer : n025.cluster.edu % 0.08/0.29 % Model : x86_64 x86_64 % 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.29 % Memory : 8042.1875MB % 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.08/0.29 % CPULimit : 300 % 0.08/0.29 % WCLimit : 600 % 0.08/0.29 % DateTime : Tue Jul 12 07:22:18 EDT 2022 % 0.08/0.29 % CPUTime : % 0.08/0.29 % SZS status Theorem % 0.08/0.29 % SZS output begin IncompleteProof % 0.08/0.29 cnf(c0, axiom, % 0.08/0.29 ~big_f(X0,X1) | ~big_f(sK1,X0) | ~big_f(sK0,X0)). % 0.08/0.29 cnf(c1, plain, % 0.08/0.29 ~big_f(X0,X1) | ~big_f(sK1,X0) | ~big_f(sK0,X0), % 0.08/0.29 inference(start, [], [c0])). % 0.08/0.29 % 0.08/0.29 cnf(c2, axiom, % 0.08/0.29 big_f(sK1,X2) | ~big_f(X3,X2) | big_g(X2,sK2(X3,X2)) | big_g(sK1,sK2(X3,X2))). % 0.08/0.29 cnf(a0, assumption, % 0.08/0.29 X0 = sK1). % 0.08/0.29 cnf(a1, assumption, % 0.08/0.29 X1 = X2). % 0.08/0.29 cnf(c3, plain, % 0.08/0.29 ~big_f(sK1,X0) | ~big_f(sK0,X0), % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.08/0.29 cnf(c4, plain, % 0.08/0.29 ~big_f(X3,X2) | big_g(X2,sK2(X3,X2)) | big_g(sK1,sK2(X3,X2)), % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 0.08/0.29 % 0.08/0.29 cnf(c5, axiom, % 0.08/0.29 big_f(sK0,sK1)). % 0.08/0.29 cnf(a2, assumption, % 0.08/0.29 X3 = sK0). % 0.08/0.29 cnf(a3, assumption, % 0.08/0.29 X2 = sK1). % 0.08/0.29 cnf(c6, plain, % 0.08/0.29 big_g(X2,sK2(X3,X2)) | big_g(sK1,sK2(X3,X2)), % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.08/0.29 cnf(c7, plain, % 0.08/0.29 $false, % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a2, a3])], [c4, c5])). % 0.08/0.29 % 0.08/0.29 cnf(c8, axiom, % 0.08/0.29 big_f(sK1,X4) | ~big_f(X5,X4) | ~big_g(X4,sK2(X5,X4)) | ~big_g(sK1,sK2(X5,X4))). % 0.08/0.29 cnf(a4, assumption, % 0.08/0.29 X2 = X4). % 0.08/0.29 cnf(a5, assumption, % 0.08/0.29 sK2(X3,X2) = sK2(X5,X4)). % 0.08/0.29 cnf(c9, plain, % 0.08/0.29 big_g(sK1,sK2(X3,X2)), % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.08/0.29 cnf(c10, plain, % 0.08/0.29 big_f(sK1,X4) | ~big_f(X5,X4) | ~big_g(sK1,sK2(X5,X4)), % 0.08/0.29 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])). % 0.08/0.29 % 0.08/0.29 cnf(c11, plain, % 0.08/0.29 ~big_f(X0,X1)). % 0.08/0.29 cnf(a6, assumption, % 0.08/0.29 sK1 = X0). % 0.08/0.29 cnf(a7, assumption, % 0.08/0.29 X4 = X1). % 0.08/0.29 cnf(c12, plain, % 0.08/0.29 ~big_f(X5,X4) | ~big_g(sK1,sK2(X5,X4)), % 0.08/0.29 inference(predicate_reduction, [assumptions([a6, a7])], [c10, c11])). % 0.08/0.29 % 0.08/0.29 cnf(c13, plain, % 0.08/0.29 big_f(X3,X2)). % 0.08/0.29 cnf(a8, assumption, % 0.08/0.29 X5 = X3). % 0.08/0.29 cnf(a9, assumption, % 0.08/0.29 X4 = X2). % 0.08/0.29 cnf(c14, plain, % 0.08/0.29 ~big_g(sK1,sK2(X5,X4)), % 0.08/0.29 inference(predicate_reduction, [assumptions([a8, a9])], [c12, c13])). % 0.08/0.29 % 0.08/0.29 cnf(c15, plain, % 0.08/0.29 big_g(X2,sK2(X3,X2))). % 0.08/0.29 cnf(a10, assumption, % 0.08/0.29 sK1 = X2). % 0.08/0.29 cnf(a11, assumption, % 0.08/0.29 sK2(X5,X4) = sK2(X3,X2)). % 0.08/0.29 cnf(c16, plain, % 0.08/0.29 $false, % 0.08/0.29 inference(predicate_reduction, [assumptions([a10, a11])], [c14, c15])). % 0.08/0.30 % 0.08/0.30 cnf(c17, plain, % 0.08/0.30 ~big_g(X2,sK2(X3,X2))). % 0.08/0.30 cnf(a12, assumption, % 0.08/0.30 sK1 = X2). % 0.08/0.30 cnf(a13, assumption, % 0.08/0.30 sK2(X3,X2) = sK2(X3,X2)). % 0.08/0.30 cnf(c18, plain, % 0.08/0.30 $false, % 0.08/0.30 inference(predicate_reduction, [assumptions([a12, a13])], [c9, c17])). % 0.08/0.30 % 0.08/0.30 cnf(c19, plain, % 0.08/0.30 big_f(X0,X1)). % 0.08/0.30 cnf(a14, assumption, % 0.08/0.30 sK1 = X0). % 0.08/0.30 cnf(a15, assumption, % 0.08/0.30 X0 = X1). % 0.08/0.30 cnf(c20, plain, % 0.08/0.30 ~big_f(sK0,X0), % 0.08/0.30 inference(predicate_reduction, [assumptions([a14, a15])], [c3, c19])). % 0.08/0.30 % 0.08/0.30 cnf(c21, plain, % 0.08/0.30 big_f(X3,X2)). % 0.08/0.30 cnf(a16, assumption, % 0.08/0.30 sK0 = X3). % 0.08/0.30 cnf(a17, assumption, % 0.08/0.30 X0 = X2). % 0.08/0.30 cnf(c22, plain, % 0.08/0.30 $false, % 0.08/0.30 inference(predicate_reduction, [assumptions([a16, a17])], [c20, c21])). % 0.08/0.30 % 0.08/0.30 cnf(c23, plain, % 0.08/0.30 $false, % 0.08/0.30 inference(constraint_solving, [ % 0.08/0.30 bind(X0, sK1), % 0.08/0.30 bind(X1, sK1), % 0.08/0.30 bind(X2, sK1), % 0.08/0.30 bind(X3, sK0), % 0.08/0.30 bind(X4, sK1), % 0.08/0.30 bind(X5, sK0) % 0.08/0.30 ], % 0.08/0.30 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17])). % 0.08/0.30 % 0.08/0.30 % SZS output end IncompleteProof %------------------------------------------------------------------------------