%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN084-2 : TPTP v8.1.0. Released v1.2.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:08:01 EDT 2022 % Result : Unsatisfiable 0.14s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : SYN084-2 : TPTP v8.1.0. Released v1.2.0. % 0.03/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.34 % Computer : n012.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Tue Jul 12 01:13:42 EDT 2022 % 0.14/0.34 % CPUTime : % 0.14/0.35 % SZS status Unsatisfiable % 0.14/0.35 % SZS output begin IncompleteProof % 0.14/0.35 cnf(c0, axiom, % 0.14/0.35 ~big_p(f(f(sk2))) | ~big_p(f(f(sk1)))). % 0.14/0.35 cnf(c1, plain, % 0.14/0.35 ~big_p(f(f(sk2))) | ~big_p(f(f(sk1))), % 0.14/0.35 inference(start, [], [c0])). % 0.14/0.35 % 0.14/0.35 cnf(c2, axiom, % 0.14/0.35 ~big_p(a) | big_p(X0) | big_p(f(f(X0)))). % 0.14/0.35 cnf(a0, assumption, % 0.14/0.35 f(f(sk2)) = f(f(X0))). % 0.14/0.35 cnf(c3, plain, % 0.14/0.35 ~big_p(f(f(sk1))), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.35 cnf(c4, plain, % 0.14/0.35 ~big_p(a) | big_p(X0), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.14/0.35 % 0.14/0.35 cnf(c5, axiom, % 0.14/0.35 big_p(a)). % 0.14/0.35 cnf(a1, assumption, % 0.14/0.35 a = a). % 0.14/0.35 cnf(c6, plain, % 0.14/0.35 big_p(X0), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.14/0.35 cnf(c7, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.14/0.35 % 0.14/0.35 cnf(c8, axiom, % 0.14/0.35 ~big_p(sk2) | ~big_p(sk1) | big_p(f(sk2)) | big_p(f(sk1))). % 0.14/0.35 cnf(a2, assumption, % 0.14/0.35 X0 = sk2). % 0.14/0.35 cnf(c9, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.14/0.35 cnf(c10, plain, % 0.14/0.35 ~big_p(sk1) | big_p(f(sk2)) | big_p(f(sk1)), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])). % 0.14/0.35 % 0.14/0.35 cnf(c11, axiom, % 0.14/0.35 ~big_p(a) | big_p(X1) | big_p(f(f(X1)))). % 0.14/0.35 cnf(a3, assumption, % 0.14/0.35 sk1 = X1). % 0.14/0.35 cnf(c12, plain, % 0.14/0.35 big_p(f(sk2)) | big_p(f(sk1)), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.14/0.35 cnf(c13, plain, % 0.14/0.35 ~big_p(a) | big_p(f(f(X1))), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 0.14/0.35 % 0.14/0.35 cnf(c14, plain, % 0.14/0.35 big_p(a)). % 0.14/0.35 cnf(a4, assumption, % 0.14/0.35 a = a). % 0.14/0.35 cnf(c15, plain, % 0.14/0.35 big_p(f(f(X1))), % 0.14/0.35 inference(predicate_reduction, [assumptions([a4])], [c13, c14])). % 0.14/0.35 % 0.14/0.35 cnf(c16, axiom, % 0.14/0.35 ~big_p(f(f(sk1))) | ~big_p(sk2) | big_p(f(sk2))). % 0.14/0.35 cnf(a5, assumption, % 0.14/0.35 f(f(X1)) = f(f(sk1))). % 0.14/0.35 cnf(c17, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c15, c16])). % 0.14/0.35 cnf(c18, plain, % 0.14/0.35 ~big_p(sk2) | big_p(f(sk2)), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a5])], [c15, c16])). % 0.14/0.35 % 0.14/0.35 cnf(c19, plain, % 0.14/0.35 big_p(X0)). % 0.14/0.35 cnf(a6, assumption, % 0.14/0.35 sk2 = X0). % 0.14/0.35 cnf(c20, plain, % 0.14/0.35 big_p(f(sk2)), % 0.14/0.35 inference(predicate_reduction, [assumptions([a6])], [c18, c19])). % 0.14/0.35 % 0.14/0.35 cnf(c21, axiom, % 0.14/0.35 ~big_p(a) | ~big_p(f(X2)) | big_p(f(f(X2)))). % 0.14/0.35 cnf(a7, assumption, % 0.14/0.35 f(sk2) = f(X2)). % 0.14/0.35 cnf(c22, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a7])], [c20, c21])). % 0.14/0.35 cnf(c23, plain, % 0.14/0.35 ~big_p(a) | big_p(f(f(X2))), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a7])], [c20, c21])). % 0.14/0.35 % 0.14/0.35 cnf(c24, plain, % 0.14/0.35 big_p(a)). % 0.14/0.35 cnf(a8, assumption, % 0.14/0.35 a = a). % 0.14/0.35 cnf(c25, plain, % 0.14/0.35 big_p(f(f(X2))), % 0.14/0.35 inference(predicate_reduction, [assumptions([a8])], [c23, c24])). % 0.14/0.35 % 0.14/0.35 cnf(c26, plain, % 0.14/0.35 ~big_p(f(f(sk2)))). % 0.14/0.35 cnf(a9, assumption, % 0.14/0.35 f(f(X2)) = f(f(sk2))). % 0.14/0.35 cnf(c27, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(predicate_reduction, [assumptions([a9])], [c25, c26])). % 0.14/0.35 % 0.14/0.35 cnf(c28, plain, % 0.14/0.35 ~big_p(f(sk2))). % 0.14/0.35 cnf(a10, assumption, % 0.14/0.35 f(sk2) = f(sk2)). % 0.14/0.35 cnf(c29, plain, % 0.14/0.35 big_p(f(sk1)), % 0.14/0.35 inference(predicate_reduction, [assumptions([a10])], [c12, c28])). % 0.14/0.35 % 0.14/0.35 cnf(c30, axiom, % 0.14/0.35 ~big_p(a) | ~big_p(f(X3)) | big_p(f(f(X3)))). % 0.14/0.35 cnf(a11, assumption, % 0.14/0.35 f(sk1) = f(X3)). % 0.14/0.35 cnf(c31, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a11])], [c29, c30])). % 0.14/0.35 cnf(c32, plain, % 0.14/0.35 ~big_p(a) | big_p(f(f(X3))), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a11])], [c29, c30])). % 0.14/0.35 % 0.14/0.35 cnf(c33, plain, % 0.14/0.35 big_p(a)). % 0.14/0.35 cnf(a12, assumption, % 0.14/0.35 a = a). % 0.14/0.35 cnf(c34, plain, % 0.14/0.35 big_p(f(f(X3))), % 0.14/0.35 inference(predicate_reduction, [assumptions([a12])], [c32, c33])). % 0.14/0.35 % 0.14/0.35 cnf(c35, plain, % 0.14/0.35 ~big_p(f(f(X1)))). % 0.14/0.35 cnf(a13, assumption, % 0.14/0.35 f(f(X3)) = f(f(X1))). % 0.14/0.35 cnf(c36, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(predicate_reduction, [assumptions([a13])], [c34, c35])). % 0.14/0.35 % 0.14/0.35 cnf(c37, axiom, % 0.14/0.35 ~big_p(a) | big_p(X4) | big_p(f(f(X4)))). % 0.14/0.35 cnf(a14, assumption, % 0.14/0.35 f(f(sk1)) = f(f(X4))). % 0.14/0.35 cnf(c38, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a14])], [c3, c37])). % 0.14/0.35 cnf(c39, plain, % 0.14/0.35 ~big_p(a) | big_p(X4), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a14])], [c3, c37])). % 0.14/0.35 % 0.14/0.35 cnf(c40, plain, % 0.14/0.35 big_p(a)). % 0.14/0.35 cnf(a15, assumption, % 0.14/0.35 a = a). % 0.14/0.35 cnf(c41, plain, % 0.14/0.35 big_p(X4), % 0.14/0.35 inference(predicate_reduction, [assumptions([a15])], [c39, c40])). % 0.14/0.35 % 0.14/0.35 cnf(c42, axiom, % 0.14/0.35 ~big_p(f(f(sk2))) | ~big_p(sk1) | big_p(f(sk1))). % 0.14/0.35 cnf(a16, assumption, % 0.14/0.35 X4 = sk1). % 0.14/0.35 cnf(c43, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a16])], [c41, c42])). % 0.14/0.35 cnf(c44, plain, % 0.14/0.35 ~big_p(f(f(sk2))) | big_p(f(sk1)), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a16])], [c41, c42])). % 0.14/0.35 % 0.14/0.35 cnf(c45, plain, % 0.14/0.35 big_p(f(f(sk2)))). % 0.14/0.35 cnf(a17, assumption, % 0.14/0.35 f(f(sk2)) = f(f(sk2))). % 0.14/0.35 cnf(c46, plain, % 0.14/0.35 big_p(f(sk1)), % 0.14/0.35 inference(predicate_reduction, [assumptions([a17])], [c44, c45])). % 0.14/0.35 % 0.14/0.35 cnf(c47, axiom, % 0.14/0.35 ~big_p(a) | ~big_p(f(X5)) | big_p(f(f(X5)))). % 0.14/0.35 cnf(a18, assumption, % 0.14/0.35 f(sk1) = f(X5)). % 0.14/0.35 cnf(c48, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a18])], [c46, c47])). % 0.14/0.35 cnf(c49, plain, % 0.14/0.35 ~big_p(a) | big_p(f(f(X5))), % 0.14/0.35 inference(strict_predicate_extension, [assumptions([a18])], [c46, c47])). % 0.14/0.35 % 0.14/0.35 cnf(c50, plain, % 0.14/0.35 big_p(a)). % 0.14/0.35 cnf(a19, assumption, % 0.14/0.35 a = a). % 0.14/0.35 cnf(c51, plain, % 0.14/0.35 big_p(f(f(X5))), % 0.14/0.35 inference(predicate_reduction, [assumptions([a19])], [c49, c50])). % 0.14/0.35 % 0.14/0.35 cnf(c52, plain, % 0.14/0.35 ~big_p(f(f(sk1)))). % 0.14/0.35 cnf(a20, assumption, % 0.14/0.35 f(f(X5)) = f(f(sk1))). % 0.14/0.35 cnf(c53, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(predicate_reduction, [assumptions([a20])], [c51, c52])). % 0.14/0.35 % 0.14/0.35 cnf(c54, plain, % 0.14/0.35 $false, % 0.14/0.35 inference(constraint_solving, [ % 0.14/0.35 bind(X0, sk2), % 0.14/0.35 bind(X1, sk1), % 0.14/0.35 bind(X2, sk2), % 0.14/0.35 bind(X3, sk1), % 0.14/0.35 bind(X4, sk1), % 0.14/0.35 bind(X5, sk1) % 0.14/0.35 ], % 0.14/0.35 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20])). % 0.14/0.35 % 0.14/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------