%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN056+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 : n019.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:07:39 EDT 2022 % Result : Theorem 0.20s 0.46s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN056+1 : TPTP v8.1.0. Released v2.0.0. % 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n019.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Mon Jul 11 22:06:53 EDT 2022 % 0.13/0.33 % CPUTime : % 0.20/0.46 % SZS status Theorem % 0.20/0.46 % SZS output begin IncompleteProof % 0.20/0.46 cnf(c0, axiom, % 0.20/0.46 ~big_s(sK2) | ~big_r(sK3)). % 0.20/0.46 cnf(c1, plain, % 0.20/0.46 ~big_s(sK2) | ~big_r(sK3), % 0.20/0.46 inference(start, [], [c0])). % 0.20/0.46 % 0.20/0.46 cnf(c2, axiom, % 0.20/0.46 big_s(X0) | ~big_r(X1) | ~big_q(X0) | ~big_p(X1)). % 0.20/0.46 cnf(a0, assumption, % 0.20/0.46 sK2 = X0). % 0.20/0.46 cnf(c3, plain, % 0.20/0.46 ~big_r(sK3), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.46 cnf(c4, plain, % 0.20/0.46 ~big_r(X1) | ~big_q(X0) | ~big_p(X1), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 0.20/0.46 % 0.20/0.46 cnf(c5, axiom, % 0.20/0.46 big_s(X2) | ~big_q(X2) | big_r(X3) | ~big_p(X3)). % 0.20/0.46 cnf(a1, assumption, % 0.20/0.46 X1 = X3). % 0.20/0.46 cnf(c6, plain, % 0.20/0.46 ~big_q(X0) | ~big_p(X1), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.20/0.46 cnf(c7, plain, % 0.20/0.46 big_s(X2) | ~big_q(X2) | ~big_p(X3), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 0.20/0.46 % 0.20/0.46 cnf(c8, plain, % 0.20/0.46 ~big_s(sK2)). % 0.20/0.46 cnf(a2, assumption, % 0.20/0.46 X2 = sK2). % 0.20/0.46 cnf(c9, plain, % 0.20/0.46 ~big_q(X2) | ~big_p(X3), % 0.20/0.46 inference(predicate_reduction, [assumptions([a2])], [c7, c8])). % 0.20/0.46 % 0.20/0.46 cnf(c10, axiom, % 0.20/0.46 big_q(sK2) | big_p(sK3)). % 0.20/0.46 cnf(a3, assumption, % 0.20/0.46 X2 = sK2). % 0.20/0.46 cnf(c11, plain, % 0.20/0.46 ~big_p(X3), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a3])], [c9, c10])). % 0.20/0.46 cnf(c12, plain, % 0.20/0.46 big_p(sK3), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a3])], [c9, c10])). % 0.20/0.46 % 0.20/0.46 cnf(c13, axiom, % 0.20/0.46 big_q(sK1) | ~big_p(X4)). % 0.20/0.46 cnf(a4, assumption, % 0.20/0.46 sK3 = X4). % 0.20/0.46 cnf(c14, plain, % 0.20/0.46 $false, % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a4])], [c12, c13])). % 0.20/0.46 cnf(c15, plain, % 0.20/0.46 big_q(sK1), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a4])], [c12, c13])). % 0.20/0.46 % 0.20/0.46 cnf(c16, axiom, % 0.20/0.46 big_s(X5) | ~big_q(X5) | big_r(X6) | ~big_p(X6)). % 0.20/0.46 cnf(a5, assumption, % 0.20/0.46 sK1 = X5). % 0.20/0.46 cnf(c17, plain, % 0.20/0.46 $false, % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a5])], [c15, c16])). % 0.20/0.46 cnf(c18, plain, % 0.20/0.46 big_s(X5) | big_r(X6) | ~big_p(X6), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a5])], [c15, c16])). % 0.20/0.46 % 0.20/0.46 cnf(c19, axiom, % 0.20/0.46 big_r(X7) | ~big_s(X8) | ~big_q(X8) | ~big_p(X7)). % 0.20/0.46 cnf(a6, assumption, % 0.20/0.46 X5 = X8). % 0.20/0.46 cnf(c20, plain, % 0.20/0.46 big_r(X6) | ~big_p(X6), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a6])], [c18, c19])). % 0.20/0.46 cnf(c21, plain, % 0.20/0.46 big_r(X7) | ~big_q(X8) | ~big_p(X7), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a6])], [c18, c19])). % 0.20/0.46 % 0.20/0.46 cnf(c22, axiom, % 0.20/0.46 big_q(sK2) | ~big_r(sK3)). % 0.20/0.46 cnf(a7, assumption, % 0.20/0.46 X7 = sK3). % 0.20/0.46 cnf(c23, plain, % 0.20/0.46 ~big_q(X8) | ~big_p(X7), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a7])], [c21, c22])). % 0.20/0.46 cnf(c24, plain, % 0.20/0.46 big_q(sK2), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a7])], [c21, c22])). % 0.20/0.46 % 0.20/0.46 cnf(c25, plain, % 0.20/0.46 ~big_q(X2)). % 0.20/0.46 cnf(a8, assumption, % 0.20/0.46 sK2 = X2). % 0.20/0.46 cnf(c26, plain, % 0.20/0.46 $false, % 0.20/0.46 inference(predicate_reduction, [assumptions([a8])], [c24, c25])). % 0.20/0.46 % 0.20/0.46 cnf(c27, plain, % 0.20/0.46 big_q(sK1)). % 0.20/0.46 cnf(a9, assumption, % 0.20/0.46 X8 = sK1). % 0.20/0.46 cnf(c28, plain, % 0.20/0.46 ~big_p(X7), % 0.20/0.46 inference(predicate_reduction, [assumptions([a9])], [c23, c27])). % 0.20/0.46 % 0.20/0.46 cnf(c29, plain, % 0.20/0.46 big_p(sK3)). % 0.20/0.46 cnf(a10, assumption, % 0.20/0.46 X7 = sK3). % 0.20/0.46 cnf(c30, plain, % 0.20/0.46 $false, % 0.20/0.46 inference(predicate_reduction, [assumptions([a10])], [c28, c29])). % 0.20/0.46 % 0.20/0.46 cnf(c31, plain, % 0.20/0.46 ~big_r(X7)). % 0.20/0.46 cnf(a11, assumption, % 0.20/0.46 X6 = X7). % 0.20/0.46 cnf(c32, plain, % 0.20/0.46 ~big_p(X6), % 0.20/0.46 inference(predicate_reduction, [assumptions([a11])], [c20, c31])). % 0.20/0.46 % 0.20/0.46 cnf(c33, plain, % 0.20/0.46 big_p(sK3)). % 0.20/0.46 cnf(a12, assumption, % 0.20/0.46 X6 = sK3). % 0.20/0.46 cnf(c34, plain, % 0.20/0.46 $false, % 0.20/0.46 inference(predicate_reduction, [assumptions([a12])], [c32, c33])). % 0.20/0.46 % 0.20/0.46 cnf(c35, axiom, % 0.20/0.46 big_p(sK0) | ~big_q(X9)). % 0.20/0.46 cnf(a13, assumption, % 0.20/0.46 X3 = sK0). % 0.20/0.46 cnf(c36, plain, % 0.20/0.46 $false, % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a13])], [c11, c35])). % 0.20/0.46 cnf(c37, plain, % 0.20/0.46 ~big_q(X9), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a13])], [c11, c35])). % 0.20/0.46 % 0.20/0.46 cnf(c38, plain, % 0.20/0.46 big_q(X2)). % 0.20/0.46 cnf(a14, assumption, % 0.20/0.46 X9 = X2). % 0.20/0.46 cnf(c39, plain, % 0.20/0.46 $false, % 0.20/0.46 inference(predicate_reduction, [assumptions([a14])], [c37, c38])). % 0.20/0.46 % 0.20/0.46 cnf(c40, plain, % 0.20/0.46 big_q(X2)). % 0.20/0.46 cnf(a15, assumption, % 0.20/0.46 X0 = X2). % 0.20/0.46 cnf(c41, plain, % 0.20/0.46 ~big_p(X1), % 0.20/0.46 inference(predicate_reduction, [assumptions([a15])], [c6, c40])). % 0.20/0.46 % 0.20/0.46 cnf(c42, plain, % 0.20/0.46 big_p(X3)). % 0.20/0.46 cnf(a16, assumption, % 0.20/0.46 X1 = X3). % 0.20/0.46 cnf(c43, plain, % 0.20/0.46 $false, % 0.20/0.46 inference(predicate_reduction, [assumptions([a16])], [c41, c42])). % 0.20/0.46 % 0.20/0.46 cnf(c44, axiom, % 0.20/0.46 big_r(X10) | ~big_s(X11) | ~big_q(X11) | ~big_p(X10)). % 0.20/0.46 cnf(a17, assumption, % 0.20/0.46 sK3 = X10). % 0.20/0.46 cnf(c45, plain, % 0.20/0.46 $false, % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a17])], [c3, c44])). % 0.20/0.46 cnf(c46, plain, % 0.20/0.46 ~big_s(X11) | ~big_q(X11) | ~big_p(X10), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a17])], [c3, c44])). % 0.20/0.46 % 0.20/0.46 cnf(c47, plain, % 0.20/0.46 big_s(sK2)). % 0.20/0.46 cnf(a18, assumption, % 0.20/0.46 X11 = sK2). % 0.20/0.46 cnf(c48, plain, % 0.20/0.46 ~big_q(X11) | ~big_p(X10), % 0.20/0.46 inference(predicate_reduction, [assumptions([a18])], [c46, c47])). % 0.20/0.46 % 0.20/0.46 cnf(c49, plain, % 0.20/0.46 big_q(X2)). % 0.20/0.46 cnf(a19, assumption, % 0.20/0.46 X11 = X2). % 0.20/0.46 cnf(c50, plain, % 0.20/0.46 ~big_p(X10), % 0.20/0.46 inference(predicate_reduction, [assumptions([a19])], [c48, c49])). % 0.20/0.46 % 0.20/0.46 cnf(c51, axiom, % 0.20/0.46 ~big_s(sK2) | big_p(sK3)). % 0.20/0.46 cnf(a20, assumption, % 0.20/0.46 X10 = sK3). % 0.20/0.46 cnf(c52, plain, % 0.20/0.46 $false, % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a20])], [c50, c51])). % 0.20/0.46 cnf(c53, plain, % 0.20/0.46 ~big_s(sK2), % 0.20/0.46 inference(strict_predicate_extension, [assumptions([a20])], [c50, c51])). % 0.20/0.46 % 0.20/0.46 cnf(c54, plain, % 0.20/0.46 big_s(sK2)). % 0.20/0.46 cnf(a21, assumption, % 0.20/0.46 sK2 = sK2). % 0.20/0.46 cnf(c55, plain, % 0.20/0.46 $false, % 0.20/0.46 inference(predicate_reduction, [assumptions([a21])], [c53, c54])). % 0.20/0.46 % 0.20/0.46 cnf(c56, plain, % 0.20/0.46 $false, % 0.20/0.46 inference(constraint_solving, [ % 0.20/0.46 bind(X0, sK2), % 0.20/0.46 bind(X1, sK0), % 0.20/0.46 bind(X2, sK2), % 0.20/0.46 bind(X3, sK0), % 0.20/0.46 bind(X4, sK3), % 0.20/0.46 bind(X5, sK1), % 0.20/0.46 bind(X6, sK3), % 0.20/0.46 bind(X7, sK3), % 0.20/0.46 bind(X8, sK1), % 0.20/0.46 bind(X9, sK2), % 0.20/0.46 bind(X10, sK3), % 0.20/0.46 bind(X11, sK2) % 0.20/0.46 ], % 0.20/0.46 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21])). % 0.20/0.46 % 0.20/0.46 % SZS output end IncompleteProof %------------------------------------------------------------------------------