%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SYN059+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:07:42 EDT 2022 % Result : Theorem 0.19s 0.36s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SYN059+1 : TPTP v8.1.0. Released v2.0.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n025.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 : Tue Jul 12 00:36:32 EDT 2022 % 0.13/0.33 % CPUTime : % 0.19/0.36 % SZS status Theorem % 0.19/0.36 % SZS output begin IncompleteProof % 0.19/0.36 cnf(c0, axiom, % 0.19/0.36 sP2 | sP1). % 0.19/0.36 cnf(c1, plain, % 0.19/0.36 sP2 | sP1, % 0.19/0.36 inference(start, [], [c0])). % 0.19/0.36 % 0.19/0.36 cnf(c2, axiom, % 0.19/0.36 big_h(X0) | ~big_g(X1) | ~big_f(X0) | ~sP2). % 0.19/0.36 cnf(c3, plain, % 0.19/0.36 sP1, % 0.19/0.36 inference(strict_predicate_extension, [], [c1, c2])). % 0.19/0.36 cnf(c4, plain, % 0.19/0.36 big_h(X0) | ~big_g(X1) | ~big_f(X0), % 0.19/0.36 inference(strict_predicate_extension, [], [c1, c2])). % 0.19/0.36 % 0.19/0.36 cnf(c5, axiom, % 0.19/0.36 sP0 | ~big_h(sK8)). % 0.19/0.36 cnf(a0, assumption, % 0.19/0.36 X0 = sK8). % 0.19/0.36 cnf(c6, plain, % 0.19/0.36 ~big_g(X1) | ~big_f(X0), % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])). % 0.19/0.36 cnf(c7, plain, % 0.19/0.36 sP0, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a0])], [c4, c5])). % 0.19/0.36 % 0.19/0.36 cnf(c8, axiom, % 0.19/0.36 sP1 | ~big_j(sK7) | ~sP0). % 0.19/0.36 cnf(c9, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(strict_predicate_extension, [], [c7, c8])). % 0.19/0.36 cnf(c10, plain, % 0.19/0.36 sP1 | ~big_j(sK7), % 0.19/0.36 inference(strict_predicate_extension, [], [c7, c8])). % 0.19/0.36 % 0.19/0.36 cnf(c11, axiom, % 0.19/0.36 ~sP2 | ~sP1). % 0.19/0.36 cnf(c12, plain, % 0.19/0.36 ~big_j(sK7), % 0.19/0.36 inference(strict_predicate_extension, [], [c10, c11])). % 0.19/0.36 cnf(c13, plain, % 0.19/0.36 ~sP2, % 0.19/0.36 inference(strict_predicate_extension, [], [c10, c11])). % 0.19/0.36 % 0.19/0.36 cnf(c14, plain, % 0.19/0.36 sP2). % 0.19/0.36 cnf(c15, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(predicate_reduction, [], [c13, c14])). % 0.19/0.36 % 0.19/0.36 cnf(c16, axiom, % 0.19/0.36 big_j(X2) | ~big_g(X2) | ~big_f(X3) | ~sP2). % 0.19/0.36 cnf(a1, assumption, % 0.19/0.36 sK7 = X2). % 0.19/0.36 cnf(c17, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c12, c16])). % 0.19/0.36 cnf(c18, plain, % 0.19/0.36 ~big_g(X2) | ~big_f(X3) | ~sP2, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a1])], [c12, c16])). % 0.19/0.36 % 0.19/0.36 cnf(c19, axiom, % 0.19/0.36 sP1 | big_g(sK7) | ~sP0). % 0.19/0.36 cnf(a2, assumption, % 0.19/0.36 X2 = sK7). % 0.19/0.36 cnf(c20, plain, % 0.19/0.36 ~big_f(X3) | ~sP2, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c18, c19])). % 0.19/0.36 cnf(c21, plain, % 0.19/0.36 sP1 | ~sP0, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a2])], [c18, c19])). % 0.19/0.36 % 0.19/0.36 cnf(c22, plain, % 0.19/0.36 ~sP1). % 0.19/0.36 cnf(c23, plain, % 0.19/0.36 ~sP0, % 0.19/0.36 inference(predicate_reduction, [], [c21, c22])). % 0.19/0.36 % 0.19/0.36 cnf(c24, plain, % 0.19/0.36 sP0). % 0.19/0.36 cnf(c25, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(predicate_reduction, [], [c23, c24])). % 0.19/0.36 % 0.19/0.36 cnf(c26, axiom, % 0.19/0.36 big_f(sK3)). % 0.19/0.36 cnf(a3, assumption, % 0.19/0.36 X3 = sK3). % 0.19/0.36 cnf(c27, plain, % 0.19/0.36 ~sP2, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c20, c26])). % 0.19/0.36 cnf(c28, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a3])], [c20, c26])). % 0.19/0.36 % 0.19/0.36 cnf(c29, plain, % 0.19/0.36 sP2). % 0.19/0.36 cnf(c30, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(predicate_reduction, [], [c27, c29])). % 0.19/0.36 % 0.19/0.36 cnf(c31, axiom, % 0.19/0.36 big_g(sK4)). % 0.19/0.36 cnf(a4, assumption, % 0.19/0.36 X1 = sK4). % 0.19/0.36 cnf(c32, plain, % 0.19/0.36 ~big_f(X0), % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a4])], [c6, c31])). % 0.19/0.36 cnf(c33, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a4])], [c6, c31])). % 0.19/0.36 % 0.19/0.36 cnf(c34, axiom, % 0.19/0.36 sP0 | big_f(sK8)). % 0.19/0.36 cnf(a5, assumption, % 0.19/0.36 X0 = sK8). % 0.19/0.36 cnf(c35, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a5])], [c32, c34])). % 0.19/0.36 cnf(c36, plain, % 0.19/0.36 sP0, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a5])], [c32, c34])). % 0.19/0.36 % 0.19/0.36 cnf(c37, plain, % 0.19/0.36 ~sP0). % 0.19/0.36 cnf(c38, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(predicate_reduction, [], [c36, c37])). % 0.19/0.36 % 0.19/0.36 cnf(c39, axiom, % 0.19/0.36 big_j(X4) | ~big_g(X4) | ~sP1). % 0.19/0.36 cnf(c40, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(strict_predicate_extension, [], [c3, c39])). % 0.19/0.36 cnf(c41, plain, % 0.19/0.36 big_j(X4) | ~big_g(X4), % 0.19/0.36 inference(strict_predicate_extension, [], [c3, c39])). % 0.19/0.36 % 0.19/0.36 cnf(c42, axiom, % 0.19/0.36 sP2 | ~big_j(sK6) | ~big_h(sK5)). % 0.19/0.36 cnf(a6, assumption, % 0.19/0.36 X4 = sK6). % 0.19/0.36 cnf(c43, plain, % 0.19/0.36 ~big_g(X4), % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a6])], [c41, c42])). % 0.19/0.36 cnf(c44, plain, % 0.19/0.36 sP2 | ~big_h(sK5), % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a6])], [c41, c42])). % 0.19/0.36 % 0.19/0.36 cnf(c45, plain, % 0.19/0.36 ~sP2). % 0.19/0.36 cnf(c46, plain, % 0.19/0.36 ~big_h(sK5), % 0.19/0.36 inference(predicate_reduction, [], [c44, c45])). % 0.19/0.36 % 0.19/0.36 cnf(c47, axiom, % 0.19/0.36 big_h(X5) | ~big_f(X5) | ~sP0). % 0.19/0.36 cnf(a7, assumption, % 0.19/0.36 sK5 = X5). % 0.19/0.36 cnf(c48, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a7])], [c46, c47])). % 0.19/0.36 cnf(c49, plain, % 0.19/0.36 ~big_f(X5) | ~sP0, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a7])], [c46, c47])). % 0.19/0.36 % 0.19/0.36 cnf(c50, axiom, % 0.19/0.36 sP2 | big_f(sK5)). % 0.19/0.36 cnf(a8, assumption, % 0.19/0.36 X5 = sK5). % 0.19/0.36 cnf(c51, plain, % 0.19/0.36 ~sP0, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a8])], [c49, c50])). % 0.19/0.36 cnf(c52, plain, % 0.19/0.36 sP2, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a8])], [c49, c50])). % 0.19/0.36 % 0.19/0.36 cnf(c53, plain, % 0.19/0.36 ~sP2). % 0.19/0.36 cnf(c54, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(predicate_reduction, [], [c52, c53])). % 0.19/0.36 % 0.19/0.36 cnf(c55, axiom, % 0.19/0.36 sP0 | ~sP1). % 0.19/0.36 cnf(c56, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(strict_predicate_extension, [], [c51, c55])). % 0.19/0.36 cnf(c57, plain, % 0.19/0.36 ~sP1, % 0.19/0.36 inference(strict_predicate_extension, [], [c51, c55])). % 0.19/0.36 % 0.19/0.36 cnf(c58, plain, % 0.19/0.36 sP1). % 0.19/0.36 cnf(c59, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(predicate_reduction, [], [c57, c58])). % 0.19/0.36 % 0.19/0.36 cnf(c60, axiom, % 0.19/0.36 sP2 | big_g(sK6)). % 0.19/0.36 cnf(a9, assumption, % 0.19/0.36 X4 = sK6). % 0.19/0.36 cnf(c61, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a9])], [c43, c60])). % 0.19/0.36 cnf(c62, plain, % 0.19/0.36 sP2, % 0.19/0.36 inference(strict_predicate_extension, [assumptions([a9])], [c43, c60])). % 0.19/0.36 % 0.19/0.36 cnf(c63, plain, % 0.19/0.36 ~sP2). % 0.19/0.36 cnf(c64, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(predicate_reduction, [], [c62, c63])). % 0.19/0.36 % 0.19/0.36 cnf(c65, plain, % 0.19/0.36 $false, % 0.19/0.36 inference(constraint_solving, [ % 0.19/0.36 bind(X0, sK8), % 0.19/0.36 bind(X1, sK4), % 0.19/0.36 bind(X2, sK7), % 0.19/0.36 bind(X3, sK3), % 0.19/0.36 bind(X4, sK6), % 0.19/0.36 bind(X5, sK5) % 0.19/0.36 ], % 0.19/0.36 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9])). % 0.19/0.36 % 0.19/0.36 % SZS output end IncompleteProof %------------------------------------------------------------------------------