%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : NUM565+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 : n015.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:34:04 EDT 2022 % Result : Theorem 1.80s 0.58s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.11 % Problem : NUM565+3 : TPTP v8.1.0. Released v4.0.0. % 0.04/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n015.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 : Fri Jul 8 02:26:35 EDT 2022 % 0.13/0.33 % CPUTime : % 1.80/0.58 % SZS status Theorem % 1.80/0.58 % SZS output begin IncompleteProof % 1.80/0.58 cnf(c0, axiom, % 1.80/0.58 xK = sbrdtbr0(sK81)). % 1.80/0.58 cnf(c1, plain, % 1.80/0.58 xK = sbrdtbr0(sK81), % 1.80/0.58 inference(start, [], [c0])). % 1.80/0.58 % 1.80/0.58 cnf(c2, axiom, % 1.80/0.58 slcrc0 = X0 | sbrdtbr0(X0) != xK | ~aSet0(X0)). % 1.80/0.58 cnf(a0, assumption, % 1.80/0.58 sbrdtbr0(X0) = sbrdtbr0(sK81)). % 1.80/0.58 cnf(a1, assumption, % 1.80/0.58 xK = X1). % 1.80/0.58 cnf(c3, plain, % 1.80/0.58 $false, % 1.80/0.58 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 1.80/0.58 cnf(c4, plain, % 1.80/0.58 slcrc0 = X0 | ~aSet0(X0), % 1.80/0.58 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 1.80/0.58 cnf(c5, plain, % 1.80/0.58 X1 != xK, % 1.80/0.58 inference(strict_subterm_extension, [assumptions([a0, a1])], [c1, c2])). % 1.80/0.58 % 1.80/0.58 cnf(a2, assumption, % 1.80/0.58 X1 = xK). % 1.80/0.58 cnf(c6, plain, % 1.80/0.58 $false, % 1.80/0.58 inference(reflexivity, [assumptions([a2])], [c5])). % 1.80/0.58 % 1.80/0.58 cnf(c7, axiom, % 1.80/0.58 sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,sK81)). % 1.80/0.58 cnf(a3, assumption, % 1.80/0.58 sK81 = X0). % 1.80/0.58 cnf(a4, assumption, % 1.80/0.58 slcrc0 = X2). % 1.80/0.58 cnf(c8, plain, % 1.80/0.58 ~aSet0(X0), % 1.80/0.58 inference(strict_subterm_extension, [assumptions([a3, a4])], [c4, c7])). % 1.80/0.58 cnf(c9, plain, % 1.80/0.58 $false, % 1.80/0.58 inference(strict_subterm_extension, [assumptions([a3, a4])], [c4, c7])). % 1.80/0.58 cnf(c10, plain, % 1.80/0.58 sdtlpdtrp0(xc,slcrc0) != sdtlpdtrp0(xc,X2), % 1.80/0.58 inference(strict_subterm_extension, [assumptions([a3, a4])], [c4, c7])). % 1.80/0.58 % 1.80/0.58 cnf(a5, assumption, % 1.80/0.58 sdtlpdtrp0(xc,slcrc0) = sdtlpdtrp0(xc,X2)). % 1.80/0.58 cnf(c11, plain, % 1.80/0.58 $false, % 1.80/0.58 inference(reflexivity, [assumptions([a5])], [c10])). % 1.80/0.58 % 1.80/0.58 cnf(c12, axiom, % 1.80/0.58 aSet0(sK81)). % 1.80/0.58 cnf(a6, assumption, % 1.80/0.58 X0 = sK81). % 1.80/0.58 cnf(c13, plain, % 1.80/0.58 $false, % 1.80/0.58 inference(strict_predicate_extension, [assumptions([a6])], [c8, c12])). % 1.80/0.58 cnf(c14, plain, % 1.80/0.58 $false, % 1.80/0.58 inference(strict_predicate_extension, [assumptions([a6])], [c8, c12])). % 1.80/0.58 % 1.80/0.58 cnf(c15, plain, % 1.80/0.58 $false, % 1.80/0.58 inference(constraint_solving, [ % 1.80/0.58 bind(X0, sK81), % 1.80/0.58 bind(X1, xK), % 1.80/0.58 bind(X2, slcrc0) % 1.80/0.58 ], % 1.80/0.58 [a0, a1, a2, a3, a4, a5, a6])). % 1.80/0.58 % 1.80/0.58 % SZS output end IncompleteProof %------------------------------------------------------------------------------