%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM531+1 : 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 : n023.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:45 EDT 2022 % Result : Theorem 0.12s 0.33s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : NUM531+1 : TPTP v8.1.0. Released v4.0.0. % 0.03/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.12/0.32 % Computer : n023.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.32 % CPULimit : 300 % 0.12/0.32 % WCLimit : 600 % 0.12/0.32 % DateTime : Thu Jul 7 08:19:26 EDT 2022 % 0.12/0.32 % CPUTime : % 0.12/0.33 % SZS status Theorem % 0.12/0.33 % SZS output begin IncompleteProof % 0.12/0.33 cnf(c0, axiom, % 0.12/0.33 slcrc0 = sK1). % 0.12/0.33 cnf(c1, plain, % 0.12/0.33 slcrc0 = sK1, % 0.12/0.33 inference(start, [], [c0])). % 0.12/0.33 % 0.12/0.33 cnf(c2, axiom, % 0.12/0.33 isCountable0(sK1)). % 0.12/0.33 cnf(a0, assumption, % 0.12/0.33 sK1 = sK1). % 0.12/0.33 cnf(a1, assumption, % 0.12/0.33 slcrc0 = X0). % 0.12/0.33 cnf(c3, plain, % 0.12/0.33 $false, % 0.12/0.33 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.33 cnf(c4, plain, % 0.12/0.33 $false, % 0.12/0.33 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.33 cnf(c5, plain, % 0.12/0.33 isCountable0(X0), % 0.12/0.33 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 0.12/0.33 % 0.12/0.33 cnf(c6, axiom, % 0.12/0.33 ~isFinite0(X1) | ~isCountable0(X1) | ~aSet0(X1)). % 0.12/0.33 cnf(a2, assumption, % 0.12/0.33 X0 = X1). % 0.12/0.33 cnf(c7, plain, % 0.12/0.33 $false, % 0.12/0.33 inference(strict_predicate_extension, [assumptions([a2])], [c5, c6])). % 0.12/0.33 cnf(c8, plain, % 0.12/0.33 ~isFinite0(X1) | ~aSet0(X1), % 0.12/0.33 inference(strict_predicate_extension, [assumptions([a2])], [c5, c6])). % 0.12/0.33 % 0.12/0.33 cnf(c9, axiom, % 0.12/0.33 isFinite0(slcrc0)). % 0.12/0.33 cnf(a3, assumption, % 0.12/0.33 X1 = slcrc0). % 0.12/0.33 cnf(c10, plain, % 0.12/0.33 ~aSet0(X1), % 0.12/0.33 inference(strict_predicate_extension, [assumptions([a3])], [c8, c9])). % 0.12/0.33 cnf(c11, plain, % 0.12/0.33 $false, % 0.12/0.33 inference(strict_predicate_extension, [assumptions([a3])], [c8, c9])). % 0.12/0.33 % 0.12/0.33 cnf(c12, axiom, % 0.12/0.33 aSet0(slcrc0)). % 0.12/0.33 cnf(a4, assumption, % 0.12/0.33 X1 = slcrc0). % 0.12/0.33 cnf(c13, plain, % 0.12/0.33 $false, % 0.12/0.33 inference(strict_predicate_extension, [assumptions([a4])], [c10, c12])). % 0.12/0.33 cnf(c14, plain, % 0.12/0.33 $false, % 0.12/0.33 inference(strict_predicate_extension, [assumptions([a4])], [c10, c12])). % 0.12/0.33 % 0.12/0.33 cnf(c15, plain, % 0.12/0.33 $false, % 0.12/0.33 inference(constraint_solving, [ % 0.12/0.33 bind(X0, slcrc0), % 0.12/0.33 bind(X1, slcrc0) % 0.12/0.33 ], % 0.12/0.33 [a0, a1, a2, a3, a4])). % 0.12/0.33 % 0.12/0.33 % SZS output end IncompleteProof %------------------------------------------------------------------------------