%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM557+3 : TPTP v8.1.0. Released v4.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 : n024.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 : Mon Jul 18 11:33:59 EDT 2022 % Result : Theorem 0.12s 0.35s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : NUM557+3 : TPTP v8.1.0. Released v4.0.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 : n024.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 : Thu Jul 7 06:57:14 EDT 2022 % 0.12/0.33 % CPUTime : % 0.12/0.35 % SZS status Theorem % 0.12/0.35 % SZS output begin IncompleteProof % 0.12/0.35 cnf(c0, axiom, % 0.12/0.35 xk != sbrdtbr0(xP) | ~aSubsetOf0(xP,xS)). % 0.12/0.35 cnf(c1, plain, % 0.12/0.35 xk != sbrdtbr0(xP) | ~aSubsetOf0(xP,xS), % 0.12/0.35 inference(start, [], [c0])). % 0.12/0.35 % 0.12/0.35 cnf(c2, axiom, % 0.12/0.35 xk = sbrdtbr0(xP)). % 0.12/0.35 cnf(a0, assumption, % 0.12/0.35 sbrdtbr0(xP) = sbrdtbr0(xP)). % 0.12/0.35 cnf(c3, plain, % 0.12/0.35 ~aSubsetOf0(xP,xS), % 0.12/0.35 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.35 cnf(c4, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.35 cnf(c5, plain, % 0.12/0.35 X0 != xk | xk != X0, % 0.12/0.35 inference(strict_function_extension, [assumptions([a0])], [c1, c2])). % 0.12/0.35 % 0.12/0.35 cnf(a1, assumption, % 0.12/0.35 X0 = xk). % 0.12/0.35 cnf(c6, plain, % 0.12/0.35 xk != X0, % 0.12/0.35 inference(reflexivity, [assumptions([a1])], [c5])). % 0.12/0.35 % 0.12/0.35 cnf(a2, assumption, % 0.12/0.35 xk = X0). % 0.12/0.35 cnf(c7, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(reflexivity, [assumptions([a2])], [c6])). % 0.12/0.35 % 0.12/0.35 cnf(c8, axiom, % 0.12/0.35 aSubsetOf0(xP,xS)). % 0.12/0.35 cnf(a3, assumption, % 0.12/0.35 xP = xP). % 0.12/0.35 cnf(a4, assumption, % 0.12/0.35 xS = xS). % 0.12/0.35 cnf(c9, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c3, c8])). % 0.12/0.35 cnf(c10, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(strict_predicate_extension, [assumptions([a3, a4])], [c3, c8])). % 0.12/0.35 % 0.12/0.35 cnf(c11, plain, % 0.12/0.35 $false, % 0.12/0.35 inference(constraint_solving, [ % 0.12/0.35 bind(X0, xk) % 0.12/0.35 ], % 0.12/0.35 [a0, a1, a2, a3, a4])). % 0.12/0.35 % 0.12/0.35 % SZS output end IncompleteProof %------------------------------------------------------------------------------