%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWC359+1 : TPTP v8.1.0. Released v2.4.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % Computer : n010.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 21:08:25 EDT 2022 % Result : Theorem 0.21s 0.41s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.13/0.12 % Problem : SWC359+1 : TPTP v8.1.0. Released v2.4.0. % 0.13/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n010.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 : Sun Jun 12 21:39:25 EDT 2022 % 0.13/0.33 % CPUTime : % 0.21/0.41 % SZS status Theorem % 0.21/0.41 % SZS output begin IncompleteProof % 0.21/0.41 cnf(c0, axiom, % 0.21/0.41 sK89 = sK91). % 0.21/0.41 cnf(c1, plain, % 0.21/0.41 sK89 = sK91, % 0.21/0.41 inference(start, [], [c0])). % 0.21/0.41 % 0.21/0.41 cnf(c2, axiom, % 0.21/0.41 segmentP(sK91,sK90)). % 0.21/0.41 cnf(a0, assumption, % 0.21/0.41 sK91 = sK91). % 0.21/0.41 cnf(a1, assumption, % 0.21/0.41 sK89 = X0). % 0.21/0.41 cnf(c3, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.41 cnf(c4, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.41 cnf(c5, plain, % 0.21/0.41 segmentP(X0,sK90), % 0.21/0.41 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.21/0.41 % 0.21/0.41 cnf(c6, axiom, % 0.21/0.41 sK88 = sK90). % 0.21/0.41 cnf(a2, assumption, % 0.21/0.41 sK90 = sK90). % 0.21/0.41 cnf(c7, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(strict_function_extension, [assumptions([a2])], [c5, c6])). % 0.21/0.41 cnf(c8, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(strict_function_extension, [assumptions([a2])], [c5, c6])). % 0.21/0.41 cnf(c9, plain, % 0.21/0.41 X1 != sK88 | segmentP(X0,X1), % 0.21/0.41 inference(strict_function_extension, [assumptions([a2])], [c5, c6])). % 0.21/0.41 % 0.21/0.41 cnf(a3, assumption, % 0.21/0.41 X1 = sK88). % 0.21/0.41 cnf(c10, plain, % 0.21/0.41 segmentP(X0,X1), % 0.21/0.41 inference(reflexivity, [assumptions([a3])], [c9])). % 0.21/0.41 % 0.21/0.41 cnf(c11, axiom, % 0.21/0.41 ~segmentP(sK89,sK88)). % 0.21/0.41 cnf(a4, assumption, % 0.21/0.41 X0 = sK89). % 0.21/0.41 cnf(a5, assumption, % 0.21/0.41 X1 = sK88). % 0.21/0.41 cnf(c12, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])). % 0.21/0.41 cnf(c13, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(strict_predicate_extension, [assumptions([a4, a5])], [c10, c11])). % 0.21/0.41 % 0.21/0.41 cnf(c14, plain, % 0.21/0.41 $false, % 0.21/0.41 inference(constraint_solving, [ % 0.21/0.41 bind(X0, sK89), % 0.21/0.41 bind(X1, sK88) % 0.21/0.41 ], % 0.21/0.41 [a0, a1, a2, a3, a4, a5])). % 0.21/0.41 % 0.21/0.41 % SZS output end IncompleteProof %------------------------------------------------------------------------------