%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWW342+1 : 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 : n026.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 00:45:41 EDT 2022 % Result : Theorem 139.93s 19.86s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.11 % Problem : SWW342+1 : TPTP v8.1.0. Released v5.2.0. % 0.06/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.33 % Computer : n026.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Mon Jun 6 09:58:15 EDT 2022 % 0.12/0.33 % CPUTime : % 139.93/19.86 % SZS status Theorem % 139.93/19.86 % SZS output begin IncompleteProof % 139.93/19.86 cnf(c0, axiom, % 139.93/19.86 c_Natural_Oevaln(c_Com_Ocom_OSKIP,sK971,v_n,sK972)). % 139.93/19.86 cnf(c1, plain, % 139.93/19.86 c_Natural_Oevaln(c_Com_Ocom_OSKIP,sK971,v_n,sK972), % 139.93/19.86 inference(start, [], [c0])). % 139.93/19.86 % 139.93/19.86 cnf(c2, axiom, % 139.93/19.86 X0 = X1 | ~c_Natural_Oevaln(c_Com_Ocom_OSKIP,X1,X2,X0)). % 139.93/19.86 cnf(a0, assumption, % 139.93/19.86 c_Com_Ocom_OSKIP = c_Com_Ocom_OSKIP). % 139.93/19.86 cnf(a1, assumption, % 139.93/19.86 sK971 = X1). % 139.93/19.86 cnf(a2, assumption, % 139.93/19.86 v_n = X2). % 139.93/19.86 cnf(a3, assumption, % 139.93/19.86 sK972 = X0). % 139.93/19.86 cnf(c3, plain, % 139.93/19.86 $false, % 139.93/19.86 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 139.93/19.86 cnf(c4, plain, % 139.93/19.86 X0 = X1, % 139.93/19.86 inference(strict_predicate_extension, [assumptions([a0, a1, a2, a3])], [c1, c2])). % 139.93/19.86 % 139.93/19.86 cnf(c5, axiom, % 139.93/19.86 v_P(sK970,sK971)). % 139.93/19.86 cnf(a4, assumption, % 139.93/19.86 sK971 = X1). % 139.93/19.86 cnf(c6, plain, % 139.93/19.86 $false, % 139.93/19.86 inference(strict_subterm_extension, [assumptions([a4])], [c4, c5])). % 139.93/19.86 cnf(c7, plain, % 139.93/19.86 $false, % 139.93/19.86 inference(strict_subterm_extension, [assumptions([a4])], [c4, c5])). % 139.93/19.86 cnf(c8, plain, % 139.93/19.86 v_P(sK970,X0), % 139.93/19.86 inference(strict_subterm_extension, [assumptions([a4])], [c4, c5])). % 139.93/19.86 % 139.93/19.86 cnf(c9, axiom, % 139.93/19.86 ~v_P(sK970,sK972)). % 139.93/19.86 cnf(a5, assumption, % 139.93/19.86 sK970 = sK970). % 139.93/19.86 cnf(a6, assumption, % 139.93/19.86 X0 = sK972). % 139.93/19.86 cnf(c10, plain, % 139.93/19.86 $false, % 139.93/19.86 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c9])). % 139.93/19.86 cnf(c11, plain, % 139.93/19.86 $false, % 139.93/19.86 inference(strict_predicate_extension, [assumptions([a5, a6])], [c8, c9])). % 139.93/19.86 % 139.93/19.86 cnf(c12, plain, % 139.93/19.86 $false, % 139.93/19.86 inference(constraint_solving, [ % 139.93/19.86 bind(X0, sK972), % 139.93/19.86 bind(X1, sK971), % 139.93/19.86 bind(X2, v_n) % 139.93/19.86 ], % 139.93/19.86 [a0, a1, a2, a3, a4, a5, a6])). % 139.93/19.86 % 139.93/19.86 % SZS output end IncompleteProof %------------------------------------------------------------------------------