%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : BIO002+1 : TPTP v8.1.0. Bugfixed v6.4.1. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n015.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 14 23:29:10 EDT 2022 % Result : Theorem 4.88s 4.39s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : BIO002+1 : TPTP v8.1.0. Bugfixed v6.4.1. % 0.14/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.14/0.35 % Computer : n015.cluster.edu % 0.14/0.35 % Model : x86_64 x86_64 % 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.35 % Memory : 8042.1875MB % 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.35 % CPULimit : 300 % 0.14/0.35 % WCLimit : 600 % 0.14/0.35 % DateTime : Thu Jun 16 16:54:26 EDT 2022 % 0.14/0.36 % CPUTime : % 4.88/4.39 % SZS status Theorem % 4.88/4.39 % SZS output begin IncompleteProof % 4.88/4.39 cnf(c0, axiom, % 4.88/4.39 ~has_part_2(a_cell,X0)). % 4.88/4.39 cnf(c1, plain, % 4.88/4.39 ~has_part_2(a_cell,X0), % 4.88/4.39 inference(start, [], [c0])). % 4.88/4.39 % 4.88/4.39 cnf(c2, axiom, % 4.88/4.39 has_part_2(X1,fn_cell_14(X1)) | ~sP934(X1)). % 4.88/4.39 cnf(a0, assumption, % 4.88/4.39 a_cell = X1). % 4.88/4.39 cnf(a1, assumption, % 4.88/4.39 X0 = fn_cell_14(X1)). % 4.88/4.39 cnf(c3, plain, % 4.88/4.39 $false, % 4.88/4.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 4.88/4.39 cnf(c4, plain, % 4.88/4.39 ~sP934(X1), % 4.88/4.39 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])). % 4.88/4.39 % 4.88/4.39 cnf(c5, axiom, % 4.88/4.39 sP934(X2) | ~cell_1(X2)). % 4.88/4.39 cnf(a2, assumption, % 4.88/4.39 X1 = X2). % 4.88/4.39 cnf(c6, plain, % 4.88/4.39 $false, % 4.88/4.39 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 4.88/4.39 cnf(c7, plain, % 4.88/4.39 ~cell_1(X2), % 4.88/4.39 inference(strict_predicate_extension, [assumptions([a2])], [c4, c5])). % 4.88/4.39 % 4.88/4.39 cnf(c8, axiom, % 4.88/4.39 cell_1(a_cell)). % 4.88/4.39 cnf(a3, assumption, % 4.88/4.39 X2 = a_cell). % 4.88/4.39 cnf(c9, plain, % 4.88/4.39 $false, % 4.88/4.39 inference(strict_predicate_extension, [assumptions([a3])], [c7, c8])). % 4.88/4.39 cnf(c10, plain, % 4.88/4.39 $false, % 4.88/4.39 inference(strict_predicate_extension, [assumptions([a3])], [c7, c8])). % 4.88/4.39 % 4.88/4.39 cnf(c11, plain, % 4.88/4.39 $false, % 4.88/4.39 inference(constraint_solving, [ % 4.88/4.39 bind(X0, fn_cell_14(X1)), % 4.88/4.39 bind(X1, a_cell), % 4.88/4.39 bind(X2, a_cell) % 4.88/4.39 ], % 4.88/4.39 [a0, a1, a2, a3])). % 4.88/4.39 % 4.88/4.39 % SZS output end IncompleteProof %------------------------------------------------------------------------------