%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWB002+4 : TPTP v8.1.0. Released v5.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 : 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 : Tue Jul 19 19:12:27 EDT 2022 % Result : Theorem 0.15s 0.37s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.14 % Problem : SWB002+4 : TPTP v8.1.0. Released v5.2.0. % 0.04/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.15/0.36 % Computer : n019.cluster.edu % 0.15/0.36 % Model : x86_64 x86_64 % 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.15/0.36 % Memory : 8042.1875MB % 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.15/0.36 % CPULimit : 300 % 0.15/0.36 % WCLimit : 600 % 0.15/0.36 % DateTime : Wed Jun 1 12:20:10 EDT 2022 % 0.15/0.36 % CPUTime : % 0.15/0.37 % SZS status Theorem % 0.15/0.37 % SZS output begin IncompleteProof % 0.15/0.37 cnf(c0, axiom, % 0.15/0.37 ~iext(uri_ex_q,X0,X1) | ~iext(uri_ex_p,X1,X0)). % 0.15/0.37 cnf(c1, plain, % 0.15/0.37 ~iext(uri_ex_q,X0,X1) | ~iext(uri_ex_p,X1,X0), % 0.15/0.37 inference(start, [], [c0])). % 0.15/0.37 % 0.15/0.37 cnf(c2, axiom, % 0.15/0.37 iext(uri_ex_q,sK2,uri_ex_s)). % 0.15/0.37 cnf(a0, assumption, % 0.15/0.37 uri_ex_q = uri_ex_q). % 0.15/0.37 cnf(a1, assumption, % 0.15/0.37 X0 = sK2). % 0.15/0.37 cnf(a2, assumption, % 0.15/0.37 X1 = uri_ex_s). % 0.15/0.37 cnf(c3, plain, % 0.15/0.37 ~iext(uri_ex_p,X1,X0), % 0.15/0.37 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.15/0.37 cnf(c4, plain, % 0.15/0.37 $false, % 0.15/0.37 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])). % 0.15/0.37 % 0.15/0.37 cnf(c5, axiom, % 0.15/0.37 iext(uri_ex_p,uri_ex_s,sK2)). % 0.15/0.37 cnf(a3, assumption, % 0.15/0.37 uri_ex_p = uri_ex_p). % 0.15/0.37 cnf(a4, assumption, % 0.15/0.37 X1 = uri_ex_s). % 0.15/0.37 cnf(a5, assumption, % 0.15/0.37 X0 = sK2). % 0.15/0.37 cnf(c6, plain, % 0.15/0.37 $false, % 0.15/0.37 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c3, c5])). % 0.15/0.37 cnf(c7, plain, % 0.15/0.37 $false, % 0.15/0.37 inference(strict_predicate_extension, [assumptions([a3, a4, a5])], [c3, c5])). % 0.15/0.37 % 0.15/0.37 cnf(c8, plain, % 0.15/0.37 $false, % 0.15/0.37 inference(constraint_solving, [ % 0.15/0.37 bind(X0, sK2), % 0.15/0.37 bind(X1, uri_ex_s) % 0.15/0.37 ], % 0.15/0.37 [a0, a1, a2, a3, a4, a5])). % 0.15/0.37 % 0.15/0.37 % SZS output end IncompleteProof %------------------------------------------------------------------------------